-
When using these two algorithms, it is aimed at a wall. If there is only one layer in the wall that needs to use these two algorithms, how can I use it?
-
DDO FIP proposes,"Adds a sector→deal mapping in the built-in market actor"
map looks like
```
/// HAMT[Address]HAMT[SectorNumber]SectorDealIDs
pub provider_sectors: Cid,
```
add …
-
Background: https://github.com/ipfs/boxo/issues/387.
To differentiate between nodes of the HAMT directory and nodes that represent an entry in that directory (but that don't belong to it) the links…
-
Context: https://github.com/ipld/specs/pull/109#discussion_r271081859. I'm putting this here as I'm seeing optimization work on HAMTs and I don't want this to get lost (or us to waste a bunch of time …
-
Layering another generic API on top of FSet's is redundant, and the tweaks we make to FSet break it for other programs using FSet in the same Lisp image.
Potential alternatives:
- [cl-hamt](https…
-
In the [load](https://github.com/rvagg/js-ipld-hashmap/blob/e852cc90e0e446b88e7adfe9440237ed852c6fa1/ipld-hashmap.js#L438) function and in the [save](https://github.com/rvagg/js-ipld-hashmap/blob/e852…
-
https://github.com/ipld/go-ipld-adl-hamt/blob/b2c8ddbaab060c3deb13863eb9f37b9542992f64/node.go#L36-L38
-
Ideally, I would like to be able to do
```
x = Map({'a': 2, 'c': 1})
y = x.update({'b': 3: 'c': 2)
z = y - x # magic
z == Map({'b': 3, 'c': 2})
```
Is there any particularly efficient way t…
-
Could the binary structures serve as the basis for persistent data structures, implemented as [HAMT](https://en.wikipedia.org/wiki/Hash_array_mapped_trie)?
-
CHAMP (Compressed Hash-Array Mapped Prefix-tree) is an incremental improvement over HAMT that simplifies the code, decreases the memory footprint, and increases performance.
[Leveling up Clojure’s…