Sponsored Content
Top Forums Shell Programming and Scripting How to sort and compare files in more efficient manner? Post 302810647 by RudiC on Wednesday 22nd of May 2013 09:02:11 AM
Old 05-22-2013
OK, the bourne shell may not come with process substitution. Do you have bash or ksh available?
 

10 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

Is there an efficient way in finding and deleting files?

Hi I have a script to find and delete the files which are say, noDaysOld, I am interested to find the number of such files I am fniding for deleting and then deleting it. So, the script I wrote, first finds the number of such files and then deletes, clearly this is two different steps. ... (3 Replies)
Discussion started by: guruparan18
3 Replies

2. Shell Programming and Scripting

Why do we use sort before compare ?

Dear All. Im trying to know how exactly the command "compare" works, does it compare line by line or field by field, and the most important thing is that why the files have to be sorted before we compare them? Thanks in advance (7 Replies)
Discussion started by: yahyaaa
7 Replies

3. UNIX for Dummies Questions & Answers

sort and compare files

Hi, I have around 14-15 files and i want to sort all the files and then compare. I dont want to sort them and store in a different file and then compare. I want to compare two files at a time. Is there a way we can do this using a single command? (5 Replies)
Discussion started by: dnat
5 Replies

4. Shell Programming and Scripting

HELP: I need to sort a text file in an uncommon manner, can't get desired results

Hi All I have a flat text file. Each line in it contains a "/full path/filename". The last three columns are predictable, but directory depth of each line varies. I want to sort on the last three columns, starting from the last, 2nd last and 3rd last. In that order. The last three columns... (6 Replies)
Discussion started by: JakeKatz
6 Replies

5. Emergency UNIX and Linux Support

Appending the contents of two files in computational manner

Hi, I have two files say file 1 file 2 File1 1 2 4 5 File 2 asdf adf How to get the ouput something like asdf1 adf1 asdf2 adf2 asdf4 adf4 asdf5 (5 Replies)
Discussion started by: ecearund
5 Replies

6. Emergency UNIX and Linux Support

Help to make awk script more efficient for large files

Hello, Error awk: Internal software error in the tostring function on TS1101?05044400?.0085498227?0?.0011041461?.0034752266?.00397045?0?0?0?0?0?0?11/02/10?09/23/10???10?no??0??no?sct_det3_10_20110516_143936.txt What it is It is a unix shell script that contains an awk program as well as... (4 Replies)
Discussion started by: script_op2a
4 Replies

7. Programming

Help with make this Fortran code more efficient (in HPC manner)

Hi there, I had run into some fortran code to modify. Obviously, it was written without thinking of high performance computing and not parallelized... Now I would like to make the code "on track" and parallel. After a whole afternoon thinking, I still cannot find where to start. Can any one... (3 Replies)
Discussion started by: P_E_M_Lee
3 Replies

8. Shell Programming and Scripting

comm command -- Sort and compare two files

Team, I have two files and I am trying to find the lines unique to file1. So i have executed the below command at shell prompt and got the correct results comm -23 <(sort test) <(sort test1) When i run the same command in Bash shell script, i got the correct results. But when i run... (5 Replies)
Discussion started by: forums123456
5 Replies

9. Shell Programming and Scripting

Most efficient method to extract values from text files

I have a list of files defined in a single file , one on each line.(No.of files may wary each time) eg. content of ETL_LOOKUP.dat /data/project/randomname /data/project/ramname /data/project/raname /data/project/radomname /data/project/raame /data/project/andomname size of these... (5 Replies)
Discussion started by: h0x0r21
5 Replies

10. Shell Programming and Scripting

More efficient for loop on files

is there a more efficient way to write the following code: for eachlfile in $(ls -ltcrd ${BACKUPDIR}/${BACKUPNAME}*/content_${BACKUPNAME}* 2>/dev/null | awk '{print $NF}') do echo "==========================" ... (4 Replies)
Discussion started by: SkySmart
4 Replies
Xapian::Enquire(3pm)					User Contributed Perl Documentation				      Xapian::Enquire(3pm)

NAME
Search::Xapian::Enquire - Make queries against a database DESCRIPTION
This class provides an interface to the information retrieval system for the purpose of searching. METHODS
new set_query takes either a ready made Search::Xapian::Query or a scalar containing a query, which in that case will be passed to Search::Xapian::Query's constructor, together with any other passed arguments. set_query_object <query> get_query matches <start> <size> [<check_at_least>] Takes the start element, and maximum number of elements (and optionally the minimum number of matches to check), and returns an array tied to Search::Xapian::MSet::Tied. get_matching_terms_begin Returns a Search::Xapian::TermIterator, pointing to the start of the stream. get_matching_terms_end Returns a Search::Xapian::TermIterator, pointing to the end of the stream. set_collapse_key <collapse_key> set_docid_order <order> Set the direction in which documents are ordered by document id in the returned MSet. This order only has an effect on documents which would otherwise have equal rank. For a weighted probabilistic match with no sort value, this means documents with equal weight. For a boolean match, with no sort value, this means all documents. And if a sort value is used, this means documents with equal sort value (and also equal weight if ordering on relevance after the sort). order can be ENQ_ASCENDING (the default, docids sort in ascending order), ENQ_DESCENDING (docds sort in descending order), or ENQ_DONT_CARE (docids sort in whatever order is most efficient for the backend.) Note: If you add documents in strict date order, then a boolean search - i.e. set_weighting_scheme(Search::Xapian::BoolWeight->new()) - with set_docid_order(ENQ_DESCENDING) is a very efficient way to perform "sort by date, newest first". set_cutoff <percent_cutoff> [<weight_cutoff>] set_sort_by_relevance Set the sorting to be by relevance only. This is the default. set_sort_by_value <sort_key> [<ascending>] Set the sorting to be by value only. sort_key - value number to reorder on. Sorting is with a string compare. If ascending is true (the default) higher is better; if ascending is false, lower is better. ascending - If true, document values which sort higher by string compare are better. If false, the sort order is reversed. (default true) set_sort_by_value_then_relevance <sort_key> [<ascending>] Set the sorting to be by value, then by relevance for documents with the same value. sort_key - value number to reorder on. Sorting is with a string compare. If ascending is true (the default) higher is better; if ascending is false, lower is better. ascending - If true, document values which sort higher by string compare are better. If false, the sort order is reversed. (default true) set_sort_by_relevance_then_value <sort_key> [<ascending>] Set the sorting to be by relevance then value. Note that with the default BM25 weighting scheme parameters, non-identical documents will rarely have the same weight, so this setting will give very similar results to set_sort_by_relevance(). It becomes more useful with particular BM25 parameter settings (e.g. BM25Weight(1,0,1,0,0)) or custom weighting schemes. sort_key - value number to reorder on. Sorting is with a string compare. If ascending is true (the default) higher is better; if ascending is false, lower is better. ascending - If true, document values which sort higher by string compare are better. If false, the sort order is reversed. (default true) set_sort_by_key <sorter> [<ascending>] Set the sorting to be by key only. sorter - the functor to use to build the key. ascending - If true, keys which sort higher by string compare are better. If false, the sort order is reversed. (default true) set_sort_by_key_then_relevance <sorter> [<ascending>] Set the sorting to be by key, then by relevance for documents with the same key. sorter - the functor to use to build the key. ascending - If true, keys which sort higher by string compare are better. If false, the sort order is reversed. (default true) set_sort_by_relevance_then_key <sorter> [<ascending>] Set the sorting to be by relevance then key. sorter - the functor to use to build the key. ascending - If true, keys which sort higher by string compare are better. If false, the sort order is reversed. (default true) get_mset Get match set. get_eset <maxitems> <rset> [<decider>] Get set of query expansion terms. get_description Return a description of this object. SEE ALSO
Search::Xapian::Query, Search::Xapian::Database perl v5.14.2 2012-05-09 Xapian::Enquire(3pm)
All times are GMT -4. The time now is 05:06 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy