| 1 | package Puzzle::Args; | ||
| 2 | |||
| 3 | our $VERSION = '0.20'; | ||
| 4 | |||
| 5 | use Params::Validate qw(:types);; | ||
| 6 | |||
| 7 | use base 'Class::Container'; | ||
| 8 | use Scalar::Util "blessed"; | ||
| 9 | |||
| 10 | use HTML::Mason::MethodMaker( | ||
| 11 | read_only => [ qw(args) ], | ||
| 12 | read_write => [ | ||
| 13 | ] | ||
| 14 | ); | ||
| 15 | |||
| 16 | __PACKAGE__->valid_params ( | ||
| 17 | args => { type => HASHREF, parse => 'list', default => {}} | ||
| 18 | ); | ||
| 19 | |||
| 20 | |||
| 21 | sub AUTOLOAD { | ||
| 22 | my $self = shift; | ||
| 23 | my $key = $AUTOLOAD; | ||
| 24 | $key =~ s/.*:://; | ||
| 25 | if (@_) { | ||
| 26 | $self->set($key,@_); | ||
| 27 | } else { | ||
| 28 | $self->get($key); | ||
| 29 | } | ||
| 30 | } | ||
| 31 | |||
| 32 | sub DESTROY {} | ||
| 33 | |||
| 34 | sub get { | ||
| 35 | my $self = shift; | ||
| 36 | my $key = shift; | ||
| 37 | return $self->{args}->{$key}; | ||
| 38 | } | ||
| 39 | |||
| 40 | |||
| 41 | sub set { | ||
| 42 | my $self = shift; | ||
| 43 | my $key = shift; | ||
| 44 | my $value = shift; | ||
| 45 | my $params = shift; | ||
| 46 | die "Starting from 0.19 the fourth arg must be an hashref of params." . | ||
| 47 | " Replace relship with {relship => ...}" if ($params && ref($params) ne 'HASH'); | ||
| 48 | if (ref($key) eq 'HASH') { | ||
| 49 | &__push_hashref($self->{args}, $key, $params->{filter}); | ||
| 50 | } elsif (ref($key) eq '') { | ||
| 51 | if (blessed($value) && $value->isa('DBIx::Class::ResultSet')) { | ||
| 52 | my $relship = $params->{relship} ? $params->{relship} : {}; | ||
| 53 | my $array = $self->container->tmpl->dcc->resultset($value,$key,$relship); | ||
| 54 | $self->set($array,undef,$params); | ||
| 55 | } else { | ||
| 56 | $self->{args}->{$key} = &__call_filter($flt,$value,$key,$value,0); | ||
| 57 | } | ||
| 58 | } elsif (blessed($key) && $key->isa('DBIx::Class::ResultSet')) { | ||
| 59 | my $relship = $params->{relship} ? $params->{relship} : {}; | ||
| 60 | my $array = $self->container->tmpl->dcc->resultset($key,undef,$relship); | ||
| 61 | $self->set($array,undef,$params); | ||
| 62 | } elsif (blessed($key) && $key->isa('DBIx::Class::Row')) { | ||
| 63 | my $relship = $params->{relship} ? $params->{relship} : {}; | ||
| 64 | $hashref = $self->container->tmpl->dcc->row($key,$relship); | ||
| 65 | $self->set($hashref,undef,$params); | ||
| 66 | } else { | ||
| 67 | die "Unknown structure to set: " . ref($key) . ' - ' . Data::Dumper::Dumper($key); | ||
| 68 | } | ||
| 69 | return $self->{args}->{$key}; | ||
| 70 | } | ||
| 71 | |||
| 72 | sub clear { | ||
| 73 | my $self = shift; | ||
| 74 | $self->{args} = {}; | ||
| 75 | } | ||
| 76 | |||
| 77 | sub __push_hashref { | ||
| 78 | # da verificare cosa e' piu' veloce | ||
| 79 | my $dst = shift; | ||
| 80 | my $src = shift; | ||
| 81 | my $flt = shift; | ||
| 82 | foreach (keys %$src) { | ||
| 83 | $dst->{$_} = &__call_filter($flt,$src,$_,$src->{$_},0); | ||
| 84 | } | ||
| 85 | } | ||
| 86 | |||
| 87 | sub __call_filter { | ||
| 88 | my $flt = shift; | ||
| 89 | my $src = shift; | ||
| 90 | my $key = shift; | ||
| 91 | my $val = shift; | ||
| 92 | my $lev = shift; | ||
| 93 | return $val unless ($flt); | ||
| 94 | if (ref($val) eq 'HASH') { | ||
| 95 | while (my ($k,$v) = each %$val) { | ||
| 96 | $val->{$k} = &__call_filter($flt,$val,$k,$v,$lev+1); | ||
| 97 | } | ||
| 98 | } elsif (ref($val) eq 'ARRAY') { | ||
| 99 | for (my $i=0;$i<scalar(@$val); $i++) { | ||
| 100 | $val->[$i] = &__call_filter($flt,$val,$i,$val->[$i],$lev+1); | ||
| 101 | } | ||
| 102 | } | ||
| 103 | return &$flt($src,$key,$val,$lev); | ||
| 104 | } | ||
| 105 | |||
| 106 | |||
| 107 | 1; |