File Coverage

blib/lib/Type/Tiny/Intersection.pm

Criterion	Covered	Total	%
statement	99	101	99.0
branch	36	44	81.8
condition	8	10	80.0
subroutine	26	26	100.0
pod	12	12	100.0
total	181	193	94.3

package Type::Tiny::Intersection;

use 5.008001;
use strict;
use warnings;

BEGIN {
	$Type::Tiny::Intersection::AUTHORITY = 'cpan:TOBYINK';
	$Type::Tiny::Intersection::VERSION   = '2.003_000';
}

$Type::Tiny::Intersection::VERSION =~ tr/_//d;

use Scalar::Util qw< blessed >;
use Types::TypeTiny ();

sub _croak ($;@) { require Error::TypeTiny; goto \&Error::TypeTiny::croak }

use Type::Tiny ();
our @ISA = 'Type::Tiny';

__PACKAGE__->_install_overloads(
	q[@{}] => sub { $_[0]{type_constraints} ||= [] },
);

sub new_by_overload {
	my $proto = shift;
	my %opts  = ( @_ == 1 ) ? %{ $_[0] } : @_;

	my @types = @{ $opts{type_constraints} };
	if ( my @makers = map scalar( blessed($_) && $_->can( 'new_intersection' ) ), @types ) {
		my $first_maker = shift @makers;
		if ( ref $first_maker ) {
			my $all_same = not grep $_ ne $first_maker, @makers;
			if ( $all_same ) {
				return ref( $types[0] )->$first_maker( %opts );
			}
		}
	}

	return $proto->new( \%opts );
}

sub new {
	my $proto = shift;

	my %opts = ( @_ == 1 ) ? %{ $_[0] } : @_;
	_croak "Intersection type constraints cannot have a parent constraint"
		if exists $opts{parent};
	_croak
		"Intersection type constraints cannot have a constraint coderef passed to the constructor"
		if exists $opts{constraint};
	_croak
		"Intersection type constraints cannot have a inlining coderef passed to the constructor"
		if exists $opts{inlined};
	_croak "Need to supply list of type constraints"
		unless exists $opts{type_constraints};

	$opts{type_constraints} = [
		map { $_->isa( __PACKAGE__ ) ? @$_ : $_ }
			map Types::TypeTiny::to_TypeTiny( $_ ),
		@{
			ref $opts{type_constraints} eq "ARRAY"
			? $opts{type_constraints}
			: [ $opts{type_constraints} ]
		}
	];

	if ( Type::Tiny::_USE_XS ) {
		my @constraints = @{ $opts{type_constraints} };
		my @known       = map {
			my $known = Type::Tiny::XS::is_known( $_->compiled_check );
			defined( $known ) ? $known : ();
		} @constraints;

		if ( @known == @constraints ) {
			my $xsub = Type::Tiny::XS::get_coderef_for(
				sprintf "AllOf[%s]",
				join( ',', @known )
			);
			$opts{compiled_type_constraint} = $xsub if $xsub;
		}
	} #/ if ( Type::Tiny::_USE_XS)

	return $proto->SUPER::new( %opts );
} #/ sub new

sub _lockdown {
	my ( $self, $callback ) = @_;
	$callback->( $self->{type_constraints} );
}

sub type_constraints { $_[0]{type_constraints} }
sub constraint       { $_[0]{constraint} ||= $_[0]->_build_constraint }

sub _is_null_constraint { 0 }

sub _build_display_name {
	my $self = shift;
	join q[&], @$self;
}

sub _build_constraint {
	my @checks = map $_->compiled_check, @{ +shift };
	return sub {
		my $val = $_;
		$_->( $val ) || return for @checks;
		return !!1;
	}
}

sub can_be_inlined {
	my $self = shift;
	not grep !$_->can_be_inlined, @$self;
}

sub inline_check {
	my $self = shift;

	if ( Type::Tiny::_USE_XS and !exists $self->{xs_sub} ) {
		$self->{xs_sub} = undef;

		my @constraints = @{ $self->type_constraints };
		my @known       = map {
			my $known = Type::Tiny::XS::is_known( $_->compiled_check );
			defined( $known ) ? $known : ();
		} @constraints;

		if ( @known == @constraints ) {
			$self->{xs_sub} = Type::Tiny::XS::get_subname_for(
				sprintf "AllOf[%s]",
				join( ',', @known )
			);
		}
	} #/ if ( Type::Tiny::_USE_XS...)

	my $code = sprintf '(%s)', join " and ", map $_->inline_check( $_[0] ), @$self;

	return "do { $Type::Tiny::SafePackage $code }"
		if $Type::Tiny::AvoidCallbacks;
	return "$self->{xs_sub}\($_[0]\)"
		if $self->{xs_sub};
	return $code;
} #/ sub inline_check

sub has_parent {
	!!@{ $_[0]{type_constraints} };
}

sub parent {
	$_[0]{type_constraints}[0];
}

sub validate_explain {
	my $self = shift;
	my ( $value, $varname ) = @_;
	$varname = '$_' unless defined $varname;

	return undef if $self->check( $value );

	require Type::Utils;
	for my $type ( @$self ) {
		my $deep = $type->validate_explain( $value, $varname );
		return [
			sprintf(
				'"%s" requires that the value pass %s',
				$self,
				Type::Utils::english_list( map qq["$_"], @$self ),
			),
			@$deep,
		] if $deep;
	} #/ for my $type ( @$self )

	# This should never happen...
	return;    # uncoverable statement
} #/ sub validate_explain

my $_delegate = sub {
	my ( $self, $method ) = ( shift, shift );
	my @types = @{ $self->type_constraints };
	my $found = 0;
	for my $i ( 0 .. $#types ) {
		my $type = $types[$i];
		if ( $type->can( $method ) ) {
			$types[$i] = $type->$method( @_ );
			++$found;
			last;
		}
	}
	_croak(
		'Could not apply method %s to any type within the intersection',
		$method
	) unless $found;
	ref( $self )->new( type_constraints => \@types );
};

sub stringifies_to {
	my $self = shift;
	$self->$_delegate( stringifies_to => @_ );
}

sub numifies_to {
	my $self = shift;
	$self->$_delegate( numifies_to => @_ );
}

sub with_attribute_values {
	my $self = shift;
	$self->$_delegate( with_attribute_values => @_ );
}

my $comparator;
$comparator = sub {
	my $A = shift->find_constraining_type;
	my $B = shift->find_constraining_type;

	if ( $A->isa( __PACKAGE__ ) ) {
		my @A_constraints = map $_->find_constraining_type, @{ $A->type_constraints };

		my @A_equal_to_B = grep $_->equals( $B ), @A_constraints;
		if ( @A_equal_to_B == @A_constraints ) {
			return Type::Tiny::CMP_EQUIVALENT();
		}

		my @A_subs_of_B = grep $_->is_a_type_of( $B ), @A_constraints;
		if ( @A_subs_of_B ) {
			return Type::Tiny::CMP_SUBTYPE();
		}
	} #/ if ( $A->isa( __PACKAGE__...))

	elsif ( $B->isa( __PACKAGE__ ) ) {
		my $r = $comparator->( $B, $A );
		return $r  if $r eq Type::Tiny::CMP_EQUIVALENT();
		return -$r if $r eq Type::Tiny::CMP_SUBTYPE();
	}

	return Type::Tiny::CMP_UNKNOWN();
};
push @Type::Tiny::CMP, $comparator;

1;

__END__

=pod

=encoding utf-8

=head1 NAME

Type::Tiny::Intersection - intersection type constraints

=head1 SYNOPSIS

Using via the C<< & >> operator overload:

  package Local::Stash {
    use Moo;
    use Types::Common qw( LowerCaseStr StrLength );

    has identifier => (
      is   => 'ro',
      isa  => (LowerCaseStr) & (StrLength[4, 8]),
    );
  }

  my $x = Local::Stash->new( data => {} );  # not ok
  my $y = Local::Stash->new( data => [] );  # not ok

Note that it is a good idea to enclose each type being intersected
in parentheses to avoid Perl thinking the C<< & >> is the sigil for
a coderef.

Using Type::Tiny::Intersection's object-oriented interface:

  package Local::Stash {
    use Moo;
    use Types::Common qw( LowerCaseStr StrLength );
    use Type::Tiny::Intersection;

    my $ShortLcStr = Type::Tiny::Intersection->new(
      name             => 'AnyData',
      type_constraints => [ LowerCaseStr, StrLength[4, 8] ],
    );

    has identifier => (
      is   => 'ro',
      isa  => $ShortLcStr,
    );
  }

Using Type::Utils's functional interface:

  package Local::Stash {
    use Moo;
    use Types::Common qw( LowerCaseStr StrLength );
    use Type::Utils;

    my $ShortLcStr = intersection ShortLcStr => [ LowerCaseStr, StrLength[4, 8] ];

    has identifier => (
      is   => 'ro',
      isa  => $ShortLcStr,
    );
  }

=head1 STATUS

This module is covered by the
L<Type-Tiny stability policy|Type::Tiny::Manual::Policies/"STABILITY">.

=head1 DESCRIPTION

Intersection type constraints.

Intersection type constraints are not often very useful. Consider the
intersection of B<HashRef> and B<ArrayRef>. A value will only pass if
it is both a hashref and an arrayref. Given that neither of those type
constraints accept C<undef> or overloaded objects, there is no possible
value that can pass both.

Which is not to say that intersections are never useful, but it happens
quite rarely.

This package inherits from L<Type::Tiny>; see that for most documentation.
Major differences are listed below:

=head2 Constructor

The C<new> constructor from L<Type::Tiny> still works, of course. But there
is also:

=over

=item C<< new_by_overload(%attributes) >>

Like the C<new> constructor, but will sometimes return another type
constraint which is not strictly an instance of L<Type::Tiny::Intersection>,
but still encapsulates the same meaning. This constructor is used by
Type::Tiny's overloading of the C<< & >> operator.

=back

=head2 Attributes

=over

=item C<type_constraints>

Arrayref of type constraints.

When passed to the constructor, if any of the type constraints in the
intersection is itself an intersection type constraint, this is "exploded"
into the new intersection.

=item C<constraint>

Unlike Type::Tiny, you I<cannot> pass a constraint coderef to the constructor.
Instead rely on the default.

=item C<inlined>

Unlike Type::Tiny, you I<cannot> pass an inlining coderef to the constructor.
Instead rely on the default.

=item C<parent>

Unlike Type::Tiny, you I<cannot> pass an inlining coderef to the constructor.
A parent will instead be automatically calculated.

(Technically any of the types in the intersection could be treated as a
parent type; we choose the first arbitrarily.)

=back

=head2 Methods

=over

=item C<< stringifies_to($constraint) >>

See L<Type::Tiny::ConstrainedObject>.

=item C<< numifies_to($constraint) >>

See L<Type::Tiny::ConstrainedObject>.

=item C<< with_attribute_values($attr1 => $constraint1, ...) >>

See L<Type::Tiny::ConstrainedObject>.

=back

=head2 Overloading

=over

=item *

Arrayrefification calls C<type_constraints>.

=back

=head1 BUGS

Please report any bugs to
L<https://github.com/tobyink/p5-type-tiny/issues>.

=head1 SEE ALSO

L<Type::Tiny::Manual>.

L<Type::Tiny>.

L<MooseX::Meta::TypeConstraint::Intersection>.

=head1 AUTHOR

Toby Inkster E<lt>[e-mail]<gt>.

=head1 COPYRIGHT AND LICENCE

This software is copyright (c) 2013-2014, 2017-2023 by Toby Inkster.

This is free software; you can redistribute it and/or modify it under
the same terms as the Perl 5 programming language system itself.

=head1 DISCLAIMER OF WARRANTIES

THIS PACKAGE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.