Struct Hamt 

pub struct Hamt<'a, BS, V, K = BytesKey, H = Sha256> { /* private fields */ }

Implementation of the HAMT data structure for IPLD.

Examples

use ipld_hamt::Hamt;

let store = db::MemoryDB::default();

let mut map: Hamt<_, _, usize> = Hamt::new(&store);
map.set(1, "a".to_string()).unwrap();
assert_eq!(map.get(&1).unwrap(), Some(&"a".to_string()));
assert_eq!(map.delete(&1).unwrap(), Some((1, "a".to_string())));
assert_eq!(map.get::<_>(&1).unwrap(), None);
let cid = map.flush().unwrap();

Implementations

impl<'a, BS, V, K, H> Hamt<'a, BS, V, K, H>

where K: Hash + Eq + PartialOrd + Serialize + DeserializeOwned, V: Serialize + DeserializeOwned, BS: BlockStore, H: HashAlgorithm,

pub fn new(store: &'a BS) -> Self

pub fn new_with_bit_width(store: &'a BS, bit_width: u32) -> Self

Construct hamt with a bit width

pub fn load(cid: &Cid, store: &'a BS) -> Result<Self, Error>

Lazily instantiate a hamt from this root Cid.

pub fn load_with_bit_width( cid: &Cid, store: &'a BS, bit_width: u32, ) -> Result<Self, Error>

Lazily instantiate a hamt from this root Cid with a specified bit width.

pub fn set_root(&mut self, cid: &Cid) -> Result<(), Error>

Sets the root based on the Cid of the root node using the Hamt store

pub fn store(&self) -> &'a BS

Returns a reference to the underlying store of the Hamt.

pub fn set(&mut self, key: K, value: V) -> Result<Option<V>, Error>

where V: PartialEq,

Inserts a key-value pair into the HAMT.

If the HAMT did not have this key present, None is returned.

If the HAMT did have this key present, the value is updated, and the old value is returned. The key is not updated, though;

Examples

use ipld_hamt::Hamt;

let store = db::MemoryDB::default();

let mut map: Hamt<_, _, usize> = Hamt::new(&store);
map.set(37, "a".to_string()).unwrap();
assert_eq!(map.is_empty(), false);

map.set(37, "b".to_string()).unwrap();
map.set(37, "c".to_string()).unwrap();

pub fn set_if_absent(&mut self, key: K, value: V) -> Result<bool, Error>

where V: PartialEq,

Inserts a key-value pair into the HAMT only if that key does not already exist.

If the HAMT did not have this key present, true is returned and the key/value is added.

If the HAMT did have this key present, this function will return false

Examples

use ipld_hamt::Hamt;

let store = db::MemoryDB::default();

let mut map: Hamt<_, _, usize> = Hamt::new(&store);
let a = map.set_if_absent(37, "a".to_string()).unwrap();
assert_eq!(map.is_empty(), false);
assert_eq!(a, true);

let b = map.set_if_absent(37, "b".to_string()).unwrap();
assert_eq!(b, false);
assert_eq!(map.get(&37).unwrap(), Some(&"a".to_string()));

let c = map.set_if_absent(30, "c".to_string()).unwrap();
assert_eq!(c, true);

pub fn get<Q>(&self, k: &Q) -> Result<Option<&V>, Error>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized, V: DeserializeOwned,

Returns a reference to the value corresponding to the key.

The key may be any borrowed form of the map’s key type, but Hash and Eq on the borrowed form must match those for the key type.

Examples

use ipld_hamt::Hamt;

let store = db::MemoryDB::default();

let mut map: Hamt<_, _, usize> = Hamt::new(&store);
map.set(1, "a".to_string()).unwrap();
assert_eq!(map.get(&1).unwrap(), Some(&"a".to_string()));
assert_eq!(map.get(&2).unwrap(), None);

pub fn contains_key<Q>(&self, k: &Q) -> Result<bool, Error>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Returns true if a value exists for the given key in the HAMT.

The key may be any borrowed form of the map’s key type, but Hash and Eq on the borrowed form must match those for the key type.

Examples

use ipld_hamt::Hamt;

let store = db::MemoryDB::default();

let mut map: Hamt<_, _, usize> = Hamt::new(&store);
map.set(1, "a".to_string()).unwrap();
assert_eq!(map.contains_key(&1).unwrap(), true);
assert_eq!(map.contains_key(&2).unwrap(), false);

pub fn delete<Q>(&mut self, k: &Q) -> Result<Option<(K, V)>, Error>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Removes a key from the HAMT, returning the value at the key if the key was previously in the HAMT.

The key may be any borrowed form of the HAMT’s key type, but Hash and Eq on the borrowed form must match those for the key type.

Examples

use ipld_hamt::Hamt;

let store = db::MemoryDB::default();

let mut map: Hamt<_, _, usize> = Hamt::new(&store);
map.set(1, "a".to_string()).unwrap();
assert_eq!(map.delete(&1).unwrap(), Some((1, "a".to_string())));
assert_eq!(map.delete(&1).unwrap(), None);

pub fn flush(&mut self) -> Result<Cid, Error>

Flush root and return Cid for hamt

pub fn is_empty(&self) -> bool

Returns true if the HAMT has no entries

pub fn for_each<F>(&self, f: F) -> Result<(), Box<dyn StdError>>

where V: DeserializeOwned, F: FnMut(&K, &V) -> Result<(), Box<dyn StdError>>,

Iterates over each KV in the Hamt and runs a function on the values.

This function will constrain all values to be of the same type

Examples

use ipld_hamt::Hamt;

let store = db::MemoryDB::default();

let mut map: Hamt<_, _, usize> = Hamt::new(&store);
map.set(1, 1).unwrap();
map.set(4, 2).unwrap();

let mut total = 0;
map.for_each(|_, v: &u64| {
   total += v;
   Ok(())
}).unwrap();
assert_eq!(total, 3);

Trait Implementations

impl<'a, BS: Debug, V: Debug, K: Debug, H: Debug> Debug for Hamt<'a, BS, V, K, H>

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

Formats the value using the given formatter.

impl<'a, K: PartialEq, V: PartialEq, S: BlockStore, H: HashAlgorithm> PartialEq for Hamt<'a, S, V, K, H>

fn eq(&self, other: &Self) -> 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<BS, V, K, H> Serialize for Hamt<'_, BS, V, K, H>

where K: Serialize, V: Serialize, H: HashAlgorithm,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.