hibit_tree 0.1.0-beta.1

Hierarchical bitmap tree. Integer-key map that can intersect FAST.
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

use std::marker::PhantomData;
use crate::const_utils::{ConstBool, ConstFalse, ConstTrue};

/// Marker for container's item [Default] requirement.
#[derive(Default, Copy, Clone)] 
pub struct ReqDefault<B: ConstBool = ConstTrue>(B);

pub trait DefaultRequirement: Default + Copy + Clone {
    type Required: ConstBool;
}
impl<B: ConstBool> DefaultRequirement for ReqDefault<B>{
    type Required = B;
} 

/*pub trait IsReqDefault{}
impl IsReqDefault for ReqDefault<ConstTrue>{}*/

pub trait MakeDefault<T> {
    fn make_default() -> T;
}
pub struct MakeDefaultFor<T, R>(PhantomData<(T, R)>);
impl<T: Default> MakeDefault<T> for MakeDefaultFor<T, ReqDefault> {
    #[inline]
    fn make_default() -> T{
        T::default()
    }
}
impl<T> MakeDefault<T> for MakeDefaultFor<T, ReqDefault<ConstFalse>> {
    #[inline]
    fn make_default() -> T {
        unreachable!("T does not implement Default.")
    }
}