Expand description
Directory node (spec §4.2, bit-level/34-directory-node.md).
A directory node is a leaf of the deterministic Merkle B-tree that represents a directory’s entries. Per pivot D2, v0.1 defines a single layout: the leaf node (all entries in one node). Future revisions may introduce internal nodes to scale beyond the leaf ceiling.
Entries within a node MUST be lexicographic by name (§1.4). This makes range reads and diff walks deterministic.
Modules§
- entry_
type - POSIX-equivalent file-type tags used in directory entries.
Structs§
- DirEntry
- One directory entry: a name, an inode number, and a type tag.
- Directory
Node - A parsed directory node (leaf only in v0.1).
Constants§
- DIRECTORY_
NODE_ VERSION - Currently supported node version.
Functions§
- parse_
directory_ node - Parse one directory node from the cursor’s current position.