pub struct OrSet<T>{ /* private fields */ }Expand description
Observed-remove set. Each addition gets a unique tag; a removal retains all tags seen at that moment. Merge takes the union of (item, tag) pairs minus tombstones.
Implementations§
Source§impl<T: Eq + Hash + Clone> OrSet<T>
impl<T: Eq + Hash + Clone> OrSet<T>
pub fn new() -> Self
pub fn add(&mut self, item: T)
pub fn remove(&mut self, item: &T)
pub fn contains(&self, item: &T) -> bool
Sourcepub fn iter(&self) -> impl Iterator<Item = &T>
pub fn iter(&self) -> impl Iterator<Item = &T>
Iterate over the elements currently present in the set — elements with at least one add-tag that has not been observed-removed.
pub fn len(&self) -> usize
pub fn is_empty(&self) -> bool
Trait Implementations§
Source§impl<'de, T> Deserialize<'de> for OrSet<T>
impl<'de, T> Deserialize<'de> for OrSet<T>
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl<T> Freeze for OrSet<T>
impl<T> RefUnwindSafe for OrSet<T>where
T: RefUnwindSafe,
impl<T> Send for OrSet<T>where
T: Send,
impl<T> Sync for OrSet<T>where
T: Sync,
impl<T> Unpin for OrSet<T>where
T: Unpin,
impl<T> UnsafeUnpin for OrSet<T>
impl<T> UnwindSafe for OrSet<T>where
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more