jaggedarray 0.2.11

Multidimensional jagged array
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121

use std::ops::{Deref, DerefMut, Index, IndexMut, Range, RangeBounds, RangeFrom, RangeFull};

use tinyvec::{Array, ArrayVec};
pub trait VecLike:
    Deref<Target = [Self::TI]>
    + DerefMut
    + Index<usize, Output = Self::TI>
    + Index<RangeFull, Output = [Self::TI]>
    + Index<Range<usize>, Output = [Self::TI]>
    +Index<RangeFrom<usize>, Output = [Self::TI]>
    +IndexMut<RangeFrom<usize>, Output = [Self::TI]>
    + IndexMut<usize>
    + IndexMut<RangeFull, Output = [Self::TI]>
    + IndexMut<Range<usize>, Output = [Self::TI]>
    + IntoIterator<Item = Self::TI>
    + AsRef<[Self::TI]>
    + AsMut<[Self::TI]>
    + Default
    + FromIterator<Self::TI>
    + Extend<Self::TI>
{
    type TI;
    fn len(&self) -> usize;
    fn is_empty(&self) -> bool {
        self.len() == 0
    }
    fn reserve(&mut self, additional: usize);
    fn push(&mut self, item: Self::Item);
    fn pop(&mut self) -> Option<Self::Item>;
    fn remove(&mut self, index: usize) -> Self::Item;
    fn insert(&mut self, index: usize, item: Self::Item);
    fn clear(&mut self);
    fn truncate(&mut self, len: usize);
    fn remove_range<R>(&mut self, range: R)
    where
        R: RangeBounds<usize>;
}

impl<T> VecLike for Vec<T> {
    type TI = T;
    #[inline]
    fn len(&self) -> usize {
        Vec::len(self)
    }
    #[inline]
    fn push(&mut self, item: T) {
        Vec::push(self, item)
    }
    #[inline]
    fn pop(&mut self) -> Option<T> {
        Vec::pop(self)
    }
    #[inline]
    fn remove(&mut self, index: usize) -> T {
        Vec::remove(self, index)
    }
    #[inline]
    fn insert(&mut self, index: usize, item: T) {
        Vec::insert(self, index, item)
    }
    #[inline]
    fn clear(&mut self) {
        Vec::clear(self)
    }
    #[inline]
    fn reserve(&mut self, additional: usize) {
        Vec::reserve(self, additional)
    }
    #[inline]
    fn truncate(&mut self, len: usize) {
        Vec::truncate(self, len)
    }
    #[inline]
    fn remove_range<R>(&mut self, range: R)
    where
        R: RangeBounds<usize>,
    {
        Vec::drain(self, range).for_each(drop);
    }
}

impl<A: Array + Clone> VecLike for ArrayVec<A> {
    type TI = A::Item;
    #[inline]
    fn len(&self) -> usize {
        ArrayVec::len(self)
    }
    #[inline]
    fn push(&mut self, item: A::Item) {
        ArrayVec::push(self, item)
    }
    #[inline]
    fn pop(&mut self) -> Option<A::Item> {
        ArrayVec::pop(self)
    }
    #[inline]
    fn remove(&mut self, index: usize) -> A::Item {
        ArrayVec::remove(self, index)
    }
    #[inline]
    fn insert(&mut self, index: usize, item: A::Item) {
        ArrayVec::insert(self, index, item)
    }
    #[inline]
    fn clear(&mut self) {
        ArrayVec::clear(self)
    }
    #[inline]
    fn reserve(&mut self, _: usize) {}
    #[inline]
    fn truncate(&mut self, len: usize) {
        ArrayVec::truncate(self, len)
    }
    #[inline]
    fn remove_range<R>(&mut self, range: R)
    where
        R: RangeBounds<usize>,
    {
        ArrayVec::splice(self, range, std::iter::empty());
    }
}