Note that the "keys" function returns the keys of a hash in an apparently random order.
I sorted names as well as activities, so the values in my output are ordered horizontally by name and vertically by activities.
This User Gave Thanks to durden_tyler For This Post:
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)
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)
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)
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... (1 Reply)
Can Someone explain me why even using Tie::IxHash I can not get the output data in the same order that it was inserted? See code below.
#!/usr/bin/perl
use warnings;
use Tie::IxHash;
use strict;
tie (my %programs, "Tie::IxHash");
while (my $line = <DATA>) {
chomp $line;
my(... (1 Reply)
Hi,
In Perl, is it possible to use a range of numbers with '..' as a key in a hash?
Something in like:
%hash = (
'768..1536' => '1G',
'1537..2560' => '2G'
);
That is, the range operation is evaluated, and all members of the range are... (3 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,
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',
... (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)
Discussion started by: totoro125
14 Replies
LEARN ABOUT DEBIAN
aptpkg::hash
AptPkg::hash(3pm) User Contributed Perl Documentation AptPkg::hash(3pm)NAME
AptPkg::hash - a helper class for implementing tied hashes
SYNOPSIS
use AptPkg::hash;
DESCRIPTION
The AptPkg::hash class provides hash-like access for objects which have an underlying XS implementation.
Such objects need to add AptPkg::hash to @ISA, provide get, set and exists methods, and an iterator class.
AptPkg::hash
new([XS_OBJECT])
Create a object as a tied hash. The object is implemented as a hash reference blessed into the class, which in turn is tied to
AptPkg::hash.
This means that both $obj->method() and $obj->{key} valid, the latter invoking get/set (through FETCH/STORE).
The tie associates an array reference with the hash, which initially contains a reference to the hash, the XS object and an anon hash
which may be used by subclasses to store state information.
If no XS object is passed, one is created via new in the XS class. The name of that class is constructed from the class name, by
lower-casing the last component and prefixing it with an underscore (eg. AptPkg::Config becomes AptPkg::_config).
If the module contains a @KEYS array, then the private hash will be populated with those entries as keys (see the description below of
the AptPkg::hash::method class).
_self, _xs, _priv
Accessors which may be used in subclass methods to fetch the three array elements associated with the hash reference.
keys(ARGS)
In a scalar context, creates and returns a new iterator object (the class name with the suffix ::Iter appended).
The XS object, the private hash and any arguments are passed to the constructor.
In an array context, the iterator is used to generate a list of keys which are then returned.
The iterator class must implement a next method, which returns the current key and advances to the next.
AptPkg::hash::method
The AptPkg::hash::method class extends AptPkg::hash, providing a simple way to map a fixed set of keys (defined by the @KEYS array) into
method calls on either the object, or the internal XS object.
Classes inheriting from AptPkg::hash::method should provide an iterator class which inherits from AptPkg::hash::method::iter.
AUTHOR
Brendan O'Dea <bod@debian.org>
perl v5.14.2 2012-03-16 AptPkg::hash(3pm)