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);
77 return all { $_->can_be_inlined } @{ $self->type_constraints };
86 join ' || ', map { '(' . $_->_inline_check($val) . ')' }
87 @{ $self->type_constraints }
92 sub inline_environment {
95 return { map { %{ $_->inline_environment } }
96 @{ $self->type_constraints } };
100 my ( $self, $type_or_name ) = @_;
102 my $other = Moose::Util::TypeConstraints::find_type_constraint($type_or_name);
104 return unless $other->isa(__PACKAGE__);
106 my @self_constraints = @{ $self->type_constraints };
107 my @other_constraints = @{ $other->type_constraints };
109 return unless @self_constraints == @other_constraints;
111 # FIXME presort type constraints for efficiency?
112 constraint: foreach my $constraint ( @self_constraints ) {
113 for ( my $i = 0; $i < @other_constraints; $i++ ) {
114 if ( $constraint->equals($other_constraints[$i]) ) {
115 splice @other_constraints, $i, 1;
121 return @other_constraints == 0;
126 $self->type_constraints;
130 my ($self, $value) = @_;
132 foreach my $type (@{$self->type_constraints}) {
133 my $err = $type->validate($value);
134 return unless defined $err;
135 $message .= ($message ? ' and ' : '') . $err
138 return ($message . ' in (' . $self->name . ')') ;
142 my ($self, $value) = @_;
144 return first { $_->check($value) } @{ $self->type_constraints };
148 my ($self, $type_name) = @_;
149 foreach my $type (@{$self->type_constraints}) {
150 return 1 if $type->is_a_type_of($type_name);
156 my ($self, $type_name) = @_;
157 foreach my $type (@{$self->type_constraints}) {
158 return 1 if $type->is_subtype_of($type_name);
163 sub create_child_type {
164 my ( $self, %opts ) = @_;
167 = Moose::Meta::TypeConstraint->new( %opts, parent => $self );
169 # if we have a type constraint union, and no
170 # type check, this means we are just aliasing
171 # the union constraint, which means we need to
172 # handle this differently.
174 if ( not( defined $opts{constraint} )
175 && $self->has_coercion ) {
176 $constraint->coercion(
177 Moose::Meta::TypeCoercion::Union->new(
178 type_constraint => $self,
188 # ABSTRACT: A union of Moose type constraints
196 This metaclass represents a union of type constraints. A union takes
197 multiple type constraints, and is true if any one of its member
202 C<Moose::Meta::TypeConstraint::Union> is a subclass of
203 L<Moose::Meta::TypeConstraint>.
207 =item B<< Moose::Meta::TypeConstraint::Union->new(%options) >>
209 This creates a new class type constraint based on the given
212 It takes the same options as its parent. It also requires an
213 additional option, C<type_constraints>. This is an array reference
214 containing the L<Moose::Meta::TypeConstraint> objects that are the
215 members of the union type. The C<name> option defaults to the names
216 all of these member types sorted and then joined by a pipe (|).
218 The constructor sets the implementation of the constraint so that is
219 simply calls C<check> on the newly created object.
221 Finally, the constructor also makes sure that the object's C<coercion>
222 attribute is a L<Moose::Meta::TypeCoercion::Union> object.
224 =item B<< $constraint->type_constraints >>
226 This returns the array reference of C<type_constraints> provided to
229 =item B<< $constraint->parents >>
231 This returns the same constraint as the C<type_constraints> method.
233 =item B<< $constraint->check($value) >>
235 =item B<< $constraint->validate($value) >>
237 These two methods simply call the relevant method on each of the
238 member type constraints in the union. If any type accepts the value,
241 With C<validate> the error message returned includes all of the error
242 messages returned by the member type constraints.
244 =item B<< $constraint->equals($type_name_or_object) >>
246 A type is considered equal if it is also a union type, and the two
247 unions have the same member types.
249 =item B<< $constraint->find_type_for($value) >>
251 This returns the first member type constraint for which C<check($value)> is
252 true, allowing you to determine which of the Union's member type constraints
253 a given value matches.
255 =item B<< $constraint->is_a_type_of($type_name_or_object) >>
257 This returns true if any of the member type constraints return true
258 for the C<is_a_type_of> method.
260 =item B<< $constraint->is_subtype_of >>
262 This returns true if any of the member type constraints return true
263 for the C<is_a_subtype_of> method.
265 =item B<< $constraint->create_child_type(%options) >>
267 This returns a new L<Moose::Meta::TypeConstraint> object with the type
274 See L<Moose/BUGS> for details on reporting bugs.