From Code to Community: Sponsoring The Perl and Raku Conference 2025 Learn more

CYCLES / Data-TreeValidator-0.03 / lib / Data / TreeValidator / Branch.pm 

            

              
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
—
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123

              
package Data::TreeValidator::Branch;
BEGIN {
  $Data::TreeValidator::Branch::VERSION = '0.03';
}
# ABSTRACT: A branch of tree validation
use Moose;
use namespace::autoclean;
use Data::TreeValidator::Types qw( HashTree Node );
use MooseX::Types::Moose qw( CodeRef Maybe Str );
use MooseX::Types::Structured qw( Map );
use aliased 'Data::TreeValidator::Result::Branch' => 'Result',;
use MooseX::Params::Validate;
with 'Data::TreeValidator::Node';
has 'children' => (
    isa => Map[ Str, Node ],
    default => sub { {} },
    traits => [ 'Hash' ],
    handles => {
        children => 'values',
        child_names => 'keys',
        add_child => 'set',
        child => 'get',
    }
);
has 'cross_validator' => (
    isa => CodeRef,
    traits => [ 'Code' ],
    default => sub { sub {} },
    handles => {
        cross_validate => 'execute',
    }
);
sub process {
    my $self = shift;
    my ($tree) = pos_validated_list([ shift ],
        { isa => Maybe[HashTree], coerce => 1 }
    );
    my %args = @_;
    my $result = Result->new(
        input => $tree,
        results => {
            map {
                my $process = $tree->{$_} || $args{initialize}->{$_};
                $_ => $self->child($_)->process($process)
            } $self->child_names
        }
    );
    # XXX Try::Tiny doesn't work here -- why? 
    eval {
        $self->cross_validate($result->clean);
    };
    if ($@) {
        $result->add_error($@);
    }
    return $result;
}
1;
__END__
=pod
=encoding utf-8
=head1 NAME
Data::TreeValidator::Branch - A branch of tree validation
=head1 DESCRIPTION
Represents a branch in the tree, ie something that has child nodes. Almost all
your validation specifications will have at least one tree (unless it really
only takes a single piece of input).
=head1 METHODS
=head2 children
Returns a list of all child nodes of this branch
=head2 child_names
Returns the names of all child nodes for this branch
=head2 add_child($name => $value)
Adds a child to the branch, with the name C<$name> and value C<$value>
=head2 child($name)
Returns the child with name C<$name>, or C<undef>
=head2 process($input)
Takes the input in C<$input> and validates it against this branch. The general
process here is to enumerate over each child of this branch, and fetch the
corresponding data from C<$input> and process that.
Returns a L<Data::TreeValidator:::Result::Branch>, which can be inspected to
determine if the branch validated, and for clean data.
=head1 AUTHOR
Oliver Charles
=head1 COPYRIGHT AND LICENSE
This software is copyright (c) 2011 by Oliver Charles <oliver.g.charles@googlemail.com>.
This is free software; you can redistribute it and/or modify it under
the same terms as the Perl 5 programming language system itself.
=cut