mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-05-09 16:27:58 +00:00
Benjamin Kampmann
60e5011c72
* Adding first rough ouline of the repository structure * Remove old CI stuff * add title * formatting fixes * move node-exits job's script to scripts dir * Move docs into subdir * move to bin * move maintainence scripts, configs and helpers into its own dir * add .local to ignore * move core->client * start up 'test' area * move test client * move test runtime * make test move compile * Add dependencies rule enforcement. * Fix indexing. * Update docs to reflect latest changes * Moving /srml->/paint * update docs * move client/sr-* -> primitives/ * clean old readme * remove old broken code in rhd * update lock * Step 1. * starting to untangle client * Fix after merge. * start splitting out client interfaces * move children and blockchain interfaces * Move trie and state-machine to primitives. * Fix WASM builds. * fixing broken imports * more interface moves * move backend and light to interfaces * move CallExecutor * move cli off client * moving around more interfaces * re-add consensus crates into the mix * fix subkey path * relieve client from executor * starting to pull out client from grandpa * move is_decendent_of out of client * grandpa still depends on client directly * lemme tests pass * rename srml->paint * Make it compile. * rename interfaces->client-api * Move keyring to primitives. * fixup libp2p dep * fix broken use * allow dependency enforcement to fail * move fork-tree * Moving wasm-builder * make env * move build-script-utils * fixup broken crate depdencies and names * fix imports for authority discovery * fix typo * update cargo.lock * fixing imports * Fix paths and add missing crates * re-add missing crates
77 lines
2.4 KiB
Rust
77 lines
2.4 KiB
Rust
// Copyright 2019 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/>.
|
|
|
|
use std::collections::hash_map::{HashMap, Entry};
|
|
|
|
/// Offchain workers local storage.
|
|
pub trait OffchainStorage: Clone + Send + Sync {
|
|
/// Persist a value in storage under given key and prefix.
|
|
fn set(&mut self, prefix: &[u8], key: &[u8], value: &[u8]);
|
|
|
|
/// Retrieve a value from storage under given key and prefix.
|
|
fn get(&self, prefix: &[u8], key: &[u8]) -> Option<Vec<u8>>;
|
|
|
|
/// Replace the value in storage if given old_value matches the current one.
|
|
///
|
|
/// Returns `true` if the value has been set and false otherwise.
|
|
fn compare_and_set(
|
|
&mut self,
|
|
prefix: &[u8],
|
|
key: &[u8],
|
|
old_value: Option<&[u8]>,
|
|
new_value: &[u8],
|
|
) -> bool;
|
|
}
|
|
|
|
/// In-memory storage for offchain workers.
|
|
#[derive(Debug, Clone, Default)]
|
|
pub struct InMemOffchainStorage {
|
|
storage: HashMap<Vec<u8>, Vec<u8>>,
|
|
}
|
|
|
|
impl OffchainStorage for InMemOffchainStorage {
|
|
fn set(&mut self, prefix: &[u8], key: &[u8], value: &[u8]) {
|
|
let key = prefix.iter().chain(key).cloned().collect();
|
|
self.storage.insert(key, value.to_vec());
|
|
}
|
|
|
|
fn get(&self, prefix: &[u8], key: &[u8]) -> Option<Vec<u8>> {
|
|
let key: Vec<u8> = prefix.iter().chain(key).cloned().collect();
|
|
self.storage.get(&key).cloned()
|
|
}
|
|
|
|
fn compare_and_set(
|
|
&mut self,
|
|
prefix: &[u8],
|
|
key: &[u8],
|
|
old_value: Option<&[u8]>,
|
|
new_value: &[u8],
|
|
) -> bool {
|
|
let key = prefix.iter().chain(key).cloned().collect();
|
|
|
|
match self.storage.entry(key) {
|
|
Entry::Vacant(entry) => if old_value.is_none() {
|
|
entry.insert(new_value.to_vec());
|
|
true
|
|
} else { false },
|
|
Entry::Occupied(ref mut entry) if Some(entry.get().as_slice()) == old_value => {
|
|
entry.insert(new_value.to_vec());
|
|
true
|
|
},
|
|
_ => false,
|
|
}
|
|
}
|
|
} |