identified_vec 0.1.11

Like HashSet but retaining INSERTION order and without `Hash` requirement on the Element 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
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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140

//! A collection of unique identifiable elements which retains **insertion** order, inspired by [Pointfree's Swift Identified Collections](https://github.com/pointfreeco/swift-identified-collections).
//!
//! Similar to the standard `Vec`, the `IdentifiedVec` maintain their elements in a particular user-specified order. However, unlike `Vec`, the `IdentifiedVec` introduce the ability to uniquely identify elements, using a hash table to ensure that no two elements have the same identity, and to efficiently look up elements corresponding to specific identifiers.
//!
//! `IdentifiedVec` is a useful alternative to `Vec` when you need to be able to efficiently access unique elements by a stable identifier. It is also a useful alternative to `BTreeSet`, where the `Ord` trait requirement may be too strict, an a useful alternative to `HashSet` where `Hash` trait requirement may be too strict.
//!
//! You can create an identified vec with any element type that implements the `Identifiable` trait.
//!
//! # Example
//!
//! ```
//! extern crate identified_vec;
//! use identified_vec::identified_vec::*;
//! use identified_vec::identified_vec_of::*;
//! use std::cell::RefCell;
//!
//! #[derive(Eq, PartialEq, Clone, Debug)]
//! struct User {
//!     id: &'static str,
//!     name: RefCell<&'static str>,
//! }
//!
//! impl User {
//!     fn new(id: &'static str, name: &'static str) -> Self {
//!         Self {
//!             id,
//!             name: RefCell::new(name),
//!         }
//!     }
//!     fn name(&self) -> &'static str {
//!         *self.name.borrow()
//!     }
//! }
//!
//! impl Identifiable for User {
//!     type ID = &'static str;
//!     fn id(&self) -> Self::ID {
//!         self.id
//!     }
//! }
//!
//! let mut users = IdentifiedVecOf::<User>::from_iter([
//!     User::new("u_42", "Satoshi Nakamoto"),
//!     User::new("u_1337", "Leia Skywalker"),
//! ]);
//!
//! assert_eq!(
//!     users.get(&"u_42").map(|u| u.name()),
//!     Some("Satoshi Nakamoto")
//! );
//!
//! assert_eq!(
//!     users.get_at_index(1).map(|u| u.name()),
//!     Some("Leia Skywalker")
//! );
//!
//! users.append(User::new("u_237", "Alan Turing"));
//! assert_eq!(
//!     users.elements(),
//!     [
//!         User::new("u_42", "Satoshi Nakamoto"),
//!         User::new("u_1337", "Leia Skywalker"),
//!         User::new("u_237", "Alan Turing"),
//!     ]
//!     .iter()
//!     .collect::<Vec<&User>>()
//! );
//!
//! // Element with same ID is not appended:
//! users.append(User::new("u_42", "Tom Mervolo Dolder"));
//! assert_eq!(
//!     users.elements(),
//!     [
//!         User::new("u_42", "Satoshi Nakamoto"),
//!         User::new("u_1337", "Leia Skywalker"),
//!         User::new("u_237", "Alan Turing"),
//!     ]
//!     .iter()
//!     .collect::<Vec<&User>>()
//! );
//!
//! // Element with same ID replaces existing if an `update_*` method is used:
//! // e.g. `update_or_insert`:
//! users.update_or_insert(User::new("u_42", "Tom Mervolo Dolder"), 0);
//! assert_eq!(
//!     users.elements(),
//!     [
//!         User::new("u_42", "Tom Mervolo Dolder"),
//!         User::new("u_1337", "Leia Skywalker"),
//!         User::new("u_237", "Alan Turing"),
//!     ]
//!     .iter()
//!     .collect::<Vec<&User>>()
//! );
//!
//! // or `update_or_append`
//! users.update_or_append(User::new("u_237", "Marie Curie"));
//! assert_eq!(
//!     users.elements(),
//!     [
//!         User::new("u_42", "Tom Mervolo Dolder"),
//!         User::new("u_1337", "Leia Skywalker"),
//!         User::new("u_237", "Marie Curie"),
//!     ]
//!     .iter()
//!     .collect::<Vec<&User>>()
//! );
//! ```
//!
//! Or you can provide a closure that describes an element's identity:
//!
//! ```
//! extern crate identified_vec;
//! use identified_vec::identified_vec::*;
//! use identified_vec::identified_vec_of::*;
//! // closure which plucks out an ID from an element.
//! let numbers = IdentifiedVec::<u32, u32>::new_identifying_element(|e| *e);
//! ```

mod iterators;
mod vec;
mod vec_of;

pub mod identified_vec {
    //! A collection of unique identifiable elements which retains **insertion** order.
    pub use crate::iterators::*;
    pub use crate::vec::*;
}

pub mod identified_vec_of {
    //! The `Identifiable` trait allows you to use the
    //! `IdentifiedVecOf<User> instead of the more verbose
    //! `IdentifiedVec<SomeUserID, User>` but also allows you to
    //! skip the `id_of_element: fn(&Element) -> ID` closure when
    //! initializing a new identified vec.
    pub use crate::vec_of::*;
}

pub use crate::identified_vec::*;
pub use crate::identified_vec_of::*;