FYI... The sort function in Import module

Is not functioning properly, I have been unable to sort based on anything but an initial filemname sort.

That could certainly be a useful feature. This forum is primarily focused on the new features and bugs in the beta release, so it'll be closed when the beta finishes. The best place to get your requests considered is the Feature Request forum http://feedback.photoshop.com/photoshop_family because others can also add their votes so Adobe can see which requests are most popular, and the requests can be easily tracked. They stand a much better chance of getting attention there too.

Similar Messages

How to remove the sort function on the drill down and then save

how to remove the sort function on the drill down and then save in the change local view of the Query
Is it possible to change the porperties of any characteristic in the local view and then save?
If so please post the answer.

I do not think that option is possible.
Regards,
Venkata Boga.

What happend to the sort function?!

Latest version for iPad, what happend to the sort function?
I have very big lists and I can't live without that function, I need to be able to sort the list descending.
So my latest adds will end up in TOP, not bottom.
I also need this function in my iPhone aswell...

Thanks, but I still don't see any reason for removing that function from an existing version.
Even if there is a new super-spotify under development... (that only might have that function..?)
I can only hope that this new super-spotify app will have the sorting functions that are compareable to the Windows version of Spotify, eg sort on track, artist, time, album ,added date. It's not a tricky thing to add and it should have been added years ago.
It's a real pain in the ass right now with big playlists in my iOS devices.

How does the SORT function in ALV grid work?

Hi,
I have a report for which the o/p is displayed in ALV grid format.There is one column in the O/p strcuture which is "No of days".Based on certain conditions,i need to display the value for some of the days as Negative e.g. " - 45".Becasuse of this,I have declared the field for the "No of days" of the type "CHAR".
Now when i sort(using ALV grid SORT function) the list on basis of this column,it doesnt give me the correct o/p.
CAN anyone tell me how do i handle this?I want the list to be sorted correctly on basis of the "No of days" column.
Thanks!

This is your Fourth Cross Posting in last three days on same issue!!
CHAR type column doesnt work for SORT function in ALV grid!
How to sort a column of type CHAR
I dont,ve link for your Fourth Thread on same,though i'm short memory loss.

How do I change the default "sort by" on import?

I've been pouring over the forums for a few minutes with minimal success... It seems many people are set on ranting rather than looking for solutions.
I'm finding that I can import photos easily, but upon import (in the library grid view), I have to then switch the sort-by from "import order" to my preferred sequence of "file name".
Is there a way to change the preferences so that the default sorting order of a newly imported batch of photos is "file name" (or anything else for that matter)? I feel clueless for not being able to find such a setting.
Thanks for the help in advance!
-Cody

@ Ian: thanks for the message, I was afraid that might be the case. It's not generally a bother, but from time to time, my pictures show a sequence of things and it's just plain silly that LR imports with the default being whichever order LR decides to import in.
@ John: I generally import photos from a SD card inserted into my computer, so it just imports it via the default dialog. From looking at the freshly imported gallery, it generally shows that the sort order = "Import order" rather than by filename/capture time.

Problems with the CrossTable Function "Sort"

Hello,
I have a Problem with the "nice" crosstabfunction of the DesignStudio.
When I create from a datasource the crosstab and enable the function for sorting it is only possible to sort the first column.
The other columns get the sign into the Header for the sort function, too. But if I click on it, it won't work and sort nothing.
I'm sure with the old Version of SAP Design-Studio (1.2) it has worked!
Now we are using 1.4 and u can only sort the first column?????
Do I anything wrong? I set only the value for the crosstab (Sorting enabled) on true.
Thank you for help.
Greets,
André

Hello again,
The Application Looks like:
Settings:
Structure:
I don't have any further JS Coding for this case implemented. I think that this would be not necessary because of the Settings of the crosstab or?
Greets,
André

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.

XQuery import module relative path

I'd like to use library modules in queries, with the modules stored in one or more configurable places. If I put them in files, and provide the full path to the file like so:
import module namespace pi = 'http://ceridwen.us/2006/mymodule' at 'file:///path/to/module/file'
It works fine so long as the path given is absolute. I've tried several variations on relative paths, including using 'declare base-uri' (which didn't seem to do anything) and XmlQueryContext::setBaseURI (which didn't help find the module file and caused the context to not be able to find the container). I've also tried giving paths relative to pwd and to the environment home. No luck.
It would be even cooler if I could store the modules in a bdb database... but that would require adding a resolver somewhere. Is there a way to use an XmlResolver for this?
Regards,
John Ralls

John,
documentation: Well, if it's right then I'm reading it wrong. I guess that shouldn't be a surprise.
base-uri: OIC.
XmlResolver: Hmm. I added this:
class Resolver : public DbXml::XmlResolver {
public:
 Resolver() : DbXml::XmlResolver() {}
 virtual ~Resolver() {}
 DbXml::XmlInputStream* resolveEntity(DbXml::XmlTransaction* txn,
 DbXml::XmlManager& mgr,
 const std::string& systemID,
 const std::string& publicID) {
 std::cout << "Resolver::resolveEntity: Got systemID " << systemID
 << ", publicID " << publicID << std::endl;
 return NULL;
to my header and
Resolver* rslv = new Resolver();
this->registerResolver(*rslv);
to the constructor of my DbXml::XmlManager-derived manager class.
The resolveEntity() function doesn't output. What's wrong?
(FWIW, the signature of resolveEntity in the documentation and that in the header(XmlResolver.hpp) differ: The latter doesn't have the std::string& result parameter. I tried both ways, and neither produced the output message.
resolveModule: Yes, I think that that would be clearer.
Regards,
John Ralls

Sort up down icon missing after implementing sort functionality

Hi,
I have implemented sort functionality for a table, and it is working fine, but there is no sortable icon available on the table column.
The icon with the up/down arrow is missing. Once the sorting is over, the sorted icon apears on the screen. But the up/down sort icon should appear on the column header so that it is intutive and people know that the table columns are sortable.
What am i doing wrong ? How can I get the icon ?
Thank you.
Warm regards,
Ashish

This is really important, The sort functionality is working fine but the up and down arrow icon is missing on the table.
Does anyone know how I can enable this icon ?

Difference dot sourcing and importing module

Hi,
Please clarify the difference between dot sourcing a function and importing a module.
http://mikepfeiffer.net/2010/06/how-to-add-functions-to-your-powershell-session/
Note: is there a way to import all my functions in one go so I can load them on a new pc?
J.
Jan Hoedt

dot sourcing runs the script in the global scope.
Import-Module loads an assemble or module file.
They are not in any way similar although theey can both be used to accomplish certain things.
Start by reading the manual on what a module is.
help about_modules
Now look at how dot sourcing works. A file loaded with dot sourcing is not executed but remains in memory. A function in a PS1 and all variables will not remain in memory if you "run" the script without dot sourcing.
search for "dot sourcing" and read almist any of the many blog articles on how to use it.
\_(ツ)_/

Sort functionality in Data Grid

Hi Gurus,
I am new to this DataGrid control.I want to establish the sort functionality when clicking on the headercolumns as in matrices.
(ie.When double clicking the header column , sort the data in ascending or descending order of that column) like in system form matrices.
How ever this is not possible when I tried with grid control.
The problem I am facing is that I cannot get the column headers of the grid programmatically.(in duble click event or itempressed event)
Anybody did this one previously? Also how
we can change the column order of the grid using screen painter?
The columns that actually come visible in the grid are actually columns of the linked datatable object.
In the designer ,there is no "swap" button for column re-ordering.
Only one way I know is changing the query associated with datatable.
This is a crucial thing ,since client may ask for re-ordering of columns frequently.
Can anybody help?
Regards,
Deepesh

Hi Deepesh,
1. This functionality is not available with the SDK. Thus it's not possible to change it on the fly. Your only option is to change the query associated with datatable (as you mentioned). You may set up a user preference table, that the user can configure with its preference. That's the best you can do.
2. To swap the columns in screen painter you must use SBO 2005 (it's not available on previous release). What you must do is, click on the one column you want to swap and the other you want to swap and click on the swap button (on the left bottom of the page in the columns tab)

Sort function doesn't work E12

the sort function doesn't work half the time on Elements 12 organizer.

What about FUNCTION CLOCK_INFormula
RETURN NUMBER
IS
    l_hours_worked NUMBER;
    l_to_return     NUMBER;
BEGIN
    l_hours_worked := TO_NUMBER(NVL(:ATX_CLOCK_IN,'0'));
    IF (MOD((l_hours_worked - 0.02),0.25) = 0) THEN
        l_to_return := TRUNC((l_hours_worked - 0.02) * 4) / 4;
    ELSE
        l_to_return := TRUNC((l_hours_worked + 0.23) * 4) / 4;
    END IF;
    RETURN (l_to_return);
EXCEPTION
    WHEN VALUE_ERROR THEN
        RAISE_APPLICATION_ERROR ( -20100
        ,   'ERROR, Cannot represent '
        || :ATX_CLOCK_IN
        || ' as a number.');
END CLOCK_INFormula;?
This function assumes :ATX_CLOCK_IN is always positive.
T.

DRQ# Payment Wizard Sort Function

Hi,
The sort function in the SAP payment wizard, loses it's settings in Step 6. In Step 3, you can sort the BP name field to sort by alpha, but in Step 6 the sort converts back to numeric, by BP Code. Our client is having problems with this when making their invoice selections in the wizard, as their invoice filing system is alphabetic and they have a large pile to sort through when making payments.
I would have thought the sort option should retain throughout the wizard from Step 3 to Step 6. Additionally it would be nice if in Step 6 there was also the option to sort again if needed.
Edited by: Lianne Plant on Nov 9, 2010 3:42 AM

Hi Janne,
I trust you are well.
Please post the DRQ in the forum ['SAP Business One Product Development Collaboration'|/community [original link is broken];.
All the best,
Jesper

Using SORT function in mapping

Hi,
I am having trouble getting my head around using the SORT function.
My interface is IDOC to File, The IDOC has a repeating segment (PAYLOAD) that can be of 3 types, either type A, B or C (this is set using a "TYPE" field).
In my file structure I have a repeating "ROW" element which has all of the fields for each row.
I want to group all the Type A data together, the Type B together and the Type C.
I have tried the following mapping on the "ROW" element but it doesn't seem to work:
"TYPE"--"sort"Split By Value (Value Change)--collapseContext--"ROW"
for each of the mappings under ROW I just have fields copied directly.
I think I am doing something wrong.
Thanks.

Hi,
 You could make this mapping
 TYPE --- +----------------+ +----------------+
 | | | |
 | Concat | --- | mySortFunction | --- NAME
 | | | |
 NAME --- +----------------+ +----------------+
 TYPE --- +----------------+ +----------------+
 | | | |
 | Concat | --- | mySortFunction | --- ADDR
 | | | |
 ADDR --- +----------------+ +----------------+
 Where source code of mySortFunction is like this:
public void mySortFunction(String[] inputValues,ResultList result,Container container){
 for(int i=0;i<inputValues.length;i++)
 if(inputValues.substring(0,1).equals("A"))
 result.addValue(inputValues.substring(1, inputValues.length-1);
 for(int i=0;i<inputValues.length;i++)
 if(inputValues.substring(0,1).equals("B"))
 result.addValue(inputValues.substring(1, inputValues.length-1);
 for(int i=0;i<inputValues.length;i++)
 if(inputValues.substring(0,1).equals("C"))
 result.addValue(inputValues.substring(1, inputValues.length-1);
 It is very simple. You concat TYPE whit your data, and then you sort all queue, so you have a new sort queue data. You must only then put out data.

Sort Function is being Overridden by Some default

I've created a simple HFR report using Financial Reporting Studio to do budget vs. actual on a particular dimension (cost center). The dimemsion member selected is part of an alternate heirarchy which aggregrates the same way that I'd like the report to display. The particular member is selected as Decendents Inclusive (and is defined in the report as opposed to a prompt) so that I can capture the two levels below the selected member.
No matter what I do using the Sort function (Name, Heirarchy, Description) in the member selection area when it generates the report the hierarchy is upside down (base, level 1, level 2), completely contrary the the actual heirarchy in EPMA. What am I missing and how do I get it to display from the top down?
Thanks!
Edited by: user13058666 on Jun 2, 2010 10:47 AM
Edited by: user13058666 on Jun 2, 2010 10:53 AM

A file under Private What? Where are you seeing this and how are you accessing it?

FYI... The sort function in Import module

Similar Messages

Maybe you are looking for