Struct v9::id::IdList

pub struct IdList<M: TableMarker> {
    pub free: RunList<M>,
    // some fields omitted
}

Fields

free: RunList<M>

Methods

impl<M: TableMarker> IdList<M>

pub fn len(&self) -> usize

pub fn outer_capacity(&self) -> usize

pub unsafe fn set_outer_capacity(&mut self, outer_capacity: usize)

pub fn exists(&self, id: Id<M>) -> bool

pub fn flush(&mut self, universe: &Universe, tracked_events: u8)

pub fn write_deletions(&mut self)

Important traits for CheckedIter<'a, M>

impl<'a, M: TableMarker> Iterator for CheckedIter<'a, M> type Item = CheckedId<'a, M>;

pub fn iter(&self) -> CheckedIter<M>

Important traits for CheckedIter<'a, M>

impl<'a, M: TableMarker> Iterator for CheckedIter<'a, M> type Item = CheckedId<'a, M>;

pub fn range(&self, range: UncheckedIdRange<M>) -> CheckedIter<M>

pub fn delete(&mut self, id: Id<M>)

pub fn delete_extend(&mut self, i: impl Iterator<Item = Id<M>>)

pub fn delete_extend_ranges(
    &mut self,
    i: impl Iterator<Item = RangeInclusive<Id<M>>>
)

Important traits for ListRemoving<'a, M>

impl<'a, M: TableMarker> Iterator for ListRemoving<'a, M> type Item = RmId<'a, M>;

pub fn removing(&mut self) -> ListRemoving<'static, M>

pub unsafe fn recycle_id(&mut self) -> Result<Id<M>, Id<M>>

Creates a new Id, or returns a previously deleted Id. This function is unsafe because it does not push anything to the column's Vecs.

pub unsafe fn recycle_id_contiguous(
    &mut self,
    n: usize
) -> Result<UncheckedIdRange<M>, UncheckedIdRange<M>>

Note: This method is O(self.free.data.len())

pub fn next(&self) -> Id<M>

The next Id that will be used for the next call to push. Be aware that calling this multiple times will return the same ID.

pub fn check<'a, 'b>(&'a self, i: impl Check<M = M> + 'b) -> CheckedId<'a, M>

Trait Implementations

impl<'a, M: TableMarker> Extract for &'a mut IdList<M>

fn each_resource(f: &mut dyn FnMut(TypeId, Access))

List the type & access requirement needed to do the extraction. This function must have constant behavior; it is unsound otherwise.

type Owned = Self

unsafe fn extract(_universe: &Universe, rez: &mut Rez) -> Self::Owned

unsafe fn convert(_universe: &Universe, owned: *mut Self::Owned) -> Self

type Cleanup = IdListCleanup

Default is (), which does nothing.

impl<'a, M: TableMarker> ExtractOwned for &'a IdList<M>

type Ty = IdList<M>

const ACC: Access

unsafe fn extract(_universe: &Universe, rez: &mut Rez) -> Self

impl<'a, M: TableMarker> IntoIterator for &'a IdList<M>

type Item = CheckedId<'a, M>

The type of the elements being iterated over.

type IntoIter = CheckedIter<'a, M>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<M: Default + TableMarker> Default for IdList<M>

fn default() -> IdList<M>

Returns the "default value" for a type.

impl<M: Debug + TableMarker> Debug for IdList<M>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.