feedc0de/boost_unordered
1
0
Fork 0
forked from boostorg/unordered
Code Pull Requests Activity
521 Commits 28 Branches 94 Tags
b0620a46ff986e78221a386504fe966e24f7d60b
Commit Graph

24 Commits

Author SHA1 Message Date
Daniel James
bd79d02049 Unordered: Remove unreachable code. 
[SVN r74218]
 2011-09-04 11:58:56 +00:00
Daniel James
965e25c989 Unordered: Try to fix issues with moving non-class types. 
[SVN r74193]
 2011-09-02 08:28:52 +00:00
Daniel James
a3ffd4a7c9 Unordered: Remove BOOST_DEDUCED_TYPENAME 
[SVN r74192]
 2011-09-02 08:28:19 +00:00
Daniel James
fd1aec2998 Unordered: Add option to use old equality implementation for backwards compatability. 
[SVN r74180]
 2011-08-31 22:23:01 +00:00
Daniel James
0e5930b8dc Unordred: Implement propagate_on_container_swap. 
[SVN r73680]
 2011-08-11 21:18:43 +00:00
Daniel James
eacca89d4e Unordered: Starting to implement allocator propagation. 
[SVN r73679]
 2011-08-11 21:18:19 +00:00
Daniel James
99e6bef4ef Unordered: Starting to support allocator_traits. 
[SVN r73678]
 2011-08-11 21:17:57 +00:00
Daniel James
f0517463a5 Unordered: Better std::forward/move configuration. 
[SVN r73592]
 2011-08-07 08:55:28 +00:00
Daniel James
20e923ba0d Unordered: Move the implementation into a namespace. 
Although it typically won't prevent ADL, because of boost::hash.

[SVN r72391]
 2011-06-04 16:17:07 +00:00
Daniel James
a40422fada Unordered: remove use of the 'or' keyword. 
[SVN r71602]
 2011-04-29 11:03:29 +00:00
Daniel James
b1912055a9 Unordered: Fix some errors in the equality tests. 
[SVN r71363]
 2011-04-17 21:27:38 +00:00
Daniel James
e8714d79b2 Unordered: Implement C++0x equality. 
[SVN r71354]
 2011-04-17 16:23:25 +00:00
Daniel James
140e8852e8 Unordered: fix some gcc issues. 
[SVN r71346]
 2011-04-17 00:31:35 +00:00
Daniel James
547e141166 Unordered: Overhaul the implementation. 
Store nodes in a single linked list, with hash values so that their
buckets can be found when needed. Iterators now only have to store a
pointer to the node and don't have to iterate over empty buckets to
reach the next node. This allows the container to meet the iterator
requirements - fixing the speed issues with `equal_range` and `erase`.

Also, define iterators in their own namespace, so that they don't
accidentally pull in detail functions via ADL.

I've simplified the code slightly by removing some of the special
cases for empty containers. Renamed a few things as well and other
minor changes that were made as I went along.

[SVN r71327]
 2011-04-16 18:47:33 +00:00
Daniel James
5edc45349f Revert changes for sun 5.9. 
Nobody seems to be running the tests now.


[SVN r62117]
 2010-05-21 07:06:33 +00:00
Daniel James
076e195cac Define several methods inline. 
Sun 5.9 was having some issues.

[SVN r61831]
 2010-05-06 20:13:25 +00:00
Daniel James
71a8e56ae3 Move equivalent and unique hash tables into their own headers. 
[SVN r61830]
 2010-05-06 20:12:40 +00:00
Daniel James
df72c4886f Support incomplete template parameters to unordered containers. 
[SVN r57798]
 2009-11-20 08:03:26 +00:00
Daniel James
26c72f9860 Use 'E' for key extractor, freeing 'K' for key. 
[SVN r57797]
 2009-11-20 08:02:48 +00:00
Daniel James
6bac25221a Fix unordered for intel strict. 
[SVN r57139]
 2009-10-24 17:53:03 +00:00
Daniel James
8d4b503e56 Use normal emplace implementation for emplace_hint and insert with hint. 
There's a bug in the emplace_hint implementation for unordered
containers with equivalent keys. Since my tests missed it, I'm just
going to use the normal emplace implementation until I write better
tests.

[SVN r57005]
 2009-10-19 19:24:33 +00:00
Daniel James
fe3d612fe0 Clean up some unordered TODOs. 
[SVN r56570]
 2009-10-04 10:37:36 +00:00
Daniel James
965c2ae89c Slightly more consistent variable names. In detail 'n' is now always a node pointer. 
[SVN r56346]
 2009-09-21 21:17:19 +00:00
Daniel James
78b078f41d Since all the compilers support out of line template members use them 
and lots of other things.

[SVN r56329]
 2009-09-20 21:55:15 +00:00