nested hash table

10 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

Need to print hash of hash in table format

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 ...

2. Programming

Hash Table

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...

3. Shell Programming and Scripting

Return a hash table from a sub routine

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...

4. UNIX for Dummies Questions & Answers

Hash Table like implementation in unix

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%%:*} ...

5. Programming

Hash table

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

6. UNIX for Dummies Questions & Answers

nested loop:multiplication table

I need help to produce output as below 1 2 3 4 5 2 4 6 8 10 3 6 9 12 15 4 8 12 16 20 5 10 15 20 25 my script #!/bin/bash for (( i = 1; i <= 5; ++i )); do echo -n $i for (( j = 1; j <=5; ++j )); do multiply=$(( $i * $j )) done echo $multiply

7. Shell Programming and Scripting

how to import external HASH table in PERL???

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...

8. Programming

Creating a Hash Table

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

9. Programming

hash table implementations in C Language

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...

10. UNIX for Advanced & Expert Users

Creating a hash table using shell script

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

LEARN ABOUT MOJAVE

tie::substrhash

Tie::SubstrHash(3pm)					 Perl Programmers Reference Guide				      Tie::SubstrHash(3pm)

NAME

       Tie::SubstrHash - Fixed-table-size, fixed-key-length hashing

SYNOPSIS

	   require Tie::SubstrHash;

	   tie %myhash, 'Tie::SubstrHash', $key_len, $value_len, $table_size;

DESCRIPTION

       The Tie::SubstrHash package provides a hash-table-like interface to an array of determinate size, with constant key size and record size.

       Upon tying a new hash to this package, the developer must specify the size of the keys that will be used, the size of the value fields that
       the keys will index, and the size of the overall table (in terms of key-value pairs, not size in hard memory). These values will not change
       for the duration of the tied hash. The newly-allocated hash table may now have data stored and retrieved. Efforts to store more than
       $table_size elements will result in a fatal error, as will efforts to store a value not exactly $value_len characters in length, or
       reference through a key not exactly $key_len characters in length. While these constraints may seem excessive, the result is a hash table
       using much less internal memory than an equivalent freely-allocated hash table.

CAVEATS

       Because the current implementation uses the table and key sizes for the hashing algorithm, there is no means by which to dynamically change
       the value of any of the initialization parameters.

       The hash does not support exists().

perl v5.18.2							    2013-11-04						      Tie::SubstrHash(3pm)

UNIX for Dummies Questions & Answers