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
use quote::quote_spanned;
use syn::parse_quote;
use super::{
OperatorCategory, OperatorConstraints, OperatorWriteOutput, WriteContextArgs,
RANGE_0, RANGE_1,
};
/// An operator representing a [lattice bimorphism](https://hydro.run/docs/hydroflow/lattices_crate/lattice_math#lattice-bimorphism).
///
/// > 2 input streams, of type `LhsItem` and `RhsItem`.
///
/// > Three argument, one `LatticeBimorphism` function `Func`, an `LhsState` singleton reference, and an `RhsState` singleton reference.
///
/// > 1 output stream of the output type of the `LatticeBimorphism` function.
///
/// The function must be a lattice bimorphism for both `(LhsState, RhsItem)` and `(RhsState, LhsItem)`.
///
/// ```hydroflow
/// use std::collections::HashSet;
/// use lattices::set_union::{CartesianProductBimorphism, SetUnionHashSet, SetUnionSingletonSet};
///
/// lhs = source_iter(0..3)
/// -> map(SetUnionSingletonSet::new_from)
/// -> state::<'static, SetUnionHashSet<u32>>();
/// rhs = source_iter(3..5)
/// -> map(SetUnionSingletonSet::new_from)
/// -> state::<'static, SetUnionHashSet<u32>>();
///
/// lhs -> [0]my_join;
/// rhs -> [1]my_join;
///
/// my_join = lattice_bimorphism(CartesianProductBimorphism::<HashSet<_>>::default(), #lhs, #rhs)
/// -> assert_eq([SetUnionHashSet::new(HashSet::from_iter([
/// (0, 3),
/// (0, 4),
/// (1, 3),
/// (1, 4),
/// (2, 3),
/// (2, 4),
/// ]))]);
/// ```
pub const LATTICE_BIMORPHISM: OperatorConstraints = OperatorConstraints {
name: "lattice_bimorphism",
categories: &[OperatorCategory::MultiIn],
hard_range_inn: &(2..=2),
soft_range_inn: &(2..=2),
hard_range_out: RANGE_1,
soft_range_out: RANGE_1,
num_args: 3,
persistence_args: RANGE_0,
type_args: RANGE_0,
is_external_input: false,
has_singleton_output: false,
ports_inn: Some(|| super::PortListSpec::Fixed(parse_quote! { 0, 1 })),
ports_out: None,
input_delaytype_fn: |_| None,
write_fn: |&WriteContextArgs {
root,
context,
op_span,
is_pull,
ident,
inputs,
arguments,
arguments_handles,
..
},
_| {
assert!(is_pull);
let func = &arguments[0];
let lhs_state_handle = &arguments_handles[1];
let rhs_state_handle = &arguments_handles[2];
let lhs_items = &inputs[0];
let rhs_items = &inputs[1];
let write_iterator = quote_spanned! {op_span=>
let #ident = {
#[inline(always)]
fn check_inputs<'a, Func, LhsIter, RhsIter, LhsState, RhsState, Output>(
mut func: Func,
mut lhs_iter: LhsIter,
mut rhs_iter: RhsIter,
lhs_state_handle: #root::scheduled::state::StateHandle<::std::cell::RefCell<LhsState>>,
rhs_state_handle: #root::scheduled::state::StateHandle<::std::cell::RefCell<RhsState>>,
context: &'a #root::scheduled::context::Context,
) -> Option<Output>
where
Func: 'a
+ #root::lattices::LatticeBimorphism<LhsState, RhsIter::Item, Output = Output>
+ #root::lattices::LatticeBimorphism<LhsIter::Item, RhsState, Output = Output>,
LhsIter: 'a + ::std::iter::Iterator,
RhsIter: 'a + ::std::iter::Iterator,
LhsState: 'static + ::std::clone::Clone,
RhsState: 'static + ::std::clone::Clone,
Output: #root::lattices::Merge<Output>,
{
let lhs_state = context.state_ref(lhs_state_handle);
let rhs_state = context.state_ref(rhs_state_handle);
let iter = ::std::iter::from_fn(move || {
// Use `from_fn` instead of `chain` to dodge multiple ownership of `func`.
if let Some(lhs_item) = lhs_iter.next() {
Some(func.call(lhs_item, (*rhs_state.borrow()).clone()))
} else {
let rhs_item = rhs_iter.next()?;
Some(func.call((*lhs_state.borrow()).clone(), rhs_item))
}
});
iter.reduce(|a, b| #root::lattices::Merge::merge_owned(a, b))
}
check_inputs(
#func,
#lhs_items,
#rhs_items,
#lhs_state_handle,
#rhs_state_handle,
&#context,
).into_iter()
};
};
Ok(OperatorWriteOutput {
write_iterator,
..Default::default()
})
},
};