differential_dataflow/operators/
threshold.rs

1//! Reduce the collection to one occurrence of each distinct element.
2//!
3//! The `distinct_total` and `distinct_total_u` operators are optimizations of the more general
4//! `distinct` and `distinct_u` operators for the case in which time is totally ordered.
5
6use timely::order::TotalOrder;
7use timely::dataflow::*;
8use timely::dataflow::operators::Operator;
9use timely::dataflow::channels::pact::Pipeline;
10
11use crate::lattice::Lattice;
12use crate::{ExchangeData, Collection};
13use crate::difference::{Semigroup, Abelian};
14use crate::hashable::Hashable;
15use crate::collection::AsCollection;
16use crate::operators::arrange::{Arranged, ArrangeBySelf};
17use crate::trace::{BatchReader, Cursor, TraceReader};
18
19/// Extension trait for the `distinct` differential dataflow method.
20pub trait ThresholdTotal<G: Scope<Timestamp: TotalOrder+Lattice+Ord>, K: ExchangeData, R: ExchangeData+Semigroup> {
21    /// Reduces the collection to one occurrence of each distinct element.
22    fn threshold_semigroup<R2, F>(&self, thresh: F) -> Collection<G, K, R2>
23    where
24        R2: Semigroup+'static,
25        F: FnMut(&K,&R,Option<&R>)->Option<R2>+'static,
26        ;
27    /// Reduces the collection to one occurrence of each distinct element.
28    ///
29    /// # Examples
30    ///
31    /// ```
32    /// use differential_dataflow::input::Input;
33    /// use differential_dataflow::operators::ThresholdTotal;
34    ///
35    /// ::timely::example(|scope| {
36    ///     // report the number of occurrences of each key
37    ///     scope.new_collection_from(1 .. 10).1
38    ///          .map(|x| x / 3)
39    ///          .threshold_total(|_,c| c % 2);
40    /// });
41    /// ```
42    fn threshold_total<R2: Abelian+'static, F: FnMut(&K,&R)->R2+'static>(&self, mut thresh: F) -> Collection<G, K, R2> {
43        self.threshold_semigroup(move |key, new, old| {
44            let mut new = thresh(key, new);
45            if let Some(old) = old {
46                let mut add = thresh(key, old);
47                add.negate();
48                new.plus_equals(&add);
49            }
50            if !new.is_zero() { Some(new) } else { None }
51        })
52    }
53    /// Reduces the collection to one occurrence of each distinct element.
54    ///
55    /// This reduction only tests whether the weight associated with a record is non-zero, and otherwise
56    /// ignores its specific value. To take more general actions based on the accumulated weight, consider
57    /// the `threshold` method.
58    ///
59    /// # Examples
60    ///
61    /// ```
62    /// use differential_dataflow::input::Input;
63    /// use differential_dataflow::operators::ThresholdTotal;
64    ///
65    /// ::timely::example(|scope| {
66    ///     // report the number of occurrences of each key
67    ///     scope.new_collection_from(1 .. 10).1
68    ///          .map(|x| x / 3)
69    ///          .distinct_total();
70    /// });
71    /// ```
72    fn distinct_total(&self) -> Collection<G, K, isize> {
73        self.distinct_total_core()
74    }
75
76    /// Distinct for general integer differences.
77    ///
78    /// This method allows `distinct` to produce collections whose difference
79    /// type is something other than an `isize` integer, for example perhaps an
80    /// `i32`.
81    fn distinct_total_core<R2: Abelian+From<i8>+'static>(&self) -> Collection<G, K, R2> {
82        self.threshold_total(|_,_| R2::from(1i8))
83    }
84
85}
86
87impl<G: Scope, K: ExchangeData+Hashable, R: ExchangeData+Semigroup> ThresholdTotal<G, K, R> for Collection<G, K, R>
88where
89    G: Scope<Timestamp: TotalOrder+Lattice+Ord>,
90{
91    fn threshold_semigroup<R2, F>(&self, thresh: F) -> Collection<G, K, R2>
92    where
93        R2: Semigroup+'static,
94        F: FnMut(&K,&R,Option<&R>)->Option<R2>+'static,
95    {
96        self.arrange_by_self_named("Arrange: ThresholdTotal")
97            .threshold_semigroup(thresh)
98    }
99}
100
101impl<G, K, T1> ThresholdTotal<G, K, T1::Diff> for Arranged<G, T1>
102where
103    G: Scope<Timestamp=T1::Time>,
104    T1: for<'a> TraceReader<
105        Key<'a>=&'a K,
106        Val<'a>=&'a (),
107        Time: TotalOrder,
108        Diff : ExchangeData + Semigroup<T1::DiffGat<'a>>,
109    >+Clone+'static,
110    K: ExchangeData,
111{
112    fn threshold_semigroup<R2, F>(&self, mut thresh: F) -> Collection<G, K, R2>
113    where
114        R2: Semigroup+'static,
115        F: for<'a> FnMut(T1::Key<'a>,&T1::Diff,Option<&T1::Diff>)->Option<R2>+'static,
116    {
117
118        let mut trace = self.trace.clone();
119
120        self.stream.unary_frontier(Pipeline, "ThresholdTotal", move |_,_| {
121
122            // tracks the lower and upper limit of received batches.
123            let mut lower_limit = timely::progress::frontier::Antichain::from_elem(<G::Timestamp as timely::progress::Timestamp>::minimum());
124            let mut upper_limit = timely::progress::frontier::Antichain::from_elem(<G::Timestamp as timely::progress::Timestamp>::minimum());
125
126            move |input, output| {
127
128                let mut batch_cursors = Vec::new();
129                let mut batch_storage = Vec::new();
130
131                // Downgrde previous upper limit to be current lower limit.
132                lower_limit.clear();
133                lower_limit.extend(upper_limit.borrow().iter().cloned());
134
135                let mut cap = None;
136                input.for_each(|capability, batches| {
137                    if cap.is_none() {                          // NB: Assumes batches are in-order
138                        cap = Some(capability.retain());
139                    }
140                    for batch in batches.drain(..) {
141                        upper_limit.clone_from(batch.upper());  // NB: Assumes batches are in-order
142                        batch_cursors.push(batch.cursor());
143                        batch_storage.push(batch);
144                    }
145                });
146
147                if let Some(capability) = cap {
148
149                    let mut session = output.session(&capability);
150
151                    use crate::trace::cursor::CursorList;
152                    let mut batch_cursor = CursorList::new(batch_cursors, &batch_storage);
153                    let (mut trace_cursor, trace_storage) = trace.cursor_through(lower_limit.borrow()).unwrap();
154
155                    while let Some(key) = batch_cursor.get_key(&batch_storage) {
156                        let mut count: Option<T1::Diff> = None;
157
158                        // Compute the multiplicity of this key before the current batch.
159                        trace_cursor.seek_key(&trace_storage, key);
160                        if trace_cursor.get_key(&trace_storage) == Some(key) {
161                            trace_cursor.map_times(&trace_storage, |_, diff| {
162                                count.as_mut().map(|c| c.plus_equals(&diff));
163                                if count.is_none() { count = Some(T1::owned_diff(diff)); }
164                            });
165                        }
166
167                        // Apply `thresh` both before and after `diff` is applied to `count`.
168                        // If the result is non-zero, send it along.
169                        batch_cursor.map_times(&batch_storage, |time, diff| {
170
171                            let difference =
172                            match &count {
173                                Some(old) => {
174                                    let mut temp = old.clone();
175                                    temp.plus_equals(&diff);
176                                    thresh(key, &temp, Some(old))
177                                },
178                                None => { thresh(key, &T1::owned_diff(diff), None) },
179                            };
180
181                            // Either add or assign `diff` to `count`.
182                            if let Some(count) = &mut count {
183                                count.plus_equals(&diff);
184                            }
185                            else {
186                                count = Some(T1::owned_diff(diff));
187                            }
188
189                            if let Some(difference) = difference {
190                                if !difference.is_zero() {
191                                    session.give((key.clone(), T1::owned_time(time), difference));
192                                }
193                            }
194                        });
195
196                        batch_cursor.step_key(&batch_storage);
197                    }
198                }
199
200                // tidy up the shared input trace.
201                trace.advance_upper(&mut upper_limit);
202                trace.set_logical_compaction(upper_limit.borrow());
203                trace.set_physical_compaction(upper_limit.borrow());
204            }
205        })
206        .as_collection()
207    }
208}
differential_dataflow/operators/threshold.rs

differential_dataflow/operators/
threshold.rs
