Function differential_dataflow::lattice::antichain_meet [−][src]
pub fn antichain_meet<T: Lattice + Clone>(
one: &[T],
other: &[T]
) -> Antichain<T>
Returns the “greatest” minimal antichain “less or equal” to both inputs.
This method is primarily meant for cases where one cannot use the methods
of Antichain
’s PartialOrder
implementation, such as when one has only
references rather than owned antichains.
Examples
let f1 = &[Product::new(3, 7), Product::new(5, 6)]; let f2 = &[Product::new(4, 6)]; let meet = antichain_meet(f1, f2); assert_eq!(&*meet.elements(), &[Product::new(3, 7), Product::new(4, 6)]);