Compression algorithm( usage of Hash tables) Post: 302190916

10 More Discussions You Might Find Interesting

1. UNIX for Dummies Questions & Answers

Returning Hash Tables in Perl

Hi: Does anybody know how to return hash tables created in a function? I have something like so: %a_hash_table = build_a_hash_table(); sub build_a_hash_table { my(%hash_table); #some code to build hash table: "%hash_table" for e.g return %hash_table; } ----> This...

2. UNIX for Dummies Questions & Answers

Passing Hash Tables to Subroutines

Hi: How do I pass a hash table down to a subroutine along with some other variables? For example, I have say a subroutine play_with_hash: sub play_with_hash { my( $var1, $var2, %my_hash ) = @_; #do stuff with %my_hash ........... } Then I want to call the subroutine...

3. Programming

hash tables, pthread_key_create

I want to store a bunch of pthread_t types in a hash table, but since pthread_t is not an integer value, I cannot hash it. I was hoping to store a unique nonzero as key 0 for each thread with thread-specific data ala pthread_key_create/pthread_setspecific, but but as it turns out only the first...

4. Shell Programming and Scripting

Converting tables of row data into columns of tables

I am trying to transpose tables listed in the format into format. Any help would be greatly appreciated. Input: test_data_1 1 2 90% 4 3 91% 5 4 90% 6 5 90% 9 6 90% test_data_2 3 5 92% 5 4 92% 7 3 93% 9 2 92% 1 1 92% ... Output:...

5. Shell Programming and Scripting

Print Entire hash list (hash of hashes)

I have a script with dynamic hash of hashes , and I want to print the entire hash (with all other hashes). Itried to do it recursively by checking if the current key is a hash and if yes call the current function again with refference to the sub hash. Most of the printing seems to be OK but in...

6. HP-UX

how can I find cpu usage memory usage swap usage and logical volume usage

how can I find cpu usage memory usage swap usage and I want to know CPU usage above X% and contiue Y times and memory usage above X % and contiue Y times my final destination is monitor process logical volume usage above X % and number of Logical voluage above can I not to...

7. Programming

Hash tables concepts

How hash tables are used to quickly locate a data record?

8. UNIX for Dummies Questions & Answers

Hash Tables of Buffers

Hello, I want to know how hash tables for buffers were implemented in Unix and now, in linux how they are implemented ? I am aware of what hashing is..also quite familiar with Unix/Linux. Special case is how device numbers comes into picture..I am curious ! If possible consider some...

9. Shell Programming and Scripting

Compare values of hashes of hash for n number of hash in perl without sorting.

Hi, I have an hashes of hash, where hash is dynamic, it can be n number of hash. i need to compare data_count values of all . my %result ( $abc => { 'data_count' => '10', 'ID' => 'ABC122', } $def => { 'data_count' => '20', 'ID' => 'defASe', ...

10. Shell Programming and Scripting

Dynamically parse BibTeX and create hash of hash

Hello gurus, Iam trying to parse following BibTex file (bibliography.bib): @book{Lee2000a, abstract = {Abstract goes here}, author = {Lee, Wenke and Stolfo, Salvatore J}, title = {{Data mining approaches for intrusion detection}}, year = {2000} } @article{Forrest1996, abstract =...

LEARN ABOUT DEBIAN

hash::case::preserve

Hash::Case::Preserve(3pm)				User Contributed Perl Documentation				 Hash::Case::Preserve(3pm)

NAME

       Hash::Case::Preserve - hash with enforced lower cased keys

INHERITANCE

	Hash::Case::Preserve
	  is a Hash::Case
	  is a Tie::StdHash

SYNOPSIS

	use Hash::Case::Preserve;
	tie my(%cphash), 'Hash::Case::Preserve';
	$cphash{StraNGeKeY} = 3;
	print keys %cphash;	    # StraNGeKeY
	print $cphash{strangekey};  # 3
	print $cphash{STRANGEKEY};  # 3

DESCRIPTION

       Hash::Case::Preserve extends Hash::Case, which lets you play various trics with hash keys. This extension implements a fake hash which is
       case-insentive. The keys are administered in the casing as they were used: case-insensitive but case-preserving.

METHODS

   Constructors
       $obj->addHashData(HASH)
	   See "Constructors" in Hash::Case

       $obj->addPairs(PAIRS)
	   See "Constructors" in Hash::Case

       $obj->setHash(HASH)
	   See "Constructors" in Hash::Case

       tie(HASH, 'Hash::Case::Preserve', [VALUES,] OPTIONS)
	   Define HASH to be case insensitive, but case preserving.  The hash is initialized with the VALUES, specified as ref-array (passing a
	   list of key-value pairs) or ref-hash.

	   OPTIONS is a list of key/value pairs, which specify how the hash must handle preservation.  Current options:

	    -Option--Default
	     keep    'LAST'

	   keep => 'FIRST' | 'LAST'
	     Which casing is the preferred casing?  The FIRST appearance or the LAST.  Only stores will affect the casing, deletes will undo the
	     definition.  Defaults to LAST, which is slightly faster.

SEE ALSO

       This module is part of Hash-Case distribution version 1.02, built on March 09, 2012. Website: http://perl.overmeer.net/hash-case/

LICENSE

       Copyrights 2002-2003,2007-2012 by Mark Overmeer. For other contributors see ChangeLog.

       This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.  See
       http://www.perl.com/perl/misc/Artistic.html

perl v5.14.2							    2012-03-09						 Hash::Case::Preserve(3pm)