feedc0de/boost_unordered
1
0
Fork 0
forked from boostorg/unordered
Code Pull Requests Activity
801 Commits 28 Branches 94 Tags
7d0c6d2425a4f9cc8a0be3bfd628aac96eecd0ba
Commit Graph
31 Commits
Author SHA1 Message Date
Daniel James ddab816ed7 Use BOOST_HAS_PRAGMA_ONCE. 
Remembering to first include config, so that it'll actually be defined.

[SVN r86726]
 2013-11-16 20:13:24 +00:00
Daniel James 6f3dee13a8 Extend the Visual C++ workaround to 3 parameters. 
To avoid collision with piecewise construction.

[SVN r86506]
 2013-10-28 20:32:52 +00:00
Daniel James 7f14796ba4 Try to work around Visual C++'s variadic overload bug. 
Possibly too late for the release.

[SVN r86482]
 2013-10-27 17:58:09 +00:00
Marshall Clow 85d2657ac1 Remove usage of deprecated macros 
[SVN r81449]
 2012-11-21 01:21:54 +00:00
Daniel James 8fb85cbb8d Unordered: Fix overload edge case for piecewise construction. 
[SVN r81393]
 2012-11-17 12:03:55 +00:00
Daniel James ef4d33ce89 Unordered: Remove the deprecated equality implementation. 
[SVN r81385]
 2012-11-17 10:30:19 +00:00
Daniel James 7eefe62efe Unordered: Remove deprecated variadic pair constructors. 
This was emulating them as specified in older standard drafts.

[SVN r81384]
 2012-11-17 10:28:35 +00:00
Daniel James d1a6e948e3 Unordered: bcp friendly macros. 
[SVN r81029]
 2012-10-21 00:17:40 +00:00
Marshall Clow 0fccd93e29 Switch from deprecated macros to new shiny ones; no functionality change 
[SVN r79396]
 2012-07-09 22:08:01 +00:00
Daniel James 39bafd7b10 Unordered: Reapply changes reverted in r78788. 
[SVN r79163]
 2012-06-28 20:58:56 +00:00
Daniel James 7158700502 Unordered: Revert unmerged changes in trunk. 
So that I can fix issues in the beta.


[SVN r78788]
 2012-06-01 11:03:22 +00:00
Daniel James 1eac47a275 Unordered: Use Boost.Move in a few more places. 
Should be better for compilers with variadic parameters, but no rvalue
references. If such a thing ever exists.

[SVN r78536]
 2012-05-21 22:15:33 +00:00
Daniel James 2e80a82554 Unordered: Fix undefined macro warnings. Refs #6522. 
Just removing the rv reference stuff in extract_keys. I don't it's
needed anyway.

[SVN r76891]
 2012-02-05 08:44:22 +00:00
Daniel James 2665090568 Unordered: Use Boost.Move for variadic forwarding. 
[SVN r76331]
 2012-01-06 08:36:43 +00:00
Daniel James 11c9955902 Unordered: Remove support for TR1 tuples. Refs #6111. 
[SVN r75432]
 2011-11-10 15:16:06 +00:00
Daniel James 597d93537d Unordered: More cleaning up. 
Fix deprecated construct_impl and explicit namespaces in a few places.

[SVN r74766]
 2011-10-06 21:06:35 +00:00
Daniel James 3a909c8747 Unordered: Better emplace_args implementation. 
And some misc. cleanup.

[SVN r74750]
 2011-10-06 08:03:25 +00:00
Daniel James a3ffd4a7c9 Unordered: Remove BOOST_DEDUCED_TYPENAME 
[SVN r74192]
 2011-09-02 08:28:19 +00:00
Daniel James 395c744d6f Unordered: More portability changes. 
[SVN r74122]
 2011-08-29 11:10:09 +00:00
Daniel James 155077cba0 Unordered: Support piecewise pair construction. 
Will need to deprecate the old variadic style pair construction, also
should look into extract_key, was written for compatibility with older
compilers that are no longer supported.

[SVN r74119]
 2011-08-29 09:40:41 +00:00
Daniel James 785a6def3b Unordered: Remove another use of BOOST_RV_REF for sun. 
[SVN r73972]
 2011-08-20 23:34:38 +00:00
Daniel James 2ecfa0e08c Unordered: Fix unnecessary_copy_tests failures. 
[SVN r73894]
 2011-08-18 19:29:02 +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 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 1f17294cd3 Use remove_const again. 
[SVN r57840]
 2009-11-21 20:37:50 +00:00
Daniel James df72c4886f Support incomplete template parameters to unordered containers. 
[SVN r57798]
 2009-11-20 08:03:26 +00:00
Daniel James 2b8680d2c4 Remove the optimization for std::pair with a key reference. It'll be too much hassle to get a very unusual use case to work on all compilers. 
[SVN r56461]
 2009-09-28 23:06:03 +00:00
Daniel James 31cd8f4e16 Try supporting reference parameters in pairs. Probably not required. 
[SVN r56441]
 2009-09-27 19:12:04 +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
Daniel James 386d9f28d7 Initial checkin of new version of Boost.Unordered. 
- More template use, less preprocessor use.
 - Removed some of the Visual C++ 6 workarounds.
 - Reduced memory use of the main object.
 - Split into smaller headers.

[SVN r55878]
 2009-08-30 16:42:28 +00:00