mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-05-10 06:27:57 +00:00
c7a14db792
* meaningfull -> meaningful * initialise -> initialize * tokans -> tokens * incentivise -> incentivize * lenght -> length * incentivisation -> incentivization * doesnt't -> doesn't * overwriten -> overwritten * lifecycle -> life cycle * lifecycle -> life cycle * usefull -> useful * noone -> no one * spaming -> spamming * defered -> deferred * hieght -> height * sumation -> summation * ingore -> ignore * registed -> registered * Auxialary -> Auxiliary * loggin -> logging * independance -> independence * trailling -> trailing * responsability -> responsibility * trunkated -> truncated * Weither -> Whether * informations -> information * Runtume -> Runtime * choosen -> chosen * delcataion -> declaration * Unchekced -> Unchecked * defintion -> definition * scrach -> scratch * imput -> input * transfered -> transferred * endownment -> endowment * Determinator -> Determiner * relevent -> relevant * emited -> emitted * acocunt -> account * proprotional -> proportional * instantiaion -> instantiation * commited -> committed * tombstonedead -> tombstone * uwnrap -> unwrap * acount -> account * specialised -> specialized * existant -> existent * requried -> required * Anull -> Annul * AUTHORITES -> AUTHORITIES * underyling -> underlying * recognisable -> recognizable * Capitalise -> Capitalize * reportfor -> report for * hearbeat -> heartbeat * onlineness -> being online * creater -> creator * Bytearray -> Byte array * Despoit -> Deposit * substratced -> subtracted * Curent -> Current * imbalanes -> imbalances * countfown -> countdown * inexisting -> inexistent * additionaly -> additionally * substracted -> subtracted * auxilary -> auxiliary * parital -> partial * in't -> isn't * compatability -> compatibility * infomation -> information * etected -> detected * extrinsiscs -> extrinsics * reprensentation -> representation * coonfiguration -> configuration * primtives -> primitives * miscelanious -> miscellaneous * VERISON -> VERSION * endcoded -> encoded * Genrates -> Generates * miliseconds -> milliseconds * occured -> occurred * trully -> truely * truely -> truly * conjuction -> conjunction * encouters -> encounters * customised -> customized * deterministicly -> deterministically * finalisation -> finalization * pluggable -> plugable * wakeup -> wake-up * interemdiate -> intermediate * intepreting -> interpreting * finalzied -> finalized * throgh -> through * extinsic -> extrinsic * convient -> convenient * allocater -> allocator * propagateable -> propagatable * succesfuly -> successfully * finalising -> finalizing * publically -> publicly * phrasee -> phrase * substration -> substractions * substractions -> subtractions * neccessarily -> necessarily * Inlucde -> Include * unefficient -> inefficient * thay -> they * funtion -> function * datastructures -> data structures * infromation -> information * propagatable -> propagable * ecountered -> encountered * recognise -> recognize * intergration -> integration * lastet -> latest * datatypes -> data types * datatype -> data type * Strongarming -> Strong Arming * avaible -> available * Commiting -> Committing * Retreiving -> Retrieving * shoud -> should * canonicaliziation -> canonicalization * comitted -> committed * clonable -> cloneable * Uknown -> Unknown * reponse -> response * arbitary -> arbitrary * Capapbilities -> Capabilities * responsbile -> responsible * initialisation -> initialization * cames -> came * intemediate -> intermediate * reqeust -> request * intance -> instance * explcitly -> explicitly * neighor -> neighbor * reolving -> resolving * untill -> until * Validte -> Validate * deserailize -> deserialize * literaly -> literally * preceeding -> preceding * abpve -> above * chcecked -> checked * numbet -> number * Unknow -> Unknown * halfs -> halves * gossup -> gossip * givent -> given * immediatelly -> immediately * slicable -> sliceable * conensus -> consensus * Mimicks -> Mimics * acccept -> accept * serialise -> serialize * exstrinsics -> extrinsics * panicks -> panics * maintaince -> maintenance * repeatidely -> repeatedly * anecstor -> ancestor * becasue -> because * processer -> processor * Prunning -> Pruning * insterested -> interested * unuseful -> not useful * yeided -> yielded * descendfing -> descending * corresponts -> corresponds * survivew -> survive * keps -> keeps * ligh -> light * prerequisities -> prerequisites * positiion -> position * depedency -> dependency * extrinisic -> extrinsic * atomicaly -> atomically * staticly -> statically * resul -> result * timestamb -> timestamp * Utilites -> Utilities * ammount -> amount * pocess -> process * exteral -> external * Update client/finality-grandpa/src/tests.rs * Update primitives/io/src/lib.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update primitives/blockchain/src/lib.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update frame/support/src/weights.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update bin/node/cli/tests/common.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update client/api/src/execution_extensions.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update client/cli/src/params.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update client/executor/common/src/sandbox.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update client/api/src/execution_extensions.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update client/finality-grandpa/src/communication/mod.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update client/state-db/src/pruning.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update frame/contracts/src/tests.rs Co-Authored-By: joe petrowski <25483142+joepetrowski@users.noreply.github.com> * Update client/api/src/execution_extensions.rs * bump impl * timestamb -> timestamp Co-authored-by: joe petrowski <25483142+joepetrowski@users.noreply.github.com>
121 lines
3.6 KiB
Rust
121 lines
3.6 KiB
Rust
// Copyright 2019-2020 Parity Technologies (UK) Ltd.
|
|
// This file is part of Substrate.
|
|
|
|
// Substrate is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
|
|
// Substrate is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with Substrate. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
//! Functionality for reading and storing children hashes from db.
|
|
|
|
use kvdb::{KeyValueDB, DBTransaction};
|
|
use codec::{Encode, Decode};
|
|
use sp_blockchain;
|
|
use std::hash::Hash;
|
|
|
|
/// Returns the hashes of the children blocks of the block with `parent_hash`.
|
|
pub fn read_children<
|
|
K: Eq + Hash + Clone + Encode + Decode,
|
|
V: Eq + Hash + Clone + Encode + Decode,
|
|
>(db: &dyn KeyValueDB, column: u32, prefix: &[u8], parent_hash: K) -> sp_blockchain::Result<Vec<V>> {
|
|
let mut buf = prefix.to_vec();
|
|
parent_hash.using_encoded(|s| buf.extend(s));
|
|
|
|
let raw_val_opt = match db.get(column, &buf[..]) {
|
|
Ok(raw_val_opt) => raw_val_opt,
|
|
Err(_) => return Err(sp_blockchain::Error::Backend("Error reading value from database".into())),
|
|
};
|
|
|
|
let raw_val = match raw_val_opt {
|
|
Some(val) => val,
|
|
None => return Ok(Vec::new()),
|
|
};
|
|
|
|
let children: Vec<V> = match Decode::decode(&mut &raw_val[..]) {
|
|
Ok(children) => children,
|
|
Err(_) => return Err(sp_blockchain::Error::Backend("Error decoding children".into())),
|
|
};
|
|
|
|
Ok(children)
|
|
}
|
|
|
|
/// Insert the key-value pair (`parent_hash`, `children_hashes`) in the transaction.
|
|
/// Any existing value is overwritten upon write.
|
|
pub fn write_children<
|
|
K: Eq + Hash + Clone + Encode + Decode,
|
|
V: Eq + Hash + Clone + Encode + Decode,
|
|
>(
|
|
tx: &mut DBTransaction,
|
|
column: u32,
|
|
prefix: &[u8],
|
|
parent_hash: K,
|
|
children_hashes: V,
|
|
) {
|
|
let mut key = prefix.to_vec();
|
|
parent_hash.using_encoded(|s| key.extend(s));
|
|
tx.put_vec(column, &key[..], children_hashes.encode());
|
|
}
|
|
|
|
/// Prepare transaction to remove the children of `parent_hash`.
|
|
pub fn remove_children<
|
|
K: Eq + Hash + Clone + Encode + Decode,
|
|
>(
|
|
tx: &mut DBTransaction,
|
|
column: u32,
|
|
prefix: &[u8],
|
|
parent_hash: K,
|
|
) {
|
|
let mut key = prefix.to_vec();
|
|
parent_hash.using_encoded(|s| key.extend(s));
|
|
tx.delete(column, &key[..]);
|
|
}
|
|
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use super::*;
|
|
|
|
#[test]
|
|
fn children_write_read_remove() {
|
|
const PREFIX: &[u8] = b"children";
|
|
let db = ::kvdb_memorydb::create(1);
|
|
|
|
let mut tx = DBTransaction::new();
|
|
|
|
let mut children1 = Vec::new();
|
|
children1.push(1_3);
|
|
children1.push(1_5);
|
|
write_children(&mut tx, 0, PREFIX, 1_1, children1);
|
|
|
|
let mut children2 = Vec::new();
|
|
children2.push(1_4);
|
|
children2.push(1_6);
|
|
write_children(&mut tx, 0, PREFIX, 1_2, children2);
|
|
|
|
db.write(tx.clone()).expect("(2) Committing transaction failed");
|
|
|
|
let r1: Vec<u32> = read_children(&db, 0, PREFIX, 1_1).expect("(1) Getting r1 failed");
|
|
let r2: Vec<u32> = read_children(&db, 0, PREFIX, 1_2).expect("(1) Getting r2 failed");
|
|
|
|
assert_eq!(r1, vec![1_3, 1_5]);
|
|
assert_eq!(r2, vec![1_4, 1_6]);
|
|
|
|
remove_children(&mut tx, 0, PREFIX, 1_2);
|
|
db.write(tx).expect("(2) Committing transaction failed");
|
|
|
|
let r1: Vec<u32> = read_children(&db, 0, PREFIX, 1_1).expect("(2) Getting r1 failed");
|
|
let r2: Vec<u32> = read_children(&db, 0, PREFIX, 1_2).expect("(2) Getting r2 failed");
|
|
|
|
assert_eq!(r1, vec![1_3, 1_5]);
|
|
assert_eq!(r2.len(), 0);
|
|
}
|
|
}
|