Hi Martin,
Its an associative array.
###############################################
# Perl hash
#3 dimensional:
$myhash{'this'}{$that}{$somethingelse} =
$scalar_or_data_structure_or_whatever;
# exists:
if (exists $myhash{'this'}{$that}{$somethingelse} ) {
print "Yup it exists\n";
}
#Sort by key first dimension
foreach my $key1 (sort keys %myhash) {
............
#Sort by key Second dimension
foreach my $key2 (sort keys %{$myhash{$key1}}) {
............
#Sort by key third dimension
foreach my $key3 (sort keys %{$myhash{$key1}{$key2}}) {
............
}
}
}
#Delete an element:
delete $myhash{'this'}{$that}{$somethingelse};
###############################################
Want to do all these things.
Currently using Array class.
var myhash = new Array();
myhash["this"] = new Array(); //Thats a pain, but i can live with it.
Its the other fucntionality ( sorting, existence and deleting) I would
like. Was hoping that was built into
some other class already.
Thanks.
Jeff
On Sun, 2010-07-18 at 23:22 -0700, MartinWittemann wrote:
> Hell Jeff,
> Could you please explain a bit what how this data structure works in perl? I
> am not an perl programmer so I have no idea how it should look like. But I
> know JavaScript so maybe I know something similar or how to get that.
> Regards,
> Martin
------------------------------------------------------------------------------
This SF.net email is sponsored by Sprint
What will you do first with EVO, the first 4G phone?
Visit sprint.com/first -- http://p.sf.net/sfu/sprint-com-first
_______________________________________________
qooxdoo-devel mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/qooxdoo-devel
