Code is Undefined in B1iSn JE

Dear Expert,
When i transfer from one database to another database in B1 with the use of B1iSN.
Its' Give me the following error.
com.sap.b1i.xcellerator.XcelleratorException: XCE001 Nested exception: com.sap.b1i.bizprocessor.BizProcException: BPE001 Nested exception: com.sap.b1i.xcellerator.XcelleratorException: XCE001 Nested exception: com.sap.b1i.xcellerator.XcelleratorException: XCE001 Nested exception: java.lang.RuntimeException: DI Error: (-5010) Code undefined
Can you please suggest me on this?
Thanks & Regards,
Tushar Nathwani

Hi...
It's Solved.
Error was coming due to my vendor was not created on other database.
Thanks.

Similar Messages

I get error -1074388956 when using CAN. This error code is undefined. what could it be? I am using NI-CAN 2.1.2 on WinXP SP1.

I've tried to search for it but come up with nothing.

You can convert this decimal code to HEX Code. If you do so, the HEX code looks like BFF62024. This Code means the Board handle is invalid. This could happen if you use not a valid handle because of race conditions within variables or close functions within the code.
Please check the handles within your code.

I get this error when loading Firefox? this.$pendingLocations[code] is undefined - 2, is there a solution to this?? Pls

The problem started a few weeks ago and only occurs when, it seems to be related to Java Script but can nothing shows in error files etc?
Has anyone else encountered this problem

Start Firefox in [[Safe Mode]] to check if one of the add-ons is causing the problem (switch to the DEFAULT theme: Tools > Add-ons > Themes).
* Don't make any changes on the Safe mode start window.
See:
* [[Troubleshooting extensions and themes]]
If it does work in Safe-mode then disable all extensions and then try to find which is causing it by enabling one at a time until the problem reappears.
* Use "Disable all add-ons" on the [[Safe mode]] start window to disable all extensions.
* Close and restart Firefox after each change via "File > Exit" (Mac: "Firefox > Quit"; Linux: "File > Quit")

Calling a thread from a cvi code file to another code file

Hello,
I want to call a thread from a labwindows/cvi code file to another labwindows/cvi code file. Namely, my thread function (GraphLoop) is in 'TestsModel.c' ; but I will call the thread in 'Tests.c' . My code in 'Tests.c' is in the following;
int CVICALLBACK GraphLoop (void *functionData);
int GraphLoopId;
int callbackDataGraphLoop;
int CVICALLBACK CBBasla (int panel, int control, int event,
void *callbackData, int eventData1, int eventData2)
switch (event)
case EVENT_COMMIT:
CmtInstallThreadPoolCallback (poolHandle, EVENT_TP_THREAD_BEGIN, GraphLoop, callbackDataGraphLoop, GraphLoopId);
if (tiklandiE3631ACihazinaBaglan == 0 && tiklandi34401ACihazinaBaglan == 0) // 'E3631A Cihazına Bağlan' ve '34401A Cihazına Bağlan' tuşlarına basılmamışsa uyarı verir.
MessagePopup ("Uyarı", "Lütfen cihaz bağlantısını kontrol ediniz.");
else
if (tiklandiKaydet == 0)
MessagePopup ("Uyarı", "Lütfen ayarları kaydediniz.");
else
SetCtrlAttribute (Testler, PnlTestler_BASLA, ATTR_DIMMED, 1); // 'Başla' tuşunu pasif hale getirir.
SetCtrlAttribute (Testler, PnlTestler_BASLA, ATTR_DISABLE_PANEL_THEME, 1); // 'Başla' tuşunun etiketini pasif hale getirir.
SetCtrlAttribute (Testler, PnlTestler_BITIR, ATTR_DIMMED, 0); // 'Bitir' tuşunu aktif hale getirir.
SetCtrlAttribute (Testler, PnlTestler_BITIR, ATTR_DISABLE_PANEL_THEME, 0); // 'Bitir' tuşunun etiketini aktif hale getirir.
CmtNewThreadPool (DEFAULT_THREAD_POOL_HANDLE, &poolHandle); //Yeni bir thread oluşturur.
CmtScheduleThreadPoolFunction (poolHandle, GraphLoop, NULL, &GraphLoopId); // GrapLoop thread fonksiyonunu başlatır.
break;
case EVENT_RIGHT_CLICK:
break;
return 0;
I take that errror after executing this code;
error:Undefined symbol '_GraphLoop' referenced in "f:\Tests.obj"
Please, can you help me for my question?
Regards...

Hello Eren,
I assume this is a link error.
Do you have TestsModel.c file included in your project?
Constantin.

I get the error code -2146827284 when trying to run an Ecxel macro from LabVIEW.

I am trying to insert data in an Excel workbook and then run a macro which I recorded in Excel to produce a plot.
This worked great on a laptop running W2K + LV7 and Office 2000.
I am now trying to do the same thing on a WinXP + LV7 + Excel 2002 and I get this error.
The complete message is:
"Error -2146827284 occurred at Exception occured in Microsoft Excel, Programmatic access to Visual Basic Project is not trusted
. Help Path is C:\Program Files\Microsoft Office\Office10\1033\xlmain10.chm and context 0 in Excel Import Module.vi->LV report test1.vi
This error code is undefined. No one has provided a description for this code, or you might have wired a number that is not an
error code to the error code input."
Can anyone shed some light on this. Running a macro is the obvious and easy way to get this work done.
See the attached VI. It includes the macro and some sample data to run it on.
Attachments:
LV_report_test1.vi ‏46 KB

Hi,
I have attached a link to a document that discusses the error you are getting:
Error -2146827284 When Importing a Macro to Office 2002/XP
I hope this helps.
Sincerely,
Feroz
National Instruments

How do I distribute my xml error code file?

Hi all,
I am using labVIEW 8.2 Prof. on a RedHat Linux.
I built an application where I made the tick in the labVIEW build specification "Advanced->Copy error code files". Nevertheless when I start my new application and force an error which is actually defined in my error code file I get the message "This error code is undefined. ..."
My error code file is saved twice:
1. in /usr/local/lv82/user.lib/errors which works as long as I am using the VIs and not the actual application and
2. in <project-folder>/errors
Anything I missed?
Thanks,
Johannes

Hey,
Is it working in development environment and do you test the executable then at the development machine?
Thanks,
Christian

What does the "Copy error code files" option do in the build spec properties

I have the "Copy error code files" checked for my application build specification but when I run my EXE on a different computer and call the simple error handler, I don't get the custom error from my computer's
C:\Program Files(x86)\National Instruments\LabVIEW 2012\user.lib\errors\User-errors.txt file. Instead I get the "this error code is undefined" explaination.
I've also tried including that file in the "always included" section of the build spec but that didn't work either. Am I missing something?
CLD (2014)

Infinite,
Check out this link:
http://www.ni.com/white-paper/3209/en
Specifically this paragraph:
"When building an executable (EXE) or shared library (DLL) with the Application Builder, make sure to add the custom error file as a support file (under the Source Files tab). For an executable, the custom error file will be saved in the <executable destination directory>\user.lib\errors directory. For a shared library, the custom error file will be saved in the National Instruments\Shared\LabVIEW Run-Time\<version>\Errors directory. When distributing a shared library, make sure to install the custom error file in this directory."
James K.
National Instruments
Applications Engineer

KeyEvent key code problem

This is about JavaFX 2.0.
For the code fragment:
flow.setOnKeyPressed(new EventHandler<KeyEvent>() {
public void handle(KeyEvent keyEvent) {
.....When the SLASH key is pressed, breaking at the first line of the method "handle" gives keyEvent.getCode().ordinal() being 187. When the MINUS key is pressed, keyEvent.getCode().ordinal() is STILL 187. Previously in JavaFX 1.3, the code ordinal was 23 for SLASH and 21 for MINUS. Now I cannot tell which key is pressed! Yes I can look at the keyEvent.getText() property... but it really seems like a bug that the code is UNDEFINED, right?
Thanks everyone :)
Edited by: 851528 on Jun 3, 2011 12:10 AM

I'm not so sure that RT-13972 is the same bug as what is being discussed here. I would encourage you to file a separate bug in http://javafx-jira.kenai.com against Runtime/Glass.
Thanks
Jonathan

Error code 5075 appearing when using Andor SDK to configure an EMCCD

Error code 5075 appears. The error code is undefined and doesn't appear when the examples are run, however does appear in any new programs that are produced using the vis provided by Andor. Any suggestions or help would be fantastice.

oj2 wrote:
Error code 5075 appears. The error code is undefined and doesn't appear when the examples are run, however does appear in any new programs that are produced using the vis provided by Andor. Any suggestions or help would be fantastice.
Isn't it a matter of comparing their examples to your VIs?

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 write more than 65536 data in excel Via Labview in one column

I have more than 65536 data and i want to write these data in excel sheet. It is giving Error:-
"Description:-
Error -2146827284 occurred at an unidentified location
This error code is undefined. No one has provided a description for this code, or you might have wired a number that is not an error code to the error code input."
Less than 65536 data can be written....
Please give some solution...

This is not a limitation of LabVIEW writing to a spreadsheet file but a limitation of Microsoft Excel (and also of Notepad) itself.
One option could be, you can switch to Excel 2007 or higher verison...!!
Other solution could be, forget about writing to Excel, instead write in some other format and use LabVIEW your other compatible (with large data) application to read it back.
I am not allergic to Kudos, in fact I love Kudos.
Make your LabVIEW experience more CONVENIENT.

Error while trying to install SAP CE 7.1 EHP 1 on Windows 7

I am trying to install SAP CE 7.1 EHP 1 on Windows 7. I am getting below error while trying to install. can you please help to fix this problem?
Running msiexec failed with return code 1603: undefined
Commandline was msiexec.exe /norestart /L sapmmcX86u.log /i sapmmcX86u.msi /qn
If you want the installer to retry, choose Yes. If you want the installer to abort the installation, choose No.
Thanks,
Sridhar.

I donu2019t think so it is windows 7 or 64/32 bit hardware/software issue. I have faced u201Cmsiexec failed with return code 1603u201D error many times during SAP installation and solved this issue with below mentioned procedure.
Solution:
Just change the location of temp directory to empty folder in user environment variable without cancel installation in current user session. After that, click on yes button to continue the installation. If installation will ended after click on yes button, restart the installation with continue old installation option.
Regards.
Yasir

Moving excel sheet from different files to excel template

Hi Everyone,
I need help from you guys.. I want to fetch excel sheet from different files (say for example from 3 excel files) and put in to one template file. If any one have idea regarding this please let me know. Thanks in advance
Thanks & Regards
saamy

Hii Puneet K & nyc,
Thanks a lot for ur links guys... am already done ...will upload the working code shortly...and am facing some other problem now...when I execute the program in LV 11.0 version its working fine, but when I try to run the same code in LV10.0 (32 bit machine) its showing this error
"Error -2146827284 occurred at Exception occured in Microsoft Office Excel: Excel cannot insert the sheets into the destination workbook, because it contains fewer rows and columns than the source workbook. To move or copy the data to the destination workbook, you can select the data, and then use the Copy and Paste commands to insert it into the sheets of another workbook.Help Path is C:\Program Files\Microsoft Office\Office12\1033\XLMAIN11.CHM and context 0 in copy_excel_worksheet.vi
This error code is undefined. Undefined errors might occur for a number of reasons. For example, no one has provided a description for the code, or you might have wired a number that is not an error code to the error code input.
Additionally, undefined error codes might occur because the error relates to a third-party object, such as the operating system or ActiveX. For these third-party errors, you might be able to obtain a description of the error by searching the Web for the error code (-2146827284) or for its hexadecimal representation (0x800A03EC)."
If you guys know the solution please let me knoe...thanks in advance..
Thanks & Regards
saamy

Failure to build LabVIEW application on Linux using "Shared library"

In order to create a LabVIEW application on linux without an X display, I complied the LabVIEW VI using the Linux Shared Library. I did this by right clicking on Build Specification and selecting New >> Shared Library, and in the Advanced section, checking the box labeled Use embedded version of run-time engine. At the end of the build process, a message came up informing that the build was unsuccessful, with the following message:
"Error 127 occurred at System Exec: sh: gcc: command not found
The error code is undefined. No one has provided a description for this code, or you might have wired a number that is not an error code to the error code input."
I had no compling the LabVIEW VI in the normal fashion, so am confused about what the problem is.
Solved!
Go to Solution.

Hi Julian,
gcc is a C and C++ compiler on Linux. An easy way to check if it is installed is to open a terminal and type "gcc", if the command is recognized then the package is already installed and the problem must lie elsewhere. If this distrobution of Linux has a package manager included then it should be displayed in there as well. If not then it could point to it being not installed or some dependency is missing making it not accessible from the command line. Here is a link that should hopefully step you through installing gcc with Redhat: http://www.cyberciti.biz/faq/centos-linux-install-gcc-c-c-compiler/ .
Justin D
Applications Engineer
National Instruments
http://www.ni.com/support/

Error at Step 9 of 32 while Installing CE7.11 Trail Version.

Hi All,
i am getting the following error while installing CE 7.1 SP1 Downloaded from sdn.. download area...
I am using Windows 64 Bit.. I also tried with Windows 7 64bit OS..AStill the same....
Running msiexec failed with return code 1603: undefined
Commandline was msiexec.exe /norestart /L sapmmcX86u.log /i sapmmcX86u.msi /qn
If you want the installer to retry, choose Yes. If you want the installer to abort the installation, choose No.
I reinstalled the OS again but still the same error.. Windows Installer is up and running in Services....
Hence I found one thread where to install MMC Snapshot then Install CE 7.1... I am able to pass through Step 4 of 32 installation... But got an error at step 9 of 32 Data base server Installtion error:
An error occurred while processing option SAP NetWeaver CE Developer Edition > Install SAP NetWeaver CE Developer Edition( Last error reported by the step :The database installer reported an error. DIAGNOSIS: Some database applications might still be running. SOLUTION: Check the log file sdbinst.log and C:\sapdb\data\wrk\MaxDB...>install _ .log.). You can now:
Choose Retry to repeat the current step.
Choose View Log to get more information about the error.
Stop the option and continue with it later.
Log files are written to C:\Program Files (x86)/sapinst_instdir/CE71_DEV_ADA/INSTALL
Log is as below:
Installation of MaxDB
starting installation Fr, Feb 19, 2010 at 22:55:11
operating system: Windows AMD64 NT 6.1
callers working directory: C:/Program Files (x86)/sapinst_instdir/CE71_DEV_ADA/INSTALL
installer directory: D:/Softwares/CE711SP1_SDN-Preview/CompEnv/MAXDB_WINDOWS_I386
archive directory: D:/Softwares/CE711SP1_SDN-Preview/CompEnv/MAXDB_WINDOWS_I386
software in package Fastload API is not runnable on your system
FILE MAGIC: MS Windows 32-bit i386 executable dll
YOUR SYSTEM: architecture = AMD64
YOUR SYSTEM: subversion =
YOUR SYSTEM: system = Windows
YOUR SYSTEM: version = NT 6.1
installation exited abnormally at Fr, Feb 19, 2010 at 22:55:11
Any Solution for this?
Thanks
Rajeev

Hi Russ,
I did not resolve that problem
Regards.
hari

Code is Undefined in B1iSn JE

Similar Messages

Maybe you are looking for