Leonardo de Moura cc3767e6a5 refactor(library/init/data): avoid indirection at rbmap ... 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`.		2018-10-26 17:14:09 -07:00
..
array
char	chore(library/init): missing [inline] and remove unnecessary defs	2018-10-17 08:38:30 -07:00
fin
hashmap	fix(frontends/lean/elaborator): ensure_no_unassigned_metavars: only check mvars in parameter	2018-10-07 21:11:02 -07:00
int	feat(library/compiler/erase_irrelevant): eliminate cases_on for builtin types	2018-10-23 14:58:38 -07:00
list	chore(library/init): mark a few combinators with [specialize]	2018-10-15 13:47:26 -07:00
nat	chore(library/init/data/nat/basic): missing @[inline]	2018-10-03 17:24:53 -07:00
option	chore(library/vm,library/init/meta): remove vm_format, and some obsolete meta objects	2018-10-23 11:32:56 -07:00
ordering
rbmap	refactor(library/init/data): avoid indirection at rbmap	2018-10-26 17:14:09 -07:00
rbtree	refactor(library/init/data): avoid indirection at rbmap	2018-10-26 17:14:09 -07:00
string	chore(library/init/string): remove string.iterator_imp	2018-10-02 13:46:01 -07:00
basic.lean
default.lean
dlist.lean	feat(library/init/data/dlist): inlining dlist functions is counterproductive	2018-09-24 18:47:10 -07:00
hashable.lean
repr.lean	chore(library/init/data/repr): remove unnecessary definition	2018-10-17 12:32:38 -07:00
to_string.lean	chore(library/init/data/to_string): remove unnecessary definition	2018-10-16 16:18:07 -07:00
uint.lean	feat(library/init/data/uint): add uint8	2018-10-01 14:17:11 -07:00
usize.lean