2 package Moose::Meta::TypeConstraint::Union;
8 use Moose::Meta::TypeCoercion::Union;
10 use List::MoreUtils qw(all);
11 use List::Util qw(first);
13 use base 'Moose::Meta::TypeConstraint';
15 __PACKAGE__->meta->add_attribute('type_constraints' => (
16 accessor => 'type_constraints',
21 my ($class, %options) = @_;
23 my $name = join '|' => sort { $a cmp $b }
24 map { $_->name } @{ $options{type_constraints} };
26 my $self = $class->SUPER::new(
31 $self->_set_constraint(sub { $self->check($_[0]) });
36 # XXX - this is a rather gross implementation of laziness for the benefit of
37 # MX::Types. If we try to call ->has_coercion on the objects during object
38 # construction, this does not work when defining a recursive constraint with
43 return $self->{coercion} if exists $self->{coercion};
45 # Using any instead of grep here causes a weird error with some corner
46 # cases when MX::Types is in use. See RT #61001.
47 if ( grep { $_->has_coercion } @{ $self->type_constraints } ) {
48 return $self->{coercion} = Moose::Meta::TypeCoercion::Union->new(
49 type_constraint => $self );
52 return $self->{coercion} = undef;
57 return defined $_[0]->coercion;
60 sub _actually_compile_type_constraint {
63 my @constraints = @{ $self->type_constraints };
67 foreach my $type (@constraints) {
68 return 1 if $type->check($value);
74 sub has_inlined_type_constraint {
77 return all { $_->has_inlined_type_constraint }
78 @{ $self->type_constraints };
86 join ' || ', map { '(' . $_->_inline_check($val) . ')' }
87 @{ $self->type_constraints };
91 my ( $self, $type_or_name ) = @_;
93 my $other = Moose::Util::TypeConstraints::find_type_constraint($type_or_name);
95 return unless $other->isa(__PACKAGE__);
97 my @self_constraints = @{ $self->type_constraints };
98 my @other_constraints = @{ $other->type_constraints };
100 return unless @self_constraints == @other_constraints;
102 # FIXME presort type constraints for efficiency?
103 constraint: foreach my $constraint ( @self_constraints ) {
104 for ( my $i = 0; $i < @other_constraints; $i++ ) {
105 if ( $constraint->equals($other_constraints[$i]) ) {
106 splice @other_constraints, $i, 1;
112 return @other_constraints == 0;
117 $self->type_constraints;
121 my ($self, $value) = @_;
123 foreach my $type (@{$self->type_constraints}) {
124 my $err = $type->validate($value);
125 return unless defined $err;
126 $message .= ($message ? ' and ' : '') . $err
129 return ($message . ' in (' . $self->name . ')') ;
133 my ($self, $value) = @_;
135 return first { $_->check($value) } @{ $self->type_constraints };
139 my ($self, $type_name) = @_;
140 foreach my $type (@{$self->type_constraints}) {
141 return 1 if $type->is_a_type_of($type_name);
147 my ($self, $type_name) = @_;
148 foreach my $type (@{$self->type_constraints}) {
149 return 1 if $type->is_subtype_of($type_name);
154 sub create_child_type {
155 my ( $self, %opts ) = @_;
158 = Moose::Meta::TypeConstraint->new( %opts, parent => $self );
160 # if we have a type constraint union, and no
161 # type check, this means we are just aliasing
162 # the union constraint, which means we need to
163 # handle this differently.
165 if ( not( defined $opts{constraint} )
166 && $self->has_coercion ) {
167 $constraint->coercion(
168 Moose::Meta::TypeCoercion::Union->new(
169 type_constraint => $self,
179 # ABSTRACT: A union of Moose type constraints
187 This metaclass represents a union of type constraints. A union takes
188 multiple type constraints, and is true if any one of its member
193 C<Moose::Meta::TypeConstraint::Union> is a subclass of
194 L<Moose::Meta::TypeConstraint>.
198 =item B<< Moose::Meta::TypeConstraint::Union->new(%options) >>
200 This creates a new class type constraint based on the given
203 It takes the same options as its parent. It also requires an
204 additional option, C<type_constraints>. This is an array reference
205 containing the L<Moose::Meta::TypeConstraint> objects that are the
206 members of the union type. The C<name> option defaults to the names
207 all of these member types sorted and then joined by a pipe (|).
209 The constructor sets the implementation of the constraint so that is
210 simply calls C<check> on the newly created object.
212 Finally, the constructor also makes sure that the object's C<coercion>
213 attribute is a L<Moose::Meta::TypeCoercion::Union> object.
215 =item B<< $constraint->type_constraints >>
217 This returns the array reference of C<type_constraints> provided to
220 =item B<< $constraint->parents >>
222 This returns the same constraint as the C<type_constraints> method.
224 =item B<< $constraint->check($value) >>
226 =item B<< $constraint->validate($value) >>
228 These two methods simply call the relevant method on each of the
229 member type constraints in the union. If any type accepts the value,
232 With C<validate> the error message returned includes all of the error
233 messages returned by the member type constraints.
235 =item B<< $constraint->equals($type_name_or_object) >>
237 A type is considered equal if it is also a union type, and the two
238 unions have the same member types.
240 =item B<< $constraint->find_type_for($value) >>
242 This returns the first member type constraint for which C<check($value)> is
243 true, allowing you to determine which of the Union's member type constraints
244 a given value matches.
246 =item B<< $constraint->is_a_type_of($type_name_or_object) >>
248 This returns true if any of the member type constraints return true
249 for the C<is_a_type_of> method.
251 =item B<< $constraint->is_subtype_of >>
253 This returns true if any of the member type constraints return true
254 for the C<is_a_subtype_of> method.
256 =item B<< $constraint->create_child_type(%options) >>
258 This returns a new L<Moose::Meta::TypeConstraint> object with the type
265 See L<Moose/BUGS> for details on reporting bugs.