Replacements for the Reject Statement.

Hi All,
When I do syntax Check it's showing "REJECT" is obsolete statment
Generally The statement REJECT is not allowed in ABAP Objects in later versions.
Every time Error message is shown in ABAP Objects if the following syntax is used:
REJECT [dbtab].
Thanks in advance
Venkatesh
this is body message

Guess you are using LDBs. I belive it is a warning but not error.
This syntax message is related to the ABAP portion of your report and nothing to do with the config or functionalities. Your ABAPer would help you on this.

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

Quation rejected but i can issue purchase order for the rejected.

hi, i have several issues to be solved
i rejected a quotation but i can issue purchase order for the rejected quotation..
q1: why SAP had given that option?
q2:How do i restrict user to issue purchase order for rejected quotation?
q3: what i observed was , accepting the quotation entirely lies with user.so what is the criteria for accepting the quotation.. Is it just the price?? If it is the just price then How do i restrict the user to go always for low price quotation?
thanks in advance,
regards,
srini

In SAP R/3, RFQ comparision is done on the basis on price only.( including excluding discounts, delivery cost....).
In true business scenario, lowest cost is not the best solution. There are other qualitative parameters which needs to be considered for taking final decision. These factors can be different for different type of purchases. e.g. for capital goods what is the life of equipment. Total cost simulation is done outside system & PO is created with reference to best fit quote.
In SRM, we can define parameters against which we can evaluate the quote within the system.
Hope this is helpful.
Thanks
Ashutosh

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

The number of reloads for the SQL statements

Hi,
in 10g R2, how to see the number of reloads for the SQL statements ? Any query ? Which value is high ? Which valu is low ?
Thanks.

thanks all.
It was a test question for 1Z0-042 exam as follows :
The users on your SALESDB are complaining of slow response to their queries. Using the SQL Tuning Advisor, you determine
that the SQL statements are using the best optimization plan. Querying the dynamic views, you see that the number of reloads
for the SQL statements is high, which can cause performance degradation.
Which component of the SGA should you resize to reduce the number of reloads of the SQL statements?
Answer :
shared poolThen I wonder how to see the number of reloads for the SQL ?

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

I am missing "other" as a target for the result state

Hi,
I am trying to implement a quite complex scenario using guided procedure design time.
I am not able to find other as a target for the result state of a callable object (the system proposes me just the sequential action or termination, nothing more, so I am not able to change my flow as I would like).
My portal is NW04s SP10.
I fount that target (other) using a portal sp11, so I suppose that it could be a problem concerning sp10 release, but I was not able to find a confirmation for that
Regards
Giuseppe

Hi Giuseppe,
If I have well understood youre trying to call in result state an action that is not in your current block.
To do this you have to install SP11 and the other will appear as possible choice in the result state target.
Regards
alessio

I Need to use ABS for the following statement

Hi
WA_OUTTAB-CORES_PER_MOLD = GT_IOOPCOMP-BDMNG / GT_IOOPER-MGVRG.
I need to put ABS for the following statement.
Kindly help.

WA_OUTTAB-CORES_PER_MOLD = GT_IOOPCOMP-BDMNG / GT_IOOPER-MGVRG.
WA_OUTTAB-CORES_PER_MOLD = abs(WA_OUTTAB-CORES_PER_MOLD).
Regards
Aneesh.

Where to look for the computed stats collected using gather_table_stats

I have used analyze command before but new to gather_table_stats.
I have executed gather_table_stats procedure as given below. Now where to look for the statistics estimated and also what are the important parameters I need to look in the stats ? Any major difference between analyze & gather_table_stats ?
SQL> exec dbms_stats.gather_table_stats(ownname => 'TPDBS01A', tabname => 'x_TPD_STG_TL_SF_LEGAL_OWN
ER' , estimate_percent => 50, method_opt => 'for all indexed columns size auto');
PL/SQL procedure successfully completed.

The command "analyze table" is deprecated for gathering optimizer statistics. But it is still the only command to get for instance the chained rows. This command is no longer maintained for new features, so if you use this command to collect statistics, it might not collect all needed numbers for the optimizer so the plan could be wrong.
The package dbms_stats is collecting all the figures that the optimizer needs to genererate an optimal access plan. All new database features are incorporated only here.
The statistics numbers can be found in the normal tables like USER|ALL|DBA_TABLES, ...TAB_COLUMNS, ...INDEXES, ...IND_COLUMNS etc. There you can find for instance number of rows in table, clustering factor for indexes and more numbers like this. They are not really needed for us human beings, they are used by the optimizer to generate the access plan.

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.

How to block the Payment for the Rejected Items in MIRO

Dear Sir,
Our Scenario :
1. Material Received through 101 Movement type with Inspection Stock
2. Quality will be done and move the stock to either unrestricted or rejection will be done.
3. Payment through MIRO will be done.
But we need to keep check point in the MIRO in such a way that Value of MIRO should be the Bill Value but net amount to be made only for the accepted quantity considering the rejections in separate line items.
Kindly provide me the methodology for doing this
Regards
K.Natarajan

Hi Murukan
Thanks for your reply. We want to account the bills for the full amount along with automatic debit notes against the rejections to be made simultaneously. so that rejected amount will be deducted from the total amount and net amount will be paid for the acceptance only.
Kindly guide us
Awaiting for the valuable reply at the earliest
Regards
K.Natarajan
Edited by: BASIS Administrator LECS on Jan 9, 2012 4:21 AM

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.

Replacements for the Reject Statement.

Similar Messages

Maybe you are looking for