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
|
package UR::BoolExpr::Template::PropertyComparison::In;
use strict;
use warnings;
use UR;
our $VERSION = "0.47"; # UR $VERSION;
UR::Object::Type->define(
class_name => __PACKAGE__,
is => ['UR::BoolExpr::Template::PropertyComparison'],
doc => "Returns true if any of the property's values appears in the comparison value list",
);
sub _compare {
my ($class,$comparison_values,@property_values) = @_;
if (@property_values == 1 and ref($property_values[0]) eq 'ARRAY') {
@property_values = @{$property_values[0]};
}
# undef should match missing values, which will be sorted at the end - the sorter in
# UR::BoolExpr::resolve() takes care of the sorting for us
if (! @property_values and !defined($comparison_values->[-1])) {
return 1;
}
my($pv_idx, $cv_idx);
no warnings;
my $sorter = sub { return $property_values[$pv_idx] cmp $comparison_values->[$cv_idx] };
use warnings;
# Binary search within @$comparison_values
for ( $pv_idx = 0; $pv_idx < @property_values; $pv_idx++ ) {
my $cv_min = 0;
my $cv_max = $#$comparison_values;
do {
$cv_idx = ($cv_min + $cv_max) >> 1;
my $result = &$sorter;
if (!$result) {
return 1;
} elsif ($result > 0) {
$cv_min = $cv_idx + 1;
} else {
$cv_max = $cv_idx - 1;
}
} until ($cv_min > $cv_max);
}
return '';
}
1;
=pod
=head1 NAME
UR::BoolExpr::Template::PropertyComparison::In - perform an In test
=head1 DESCRIPTION
Returns true if any of the property's values appears in the comparison value list.
Think of 'in' as short for 'intersect', and not just SQL's 'IN' operator.
=cut
|
