##// END OF EJS Templates
rust-nodemap: mutable NodeTree data structure...
rust-nodemap: mutable NodeTree data structure Thanks to the previously indexing abstraction, the only difference in the lookup algorithm is that we don't need the special case for an empty NodeTree any more. We've considered making the mutable root an `Option<Block>`, but that leads to unpleasant checks and `unwrap()` unless we abstract it as typestate patterns (`NodeTree<Immutable>` and `NodeTree<Mutated>`) which seem exaggerated in that case. The initial copy of the root block is a very minor performance penalty, given that it typically occurs just once per transaction. Differential Revision: https://phab.mercurial-scm.org/D7793

File last commit:

r40307:dbc28c91 default
r44646:a1933145 default
Show More
rustfmt.toml
3 lines | 66 B | text/plain | TOMLLexer
Georges Racinet
rust: pure Rust lazyancestors iterator...
r40307 max_width = 79
wrap_comments = true
error_on_line_overflow = true