gcmodule 0.2.1

Cyclic garbage collection inspired by CPython's gc implementation.
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

//! Additional impls about `Cc<T>` to make it easier to use.

use crate::{Cc, Trace};
use std::cmp::Ordering;

impl<T: Default + Trace + 'static> Default for Cc<T> {
    #[inline]
    fn default() -> Cc<T> {
        Cc::new(Default::default())
    }
}

impl<T: PartialEq> PartialEq for Cc<T> {
    #[inline]
    fn eq(&self, other: &Cc<T>) -> bool {
        **self == **other
    }

    #[inline]
    fn ne(&self, other: &Cc<T>) -> bool {
        **self != **other
    }
}

impl<T: Eq> Eq for Cc<T> {}

impl<T: PartialOrd> PartialOrd for Cc<T> {
    #[inline]
    fn partial_cmp(&self, other: &Cc<T>) -> Option<Ordering> {
        (**self).partial_cmp(&**other)
    }

    #[inline]
    fn lt(&self, other: &Cc<T>) -> bool {
        **self < **other
    }

    #[inline]
    fn le(&self, other: &Cc<T>) -> bool {
        **self <= **other
    }

    #[inline]
    fn gt(&self, other: &Cc<T>) -> bool {
        **self > **other
    }

    #[inline]
    fn ge(&self, other: &Cc<T>) -> bool {
        **self >= **other
    }
}

impl<T: Ord> Ord for Cc<T> {
    #[inline]
    fn cmp(&self, other: &Cc<T>) -> Ordering {
        (**self).cmp(&**other)
    }
}