Lazily deserialized trie nodes have unreachable code paths; update to type-safe enum representation
Lazily deserialized trie nodes have unreachable code paths; update to type-safe enum representation: a task in LegoFlow-SWE (Harbor dataset). The current lazy deserialization type for trie nodes is built on a two-variant Either<Bytes, Trie<K, V pair, where the Left case always and only represents…
The task
The current lazy deserialization type for trie nodes is built on a two-variant `Either<Bytes, Trie<K, V>>` pair, where the `Left` case always and only represents a `Trie::Leaf` and the `Right` case represents every other variant. This convention is not enforced by the type system; consequently **unreachable match…
Part of Lego-X/LegoFlow-SWE.