2 # Hash tied to provide additional keys/values than the original.
3 # Copyright (C) 2005 Jan Kratochvil <project-www.jankratochvil.net@jankratochvil.net>
5 # This program is free software; you can redistribute it and/or modify
6 # it under the terms of the GNU General Public License as published by
7 # the Free Software Foundation; exactly version 2 of June 1991 is required
9 # This program is distributed in the hope that it will be useful,
10 # but WITHOUT ANY WARRANTY; without even the implied warranty of
11 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 # GNU General Public License for more details.
14 # You should have received a copy of the GNU General Public License
15 # along with this program; if not, write to the Free Software
16 # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
19 package My::Hash::Merge;
20 our $VERSION=do { my @r=(q$Revision$=~/\d+/g); sprintf "%d.".("%03d"x$#r),@r; };
24 use My::Web; # for &Wrequire
26 our @ISA=qw(My::Hash);
27 use Carp qw(cluck confess);
32 my($class,@parents)=@_;
34 my $self=bless {},$class;
35 for my $parent (@parents) {
36 # Possibly upgrade unref("HASH")es:
37 $parent=$class->SUPER::TIEHASH($parent)->{"parent"};
38 push @{$self->{"parents"}},$parent;
49 for my $parent (@{$self->{"parents"}}) {
50 next if !exists $parent->{$key};
55 cluck "Duplicity ($count-icity) for key: $key" if $count>=2;
56 $first||=$self->{"parents"}[0];
62 my($this,$key,$value)=@_;
64 my $first=$this->key_find($key);
65 $first->{$key}=$value;
72 my $first=$this->key_find($key);
74 return $first->{$key};
81 confess "TODO: Not yet implemented.";
86 my($this,$lastkey)=@_;
88 confess "TODO: Not yet implemented.";
95 my $first=$this->key_find($key);
97 return exists $first->{$key};
104 my $first=$this->key_find($key);
105 delete $first->{$key};
112 confess "TODO: Not yet implemented.";
119 confess "TODO: Not yet implemented.";