Struct ShardedKey

pub struct ShardedKey<T> {
    pub key: T,
    pub highest_block_number: u64,
}

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: T

The key for this type.

highest_block_number: u64

Highest block number to which value is related to.

Implementations

impl<T> ShardedKey<T>

pub const fn new(key: T, highest_block_number: u64) -> ShardedKey<T>

Creates a new ShardedKey<T>.

pub const fn last(key: T) -> ShardedKey<T>

Creates a new key with the highest block number set to maximum. This is useful when we want to search the last value for a given key.

Trait Implementations

impl AsRef<ShardedKey<FixedBytes<32>>> for StorageShardedKey

fn as_ref(&self) -> &ShardedKey<FixedBytes<32>>

Converts this type into a shared reference of the (usually inferred) input type.

impl<T> AsRef<ShardedKey<T>> for ShardedKey<T>

fn as_ref(&self) -> &ShardedKey<T>

Converts this type into a shared reference of the (usually inferred) input type.

impl<T> Clone for ShardedKey<T>

where T: Clone,

fn clone(&self) -> ShardedKey<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T> Debug for ShardedKey<T>

where T: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<T> Decode for ShardedKey<T>

where T: Decode,

fn decode(value: &[u8]) -> Result<ShardedKey<T>, DatabaseError>

Decodes data coming from the database.

fn decode_owned(value: Vec<u8>) -> Result<Self, DatabaseError>

Decodes owned data coming from the database.

impl<T> Default for ShardedKey<T>

where T: Default,

fn default() -> ShardedKey<T>

Returns the “default value” for a type.

impl<'de, T> Deserialize<'de> for ShardedKey<T>

where T: Deserialize<'de>,

fn deserialize<__D>( __deserializer: __D, ) -> Result<ShardedKey<T>, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> Encode for ShardedKey<T>

where T: Encode,

type Encoded = Vec<u8>

Encoded type.

fn encode(self) -> <ShardedKey<T> as Encode>::Encoded

Encodes data going into the database.

impl<T> Hash for ShardedKey<T>

where T: Hash,

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T> Ord for ShardedKey<T>

where T: Ord,

fn cmp(&self, other: &ShardedKey<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T> PartialEq for ShardedKey<T>

where T: PartialEq,

fn eq(&self, other: &ShardedKey<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T> PartialOrd for ShardedKey<T>

where T: PartialOrd,

fn partial_cmp(&self, other: &ShardedKey<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T> Serialize for ShardedKey<T>

where T: Serialize,

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T> Eq for ShardedKey<T>

where T: Eq,

impl<T> StructuralPartialEq for ShardedKey<T>

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.