Replacement for the fucntion moudle TMP_GUI_DIRECTORY_LIST_FILES in ECC 6.0

Hi,
I am using the function module TMP_GUI_DIRECTORY_LIST_FILES . This function module will takes all the files from one folder and i will do the process after taking all the files. but when we upgraded to ECC 6.0 this is not working anybody can tell me how to fix this issue. if possible plese send me the code.
Thanks,
Maheedhar

Try:
Class Method
CL_GUI_FRONTEND_SERVICES->DIRECTORY_LIST_FILES
Search the forum for sample codes.

Similar Messages

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.

Replacement for the Replacement? help!! 1st generation program

Hi my name is Juan Robles I recently enter to the 1st generation ipod program replacement, and they do send me a better ipod touch nano 8 gb 6 generation.
but it doesn't charge, i let it charge for a hole day and I even try it with a usb cable and a wall charger and once you disconected, it goes dead not even a blink... but if i plug it back to the cable it turn on very fast in less than 5 seconds.
My question is do they support a replacement for the replacement they send me, it is less than 90 days of from the date of service.
The Fedex box, the one with the replacement new ipod don't have the return address like the first one, the one where i send my 1st generation ipod. So any one resolve a similar issue , i will love to have the return address. I allready try the thec phone support but they put me on hold for more tha a hour and nothing.
Thanks in advance...

Apple Service Operations
3011 Laguna Blvd., Building A
ELk Grove, CA 95758

Is there a replacement for the canon 7d

Is there a replacement for the canon 7d

See this thread
http://forums.usa.canon.com/t5/EOS/Is-there-going-to-be-another-canon-7d-with-ten-frames-a-second/m-...

Exactly what IPod's are being received as replacement for the recalled 1st generation

Exactly what IPod's are being received as replacements for the recalled 1st generation one's

6th Generation Silver Nano 8GB

Replacement for the J6400

We currently have a HP OfficeJet J6400 All-in-One Printer. It works fine and we are happy with it. However, our platforms are changing. We both have iPhones, iPads and iPods. We need to migrate to an Air Printer in order to make better use of our technology. It's a pain to have to send something to another platform (laptop) and then print.
My question is, which HP with Air Print would be a good replacement for the J6400. We still want all the features of an All-in-One.
Thanks,
Jim
This question was solved.
View Solution.

Hello jghannah
For a list of AirPrint printers check the right hand side of this page.
I personally think either the Officejet 6500A Plus or the Officejet Pro 8600 would be perfect for your upgrade. They share a similar design to that of the Officejet 6400 series. They all have Airprint as well. For a good comparison between them check out the following link: Officejets with Airprint Comparison
Don't forgot to say thanks by giving "Kudos" to those that help solve your problems.
When a solution is found please mark the post that solves your issue.

TS3048 Can you buy a replacement for the little battery cover on the left side of the wireless mouse?

Can you buy a replacement for the little battery cover on the left side of a wireless keyboard?

Did you try a Google search for one: battery cover for Apple wireless keyboard
OT

BAPI replacement for the transaction VT02

Hi All,
We are doing upgrade from 4.6C to ECC 6.0 version where we need to replace existing BDC with BAPI or a function module.
In a program we are using BDC for the transaction VT02 to update the fields End date (VTTK-DATEN) and End time (VTTK-UATEN) for the given shipments. Please suggest a BAPI or Function module to replace the existing BDC for VT02 transaction.
The BAPI 'BAPI_SHIPMENT_CHANGE' is not released officially in ECC 6.0 version. Can we use it in ECC 6.0 version? If yes, please let me know how to call this BAPI with only these three fields(Shipment number-TKNUM, Shipment end date-DATEN and Shipment end time-UATEN).
Thanks in advance.
Regards,
Siva.

hi,
try this...
SD_SHIPMENT_HEADERS_CHANGE_DIA
Prabhudas

Partner redetermination in CRM for the replicated Sales contract from ECC

Hello Friends,
We are facing a typical issue, Our sales process is, we are creating Sales contract in ECC and replicating it in CRM. Problem area is we want to determine the Employee with the Territory ID in the CRM. Issue is the User will not be aware, who is the Employee responsible for the particular Sold to Party at the time of creation in ECC.
Config details:
1. Partner function related to Contracts are
    Sold to Party
    Ship to Party
    Bill to
    Payer
    Employee Responsible
    Employee _ Territory
2. Sales Contract is created in ECC and replicates in to CRM
3. Created Z partrner function for Employee_Territory and access seq assigned is 0030:Preeceding docyment>Territory>User
4. All the Partner function in ECC are determined through the Source as Sold to, except Employee_Terrritory, which is manual
5. Partner function value is manually maintained for Employee_territory in ECC sales contract
6. When replicated to CRM, I want this Employee_Territory to be redetermined based on the Territory attributes like Business partner Zip code
Kindly let me know, how to achieve it through configuration or if there is any BADI which requires minimum development.
Thanks,
Anup Bansal

Hey!
You can use badi COM_PARTNER_DETERM to determine partnter function based on Determination Sources.
You might also use user-defined callback function to realize your business requirement based on event handle technology.

Where can I find a replacement for the power adapter tip?

I need to replace the small adapter that allows the power adapter to be inserted into a socket. Does apple sell this part separately?
The adapter itself works fine. But the tip that gets inserted into the adapter, and then the wall, has started to make sparks. I'm afraid it's going to catch fire, or cause a fire. When plugged into the wall, I hear sparks and I see smoke coming out. If I adjust it's position by slightly withdrawing it from the wall socket, so that there is minimal contact, the sparks stop. But I am a little worried now that I can't leave my MacBook Pro retina plugged in without risk of fire. This started about a month ago after two years of use without any issues.
To be clear, I'm not talking about the adapter itself, but the tip that gets inserted into the adapter, and in turn allows the adapter to be inserted into a socket.
It seems wrong to shell out $80 for a whole new adapter when all I need to replace is the wall adapter.

What about the world travel adapter
http://store.apple.com/us/product/MB974ZM/B?fnode=MTY1NDEwMQ
The Kit is designed to work with iPod, iPhone, iPad, Apple MagSafe Power Adapters (for MacBook and MacBook Pro), Portable Power Adapters (for iBook and PowerBook), and AirPort Express.

Cost for replacement for the retina display on my iphone 4S

I droped my iPhone 4s and theres a large strip of dead pixals on the left edge plus a liquid that has crept over the top left coner of my screen. I also have many arrayed dead pixals across my screen.
I am thinking of replacing the retina display but im not sure how much it will cost.
Does anyone have had this problem or had it fixed?
Thankyou

Out-of-Warranty Service
If you own an iPhone that is ineligible for warranty service but is eligible for Out-of-Warranty (OOW) Service, Apple will service your iPhone for the Out-of-Warranty Service fee listed below.
iPhone model
Out-of-Warranty Service
iPhone 5
$229
iPhone 4S
$199
iPhone 4, iPhone 3GS,
iPhone 3G, Original iPhone
$149
A $6.95 shipping fee will be added if service is arranged through Apple and requires shipping. All fees are in U.S. dollars and are subject to local tax.

Is there a modern replacement for the Nvidia 8800GS?

Like other imac users my imac 24" (2008) Nvidia 8800GS graphics card has just stopped working, I'm wondering if there is a modern replacement for this card rather than buying a (expensive) reconditioned one?

http://forums.macrumors.com/showthread.php?t=1440627
There is a lot of conflicting data on whether the graphics card in the imac is replaceable. This stems from the fact that many of the older generation imacs have the GPU soldered to the logic board. This is NOT the case with the 2008 24 inch that has the card mentioned above. It is very difficult to get to. But with planning, patience and care, it can be replaced.

Urg. Replacement for the FM's TABLE_COMPRESS & SAPWL_STATREC_READ_FILE

Hi,
We are Upgrading Ecc4.7 to Ecc6.
We found that TABLE_COMPRESS and
SAPWL_STATREC_READ_FILE are Obsolete.
Please suggest the Replacement for these Function Modules

Sandhya,
As Vasu suggested you can use class cl_abap_gzip
try.
call method cl_abap_gzip=>compress_text
exporting
 text_in = xsccpvapitem
importing
 gzip_out = it_attach2
 gzip_out_len = 255.
endtry.
Regards
Aneesh.

When is Verizon getting a replacement for the Casio Commando?!?!

I have had my Commando for over 2 years now and love all the features and the ruggedness of it!! I have MANY stories of how tough this phone is, but now it is having software issue and resets 3 or more times a day and I can't take it anymore!!!! I know there is a replacement that the FCC has released a while ago called the Commando c811 according to the Verizon manual that is on the FCC website! So my question is, What is taking Veizon SOOOO long to release it to us?!?!?! I don't want any answers from Verizon support that tells me to sign up for the "latest news" from Verizon, because I've been signed up since last year and have only received one email from them!!!!! Or that they still have 2000+ of the old Commando phones to get rid of!!! Maybe they should have thought about the fact of having a pretty indestructible phone and not needed it to be replaced all the time!! I want a REAL answer and so do many other Commando users!!!!!!!!! My contract is up so maybe its time to move on after 10 years!

Yeah same old answer I've gotten from Verizon! Guess I and many others going to look into other services since Verizon is dragging their feet on this! Casio and the FCC say the phone has been ready for a while now, so what is taking Verizon soooo long to give a REAL answer?!?!?! NOT watch our website or sign up for emails on new products! I need a rugged smart phone and I am not buying another 3G one!!!! By the time they do release the Commando c811 on the FCC website it will be obsolete Here's the FCC's website with the info: https://apps.fcc.gov/oetcf/eas/reports/ViewExhibitReport.cfm?mode=Exhibits&RequestTimeout=500&calledFromFrame=N&application_id=240582&fcc_id=TYK-JDS9507
It has the complete Verizon manual available and everything, so what is the hold up?!?!?!
Not a happy Verizon customer!!!!!

Getting my Droid X2 replaced for the third time...

Don't really have any questions that need answering, just feel like getting peoples' input on my issue.
I am primarily a business user. While I won't deny that I use my phone for Facebook and Instagram when I'm sitting bored in a meeting, more than 80% of the time I spend on my phone is work-related. With that in mind, the most important features for me in a device are (in no particular order):
Battery life
Performance (speed, responsiveness, etc.)
Reliability (low frequency in terms of crashing, force closes, hangs, forced reboots, etc.)
Compatibility with corporate email and calendar
To date, the Droid X2 has met (and when it comes to battery life, exceeded) all of my expectations in those areas except one: reliability. My phone encountered issues this week that interfered with my ability to conduct business, and I was forced to contact Verizon Support. The rep, Brandon, was extremely helpful and I get the feeling that he did all that was in his power to help me out. He suggested that he might be able to get me a different device in the same tier, since I have had the X2 replaced so many times. Unfortunately Brandon's supervisor did not approve the order, and I didn't have time to attempt to speak with his superior.
I understand that giving a different device as a replacement is not covered by warranty or company policy (or if it is, someone please let me know ), but it should be obvious that the Droid X2 is an unreliable device. I am not a vanilla user - I have been involved in Android development since the HTC Dream (G1) - but I have left my Droid X2 bone stock since it worked well enough. I know all of the troubleshooting options available and try them all each time before calling support. It is my honest and sincere opinion that each and every Droid X2 that I've had has been faulty.
With that in mind, do you think Verizon ought to switch me out for a different model? I honestly don't care about having the hottest new smartphone, I just want something that meets my needs and isn't a downgrade. Not trying to start a firestorm here, nor am I trying to rant and rave towards VZW - just interested in discussing the topic.

Good day Jon;
I've had my Droid X2 since June of 2010. I am currently on #3 due to lockups, freezing, overheats and virtually all the issues you can find in this forum. I at first assumed it was something I was doing or loading. Having been in talks with Verizon, Google and Motorola. Each handset had been reset to factory numerous times. Would work for a week or so then start the same issues.
I must say that Verizon and Google have been the best in working with this, Motorola has been absolutely useless in resolving known issues with their product. All my handsets were factory and the only apps from Verizon or Google. And the Droid X2 has had issues.
I have learned to trust Verizon and Google on this, but will never own another Motorola product. My last response from this company was to send in the only phone I own for their evaluation, and maybe in 10 days they would decide if there was a warranty issue. This even after Verizon replaced it previously.
I like the Android platform and looking forward to upgrading shortly to the Samsung line. I have other products of theirs and had very good luck. When issues have arisen they have been helpful and positive.
Thank you for the opportunity to let you and others know that many of us are here and to understand others have had the same issues.

Replacement for the fucntion moudle TMP_GUI_DIRECTORY_LIST_FILES in ECC 6.0

Similar Messages

Maybe you are looking for