This could be a bit faster:
Unless you have to, don't try to match beyond the criteria. If it's still slow, you might want break down the hash a bit more, eg by creating a hash of hashes, where the keys of the first hash are the digits left of the comma.
hello
I have loop , in this loop im picking names , this names I want to be keys in %hash
but I don't know how to set in every loop entertain different key in the %hash (1 Reply)
Say that I want to match any of the following:
abc
def
ghi
The letters will either be "abc", "def", or "ghi", only those three patterns. The numbers will vary, but there will only be numbers between the brackets.
I've only been able to match abc, using the following:
abc.*.
I'm... (1 Reply)
Hi, sorry, two hash related questions in one day .. but this has got me a bit stuck.
I have a mysql database table that kind of looks like this, the table is called "view1" and a snippet of that table (SELECT'ing just rows with serial number 0629AN1200) is below
serial nic_name ... (2 Replies)
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 all,
i have a small problem regarding sorting the keys in a hash.
my %hash;
for($i=0;$i<19;$i++)
{
$hash{$i}=$i;
}
foreach $c (sort keys %hash)
{
print "\n $hash{$c}";
} (1 Reply)
I am trying to store this information (info and number) in hash. number is the key and info is value in a hash.i shown my code below.
#!/usr/bin/perl
use warnings;
use strict;
use XML::LibXML::Reader;
my $file;open $file, 'formal.xml');
my $reader =... (0 Replies)
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 need to search for lines starting with "Include" and later has string "httpd-ssl.conf"
like the regex should return match for "Include conf/extra/httpd-ssl.conf"
I tried the following:
^]*#;].+Include.*httpd-ssl.conf
Below is my current file:
# Secure (SSL/TLS) connections... (7 Replies)
Discussion started by: mohtashims
7 Replies
LEARN ABOUT REDHAT
tie::refhash
Tie::RefHash(3pm) Perl Programmers Reference Guide Tie::RefHash(3pm)NAME
Tie::RefHash - use references as hash keys
SYNOPSIS
require 5.004;
use Tie::RefHash;
tie HASHVARIABLE, 'Tie::RefHash', LIST;
tie HASHVARIABLE, 'Tie::RefHash::Nestable', LIST;
untie HASHVARIABLE;
DESCRIPTION
This module provides the ability to use references as hash keys if you first "tie" the hash variable to this module. Normally, only the
keys of the tied hash itself are preserved as references; to use references as keys in hashes-of-hashes, use Tie::RefHash::Nestable,
included as part of Tie::RefHash.
It is implemented using the standard perl TIEHASH interface. Please see the "tie" entry in perlfunc(1) and perltie(1) for more informa-
tion.
The Nestable version works by looking for hash references being stored and converting them to tied hashes so that they too can have refer-
ences as keys. This will happen without warning whenever you store a reference to one of your own hashes in the tied hash.
EXAMPLE
use Tie::RefHash;
tie %h, 'Tie::RefHash';
$a = [];
$b = {};
$c = *main;
$d = "gunk";
$e = sub { 'foo' };
%h = ($a => 1, $b => 2, $c => 3, $d => 4, $e => 5);
$a->[0] = 'foo';
$b->{foo} = 'bar';
for (keys %h) {
print ref($_), "
";
}
tie %h, 'Tie::RefHash::Nestable';
$h{$a}->{$b} = 1;
for (keys %h, keys %{$h{$a}}) {
print ref($_), "
";
}
AUTHOR
Gurusamy Sarathy gsar@activestate.com
VERSION
Version 1.30
SEE ALSO perl(1), perlfunc(1), perltie(1)perl v5.8.0 2002-06-01 Tie::RefHash(3pm)