jleony/nanoreth
1
0
Fork 0
mirror of https://github.com/hl-archive-node/nanoreth.git synced 2025-12-06 10:59:55 +00:00
Code Issues Packages Projects Releases Wiki Activity

db-api: opt StorageShardedKey encode, decode (#12143)

Browse Source
This commit is contained in:
nk_ysg
2024-11-01 19:30:03 +08:00
committed by GitHub
parent c6b740801f
commit f52186cc4d
1 changed files with 9 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
crates/storage/db-api/src/models/storage_sharded_key.rs
View File

@ -12,6 +12,10 @@ use super::ShardedKey;
/// Number of indices in one shard.
pub const NUM_OF_INDICES_IN_SHARD: usize = 2_000;
/// The size of [`StorageShardedKey`] encode bytes.
/// The fields are: 20-byte address, 32-byte key, and 8-byte block number
const STORAGE_SHARD_KEY_BYTES_SIZE: usize = 20 + 32 + 8;
/// Sometimes data can be too big to be saved for a single key. This helps out by dividing the data
/// into different shards. Example:
///
@ -53,7 +57,8 @@ impl Encode for StorageShardedKey {
type Encoded = Vec<u8>;
fn encode(self) -> Self::Encoded {
let mut buf: Vec<u8> = Encode::encode(self.address).into();
let mut buf: Vec<u8> = Vec::with_capacity(STORAGE_SHARD_KEY_BYTES_SIZE);
buf.extend_from_slice(&Encode::encode(self.address));
buf.extend_from_slice(&Encode::encode(self.sharded_key.key));
buf.extend_from_slice(&self.sharded_key.highest_block_number.to_be_bytes());
buf
@ -62,6 +67,9 @@ impl Encode for StorageShardedKey {
impl Decode for StorageShardedKey {
fn decode(value: &[u8]) -> Result<Self, DatabaseError> {
if value.len() != STORAGE_SHARD_KEY_BYTES_SIZE {
return Err(DatabaseError::Decode)
}
let tx_num_index = value.len() - 8;
let highest_tx_number = u64::from_be_bytes(