boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2026-04-28 18:02:21 +02:00
Code Issues Packages Projects Releases Wiki Activity

Merge in latest changes to Boost.Unordered. Some compiler workarounds and

Browse Source 
starting to clean up the tests a little.


[SVN r42724]
This commit is contained in:
Daniel James
2008-01-13 16:19:26 +00:00
parent be93c29493
commit 00c2c3bc4c
5 changed files with 317 additions and 307 deletions
Download Patch File Download Diff File Expand all files Collapse all files
include/boost/unordered/detail/hash_table_impl.hpp
+4 -4
View File
@@ -131,7 +131,7 @@ namespace boost {
void destroy(link_ptr ptr)
{
node_ptr n(node_alloc_.address(static_cast<node&>(*ptr)));
node_ptr n(node_alloc_.address(*static_cast<node*>(&*ptr)));
value_alloc_.destroy(value_alloc_.address(n->value_));
node_base_alloc_.destroy(node_base_alloc_.address(*n));
node_alloc_.deallocate(n, 1);
@@ -224,7 +224,7 @@ namespace boost {
#if BOOST_UNORDERED_EQUIVALENT_KEYS
static inline link_ptr& prev_in_group(link_ptr n) {
return static_cast<node&>(*n).group_prev_;
return static_cast<node*>(&*n)->group_prev_;
}
// pre: Must be pointing to the first node in a group.
@@ -242,13 +242,13 @@ namespace boost {
// pre: Must be pointing to a node
static inline node& get_node(link_ptr p) {
BOOST_ASSERT(p);
return static_cast<node&>(*p);
return *static_cast<node*>(&*p);
}
// pre: Must be pointing to a node
static inline reference get_value(link_ptr p) {
BOOST_ASSERT(p);
return static_cast<node&>(*p).value_;
return static_cast<node*>(&*p)->value_;
}
class iterator_base