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)
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)
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)
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)
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)
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)
Hello,
I'm working with putty on Windows 7 professional and I'd like to know if there's a way to gather specific lines from a pre-existing table and make a new table with that information.
More specifically, I'd like the program to look at a specific column, say column N, and see if any of the... (5 Replies)
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)
I was looking at this script and was wondering if anyone can explain what this script does and how does it work. Thank you for any help.
State* lookup(char* prefix, int create)
{
int i, h;
State *sp = NULL ;
h = hash(prefix);
for (sp = statetab; sp != NULL; sp... (14 Replies)
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
LEARN ABOUT DEBIAN
uhashtable
UHashTable(3U) InterViews Reference Manual UHashTable(3U)NAME
UHashTable, UHashElem - hash table classes
SYNOPSIS
#include <Unidraw/uhash.h>
DESCRIPTION
UHashTable implements a simple open hash table. The number of slots can be specified when the table is created. UHashTable stores
UHashElem instances, which contain the key that is hashed. Code that uses UHashTables may derive from UHashElem to store data in addition
to the key. UHashTable also provides operations for iterating over the elements in the hash table.
UHASHELEM OPERATIONS
UHashElem(void* = nil)
Create a UHashElem with the given key value.
void* GetKey()
void SetKey(void*)
Explicitly get and set the element's key value.
UHASHTABLE PUBLIC OPERATIONS
UHashTable(int nslots)
Create a new UHashTable, specifying its number of slots.
virtual void Register(void* key, UHashElem* = nil)
Make an entry into the hash table. If no UHashElem is supplied, this function call the CreateElem function (described below) to
create one, and it will call SetKey (with key as its argument) on the result.
virtual void Unregister(void* key)
Remove the element with the matching key from the hash table and delete it.
void First(Iterator&)
void Next(Iterator&)
boolean Done(Iterator)
UHashElem* GetElem(Iterator)
Operations for iterating over the elements in the hash table. These operation do not guarantee a particular ordering for the itera-
tion. First initializes an iterator to point to the first element in the traversal, Next increments the iterator to point to the
following element, and Done returns whether or not the iterator points beyond the last element in the traversal. GetElem returns
the element to which the given iterator points.
UHashElem* Find(void* key)
Find the element with the matching key (as defined by the Equal operation, described below) in the hash table.
UHASHTABLE PROTECTED OPERATIONS
virtual UHashElem* CreateElem()
Return a new UHashElem instance. Subclasses of UHashTable should redefine this function if they use subclasses of UHashElem.
virtual int Hash(void* key)
Hash the specified key to return a slot index. This value should be less than the value of the _nslots member variable.
virtual boolean Equal(void* key1, void* key2)
Return whether the specified keys are equivalent. By default, Equal simply compares the pointers for equality. Subclasses may
redefine this operation to make more sophisticated comparisons.
SEE ALSO Iterator(3U)Unidraw 3 October 1990 UHashTable(3U)