rome 0.1.3

An RDF library in pure 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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59

use std::cmp::Ordering;
use std::hash::{Hash, Hasher};
use std::mem;

/// Key that points to an item
pub struct UnsafeKey<T> {
    key: *const T,
}

impl<T> UnsafeKey<T> {
    pub fn new(item: &T) -> UnsafeKey<T> {
        UnsafeKey { key: item }
    }
    fn get(&self) -> &T {
        unsafe { &(*self.key) }
    }
    pub fn offset(&self, slice: &[T]) -> usize {
        let start: *const T = &slice[0];
        (self.key as usize - start as usize) / mem::size_of::<T>()
    }
}

impl<T> PartialEq for UnsafeKey<T>
where
    T: PartialEq,
{
    fn eq(&self, other: &UnsafeKey<T>) -> bool {
        self.get().eq(other.get())
    }
}
impl<T> PartialOrd for UnsafeKey<T>
where
    T: PartialOrd,
{
    fn partial_cmp(&self, other: &UnsafeKey<T>) -> Option<Ordering> {
        self.get().partial_cmp(other.get())
    }
}
impl<T> Eq for UnsafeKey<T>
where
    T: Eq,
{
}
impl<T> Ord for UnsafeKey<T>
where
    T: Ord,
{
    fn cmp(&self, other: &Self) -> Ordering {
        self.get().cmp(other.get())
    }
}
impl<T> Hash for UnsafeKey<T>
where
    T: Hash,
{
    fn hash<H: Hasher>(&self, state: &mut H) {
        self.get().hash(state);
    }
}