10-03-2008
it not gives perfect count.......
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi Folks !!!!!!!!!!!!!!!!!!!
My Requirement is.............
i have a input file:
501,501.chan
502,502.anand
503,503.biji
504,504.raja
505,505.chan
506,506.anand
507,507.chan
and my o/p should be
chan->3
i.e. the word which occurs maximum number of times in a file should be... (5 Replies)
Discussion started by: aajan
5 Replies
2. Shell Programming and Scripting
Hi,
Please suggest how to write a shell script which delets all the lines containing the word unix in the files supplied as argument in the shell. (4 Replies)
Discussion started by: sireesha9
4 Replies
3. Shell Programming and Scripting
I've been looking on the internet, and haven't found anything simple enough to use in my code. All I want to do is count how many times "-" occurs in a string of characters (as a package name). It seems it should be very simple, and shouldn't require more than one line to accomplish.
And this is... (2 Replies)
Discussion started by: Shingoshi
2 Replies
4. Shell Programming and Scripting
hello everyone,
I'm trying to learn some scripts but i cant get my head around two of them.
1. how can i write a script that will count the number of times a particular word is used in file?
2. how can i make a script that will take me to a web page from unix?
if anyone could help it... (3 Replies)
Discussion started by: BigTool4u2
3 Replies
5. Shell Programming and Scripting
Hi All,
I wanted to know if there is a shell command to print a word n number of times
The Input File is :
Cat 4
Bat 3
Zall 1
Kite 2
Output File required is :
Cat
Cat
Cat
Cat
Bat
Bat
Bat
Zall
Kite (4 Replies)
Discussion started by: sam_2921
4 Replies
6. UNIX for Dummies Questions & Answers
I'm trying to count the number of times each word in the file exist
for example if the file has:
today I have a lot to write, but I will not go for it. The main thing is that today I am looking for a way to get each word in this file with a word count after it specifying that this word has... (4 Replies)
Discussion started by: shnkool
4 Replies
7. Shell Programming and Scripting
i have a script that scans a log file every 10 minutes. this script remembers the last line of the log and then uses it to continue monitoring the log when it runs again 10 minutes later.
the script searches the log for a string called MaxClients.
now, how can i make it so that when the... (7 Replies)
Discussion started by: SkySmart
7 Replies
8. UNIX for Dummies Questions & Answers
Hi
Please can you help how do I count the number of specific characters or words that appear in a file? (8 Replies)
Discussion started by: fretagi
8 Replies
9. Shell Programming and Scripting
can i get a simple script for , Count same word which has come many times in single lines & pars
Eg file would be ==
"Thanks heman thanks thanks
Thanks heman
thanks man"
So resullt should be
Thanks = 5
heman=2
man = 1
thanks in advance :)
Please use code tags for code and... (1 Reply)
Discussion started by: heman96
1 Replies
10. Shell Programming and Scripting
I have a file: file.txt, which contains the following data in it.
This is a file, my name is Karl, what is this process, karl is karl junior, file is a test file, file's name is file.txt
My name is not Karl, my name is Karl Joey
What is your name?
Do you know your name and... (3 Replies)
Discussion started by: anuragpgtgerman
3 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