pub struct ObservableVector<T> { /* private fields */ }Expand description
An ordered list of elements that broadcasts any changes made to it.
Implementations§
Source§impl<T: Clone + 'static> ObservableVector<T>
impl<T: Clone + 'static> ObservableVector<T>
Sourcepub fn new() -> Self
pub fn new() -> Self
Create a new ObservableVector.
As of the time of writing, this is equivalent to
ObservableVector::with_capacity(16), but the internal buffer capacity
is subject to change in non-breaking releases.
See with_capacity for details about the buffer
capacity.
Sourcepub fn with_capacity(capacity: usize) -> Self
pub fn with_capacity(capacity: usize) -> Self
Create a new ObservableVector with the given capacity for the inner
buffer.
Up to capacity updates that have not been received by all of the
subscribers yet will be retained in the inner buffer. If an update
happens while the buffer is at capacity, the oldest update is discarded
from it and all subscribers that have not yet received it will instead
see VectorDiff::Reset as the next update.
§Panics
Panics if the capacity is 0, or overflows.
Sourcepub fn into_inner(self) -> Vector<T>
pub fn into_inner(self) -> Vector<T>
Turn the ObservableVector back into a regular Vector.
Sourcepub fn subscribe(&self) -> VectorSubscriber<T>
pub fn subscribe(&self) -> VectorSubscriber<T>
Obtain a new subscriber.
If you put the ObservableVector behind a lock, it is highly
recommended to make access of the elements and subscribing one
operation. Otherwise, the values could be altered in between the
reading of the values and subscribing to changes.
Sourcepub fn append(&mut self, values: Vector<T>)
pub fn append(&mut self, values: Vector<T>)
Append the given elements at the end of the Vector and notify
subscribers.
Sourcepub fn push_front(&mut self, value: T)
pub fn push_front(&mut self, value: T)
Add an element at the front of the list and notify subscribers.
Sourcepub fn push_back(&mut self, value: T)
pub fn push_back(&mut self, value: T)
Add an element at the back of the list and notify subscribers.
Sourcepub fn pop_front(&mut self) -> Option<T>
pub fn pop_front(&mut self) -> Option<T>
Remove the first element, notify subscribers and return the element.
If there are no elements, subscribers will not be notified and this
method will return None.
Sourcepub fn pop_back(&mut self) -> Option<T>
pub fn pop_back(&mut self) -> Option<T>
Remove the last element, notify subscribers and return the element.
If there are no elements, subscribers will not be notified and this
method will return None.
Sourcepub fn set(&mut self, index: usize, value: T) -> T
pub fn set(&mut self, index: usize, value: T) -> T
Replace the element at the given position, notify subscribers and return the previous element at that position.
§Panics
Panics if index >= len.
Sourcepub fn remove(&mut self, index: usize) -> T
pub fn remove(&mut self, index: usize) -> T
Remove the element at the given position, notify subscribers and return the element.
§Panics
Panics if index >= len.
Sourcepub fn truncate(&mut self, len: usize)
pub fn truncate(&mut self, len: usize)
Truncate the vector to len elements and notify subscribers.
Does nothing if len is greater or equal to the vector’s current
length.
Sourcepub fn entry(&mut self, index: usize) -> ObservableVectorEntry<'_, T>
pub fn entry(&mut self, index: usize) -> ObservableVectorEntry<'_, T>
Gets an entry for the given index, through which only the element at that index alone can be updated or removed.
§Panics
Panics if index >= len.
Sourcepub fn for_each(&mut self, f: impl FnMut(ObservableVectorEntry<'_, T>))
pub fn for_each(&mut self, f: impl FnMut(ObservableVectorEntry<'_, T>))
Call the given closure for every element in this ObservableVector,
with an entry struct that allows updating or removing that element.
Iteration happens in order, i.e. starting at index 0.
Sourcepub fn entries(&mut self) -> ObservableVectorEntries<'_, T>
pub fn entries(&mut self) -> ObservableVectorEntries<'_, T>
Get an iterator over all the entries in this ObservableVector.
This is a more flexible, but less convenient alternative to
for_each. If you don’t need to use special control
flow like .await or break when iterating, it’s recommended to use
that method instead.
Because std’s Iterator trait does not allow iterator items to borrow
from the iterator itself, the returned typed does not implement the
Iterator trait and can thus not be used with a for loop. Instead,
you have to call its .next() method directly, as in:
let mut entries = ob.entries();
while let Some(entry) = entries.next() {
// use entry
}Sourcepub fn transaction(&mut self) -> ObservableVectorTransaction<'_, T>
pub fn transaction(&mut self) -> ObservableVectorTransaction<'_, T>
Start a new transaction to make multiple updates as one unit.
See ObservableVectorTransactions documentation for more details.