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
60
61
62
63
64

use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, LinkedList, VecDeque};

/// Basic trait for anything that could have a length.
/// Even if a lot of struct have a `len()` method in the standard library,
/// to my knowledge this function is not included into any standard trait.
pub trait Len {
    /// Returns the number of elements in the collection, also referred to
    /// as its length.
    fn len(&self) -> usize;
    /// Return `true` if the collection has no element.
    fn is_empty(&self) -> bool {
        self.len() == 0
    }
}

// TODO; generic macro for all std::collection
// Add bound to generic?
impl<T> Len for Vec<T> {
    fn len(&self) -> usize {
        self.len()
    }
}

impl<T> Len for VecDeque<T> {
    fn len(&self) -> usize {
        self.len()
    }
}

impl<K, V, H> Len for HashMap<K, V, H> {
    fn len(&self) -> usize {
        self.len()
    }
}

impl<K, V> Len for BTreeMap<K, V> {
    fn len(&self) -> usize {
        self.len()
    }
}

impl<T> Len for LinkedList<T> {
    fn len(&self) -> usize {
        self.len()
    }
}

impl<T> Len for BTreeSet<T> {
    fn len(&self) -> usize {
        self.len()
    }
}

impl<T, H> Len for HashSet<T, H> {
    fn len(&self) -> usize {
        self.len()
    }
}

impl<T> Len for BinaryHeap<T> {
    fn len(&self) -> usize {
        self.len()
    }
}