pub struct SparseField<Field> {
pub field: Field,
}
Expand description
Stores values in the object pool, while keeping keys in the index
Fields§
§field: Field
Trait Implementations§
Source§impl<T> Collection for SparseField<List<T>>
impl<T> Collection for SparseField<List<T>>
Source§type Key = SizedPointer
type Key = SizedPointer
The key that the predicate will use to decide whether to pull
more data into memory.
Source§type Serialized = SizedPointer
type Serialized = SizedPointer
The serialized record format. This type will typically
implement
serde::Serialize
Source§type Item = T
type Item = T
This is equivalent to
Iterator::Item
, and should contain a
full record that can be inserted into the in-memory store.Source§fn key(from: &Self::Serialized) -> &Self::Key
fn key(from: &Self::Serialized) -> &Self::Key
Get the key based on the deserialized data. You want this to
be a reference that’s easy to derive from the serialized data.
Source§impl<T> Collection for SparseField<LinkedList<T>>
impl<T> Collection for SparseField<LinkedList<T>>
Source§type Depth = Incremental
type Depth = Incremental
Use this strategy to load the collection. Read more
Source§type Key = SizedPointer
type Key = SizedPointer
The key that the predicate will use to decide whether to pull
more data into memory.
Source§type Serialized = SizedPointer
type Serialized = SizedPointer
The serialized record format. This type will typically
implement
serde::Serialize
Source§type Item = T
type Item = T
This is equivalent to
Iterator::Item
, and should contain a
full record that can be inserted into the in-memory store.Source§fn key(from: &Self::Serialized) -> &Self::Key
fn key(from: &Self::Serialized) -> &Self::Key
Get the key based on the deserialized data. You want this to
be a reference that’s easy to derive from the serialized data.
Source§impl<K, V> Collection for SparseField<Map<K, V>>
impl<K, V> Collection for SparseField<Map<K, V>>
Source§type Key = K
type Key = K
The key that the predicate will use to decide whether to pull
more data into memory.
Source§type Serialized = (K, SizedPointer)
type Serialized = (K, SizedPointer)
The serialized record format. This type will typically
implement
serde::Serialize
Source§type Item = (K, V)
type Item = (K, V)
This is equivalent to
Iterator::Item
, and should contain a
full record that can be inserted into the in-memory store.Source§fn key(from: &Self::Serialized) -> &Self::Key
fn key(from: &Self::Serialized) -> &Self::Key
Get the key based on the deserialized data. You want this to
be a reference that’s easy to derive from the serialized data.
Source§impl<K, V> Collection for SparseField<VersionedMap<K, V>>
impl<K, V> Collection for SparseField<VersionedMap<K, V>>
Source§type Depth = Incremental
type Depth = Incremental
Use this strategy to load the collection. Read more
Source§type Key = K
type Key = K
The key that the predicate will use to decide whether to pull
more data into memory.
Source§type Serialized = (K, Option<SizedPointer>)
type Serialized = (K, Option<SizedPointer>)
The serialized record format. This type will typically
implement
serde::Serialize
Source§type Item = (K, Option<Arc<V>>)
type Item = (K, Option<Arc<V>>)
This is equivalent to
Iterator::Item
, and should contain a
full record that can be inserted into the in-memory store.Source§fn key(from: &Self::Serialized) -> &Self::Key
fn key(from: &Self::Serialized) -> &Self::Key
Get the key based on the deserialized data. You want this to
be a reference that’s easy to derive from the serialized data.
Source§impl<T> Store for SparseField<LinkedList<T>>where
T: Value,
impl<T> Store for SparseField<LinkedList<T>>where
T: Value,
Source§impl<K, V> Store for SparseField<Map<K, V>>
impl<K, V> Store for SparseField<Map<K, V>>
Source§impl<K, V> Store for SparseField<VersionedMap<K, V>>
impl<K, V> Store for SparseField<VersionedMap<K, V>>
Auto Trait Implementations§
impl<Field> Freeze for SparseField<Field>where
Field: Freeze,
impl<Field> RefUnwindSafe for SparseField<Field>where
Field: RefUnwindSafe,
impl<Field> Send for SparseField<Field>where
Field: Send,
impl<Field> Sync for SparseField<Field>where
Field: Sync,
impl<Field> Unpin for SparseField<Field>where
Field: Unpin,
impl<Field> UnwindSafe for SparseField<Field>where
Field: 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
Source§impl<T> Query for Twhere
T: Collection,
impl<T> Query for Twhere
T: Collection,
Source§type Key = <T as Collection>::Key
type Key = <T as Collection>::Key
The key that the predicate will use to decide whether to pull
more data into memory.