pub struct ShardedKey<T> {
pub key: T,
pub highest_block_number: BlockNumber,
}Expand description
Sometimes data can be too big to be saved for a single key. This helps out by dividing the data into different shards. Example:
Address | 200 -> data is from block 0 to 200.
Address | 300 -> data is from block 201 to 300.
Fields§
§key: TThe key for this type.
highest_block_number: BlockNumberHighest block number to which value is related to.
Implementations§
Source§impl<T> ShardedKey<T>
impl<T> ShardedKey<T>
Trait Implementations§
Source§impl AsRef<ShardedKey<FixedBytes<32>>> for StorageShardedKey
impl AsRef<ShardedKey<FixedBytes<32>>> for StorageShardedKey
Source§fn as_ref(&self) -> &ShardedKey<B256>
fn as_ref(&self) -> &ShardedKey<B256>
Converts this type into a shared reference of the (usually inferred) input type.
Source§impl<T> AsRef<ShardedKey<T>> for ShardedKey<T>
impl<T> AsRef<ShardedKey<T>> for ShardedKey<T>
Source§impl<T: Clone> Clone for ShardedKey<T>
impl<T: Clone> Clone for ShardedKey<T>
Source§impl<T: Debug> Debug for ShardedKey<T>
impl<T: Debug> Debug for ShardedKey<T>
Source§impl Decode for ShardedKey<Address>
impl Decode for ShardedKey<Address>
Source§fn decode_owned(value: Vec<u8>) -> Result<Self, DatabaseError>
fn decode_owned(value: Vec<u8>) -> Result<Self, DatabaseError>
Decodes owned data coming from the database.
Source§impl<T: Default> Default for ShardedKey<T>
impl<T: Default> Default for ShardedKey<T>
Source§impl<'de, T> Deserialize<'de> for ShardedKey<T>where
T: Deserialize<'de>,
impl<'de, T> Deserialize<'de> for ShardedKey<T>where
T: Deserialize<'de>,
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl Encode for ShardedKey<Address>
impl Encode for ShardedKey<Address>
impl<T: Eq> Eq for ShardedKey<T>
Source§impl<T: Hash> Hash for ShardedKey<T>
impl<T: Hash> Hash for ShardedKey<T>
Source§impl<T: Ord> Ord for ShardedKey<T>
impl<T: Ord> Ord for ShardedKey<T>
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
1.21.0 (const: unstable) · Source§fn min(self, other: Self) -> Selfwhere
Self: Sized,
fn min(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the minimum of two values. Read more
Source§impl<T: PartialEq> PartialEq for ShardedKey<T>
impl<T: PartialEq> PartialEq for ShardedKey<T>
Source§impl<T: PartialOrd> PartialOrd for ShardedKey<T>
impl<T: PartialOrd> PartialOrd for ShardedKey<T>
Source§impl<T> Serialize for ShardedKey<T>where
T: Serialize,
impl<T> Serialize for ShardedKey<T>where
T: Serialize,
impl<T: PartialEq> StructuralPartialEq for ShardedKey<T>
Auto Trait Implementations§
impl<T> Freeze for ShardedKey<T>where
T: Freeze,
impl<T> RefUnwindSafe for ShardedKey<T>where
T: RefUnwindSafe,
impl<T> Send for ShardedKey<T>where
T: Send,
impl<T> Sync for ShardedKey<T>where
T: Sync,
impl<T> Unpin for ShardedKey<T>where
T: Unpin,
impl<T> UnsafeUnpin for ShardedKey<T>where
T: UnsafeUnpin,
impl<T> UnwindSafe for ShardedKey<T>where
T: 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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. 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 moreimpl<T> Key for T
impl<T> MaybeDebug for Twhere
T: Debug,
impl<T> MaybeSerde for Twhere
T: Serialize + for<'de> Deserialize<'de>,
§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> ⓘwhere
S: Into<Dispatch>,
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> ⓘwhere
S: Into<Dispatch>,
§fn with_current_subscriber(self) -> WithDispatch<Self> ⓘ
fn with_current_subscriber(self) -> WithDispatch<Self> ⓘ
Layout§
Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.