Struct rpds::sequence::vector::Vector
[−]
[src]
pub struct Vector<T> { /* fields omitted */ }
A persistent vector with structural sharing. This data structure supports fast push_back()
, set()
,
drop_last()
, and get()
.
Complexity
Let n be the number of elements in the vector.
Temporal complexity
Operation | Best case | Average | Worst case |
---|---|---|---|
new() | Θ(1) | Θ(1) | Θ(1) |
set() | Θ(log(n)) | Θ(log(n)) | Θ(log(n)) |
push_back() | Θ(log(n)) | Θ(log(n)) | Θ(log(n)) |
drop_last() | Θ(log(n)) | Θ(log(n)) | Θ(log(n)) |
first() /last() /get() | Θ(log(n)) | Θ(log(n)) | Θ(log(n)) |
len() | Θ(1) | Θ(1) | Θ(1) |
clone() | Θ(1) | Θ(1) | Θ(1) |
iterator creation | Θ(1) | Θ(1) | Θ(1) |
iterator step | Θ(1) | Θ(1) | Θ(log(n)) |
iterator full | Θ(n) | Θ(n) | Θ(n) |
Proof sketch of the complexity of full iteration
- A tree of size n and degree d has height ⌈logd(n)⌉ - 1.
- A complete iteration is a depth-first search on the tree.
- A depth-first search has complexity Θ(|V| + |E|), where |V| is the number of nodes and |E| the number of edges.
- The number of nodes |V| for a complete tree of height h is the sum of powers of d, which is (dʰ - 1) / (d - 1). See Calculating sum of consecutive powers of a number.
- The number of edges is exactly |V| - 1.
By 2. and 3. we have that the complexity of a full iteration is
Θ(|V| + |E|)
= Θ((dʰ - 1) / (d - 1)) (by 4. and 5.)
= Θ(dʰ)
= Θ(n) (by 1.)
Implementation details
This vector is implemented as described in Understanding Persistent Vector Part 1 and Understanding Persistent Vector Part 2.
Methods
impl<T> Vector<T>
[src]
pub fn new() -> Vector<T>
[src]
pub fn new_with_bits(bits: u8) -> Vector<T>
[src]
pub fn first(&self) -> Option<&T>
[src]
pub fn last(&self) -> Option<&T>
[src]
pub fn get(&self, index: usize) -> Option<&T>
[src]
pub fn set(&self, index: usize, v: T) -> Option<Vector<T>>
[src]
pub fn push_back(&self, v: T) -> Vector<T>
[src]
pub fn drop_last(&self) -> Option<Vector<T>>
[src]
pub fn len(&self) -> usize
[src]
pub fn is_empty(&self) -> bool
[src]
pub fn iter(&self) -> Iter<T>
[src]
Trait Implementations
impl<T> Serialize for Vector<T> where
T: Serialize,
[src]
T: Serialize,
fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error>
[src]
Serialize this value into the given Serde serializer. Read more
impl<'de, T> Deserialize<'de> for Vector<T> where
T: Deserialize<'de>,
[src]
T: Deserialize<'de>,
fn deserialize<D: Deserializer<'de>>(
deserializer: D
) -> Result<Vector<T>, D::Error>
[src]
deserializer: D
) -> Result<Vector<T>, D::Error>
Deserialize this value from the given Serde deserializer. Read more
impl<T: Debug> Debug for Vector<T>
[src]
fn fmt(&self, __arg_0: &mut Formatter) -> Result
[src]
Formats the value using the given formatter. Read more
impl<T> Index<usize> for Vector<T>
[src]
type Output = T
The returned type after indexing.
fn index(&self, index: usize) -> &T
[src]
Performs the indexing (container[index]
) operation.
impl<T> Default for Vector<T>
[src]
impl<T: PartialEq> PartialEq for Vector<T>
[src]
fn eq(&self, other: &Vector<T>) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests for !=
.
impl<T: Eq> Eq for Vector<T>
[src]
impl<T: PartialOrd<T>> PartialOrd<Vector<T>> for Vector<T>
[src]
fn partial_cmp(&self, other: &Vector<T>) -> Option<Ordering>
[src]
This method returns an ordering between self
and other
values if one exists. Read more
fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests less than (for self
and other
) and is used by the <
operator. Read more
fn le(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
fn gt(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
fn ge(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests greater than or equal to (for self
and other
) and is used by the >=
operator. Read more
impl<T: Ord> Ord for Vector<T>
[src]
fn cmp(&self, other: &Vector<T>) -> Ordering
[src]
This method returns an Ordering
between self
and other
. Read more
fn max(self, other: Self) -> Self
1.21.0[src]
Compares and returns the maximum of two values. Read more
fn min(self, other: Self) -> Self
1.21.0[src]
Compares and returns the minimum of two values. Read more
impl<T: Hash> Hash for Vector<T>
[src]
fn hash<H: Hasher>(&self, state: &mut H)
[src]
Feeds this value into the given [Hasher
]. Read more
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
Feeds a slice of this type into the given [Hasher
]. Read more
impl<T> Clone for Vector<T>
[src]
fn clone(&self) -> Vector<T>
[src]
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl<T> Display for Vector<T> where
T: Display,
[src]
T: Display,
fn fmt(&self, fmt: &mut Formatter) -> Result
[src]
Formats the value using the given formatter. Read more
impl<'a, T> IntoIterator for &'a Vector<T>
[src]
type Item = &'a T
The type of the elements being iterated over.
type IntoIter = Iter<'a, T>
Which kind of iterator are we turning this into?
fn into_iter(self) -> Iter<'a, T>
[src]
Creates an iterator from a value. Read more
impl<T> FromIterator<T> for Vector<T>
[src]
fn from_iter<I: IntoIterator<Item = T>>(into_iter: I) -> Vector<T>
[src]
Creates a value from an iterator. Read more