dynamic-list 0.3.0

A powerful and efficient implementation of dynamic lists with versatile data structures, capable of storing any type!
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

use crate::array::Node;
use crate::{Empty, Length, NotEmpty};
use std::mem::size_of;

pub trait ArrayAppend {
    type Output<T>;
}
impl ArrayAppend for Empty {
    type Output<T> = Node<T>;
}
impl<V, N: ArrayAppend> ArrayAppend for Node<V, N> {
    type Output<T> = Node<V, N::Output<T>>;
}

pub trait MemorySize {
    const SIZE: usize = 0;
}
impl MemorySize for Empty {}
impl<V, N: MemorySize> MemorySize for Node<V, N> {
    const SIZE: usize = size_of::<V>() + N::SIZE;
}

pub trait RemoveFirst {
    type Element;
    type Rest;
}
impl RemoveFirst for Empty {
    type Element = Empty;
    type Rest = Empty;
}
impl<V, N> RemoveFirst for Node<V, N> {
    type Element = Node<V>;
    type Rest = N;
}

impl<V> NotEmpty for Node<V> {}
impl<V, N: NotEmpty> NotEmpty for Node<V, N> {}

impl<V, N: Length> Length for Node<V, N> {
    const SIZE: usize = 1 + N::SIZE;
}