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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
use predicates::{
reflection::{Case, PredicateReflection},
Predicate,
};
use std::fmt;
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub struct And<T, U> {
first: T,
second: U,
}
impl<T: PredicateReflection, U: PredicateReflection> And<T, U> {
pub(crate) fn new(first: T, second: U) -> Self {
Self { first, second }
}
}
impl<T: fmt::Display, U: fmt::Display> fmt::Display for And<T, U> {
fn fmt(&self, formatter: &mut fmt::Formatter<'_>) -> fmt::Result {
write!(formatter, "({} && {})", self.first, self.second)
}
}
impl<T: PredicateReflection, U: PredicateReflection> PredicateReflection for And<T, U> {}
impl<T, U, Item: ?Sized> Predicate<Item> for And<T, U>
where
T: Predicate<Item>,
U: Predicate<Item>,
{
fn eval(&self, variable: &Item) -> bool {
self.first.eval(variable) && self.second.eval(variable)
}
fn find_case(&self, expected: bool, variable: &Item) -> Option<Case<'_>> {
if expected {
let first = self.first.find_case(expected, variable)?;
let second = self.second.find_case(expected, variable)?;
let case = Case::new(Some(self), expected)
.add_child(first)
.add_child(second);
Some(case)
} else {
if let Some(child) = self.first.find_case(expected, variable) {
Some(Case::new(Some(self), expected).add_child(child))
} else {
self.second
.find_case(expected, variable)
.map(|child| Case::new(Some(self), expected).add_child(child))
}
}
}
}
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub struct Or<T, U> {
first: T,
second: U,
}
impl<T: PredicateReflection, U: PredicateReflection> Or<T, U> {
pub(crate) fn new(first: T, second: U) -> Self {
Self { first, second }
}
}
impl<T: fmt::Display, U: fmt::Display> fmt::Display for Or<T, U> {
fn fmt(&self, formatter: &mut fmt::Formatter<'_>) -> fmt::Result {
write!(formatter, "({} || {})", self.first, self.second)
}
}
impl<T: PredicateReflection, U: PredicateReflection> PredicateReflection for Or<T, U> {}
impl<T, U, Item: ?Sized> Predicate<Item> for Or<T, U>
where
T: Predicate<Item>,
U: Predicate<Item>,
{
fn eval(&self, variable: &Item) -> bool {
self.first.eval(variable) || self.second.eval(variable)
}
fn find_case(&self, expected: bool, variable: &Item) -> Option<Case<'_>> {
if expected {
if let Some(child) = self.first.find_case(expected, variable) {
Some(Case::new(Some(self), expected).add_child(child))
} else {
self.second
.find_case(expected, variable)
.map(|child| Case::new(Some(self), expected).add_child(child))
}
} else {
let first = self.first.find_case(expected, variable)?;
let second = self.second.find_case(expected, variable)?;
let case = Case::new(Some(self), expected)
.add_child(first)
.add_child(second);
Some(case)
}
}
}
macro_rules! impl_bool_ops {
($name:ident <$($ty_var:ident),+>) => {
impl<Rhs, $($ty_var,)+> core::ops::BitAnd<Rhs> for $name<$($ty_var,)+>
where
Self: predicates::reflection::PredicateReflection,
Rhs: predicates::reflection::PredicateReflection,
{
type Output = $crate::predicates::And<Self, Rhs>;
fn bitand(self, rhs: Rhs) -> Self::Output {
$crate::predicates::And::new(self, rhs)
}
}
impl<Rhs, $($ty_var,)+> core::ops::BitOr<Rhs> for $name<$($ty_var,)+>
where
Self: predicates::reflection::PredicateReflection,
Rhs: predicates::reflection::PredicateReflection,
{
type Output = $crate::predicates::Or<Self, Rhs>;
fn bitor(self, rhs: Rhs) -> Self::Output {
$crate::predicates::Or::new(self, rhs)
}
}
};
}
impl_bool_ops!(And<T, U>);
impl_bool_ops!(Or<T, U>);