10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi, I have a hash of hash where it has
name, activities and count
i have data like this -
$result->{$name}->{$activities} = $value;
content of that are -
name - robert tom cat peter
activities - running, eating, sleeping , drinking, work
i need to print output as below
... (3 Replies)
Discussion started by: asak
3 Replies
2. Shell Programming and Scripting
hello,
i am new to scripting and would like to know how to return a hash table from a sub routine.
i tried the following,
my %hash_function = ();
hash_function = &return_hash();
sub return_hash
{
my %hash = ();
///populate the hash
return %hash;
}
but it dosent seem to... (1 Reply)
Discussion started by: hemalathak10
1 Replies
3. UNIX for Dummies Questions & Answers
Hi all,
I just downloaded this example from the net. I was looking around for a hash table like implementation in unix when I came across this.
ARRAY=( "cow:moo"
"dinosaur:roar"
"bird:chirp"
"bash:rock" )
for animal in ${ARRAY} ; do
KEY=${animal%%:*}
... (8 Replies)
Discussion started by: anindyabecs
8 Replies
4. Programming
Hi,
I hope someone can help me with the following prob..
I need to implement a hashtable whose KEYs are strings and VLAUEs are
again hashtables.
ie key - is a string and value -is another hashtable .
So.... how am I supposed to be implementing my nested hashtable?
Thanks in advance (1 Reply)
Discussion started by: andrew.paul
1 Replies
5. UNIX for Advanced & Expert Users
Hi, i want to implement hash table (put, get and transfer operations) using c in unix. so give some nice infromation on how to write my code. (1 Reply)
Discussion started by: kaleab
1 Replies
6. Shell Programming and Scripting
hello,
I am creating a HASH table using file1.pl :-
I want to retrieve the content of the hash table created above from another file named file2.pl :-
The problem is that if I separate like this into 2 files.Then it says that HASH table is not created.So can you please tell me how to... (2 Replies)
Discussion started by: nsharath
2 Replies
7. UNIX for Dummies Questions & Answers
Hi,
I have a nested hash table say for example as follows:
%coins =
(
1 => {
"Quarter"=>25,
"Dime"=>10,
"Nickel"=>5,
},
2 => {
"asd"=>34,
"qwe"=>45,
... (0 Replies)
Discussion started by: arthi
0 Replies
8. Programming
Dear Friends,
I want to create a hash table using the standard Glib header (if possible) so that I can store a structure and keep the hash key(search key) based on a string.
Any example code would be great since I am not able to get the main idea.
best regards
Skull (4 Replies)
Discussion started by: callmetheskull
4 Replies
9. Programming
Hello List,
Iam searching for a solution where i can use hash based searching .
In Detail , I have linked list which will be dynamically increasing .
I need a best searching mechanisim such a way that it can take only one itereation .
Right now iam using linear search which is taking... (11 Replies)
Discussion started by: vlrk
11 Replies
10. UNIX for Advanced & Expert Users
Hi,
For one of my programs, I need to have a hashtable as in Perl. Unfortunately shell doesnt provide any variable like hash. Is there anyway/trick, I could implement a hash in shell (using shell scripts/sed/awk).
JP (2 Replies)
Discussion started by: jyotipg
2 Replies
hsearch(3) Library Functions Manual hsearch(3)
Name
hsearch, hcreate, hdestroy - manage hash search tables
Syntax
#include <search.h>
ENTRY *hsearch (item, action)
ENTRY item;
ACTION action;
int hcreate (nel)
unsigned nel;
void hdestroy ( )
Description
The subroutine is a hash-table search routine generalized from Knuth (6.4) Algorithm D. It returns a pointer into a hash table indicating
the location at which an entry can be found. The item is a structure of type ENTRY (defined in the <search.h> header file) containing two
pointers: item.key points to the comparison key, and item.data points to any other data to be associated with that key. (Pointers to types
other than character should be cast to pointer-to-character.) The action is a member of an enumeration type ACTION indicating the disposi-
tion of the entry if it cannot be found in the table. ENTER indicates that the item should be inserted in the table at an appropriate
point. FIND indicates that no entry should be made. Unsuccessful resolution is indicated by the return of a NULL pointer.
The subroutine allocates sufficient space for the table, and must be called before is used. The nel is an estimate of the maximum number
of entries that the table will contain. This number may be adjusted upward by the algorithm in order to obtain certain mathematically
favorable circumstances.
The subroutine destroys the search table, and may be followed by another call to
Restrictions
Only one hash search table may be active at any given time.
Diagnostics
The subroutine returns a NULL pointer if either the action is FIND and the item could not be found or the action is ENTER and the table is
full.
The subroutine returns zero if it cannot allocate sufficient space for the table.
See Also
bsearch(3), lsearch(3), string(3), tsearch(3)
hsearch(3)