timely 0.2.0

A low-latency data-parallel dataflow system in Rust
Documentation 
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

//! Traits and types for partially ordered sets.

/// A type that is partially ordered.
///
/// This trait is distinct from Rust's `PartialOrd` trait, because the implementation
/// of that trait precludes a distinct `Ord` implementation. We need an independent 
/// trait if we want to have a partially ordered type that can also be sorted.
pub trait PartialOrder : Eq {
    /// Returns true iff one element is strictly less than the other.
    fn less_than(&self, other: &Self) -> bool {
        self.less_equal(other) && self != other
    }
    /// Returns true iff one element is less than or equal to the other.
    fn less_equal(&self, other: &Self) -> bool;
}

impl PartialOrder for u8 { #[inline(always)] fn less_equal(&self, other: &Self) -> bool { *self <= *other } }
impl PartialOrder for u16 { #[inline(always)] fn less_equal(&self, other: &Self) -> bool { *self <= *other } }
impl PartialOrder for u32 { #[inline(always)] fn less_equal(&self, other: &Self) -> bool { *self <= *other } }
impl PartialOrder for u64 { #[inline(always)] fn less_equal(&self, other: &Self) -> bool { *self <= *other } }
impl PartialOrder for usize { #[inline(always)] fn less_equal(&self, other: &Self) -> bool { *self <= *other } }

impl PartialOrder for i8 { #[inline(always)] fn less_equal(&self, other: &Self) -> bool { *self <= *other } }
impl PartialOrder for i16 { #[inline(always)] fn less_equal(&self, other: &Self) -> bool { *self <= *other } }
impl PartialOrder for i32 { #[inline(always)] fn less_equal(&self, other: &Self) -> bool { *self <= *other } }
impl PartialOrder for i64 { #[inline(always)] fn less_equal(&self, other: &Self) -> bool { *self <= *other } }
impl PartialOrder for isize { #[inline(always)] fn less_equal(&self, other: &Self) -> bool { *self <= *other } }

impl PartialOrder for () { #[inline(always)] fn less_equal(&self, _other: &Self) -> bool { true } }