Compiling the action function

While compiling my java class I receive this error
MyClassName.java:372: warning: action(java.awt.Event,java.lang.Object) in java.awt.Component has been deprecated public boolean action(Event e, Object arg) {
How is this possible, I'm using examples from java in a nutshell 2nd edition. This examples use this function. I'm using java 2 version 1.3
Thanks
Bill

There is no need for you to worry about the 'Deprecated' warnings. It simply tells tou that you are using a method which is replaced in the present version with something else, and the method may not be there in the next version.
Then you will have problems in running it.
So, it is always good to replace the method with the new method. You can find out the new method in the JDK API documentation.
Have a nice time.
Sudha

Similar Messages

Hyperlink - How to execute it action function(Java) and then JavaScript

Hi all, I have a hyperlink in a popup window. When the hyperlink is clicked I want it's action function to be executed. This works fine, the problem is when I put java code in the hyperlink's javascript onClick() function, only the onClick() gets called and not the action function.
I need the onClick to close the window and submit the main form and I need the action function to set some session variable.
Thanks in advance for any replies.

Hi, thanks to anyone that read my post. I found a solution. I removed the code from the hyperlink's javascript onClick and placed it the body onload javascript function. I also set a flag to true when the hyperlink is clicked and only execute the code in the body onLoad() when the flag is true.

Loading in a second Actions panel with the same functionality as the first, but independent from it

The actions panel is perfect at what it does; however, if you have a few action sets and, in order to eliminate scrolling, you need to expand them into a double row of buttons, it quickly becomes difficult to maintain. As soon as you delete an action or add an action to it, it disorders the others and you have to reorganize again, which becomes a vicious cycle. I like to keep things organised and neat with all that I do and pretty much the only way to have this feature is to expand it on the back end of the software or, if possible, create a script that loads a second Actions panel with the same functionality as the first but completely independent from it. I assume that the SDK will not allow us to expand on the software in this particular way, as Photoshop is not open source; however, maybe this suggestion will be taken into account for future updates or versions since I have yet to find a suitable way to do this.
Thank you in advance.
Kind regards

That would depend on the links on the page. Some pages have links that refer to different areas on the same page. If you want to force a link to open in a new tab, you can middle-click it.

Removing Aggregate Functions from the Action Menu

Hi People,
I'd like to remove the following aggregate functions from the action menu on a report, if possible:
1. Minimum
2. Maximum
3. Median
Is this actually possible, or am I stuck with them? I've had a good sniff around, but can't find any way to remove them so far.
Cheers.
James

Ok, first click on your name in the menu bar. Then click on "Users&Groups Prefrences..." You should see a little house icon next to 'Login Options" under the menu where all user accounts are displayed. Click on it. Where it says "Show fast user switching menu as" and next to it a dropdown saying "Full Name" change that to icon. After you have done that, the name should be replaced with an icon. Hope this helped.

How to personalize the Actions LOV in Sales Order Form.

Hi All,
I've a requirement wherein I need to remove the "Payments" fuction from the Actions button( from list of values) in Sales Order lines Form.
Navigation: Order management Super User--> query or enter a Sales Order-->Line Items--> Click on Actions button--> Lov is popped up. Now from this LOV I want to remove the Payments Function. User should not be able to see this value in the Actions LOV.
Please let me know if there is a way to achieve this requirement.
Regards,
Tech D.

See if this helps
Go to System Adminstartor->Menus
query ONT_SALES_ORDERS
go down to find the payments function..mostly prompt and submenu will be empty..
Uncheck the grant option and save it..it should compile the menu
Now check by going to resp..
HTH
Mahendra

Why does the DLL function executed by call library node fail when the Vi is re-opened?

Development System
OS: Windows XP
LabVIEW: version 10.0
DLL: Custom
Compiler: Visual C++ 6.0
Function Prototype: __declspec(dllexport) const char * test(void)
We have developed a DLL for use. The DLL compiles cleanly.  The DLL includes a function test.  The test function validates the functional capabilities of the DLL. I have followed the examples online, and I have used the import shared library tool in LabVIEW. The VIs created use the call library node.
When I create a VI calling the test function from the custom DLL using the call library node the VI executes the DLL function test flawlessly. I close the VI. When I re-open the VI and run it, I get an error code from the DLL.  However, if I go to the block diagram and set the path for the DLL in the configure call library node again then the VI executes the DLL function test flawlessly again.
I have to set the path for the DLL in the configure call library node every time I open the VI. The examples I downloaded from the community do not require this. What might the DLL be missing? What am I missing?
Solved!
Go to Solution.

I think it was rather unfair of me to ask for help with my DLL issue without disclosing more detailed information. As a corrective action, I have attached a zipped file. The zipped file contains the entire VC++ 6.0 project for compiling the DLL, the DLL, and the VI I have been using to test it.
###NOTE####
As a prerequisite to compilation and usage of the DLL you'll need to have installed Python 26 on your system.
You may obtain the MSI for correct version of Python from the following location:
http://www.python.org/ftp/python/2.6.6/python-2.6.6.msi
###NOTE###
Thank you very kindly for any assistance offered!
Thanks,
Bill
Attachments:
C_DLL_PYTHON_AND_LABVIEW2010.zip ‏1685 KB

Enabling the printing function of your HP Laserjet M1005 printer

If you wonder how to install the printing function of your HP Laserjet M1005 printer, here is listed a bullet list of the actions. This has just been tested out thanks to the Support team from Germany
Go to the page http://h20000.www2.hp.com/bizsupport/TechSupport/DriverDownload.jsp?prodNameId=1 839459&lang=en&cc=us&prodTypeId=18972&prodSeriesId=1839458&taskId=135 and select the link Mac OS X; download the link "HP LaserJet M1005 MFP Mac OS X Full Software Solution"
Use the opportunity to update your printer firmware by selecting the link "Printer Firmware Update"
Shutdown your Mac and start up in the safe boot mode (should be the combined keyboard shift and power on/off - refer to the Apple web site for details)
Run the downloaded SW package listed in the step 1
Go and select under system settings printer and fax, follow the step-by-step instructions to have a printer installed
Shutdown your Mac and start up again in the safe boot mode
Connect your printer and the printer SW installation message shoud pop up requesting you to install it
SW download process should appear and run
Be aware that just the printing function will be available - no scanning function so far
For those who may be interested in knowing why safe boot mode: it is likelz that my anti-virus SW Kaspersky denied the installation.
Continue to enjoy your HP Laserjet M1005 printer

"For those who may be interested in knowing why safe boot mode: it is likelz that my anti-virus SW Kaspersky denied the installation."
You should read this:
http://www.reedcorner.net/mmg-antivirus/

How to use the Table Function defined in package in OWB?

Hi,
I defined a table function in a package. I am trying to use that in owb using Table function operator. But I came to know that, owb R1 supports only standalone table functions.
Is there any other way to use the table function defined in a package. As like we create synonyms for functions, is there any other way to do this.
I tryed to create synonyms, it is created. But it is showing compilation error. Finally I found that, we can't create synonyms for functions which are defined in packages.
Any one can explain it, how to resolve this problem.
Thank you,
Regards
Gowtham Sen.

Hi Marcos,
Thank you for reply.
OWB R1 supports stand alone table functions. Here what I mean is, the table fucntion which is not inculded in any package is a stand alone table function.
for example say sample_tbl_fn is a table function. It is defined as a function.It is a stand alone function. We call this fucntion as "samp_tbl_fn()";
For exampe say sample_pkg is a package. say a function is defined in a package.
then we call that function as sample_pkg.functionname(); This is not a stand alone function.
I hope you understand it.
owb supports stand alone functions.
Here I would like to know, is there any other way to use the functions which are defined in package. While I am trying to use those functions (which are defined in package -- giving the name as packagename.functionname) it is throwing an error "Invalid object name."
Here I would like know, is there any other way to use the table functions which are defined in a package.
Thank you,
Regards,
Gowtham Sen.

How do I use the WriteToMemoryXX functions in a CIN?

I'm getting a linker error "unresolved external reference _WriteToMemory16" when I compile the C code that contains the calls to the WriteToMemory16 function. I've installed the accesshw files and am including the accesshw.h file in my C-code CIN. It would seem that I need to compile-in the code for the WriteToMemory function, which I assume resides in accesshw.c.
My application calls for some direct hardware i/o that falls in the "too messy to do in a block diagram" catagory. I'm using Labview 5.1.1 and talking to a Keithley Metrabyte PIO-96 card.
Thanks very much for any assistance.

Ben,
Thank you for the response. I looked at the examples you mentioned, but unfortunately I'm still unsure what to do. As mentioned, I downloaded the accesshw.zip file and installed the files in order for me to use InPort and OutPort VIs in my program on an NT box, which I'm doing and is working fine. Also, I downloaded the example, "PCI-DIO using AccessHW_DLL.c". This C file contains calls just like the ones I want to use (calls to WriteToMemoryXX) in my CIN C code to basically do the same operations as are done by the InPort and OutPort VIs. Is there a makefile available for that C file? Maybe if I knew how to build that file into a CIN, it would be the same process for me to build my file into a CIN. There is an include file in the "PCI-DIO using AccessH
W_DLL.c" file that I don't have (ansi_c.h), but I don't get a compiler error when not including this file in my C file so
I assume I don't need it. I've got the accesshw.dll file in the same directory as my .c file, as instructed to do on the accesshw.zip download page.
I'm developing the CIN using MSVC++ 4.0 if that helps.
Thanks very much,
Jeff

A replacement for the Quicksort function in the C++ library

Hi every one,
I'd like to introduce and share a new Triple State Quicksort algorithm which was the result of my research in sorting algorithms during the last few years. The new algorithm reduces the number of swaps to about two thirds (2/3) of classical Quicksort. A multitude
of other improvements are implemented. Test results against the std::sort() function shows an average of 43% improvement in speed throughout various input array types. It does this by trading space for performance at the price of n/2 temporary extra spaces.
The extra space is allocated automatically and efficiently in a way that reduces memory fragmentation and optimizes performance.
Triple State Algorithm
The classical way of doing Quicksort is as follows:
- Choose one element p. Called pivot. Try to make it close to the median.
- Divide the array into two parts. A lower (left) part that is all less than p. And a higher (right) part that is all greater than p.
- Recursively sort the left and right parts using the same method above.
- Stop recursion when a part reaches a size that can be trivially sorted.
The difference between the various implementations is in how they choose the pivot p, and where equal elements to the pivot are placed. There are several schemes as follows:
[ <=p | ? | >=p ]
[ =p | ? ]
[ <=p | =p | ? | >p ]
[ =p | p ] Then swap = part to middle at the end
[ =p | p | =p ] Then swap = parts to middle at the end
Where the goal (or the ideal goal) of the above schemes (at the end of a recursive stage) is to reach the following:
[ p ]
The above would allow exclusion of the =p part from further recursive calls thus reducing the number of comparisons. However, there is a difficulty in reaching the above scheme with minimal swaps. All previous implementation of Quicksort could not immediately
put =p elements in the middle using minimal swaps, first because p might not be in the perfect middle (i.e. median), second because we don’t know how many elements are in the =p part until we finish the current recursive stage.
The new Triple State method first enters a monitoring state 1 while comparing and swapping. Elements equal to p are immediately copied to the middle if they are not already there, following this scheme:
[ p ]
Then when either the left (<p) part or the right (>p) part meet the middle (=p) part, the algorithm will jump to one of two specialized states. One state handles the case for a relatively small =p part. And the other state handles the case for a relatively
large =p part. This method adapts to the nature of the input array better than the ordinary classical Quicksort.
Further reducing number of swaps
A typical quicksort loop scans from left, then scans from right. Then swaps. As follows:
while (l<=r)
while (ar[l]<p)
l++;
while (ar[r]>p)
r--;
if (l<r)
{ Swap(ar[l],ar[r]);
l++; r--;
else if (l==r)
{ l++; r--; break;
The Swap macro above does three copy operations:
Temp=ar[l]; ar[l]=ar[r]; ar[r]=temp;
There exists another method that will almost eliminate the need for that third temporary variable copy operation. By copying only the first ar[r] that is less than or equal to p, to the temp variable, we create an empty space in the array. Then we proceed scanning
from left to find the first ar[l] that is greater than or equal to p. Then copy ar[r]=ar[l]. Now the empty space is at ar[l]. We scan from right again then copy ar[l]=ar[r] and continue as such. As long as the temp variable hasn’t been copied back to the array,
the empty space will remain there juggling left and right. The following code snippet explains.
// Pre-scan from the right
while (ar[r]>p)
r--;
temp = ar[r];
// Main loop
while (l<r)
while (l<r && ar[l]<p)
l++;
if (l<r) ar[r--] = ar[l];
while (l<r && ar[r]>p)
r--;
if (l<r) ar[l++] = ar[r];
// After loop finishes, copy temp to left side
ar[r] = temp; l++;
if (temp==p) r--;
(For simplicity, the code above does not handle equal values efficiently. Refer to the complete code for the elaborate version).
This method is not new, a similar method has been used before (read: http://www.azillionmonkeys.com/qed/sort.html)
However it has a negative side effect on some common cases like nearly sorted or nearly reversed arrays causing undesirable shifting that renders it less efficient in those cases. However, when used with the Triple State algorithm combined with further common
cases handling, it eventually proves more efficient than the classical swapping approach.
Run time tests
Here are some test results, done on an i5 2.9Ghz with 6Gb of RAM. Sorting a random array of integers. Each test is repeated 5000 times. Times shown in milliseconds.
size std::sort() Triple State QuickSort
5000 2039 1609
6000 2412 1900
7000 2733 2220
8000 2993 2484
9000 3361 2778
10000 3591 3093
It gets even faster when used with other types of input or when the size of each element is large. The following test is done for random large arrays of up to 1000000 elements where each element size is 56 bytes. Test is repeated 25 times.
size std::sort() Triple State QuickSort
100000 1607 424
200000 3165 845
300000 4534 1287
400000 6461 1700
500000 7668 2123
600000 9794 2548
700000 10745 3001
800000 12343 3425
900000 13790 3865
1000000 15663 4348
Further extensive tests has been done following Jon Bentley’s framework of tests for the following input array types:
sawtooth: ar[i] = i % arange
random: ar[i] = GenRand() % arange + 1
stagger: ar[i] = (i* arange + i) % n
plateau: ar[i] = min(i, arange)
shuffle: ar[i] = rand()%arange? (j+=2): (k+=2)
I also add the following two input types, just to add a little torture:
Hill: ar[i] = min(i<(size>>1)? i:size-i,arange);
Organ Pipes: (see full code for details)
Where each case above is sorted then reordered in 6 deferent ways then sorted again after each reorder as follows:
Sorted, reversed, front half reversed, back half reversed, dithered, fort.
Note: GenRand() above is a certified random number generator based on Park-Miller method. This is to avoid any non-uniform behavior in C++ rand().
The complete test results can be found here:
http://solostuff.net/tsqsort/Tests_Percentage_Improvement_VC++.xls
or:
https://docs.google.com/spreadsheets/d/1wxNOAcuWT8CgFfaZzvjoX8x_WpusYQAlg0bXGWlLbzk/edit?usp=sharing
Theoretical Analysis
A Classical Quicksort algorithm performs less than 2n*ln(n) comparisons on the average (check JACEK CICHON’s paper) and less than 0.333n*ln(n) swaps on the average (check Wild and Nebel’s paper). Triple state will perform about the same number of comparisons
but with less swaps of about 0.222n*ln(n) in theory. In practice however, Triple State Quicksort will perform even less comparisons in large arrays because of a new 5 stage pivot selection algorithm that is used. Here is the detailed theoretical analysis:
http://solostuff.net/tsqsort/Asymptotic_analysis_of_Triple_State_Quicksort.pdf
Using SSE2 instruction set
SSE2 uses the 128bit sized XMM registers that can do memory copy operations in parallel since there are 8 registers of them. SSE2 is primarily used in speeding up copying large memory blocks in real-time graphics demanding applications.
In order to use SSE2, copied memory blocks have to be 16byte aligned. Triple State Quicksort will automatically detect if element size and the array starting address are 16byte aligned and if so, will switch to using SSE2 instructions for extra speedup. This
decision is made only once when the function is called so it has minor overhead.
Few other notes
- The standard C++ sorting function in almost all platforms religiously takes a “call back pointer” to a comparison function that the user/programmer provides. This is obviously for flexibility and to allow closed sourced libraries. Triple State
defaults to using a call back function. However, call back functions have bad overhead when called millions of times. Using inline/operator or macro based comparisons will greatly improve performance. An improvement of about 30% to 40% can be expected. Thus,
I seriously advise against using a call back function when ever possible. You can disable the call back function in my code by #undefining CALL_BACK precompiler directive.
- Like most other efficient implementations, Triple State switches to insertion sort for tiny arrays, whenever the size of a sub-part of the array is less than TINY_THRESH directive. This threshold is empirically chosen. I set it to 15. Increasing this
threshold will improve the speed when sorting nearly sorted and reversed arrays, or arrays that are concatenations of both cases (which are common). But will slow down sorting random or other types of arrays. To remedy this, I provide a dual threshold method
that can be enabled by #defining DUAL_THRESH directive. Once enabled, another threshold TINY_THRESH2 will be used which should be set lower than TINY_THRESH. I set it to 9. The algorithm is able to “guess” if the array or sub part of the array is already sorted
or reversed, and if so will use TINY_THRESH as it’s threshold, otherwise it will use the smaller threshold TINY_THRESH2. Notice that the “guessing” here is NOT fool proof, it can miss. So set both thresholds wisely.
- You can #define the RANDOM_SAMPLES precompiler directive to add randomness to the pivoting system to lower the chances of the worst case happening at a minor performance hit.
-When element size is very large (320 bytes or more). The function/algorithm uses a new “late swapping” method. This will auto create an internal array of pointers, sort the pointers array, then swap the original array elements to sorted order using minimal
swaps for a maximum of n/2 swaps. You can change the 320 bytes threshold with the LATE_SWAP_THRESH directive.
- The function provided here is optimized to the bone for performance. It is one monolithic piece of complex code that is ugly, and almost unreadable. Sorry about that, but inorder to achieve improved speed, I had to ignore common and good coding standards
a little. I don’t advise anyone to code like this, and I my self don’t. This is really a special case for sorting only. So please don’t trip if you see weird code, most of it have a good reason.
Finally, I would like to present the new function to Microsoft and the community for further investigation and possibly, inclusion in VC++ or any C++ library as a replacement for the sorting function.
You can find the complete VC++ project/code along with a minimal test program here:
http://solostuff.net/tsqsort/
Important: To fairly compare two sorting functions, both should either use or NOT use a call back function. If one uses and another doesn’t, then you will get unfair results, the one that doesn’t use a call back function will most likely win no matter how bad
it is!!
Ammar Muqaddas

Thanks for your interest.
Excuse my ignorance as I'm not sure what you meant by "1 of 5" optimization. Did you mean median of 5 ?
Regarding swapping pointers, yes it is common sense and rather common among programmers to swap pointers instead of swapping large data types, at the small price of indirect access to the actual data through the pointers.
However, there is a rather unobvious and quite terrible side effect of using this trick. After the pointer array is sorted, sequential (sorted) access to the actual data throughout the remaining of the program will suffer heavily because of cache misses.
Memory is being accessed randomly because the pointers still point to the unsorted data causing many many cache misses, which will render the program itself slow, although the sort was fast!!.
Multi-threaded qsort is a good idea in principle and easy to implement obviously because qsort itself is recursive. The thing is Multi-threaded qsort is actually just stealing CPU time from other cores that might be busy running other apps, this might slow
down other apps, which might not be ideal for servers. The thing researchers usually try to do is to do the improvement in the algorithm it self.
I Will try to look at your sorting code, lets see if I can compile it.

How to delete all Action Sets in the Actions Palette

I'm in need of a piece of JavaScript code that will delete all the Action Sets in the Actions Palette. I've scripted the logic to load the appropriate Action Set once needed but I don't want to end up with duplicates at the end of processing the batch.
Any help would be most appreciated.
TIA, Scott

> Could someone clue me in; I'm lost?
getActionSets = function() {
var i = 1;
var sets = [];
while (true) {
var ref = new ActionReference();
ref.putIndex(cTID("ASet"), i);
var desc;
var lvl = $.level;
$.level = 0;
try {
desc = executeActionGet(ref);
} catch (e) {
break; // all done
} finally {
$.level = lvl;
if (desc.hasKey(cTID("Nm "))) {
var set = {};
set.index = i;
set.name = desc.getString(cTID("Nm "));
set.toString = function() { return this.name; };
set.count = desc.getInteger(cTID("NmbC"));
set.actions = [];
for (var j = 1; j <= set.count; j++) {
var ref = new ActionReference();
ref.putIndex(cTID('Actn'), j);
ref.putIndex(cTID('ASet'), set.index);
var adesc = executeActionGet(ref);
var actName = adesc.getString(cTID('Nm '));
set.actions.push(actName);
sets.push(set);
i++;
return sets;

How to retrieve the action type of a PA40 action?

Hi there,
I am trying to find out the way to identify what was the action type for the personnel action that is just being executed. I will try to explain myself with a concrete example.
Let's take the hiring action.
A user goes to PA40 and initiates the action to hire a new employee. The program will then start guiding the user through the different infotypes defined within the infogroup.
Let's say that the order is IT0001, IT0002, IT0006, ...
I have setup table T779X to call a Function Module of my own after inserting IT0006. At that point in time I can know that the IT has been modified through transaction PA40 (sy-tcode) but, how can I know what action is being executed?
Thanks

Jim,
Actions can always be found afterwards in IT000 indeed
My problem is that I need to know what action type was initiated in REAL TIME. When I am debugging the batch for IT0006, after the user initiated an action through PA40
Thanks for the answer anyway

Error while compiling the PO Item Category KFF

Kindly help me. I am new and learning Purchasing module and now stuck because of an error while compiling the PO Item Category KFF. This is because a segment is saved in the database incompletely.
Now the segment does not show in the Segments Summary form. But when I enter the same Number, I get the error APP-FND-00924: You chose a sement number that is used by another segment.
When I freeze and compile the structure with different segments, I get the error
APP-FND-00668: The data that defines the flexfield on this field may be inconsistent. Inform your system administrator that the function: FDFRKS could not find the structure definition for the flexfield specified by Application = &APPL, Code = MCAT and Structure number = 201 (APPID=401)
APP-FND-00738: Error detected when attempting to load value set on Context: &CONTEXT for Segment: &SEGMENT in Routine: FDFBKS
APP-FND-01564: ORACLE error 1403 in FDFAVS3
Cause: FDFAVS3 failed due to ORA-01403: no data found.
The SQL statement being executed at the time of the error was: and was executed from the file &ERRFILE.
Regards
Reem

Hi Sandeep
Sorry that I am bothering with basic questions, but I am not able to run any Select queries. It gives error Table or View does not exist. I can see the table from ALL_TABLES view, but I cannot Select.
I have logged in as oracle user. This is not Vision datbase. Can you let me know the default dba user and password or how to get the permission?
Regards
Reem

Errors were found when compiling the workflow. The workflow files were saved but cannot be run.

Greetings All,
I am having issues with a SharePoint Designer workflow. This is a SharePoint 2013 environment, I'm using SharePoint Designer 2013 and working on a SharePoint 2010 workflow. I'm developing this as a SharePoint 2010 workflow because I need to do
impersonation.
The environment and workflow have been running, in the past week, without issue. I went to add a couple steps and now I cannot publish the workflow. While in SharePoint Designer, I receive the error:
"Errors were found when compiling the workflow. The workflow files were saved but cannot be run." When I click the Advanced button on the error dialog, the message is "Unexpected error on server associating the workflow."
That is all the error information I have available; nothing is in the log files.
I have investigated this error and tried the following:
Cleared the SharePoint Designer cache.
The WebApp.UserDefinedWorkflowMaximumComplexity was at 7000 so I increased it to 10000. Restarted the servers (which may not have been necessary) and tried again receiving the same error. I then increased it to 30000 with the same error result.
Since this is a large workflow, I tried created a workflow with a single action, write to workflow log, with the same error results.
I reboot the servers and try again and now I can publish the small test workflow but not the original. However, neither will run. When I attempt to manually run the small test workflow on an item, I get an error: "Sorry something went wrong.
An unexpected error occurs. I checked the log files for the correlation id and nothing, nothing was logged for the error. ~arg~
Also, now no workflows can be published in this web app. Not just the one I was working on but none of them!
Does anyone have a clue what has happened to the SharePoint 2010 workflow service? Or some suggestions for me to try?
Thank you in advance for your help!
Bob Mixon

try these links:
http://sp2013.pro/2013/04/solution-errors-were-found-when-compiling-the-workflow-the-workflow-files-were-saved-but-cannot-be-run-cannot-set-unknown-member/
http://code2care.org/pages/sharepoint-errors-were-found-when-compiling-the-workflow-the-workflow-files-were-saved-but-cannot-be-run/
http://sharepoint.stackexchange.com/questions/119909/sharepoint-designer-error-errors-were-found-when-compiling-the-workflow
http://stackoverflow.com/questions/26413125/errors-were-found-when-compiling-the-workflow-in-sharepoint-2013
Hi Sagar,
I appreciate it but if you see my original post, this is a SharePoint 2010 workflow that cannot be published; which has now caused all SharePoint 2010 workflows in the same web app to error.
Your first link is specific to SharePoint 2013 workflows.
Your second link refers to the UserDefinedWorkflowMaximumComplexity. If you read my original post, I've already tried this and I've tried to publish a small (single activity) workflow.
Your third link also refers to large workflows with many approval activities. My workflow doesn't contain any approval activities.
And you fourth link refers to 2013 workflows not 2010.
My issue is with publishing and running a SharePoint 2010 workflow in SharePoint 2013.
Thank you...

ERROR while compiling the demo LoanDemoPlus

Hello,
I have a problem while trying to install one of the Bpel demos.
While compiling the demo LoanDemoPlus using obant, the following errors occured : (see the transcript below)
How to fix this problem, please ?
[bpelc] validating "C:\DAS\DAS_BPEL\OracleAppsPOC\LoanDemoPlus\LoanFlowPlus\LoanFlowPlus.bpel" ...
[bpelc] BPEL validation failed.
[bpelc] BPEL source validation failed, the errors are:
[bpelc]
[bpelc] [Error ORABPEL-10079]: unresolved namespace prefix
[bpelc] [Description]: in line 214 "C:\DAS\DAS_BPEL\OracleAppsPOC\LoanDemoPlus\LoanFlowPlus\LoanFlowPlus.bpel", namespace prefix "bpws" can not be resolved.
[bpelc] [Potential fix]: Please define this prefix in the bpel source file.

Hi Andrew,
Please check if the folloing is defined in the process in LoanFlowPlus.bpel file.
xmlns:bpws="http://schemas.xmlsoap.org/ws/2003/03/business-process/"
as below
<process name="BPELProcess5"
targetNamespace="http://xmlns.oracle.com/BPELProcess5"
xmlns="http://schemas.xmlsoap.org/ws/2003/03/business-process/"
xmlns:xp20="http://www.oracle.com/XSL/Transform/java/oracle.tip.pc.services.functions.Xpath20"
xmlns:bpws="http://schemas.xmlsoap.org/ws/2003/03/business-process/"
xmlns:ns1="http://xmlns.oracle.com/pcbpel/adapter/apps/PoInsert/"
xmlns:ldap="http://schemas.oracle.com/xpath/extension/ldap"
xmlns:xsd="http://www.w3.org/2001/XMLSchema"
xmlns:ns2="http://xmlns.oracle.com/pcbpel/adapter/db/top/BPELProcess5"
xmlns:client="http://xmlns.oracle.com/BPELProcess5"
xmlns:bpelx="http://schemas.oracle.com/bpel/extension"
xmlns:ora="http://schemas.oracle.com/xpath/extension"
xmlns:orcl="http://www.oracle.com/XSL/Transform/java/oracle.tip.pc.services.functions.ExtFunc">
Also Can you please provide me the following information?
1. BPEL PM Version.
2. Location where you downloaded
3. Approximate time frame when you Downloaded.
Regards,
Dhaval

Compiling the action function

Similar Messages

Maybe you are looking for