Expand description
Cell tree implementation.
Structs§
- Thread-safe cell.
- Builder for constructing cells with densely packed data.
- Tightly packed info about a cell.
- Partially assembled cell.
- Builder for constructing cell references array.
- A read-only view for a subrange of a cell.
- Indices of the slice data and refs windows.
- Cell tree storage stats.
- An iterator through child nodes which produces cloned references.
- Helper struct to debug print the root cell.
- Helper struct to print only the root cell in the cell tree.
- Helper struct to print all cells in the cell tree.
- Type alias for a cell hash.
- de Brujn level presence bitset.
- de Brujn level presence bitset iterator.
- An iterator through child nodes.
- A size of a cell.
- Static cell which can be used to create cell references in const context.
- A helper to track the size of the unique data in multiple cell trees.
- Usage tree for a family of cells.
- Usage tree for a family of cells with subtrees.
- A wrapper type which implements a virtualized cell interface.
- A non-owning reference to a
Cell.
Enums§
- Well-formed cell type.
- Dictionary insertion mode.
- Rule for including cells in the usage tree.
Constants§
- Max cell data capacity in bits
- Maximum number of child cells
Statics§
- Hash of an empty (0 bits of data, no refs) ordinary cell.
Traits§
- Gas accounting and resolcing exotic cells.
- Cell implementation family.
- Represents the interface of a well-formed cell.
- Marker trait which allows casting lazy-loaded data.
- A type with a known size in bits and refs.
- A data structure that can be deserialized from cells.
- A data structure that can be serialized into cells.
Type Aliases§
- Inner representation of the cell.
- Owned cell slice parts alias.
- Dyn trait type alias.
Derive Macros§
- Implements
Loadfor the type. - Implements
Storefor the type.