struct IndexedOrderedEntityIds {
nodes: Vec<OrderedEntityIdNode>,
node_by_id: FxHashMap<i32, usize>,
first: Option<usize>,
last: Option<usize>,
free: Option<usize>,
}Expand description
Append-ordered IDs with indexed unlinking for large lifecycle lists.
Free nodes are reused, and geometric compaction keeps removals amortized constant-time.
Fields§
§nodes: Vec<OrderedEntityIdNode>§node_by_id: FxHashMap<i32, usize>§first: Option<usize>§last: Option<usize>§free: Option<usize>Implementations§
Trait Implementations§
Auto Trait Implementations§
impl Freeze for IndexedOrderedEntityIds
impl RefUnwindSafe for IndexedOrderedEntityIds
impl Send for IndexedOrderedEntityIds
impl Sync for IndexedOrderedEntityIds
impl Unpin for IndexedOrderedEntityIds
impl UnsafeUnpin for IndexedOrderedEntityIds
impl UnwindSafe for IndexedOrderedEntityIds
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
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreWraps this value in an
Arc<SyncMutex<>>