differential_dogs3/
altneu.rs

Help
1//! A lexicographically ordered pair of timestamps.
2//!
3//! Two timestamps (s1, t1) and (s2, t2) are ordered either if
4//! s1 and s2 are ordered, or if s1 equals s2 and t1 and t2 are
5//! ordered.
6//!
7//! The join of two timestamps should have as its first coordinate
8//! the join of the first coordinates, and for its second coordinate
9//! the join of the second coordinates for elements whose first
10//! coordinate equals the computed join. That may be the minimum
11//! element of the second lattice, if neither first element equals
12//! the join.
13
14use serde::{Deserialize, Serialize};
15
16/// A pair of timestamps, partially ordered by the product order.
17#[derive(Debug, Hash, Default, Clone, Eq, PartialEq, Ord, PartialOrd, Serialize, Deserialize)]
18pub struct AltNeu<T> {
19    pub time: T,
20    pub neu: bool,  // alt < neu in timestamp comparisons.
21}
22
23impl<T> AltNeu<T> {
24    pub fn alt(time: T) -> Self { AltNeu { time, neu: false } }
25    pub fn neu(time: T) -> Self { AltNeu { time, neu: true } }
26}
27
28// Implement timely dataflow's `PartialOrder` trait.
29use timely::order::PartialOrder;
30impl<T: PartialOrder> PartialOrder for AltNeu<T> {
31    fn less_equal(&self, other: &Self) -> bool {
32        if self.time.eq(&other.time) {
33            self.neu <= other.neu
34        }
35        else {
36            self.time.less_equal(&other.time)
37        }
38    }
39}
40
41// Implement timely dataflow's `PathSummary` trait.
42// This is preparation for the `Timestamp` implementation below.
43use timely::progress::PathSummary;
44impl<T: Timestamp> PathSummary<AltNeu<T>> for () {
45    fn results_in(&self, timestamp: &AltNeu<T>) -> Option<AltNeu<T>> {
46        Some(timestamp.clone())
47    }
48    fn followed_by(&self, other: &Self) -> Option<Self> {
49        Some(other.clone())
50    }
51}
52
53// Implement timely dataflow's `Timestamp` trait.
54use timely::progress::Timestamp;
55impl<T: Timestamp> Timestamp for AltNeu<T> {
56    type Summary = ();
57    fn minimum() -> Self { AltNeu::alt(T::minimum()) }
58}
59
60use timely::progress::timestamp::Refines;
61
62impl<T: Timestamp> Refines<T> for AltNeu<T> {
63    fn to_inner(other: T) -> Self {
64        AltNeu::alt(other)
65    }
66    fn to_outer(self: AltNeu<T>) -> T {
67        self.time
68    }
69    fn summarize(_path: ()) -> <T as Timestamp>::Summary {
70        Default::default()
71    }
72}
73
74// Implement differential dataflow's `Lattice` trait.
75// This extends the `PartialOrder` implementation with additional structure.
76use differential_dataflow::lattice::Lattice;
77impl<T: Lattice> Lattice for AltNeu<T> {
78    fn join(&self, other: &Self) -> Self {
79        let time = self.time.join(&other.time);
80        let mut neu = false;
81        if time == self.time {
82            neu = neu || self.neu;
83        }
84        if time == other.time {
85            neu = neu || other.neu;
86        }
87        AltNeu { time, neu }
88    }
89    fn meet(&self, other: &Self) -> Self {
90        let time = self.time.meet(&other.time);
91        let mut neu = true;
92        if time == self.time {
93            neu = neu && self.neu;
94        }
95        if time == other.time {
96            neu = neu && other.neu;
97        }
98        AltNeu { time, neu }
99    }
100}
differential_dogs3/altneu.rs

differential_dogs3/
altneu.rs
