kudzu 0.1.0

concurrent, grow-only data structures
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
30
31

use std::borrow::Borrow;
use std::cmp::Ordering;

// Same requirements as Ord, but the LHS and RHS can be separate types
pub trait AbstractOrd<Rhs> {
    fn cmp(&self, rhs: &Rhs) -> Ordering;
}

impl<T: Ord> AbstractOrd<T> for T {
    fn cmp(&self, rhs: &T) -> Ordering {
        Ord::cmp(self, rhs)
    }
}

#[repr(transparent)]
pub struct QWrapper<Q: ?Sized>(pub Q);

impl<Q: ?Sized> QWrapper<Q> {
    pub fn new(value: &Q) -> &QWrapper<Q> {
        unsafe { std::mem::transmute(value) }
    }
}

impl<T, Q> AbstractOrd<T> for QWrapper<Q> where
    T: Ord + Borrow<Q>,
    Q: Ord + ?Sized,
{
    fn cmp(&self, rhs: &T) -> Ordering {
        Ord::cmp(&self.0, rhs.borrow())
    }
}