1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95
// Copyright 2019 Parity Technologies (UK) Ltd.
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentation files (the "Software"),
// to deal in the Software without restriction, including without limitation
// the rights to use, copy, modify, merge, publish, distribute, sublicense,
// and/or sell copies of the Software, and to permit persons to whom the
// Software is furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
// DEALINGS IN THE SOFTWARE.
mod memory;
pub use memory::{MemoryStore, MemoryStoreConfig};
use crate::K_VALUE;
use super::*;
use std::borrow::Cow;
/// The result of an operation on a `RecordStore`.
pub type Result<T> = std::result::Result<T, Error>;
/// The possible errors of a `RecordStore` operation.
#[derive(Debug)]
pub enum Error {
/// The store is at capacity w.r.t. the total number of stored records.
MaxRecords,
/// The store is at capacity w.r.t. the total number of stored keys for
/// provider records.
MaxProvidedKeys,
/// The value of a record to be stored is too large.
ValueTooLarge,
}
/// Trait for types implementing a record store.
///
/// There are two types of records managed by a `RecordStore`:
///
/// 1. Regular (value-)records. These records store an arbitrary value
/// associated with a key which is distributed to the closest nodes
/// to the key in the Kademlia DHT as per the standard Kademlia "push-model".
/// These records are subject to re-replication and re-publication as
/// per the standard Kademlia protocol.
///
/// 2. Provider records. These records associate the ID of a peer with a key
/// who can supposedly provide the associated value. These records are
/// mere "pointers" to the data which may be followed by contacting these
/// providers to obtain the value. These records are specific to the
/// libp2p Kademlia specification and realise a "pull-model" for distributed
/// content. Just like a regular record, a provider record is distributed
/// to the closest nodes to the key.
///
pub trait RecordStore<'a> {
type RecordsIter: Iterator<Item = Cow<'a, Record>>;
type ProvidedIter: Iterator<Item = Cow<'a, ProviderRecord>>;
/// Gets a record from the store, given its key.
fn get(&'a self, k: &Key) -> Option<Cow<'_, Record>>;
/// Puts a record into the store.
fn put(&'a mut self, r: Record) -> Result<()>;
/// Removes the record with the given key from the store.
fn remove(&'a mut self, k: &Key);
/// Gets an iterator over all (value-) records currently stored.
fn records(&'a self) -> Self::RecordsIter;
/// Adds a provider record to the store.
///
/// A record store only needs to store a number of provider records
/// for a key corresponding to the replication factor and should
/// store those records whose providers are closest to the key.
fn add_provider(&'a mut self, record: ProviderRecord) -> Result<()>;
/// Gets a copy of the stored provider records for the given key.
fn providers(&'a self, key: &Key) -> Vec<ProviderRecord>;
/// Gets an iterator over all stored provider records for which the
/// node owning the store is itself the provider.
fn provided(&'a self) -> Self::ProvidedIter;
/// Removes a provider record from the store.
fn remove_provider(&'a mut self, k: &Key, p: &PeerId);
}