Start documenting BTreeMap's node interface#31441
Conversation
|
Thanks for the pull request, and welcome! The Rust team is excited to review your changes, and you should hear from @alexcrichton (or someone else) soon. If any changes to this PR are deemed necessary, please add them as extra commits. This ensures that the reviewer can see what has changed since they last reviewed the code. Due to the way GitHub handles out-of-date commits, this should also make it reasonably obvious what issues have or haven't been addressed. Large or tricky changes may require several passes of review and changes. Please see the contribution instructions for more information. |
|
r? @gankro |
|
💖 |
src/libcollections/btree/node.rs
Outdated
| // - Trees must have uniform depth/height. This means that every path down to a leaf from a | ||
| // given node has exactly the same length. | ||
| // - A node of length `n` has `n` keys, `n` values, and (in an internal node) `n + 1` edges. | ||
| // This implies that even an empty node has at least one edge. |
|
Done review |
|
Sorry for being slow about this - I've been busy with schoolwork. I think I dealt with all your comments. |
|
@bors r+ |
|
📌 Commit fa8556e has been approved by |
|
@bors rollup |
|
💔 Test failed - auto-win-gnu-32-opt-rustbuild |
|
@bors: retry On Sat, Apr 16, 2016 at 4:38 AM, bors notifications@github.com wrote:
|
Start documenting BTreeMap's node interface cc @gankro @apasel422
cc @gankro @apasel422