Struct Sequence 

pub struct Sequence<R, P: ?Sized> {
    pub index: R,
    pub pools: P,
}

A Pool that iterates over it’s elements and tries to put a given OpaqueScalar into one of it’s sub-pools. May fail if it can’t put an element into any of it’s pools

i.e.

let sequence = Sequence {
    index: Cell::new(0),
    pools: [Cell::new(None), Cell::new(None), Cell::new(None), Cell::new(None)],
};
let sequence: &Sequence<Cell<usize>, [Cell<Option<OpaqueScalar<_>>>]> = &sequence;
let dynamic = ThreadLocal::with_pool(sequence);

Fields

index: R

The index must be either Cell<usize> or AtomicUsize

pools: P

The pools must have the type [P] where P is a pool

This type is generic, so that it’s possible to create it with safe code

Trait Implementations

impl<A: ScalarAllocator, R: Radium<Item = usize>, P: Pool<A>> Pool<A> for Sequence<R, [P]>

fn insert(&self, scalar: OpaqueScalar<A>) -> Option<OpaqueScalar<A>>

Put a new id into the pool

fn remove(&self) -> Option<OpaqueScalar<A>>

Take an id out of the pool

impl<A: ScalarAllocator, R: Radium<Item = usize>, P: PoolMut<A>> PoolMut<A> for Sequence<R, [P]>

fn insert_mut(&mut self, scalar: OpaqueScalar<A>) -> Option<OpaqueScalar<A>>

Put a new id into the pool

fn remove_mut(&mut self) -> Option<OpaqueScalar<A>>

Take an id out of the pool