Trait AttributeSet

Source

pub trait AttributeSet: Sized + Default {
    type Item: PartialEq + Copy + Attributes;

    const MAX_COUNT: usize;
    const NONE: Self;
Show 27 methods
    // Required methods
    fn insert(&mut self, item: Self::Item) -> bool;
    fn try_insert(&mut self, item: Self::Item) -> Result<(), InsertError>;
    fn insert_or_replace_last(&mut self, item: Self::Item) -> bool;
    fn remove(&mut self, item: &Self::Item) -> bool;
    fn take(&mut self, item: &Self::Item) -> Option<Self::Item>;
    fn replace(&mut self, item: &Self::Item, new_item: Self::Item) -> bool;
    fn clear(&mut self);
    fn iter_attributes(&self) -> impl Iterator<Item = ItemAttribute>;
    fn as_slice(&self) -> &[Option<Self::Item>];
    fn as_mut_slice(&mut self) -> &mut [Option<Self::Item>];

    // Provided methods
    fn get(&self, index: usize) -> Option<&Self::Item> { ... }
    fn len(&self) -> usize { ... }
    fn contains(&self, item: &Self::Item) -> bool { ... }
    fn is_empty(&self) -> bool { ... }
    fn is_full(&self) -> bool { ... }
    fn capacity(&self) -> usize { ... }
    fn first(&self) -> Option<&Self::Item> { ... }
    fn last(&self) -> Option<&Self::Item> { ... }
    fn difference(&self, other: &Self) -> Self { ... }
    fn intersection(&self, other: &Self) -> Self { ... }
    fn is_disjoint(&self, other: &Self) -> bool { ... }
    fn is_subset(&self, other: &Self) -> bool { ... }
    fn is_superset(&self, other: &Self) -> bool { ... }
    fn iter(&self) -> impl Iterator<Item = &Self::Item> { ... }
    fn iter_mut(&mut self) -> impl Iterator<Item = &mut Self::Item> { ... }
    fn retain<F>(&mut self, f: F)
       where F: FnMut(&Self::Item) -> bool { ... }
    fn extend<I: IntoIterator<Item = Self::Item>>(&mut self, iter: I) { ... }
}

Expand description

A fixed set of attributes.

Required Associated Constants§

Source

const MAX_COUNT: usize

Max number of items.

Source

const NONE: Self

An empty set.

Required Associated Types§

Source

type Item: PartialEq + Copy + Attributes

The item type.

Required Methods§

Source

fn insert(&mut self, item: Self::Item) -> bool

Adds an item to the first available slot. Returns false if the set is full or already contains the value.

Source

fn try_insert(&mut self, item: Self::Item) -> Result<(), InsertError>

Same as insert, but returns a std::result::Result with descriptive error to identify why the insert failed.

Source

fn insert_or_replace_last(&mut self, item: Self::Item) -> bool

Adds an item to the first available slot. Replaces the last item in the set if the set is full. Returns false if the set already contains the value.

Source