01-19-2009
Hi ss,
Why not sort it in the query itself? That would be more faster and easier.
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi,
Lets say I have a few xml files:
1234567894.xml
abc_1234567895.xml
abc_000_1234567890.xml
abc_0000000_1234567893.xml
684_abc_000_1234567899.xml
The naming convention of the files is:
xxxxx_timestamp.xml OR timestamp.xml
where x can be anything
and I would like to order them by... (4 Replies)
Discussion started by: Leion
4 Replies
2. Homework & Coursework Questions
Hi guys I need you ,please help me
i have to do this for tomorow and i don't understand how to do
Q1 : Order the words of RADIO.txt by frequency
Q2 : Order the words of RADIO.txt in alphabétique order
Q3 : Order the words of RADIO.txt par ordre "rhymique" (exemple, put togeder words which are... (1 Reply)
Discussion started by: Lili
1 Replies
3. Shell Programming and Scripting
With an input file like this:
How can I get an output like this?
(In the quoted examples, the "_" sign represents an empty space)
Note that there are some minus signs and no spaces, in the example above the first character of the first line is an empty space, so each number spans 10... (16 Replies)
Discussion started by: lego
16 Replies
4. Shell Programming and Scripting
input
Predictions for job: 1299399580
**********************************************
gg18_qqq10_100017878_100017978_-
==============================================================================
zzz Factor: XXX, ttt: crsmsgw, Cutoff: 0.6429
seqe Position fff Coordinate K-mer Score ... (3 Replies)
Discussion started by: quincyjones
3 Replies
5. Shell Programming and Scripting
Is it possible to re-order certain rows as columns (of large files).
Few lines from the file for reference.
input
Splicing Factor: Tra2beta, Motif: aaguguu, Cutoff: 0.5000
Sequence Position Genomic Coordinate K-mer Score
97 chr1:67052604 uacuguu 0.571
147... (3 Replies)
Discussion started by: quincyjones
3 Replies
6. Shell Programming and Scripting
file1
1 SNP2 3
1 SNP3 3
1 SNP5 4
2 SNP1 4
2 SNP4 4
file2
SNP1 1 1 1
SNP5 5 5 5
SNP4 4 4 4
SNP2 2 2 2
SNP3 1 1 1
desired output (1 Reply)
Discussion started by: johnkim0806
1 Replies
7. Shell Programming and Scripting
1
2
4
5
3
I would like to use a script so that i can randomly rearrange these numbers such as
3
5
2
4
1
Thanks! (3 Replies)
Discussion started by: johnkim0806
3 Replies
8. Shell Programming and Scripting
Hi All,
I have directories under
/development/arun/weekly/
20120421
20120414
.
.
.
.
I need to arrange these directories in descending order.
folder name with recent date will be on top and then others. (1 Reply)
Discussion started by: Arun Mishra
1 Replies
9. Shell Programming and Scripting
Hi,
Could some one please help to order the batch number in sequence.
I will be getting bunch of files with batch number in folder1 which are not in sequence.
I need to move all files from folder1 to folder2 with batch number in sequence.
Header record looks like
PROCESS1... (8 Replies)
Discussion started by: zooby
8 Replies
10. Shell Programming and Scripting
Hello.
I have a script that writes parameters in alphabetic order.
But I have a parameter which have 3 lines. There is no continuation character ( '\' ). Each of the three lines finish with 'cr'. But line 2 and 3 of the concerning parameter start with a tab char (but should be one or more... (7 Replies)
Discussion started by: jcdole
7 Replies
PSORT(3) BSD Library Functions Manual PSORT(3)
NAME
psort, psort_b, psort_r -- parallel sort functions
SYNOPSIS
#include <stdlib.h>
void
psort(void *base, size_t nel, size_t width, int (*compar)(const void *, const void *));
void
psort_b(void *base, size_t nel, size_t width, int (^compar)(const void *, const void *));
void
psort_r(void *base, size_t nel, size_t width, void *thunk, int (*compar)(void *, const void *, const void *));
DESCRIPTION
The psort(), psort_b(), and psort_r() functions are parallel sort routines that are drop-in compatible with the corresponding qsort() func-
tion (see qsort(3) for a description of the arguments). On multiprocessor machines, multiple threads may be created to simultaneously per-
form the sort calculations, resulting in an overall faster sort result. Overhead in managing the threads limits the maximum speed improve-
ment to somewhat less that the number of processors available. For example, on a 4-processor machine, a typical sort on a large array might
result in 3.2 times faster sorting than a regular qsort().
RESTRICTIONS
Because of the multi-threaded nature of the sort, the comparison function is expected to perform its own synchronization that might be
required for data physically outside the two objects passed to the comparison function. However, no synchronization is required for the two
object themselves, unless some third party is also accessing those objects.
Additional memory is temporary allocated to deal with the parallel nature of the computation.
Because of the overhead of maintaining multiple threads, the psort() family of routines may choose to just call qsort(3) when there is no
advantage to parallelizing (for example, when the number of objects in the array is too small, or only one processor is available).
Like qsort(3), the sort is not stable.
RETURN VALUES
The psort(), psort_b() and psort_r() functions return no value.
SEE ALSO
qsort(3)
Mac OS X Nov 25, 2008 Mac OS X