tsil_cev 0.2.0

LinkedList on Vec
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

# TsilCev


![Rust](https://github.com/mov-rax-rbx/TsilCev/workflows/Rust/badge.svg)
[![LICENSE](https://img.shields.io/github/license/mov-rax-rbx/TsilCev)](LICENSE)
[![Crates](https://img.shields.io/crates/v/tsil_cev)](https://crates.io/crates/tsil_cev)
[![Documentation](https://docs.rs/tsil_cev/badge.svg)](https://docs.rs/tsil_cev)

`LinkedList` on `Vec`. Add and remove O(1) amortized. It has a similar interface to `LinkedList` and similar to `Vec`.

## Example


```rust
use tsil_cev::TsilCev;

let mut tc = TsilCev::from(vec![5, 6, 7, 8, 9, 10]);
tc.push_front(4);

let mut cursor = tc.cursor_front_mut();
assert_eq!(cursor.current(), Some(&4));

cursor.move_next();
assert_eq!(cursor.current(), Some(&5));

cursor.remove();
assert_eq!(cursor.current(), Some(&6));

cursor.remove().remove().move_next_length(2);
assert_eq!(cursor.current(), Some(&10));

cursor.move_prev();
assert_eq!(cursor.current(), Some(&9));

let _ = tc.drain_filter_tsil(|x| *x % 2 == 0).collect::<Vec<_>>();
assert_eq!(tc.to_vec(), &[9]);
```

# Comparison with `LinkedList` *(thank [Criterion](https://github.com/bheisler/criterion.rs))*


![](img/iter.svg)
![](img/pop_front.svg)
![](img/remove.svg)
![](img/seq_bench.svg)

# Current Implementation


The allocator for the elements is `Vec` and each
element has two indexes (next and previous element).
Also if the number of elements is less than `capacity / 4`
then it is reallocated to size `capacity / 2`. The time
of addition and removal is amortized to `O(1)`.