libostd/octa
Daniel Kolesa dc58d09388 make allocator based containers more predictable + simplified PointerRange 2015-06-17 00:15:44 +01:00
..
internal fix find() for const containers 2015-06-16 22:54:04 +01:00
algorithm.h push_front is only necessary on bidir ranges or better now 2015-06-14 04:53:38 +01:00
array.h more hashtable apis 2015-06-14 03:38:08 +01:00
atomic.h use new type aliases + refactoring + namespacing 2015-06-08 21:20:12 +01:00
functional.h string equality + tweaks 2015-06-14 02:36:20 +01:00
initializer_list.h actually get rid of the reach() stuff, introduce new Reverse and Movable range traits and rename range.reach() to range.reverse() 2015-06-10 00:57:46 +01:00
map.h Map::find, Set::find 2015-06-16 22:51:57 +01:00
memory.h follow allocator propagation rules 2015-06-16 19:57:08 +01:00
new.h use new type aliases + refactoring + namespacing 2015-06-08 21:20:12 +01:00
range.h make allocator based containers more predictable + simplified PointerRange 2015-06-17 00:15:44 +01:00
set.h Map::find, Set::find 2015-06-16 22:51:57 +01:00
stream.h add header file for stream (no implementation yet) 2015-05-12 21:27:46 +01:00
string.h make allocator based containers more predictable + simplified PointerRange 2015-06-17 00:15:44 +01:00
type_traits.h use new type aliases + refactoring + namespacing 2015-06-08 21:20:12 +01:00
types.h use new type aliases + refactoring + namespacing 2015-06-08 21:20:12 +01:00
utility.h string equality + tweaks 2015-06-14 02:36:20 +01:00
vector.h make allocator based containers more predictable + simplified PointerRange 2015-06-17 00:15:44 +01:00