pub struct TreeNode {
pub children: FxHashMap<LocalBlockHash, NodeId>,
pub parent: Option<NodeId>,
pub key: Vec<LocalBlockHash>,
pub value: Vec<KvPageId>,
pub lock_ref: usize,
pub last_access_time: Instant,
}Expand description
A single node in the radix tree.
Fields§
§children: FxHashMap<LocalBlockHash, NodeId>Children keyed by the first complete page on the child edge.
parent: Option<NodeId>§key: Vec<LocalBlockHash>One content identity per complete page stored on this compressed edge.
The mocker intentionally uses the router’s 64-bit local block hash as page identity so completed radix state does not retain token IDs. Consequently, as in router-side indexing, hash collisions are treated as identical pages rather than guarded by an exact-token comparison.
value: Vec<KvPageId>One physical page ID per key. Length = key.len().
lock_ref: usizeWalk-to-root reference count (protected when > 0).
last_access_time: InstantMonotonic timestamp for LRU eviction.
Auto Trait Implementations§
impl Freeze for TreeNode
impl RefUnwindSafe for TreeNode
impl Send for TreeNode
impl Sync for TreeNode
impl Unpin for TreeNode
impl UnsafeUnpin for TreeNode
impl UnwindSafe for TreeNode
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more