Now, the nodes in a `rbmap` contain the key and value, and we avoid one level of indirection. `rbmap`s are more common than `rbtree`. We implement `rbtree A` as `rbmap A unit`. |
||
|---|---|---|
| .. | ||
| basic.lean | ||
| default.lean | ||
Now, the nodes in a `rbmap` contain the key and value, and we avoid one level of indirection. `rbmap`s are more common than `rbtree`. We implement `rbtree A` as `rbmap A unit`. |
||
|---|---|---|
| .. | ||
| basic.lean | ||
| default.lean | ||