08-26-2013
Thanks, it works perfect!!!!
9 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi,
I want to write a shell script which increments a particular column in a row from a text file and then adds another row below the current row with the incremented value .
For Eg .
if the input file has a row :
abc xyz lmn 89 lm nk o p
I would like the script to create something like... (9 Replies)
Discussion started by: aYankeeFan
9 Replies
2. Shell Programming and Scripting
Hi
I need to do some thing like "find and insert before that " in a file which contains many records. This will be clear with the following example.
The original data record should be some thing like this
60119827 RTMS_LOCATION_CDR INSTANT_POSITION_QUERY 1236574686123083rtmssrv7 ... (8 Replies)
Discussion started by: aemunathan
8 Replies
3. Shell Programming and Scripting
Guys -- I am noob and I am really strugging on this one. I cant even write the pseudo code for it. I have a file that spits values in individual rows as such:
file:
user date type size
joe 2005-25-09 log 1
joe 2005-25-09 snd 10
joe 2005-25-09 rcd 12
joe 2005-24-09 log 2
joe... (1 Reply)
Discussion started by: made2last
1 Replies
4. Shell Programming and Scripting
Hello,
I have an input file like the following:
11_3_4
2_1_35
3_15__
_16989
Where '_' is a space. The data is in a table. Is there a way for the program to prompt the user for x1,y1 and x2,y2, where x1,y1 is the desired number (for example x=6 y=4 is a value of 4) and move to a desired spot... (2 Replies)
Discussion started by: jl487
2 Replies
5. UNIX for Dummies Questions & Answers
Hello Everyone,
My issue is that I want to traverse a database table row by row and do some action on the value retrieved in each row.
I have gone through a lot of shell script questions/posts. I could find row by row traversal of a file but not a database table.
Please help.
Thanks &... (5 Replies)
Discussion started by: ahsan.asghar
5 Replies
6. Shell Programming and Scripting
HI Guys,
I have Below Input :-
RepigA_hteis522 ReptCfiEtrBsCll_aofe
MSL04_MSL2_A25_1A 0 9
MSL04_MSL2_A25_1B 0 9
MSL04_MSL2_A25_1C 0 9
RepigA ReptCfiEtrBsCll
hteis522 aofe
MSL04_MSL2_A25_1A 0 9
MSL04_MSL2_A25_1B 0 9
MSL04_MSL2_A25_1C 0 9
Split Data in two first row... (2 Replies)
Discussion started by: pareshkp
2 Replies
7. UNIX for Beginners Questions & Answers
My original files are like this below and I distinguish them from the AP_ID (file1 has 572 and file2 has 544). Also, the header on file1 has “G_” pre-pended. NOTE: these are only snippets of very large files and much of the data is not present here.
Original File 1:
... (36 Replies)
Discussion started by: aachave1
36 Replies
8. Shell Programming and Scripting
Hi ALL,
We have requirement in a file, i have multiple rows.
Example below:
Input file rows
01,1,102319,0,0,70,26,U,1,331,000000113200000011920000001212
01,1,102319,0,1,80,20,U,1,241,00000059420000006021
I need my output file should be as mentioned below. Last field should split for... (4 Replies)
Discussion started by: kotra
4 Replies
9. UNIX for Beginners Questions & Answers
This is a question that is related to one I had last August when I was trying to sort/merge two files by millsecond time column (in this case column 6).
The script (below) that helped me last august by RudiC solved the puzzle of sorting/merging two files by time, except it gets lost when the... (0 Replies)
Discussion started by: aachave1
0 Replies
LEARN ABOUT NETBSD
nbperf
NBPERF(1) BSD General Commands Manual NBPERF(1)
NAME
nbperf -- compute a perfect hash function
SYNOPSIS
nbperf [-ps] [-a algorithm] [-c utilisation] [-h hash] [-i iterations] [-m map-file] [-n name] [-o output] [input]
DESCRIPTION
nbperf reads a number of keys one per line from standard input or input. It computes a minimal perfect hash function and writes it to stdout
or output. The default algorithm is "chm".
The -m argument instructs nbperf to write the resulting key mapping to map-file. Each line gives the result of the hash function for the
corresponding input key.
The parameter utilisation determines the space efficiency.
Supported arguments for -a:
chm This results in an order preserving minimal perfect hash function. The utilisation must be at least 2, the default. The number of
iterations needed grows if the utilisation is very near to 2.
chm3
Similar to chm. The resulting hash function needs three instead of two table lookups when compared to chm. The utilisation must be at
least 1.24, the default. This makes the output for chm3 noticable smaller than the output for chm.
bpz This results in a non-order preserving minimal perfect hash function. Output size is approximately 2.79 bit per key for the default
value of utilisation, 1.24. This is also the smallest supported value.
Supported arguments for -h:
mi_vector_hash Platform-independent version of Jenkins parallel hash. See mi_vector_hash(3).
The number of iterations can be limited with -i. nbperf outputs a function matching uint32_t hash(const void * restrict, size_t) to stdout.
The function expects the key length as second argument, for strings not including the terminating NUL. It is the responsibility of the call-
er to pass in only valid keys or compare the resulting index to the key. The function name can be changed using -n name. If the -s flag is
specified, it will be static.
After each failing iteration, a dot is written to stderr.
nbperf checks for duplicate keys on the first iteration that passed basic hash distribution tests. In that case, an error message is printed
and the program terminates.
If the -p flag is specified, the hash function is seeded in a stable way. This may take longer than the normal random seed, but ensures that
the output is the same for repeated invocations as long as the input is constant.
EXIT STATUS
The nbperf utility exits 0 on success, and >0 if an error occurs.
SEE ALSO
mi_vector_hash(3)
AUTHORS
Jorg Sonnenberger
BSD
September 25, 2012 BSD