--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ Source code repo: http://github.com/khizmax/libcds/
+ Download: http://sourceforge.net/projects/libcds/files/
+
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this
+ list of conditions and the following disclaimer.
+
+ * Redistributions in binary form must reproduce the above copyright notice,
+ this list of conditions and the following disclaimer in the documentation
+ and/or other materials provided with the distribution.
+
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+ OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#include "test_intrusive_tree_hp.h"
+
+#include <cds/intrusive/ellen_bintree_hp.h>
+
+namespace {
+ namespace ci = cds::intrusive;
+ typedef cds::gc::HP gc_type;
+
+ class IntrusiveEllenBinTree_HP : public cds_test::intrusive_tree_hp
+ {
+ protected:
+ typedef cds_test::intrusive_tree_hp base_class;
+
+ protected:
+ typedef base_class::key_type key_type;
+
+ typedef typename base_class::base_int_item< ci::ellen_bintree::node<gc_type>> base_item_type;
+ typedef ci::ellen_bintree::internal_node< key_type, base_item_type > internal_base_node;
+ typedef ci::ellen_bintree::update_desc< base_item_type, internal_base_node > update_base_desc;
+
+ typedef typename base_class::member_int_item< ci::ellen_bintree::node<gc_type>> member_item_type;
+ typedef ci::ellen_bintree::internal_node< key_type, member_item_type > internal_member_node;
+ typedef ci::ellen_bintree::update_desc< member_item_type, internal_member_node > update_member_desc;
+
+ void SetUp()
+ {
+ struct list_traits : public ci::ellen_bintree::traits
+ {
+ typedef ci::ellen_bintree::base_hook< ci::opt::gc<gc_type>> hook;
+ };
+ typedef ci::EllenBinTree< gc_type, key_type, base_item_type > set_type;
+
+ // +1 - for guarded_ptr
+ cds::gc::hp::GarbageCollector::Construct( set_type::c_nHazardPtrCount + 1, 1, 16 );
+ cds::threading::Manager::attachThread();
+ }
+
+ void TearDown()
+ {
+ cds::threading::Manager::detachThread();
+ cds::gc::hp::GarbageCollector::Destruct( true );
+ }
+
+ struct generic_traits: public ci::ellen_bintree::traits
+ {
+ typedef base_class::key_extractor key_extractor;
+ typedef mock_disposer disposer;
+ };
+ };
+
+
+ TEST_F( IntrusiveEllenBinTree_HP, base_cmp )
+ {
+ typedef ci::EllenBinTree< gc_type, key_type, base_item_type,
+ ci::ellen_bintree::make_traits<
+ ci::opt::type_traits< generic_traits >
+ ,ci::opt::hook< ci::ellen_bintree::base_hook< ci::opt::gc< gc_type >>>
+ ,ci::opt::compare< cmp<base_item_type>>
+ >::type
+ > tree_type;
+
+ tree_type t;
+ test( t );
+ }
+
+ TEST_F( IntrusiveEllenBinTree_HP, base_less )
+ {
+ typedef ci::EllenBinTree< gc_type, key_type, base_item_type,
+ ci::ellen_bintree::make_traits<
+ ci::opt::type_traits< generic_traits >
+ ,ci::opt::hook< ci::ellen_bintree::base_hook< ci::opt::gc< gc_type >>>
+ ,ci::opt::less< less<base_item_type>>
+ >::type
+ > tree_type;
+
+ tree_type t;
+ test( t );
+ }
+
+ TEST_F( IntrusiveEllenBinTree_HP, base_item_counter )
+ {
+ typedef ci::EllenBinTree< gc_type, key_type, base_item_type,
+ ci::ellen_bintree::make_traits<
+ ci::opt::type_traits< generic_traits >
+ ,ci::opt::hook< ci::ellen_bintree::base_hook< ci::opt::gc< gc_type >>>
+ ,ci::opt::compare< cmp<base_item_type>>
+ ,ci::opt::item_counter< simple_item_counter >
+ >::type
+ > tree_type;
+
+ tree_type t;
+ test( t );
+ }
+
+ TEST_F( IntrusiveEllenBinTree_HP, base_backoff )
+ {
+ struct tree_traits: public generic_traits
+ {
+ typedef ci::ellen_bintree::base_hook< ci::opt::gc< gc_type >> hook;
+ typedef cmp<base_item_type> compare;
+ typedef base_class::less<base_item_type> less;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::backoff::yield back_off;
+ };
+
+ typedef ci::EllenBinTree< gc_type, key_type, base_item_type, tree_traits > tree_type;
+
+ tree_type t;
+ test( t );
+ }
+
+ TEST_F( IntrusiveEllenBinTree_HP, base_seq_cst )
+ {
+ struct tree_traits: public generic_traits
+ {
+ typedef ci::ellen_bintree::base_hook< ci::opt::gc< gc_type >> hook;
+ typedef cmp<base_item_type> compare;
+ typedef base_class::less<base_item_type> less;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::backoff::pause back_off;
+ typedef ci::opt::v::sequential_consistent memory_model;
+ };
+
+ typedef ci::EllenBinTree< gc_type, key_type, base_item_type, tree_traits > tree_type;
+
+ tree_type t;
+ test( t );
+ }
+
+
+} // namespace
}
};
+ typedef int key_type;
+
template <typename Node>
struct base_int_item
: public Node
}
};
+ struct key_extractor
+ {
+ template <typename T>
+ void operator()( key_type& key, T const& val ) const
+ {
+ key = val.key();
+ }
+ };
+
struct simple_item_counter {
size_t m_nCount;
{
return lhs < rhs.key();
}
+
+ bool operator()( int lhs, int rhs ) const
+ {
+ return lhs < rhs;
+ }
};
template <typename T>
return v1.key() > v2.key() ? 1 : 0;
}
- bool operator()( T const& lhs, int rhs ) const
+ int operator()( T const& lhs, int rhs ) const
{
if ( lhs.key() < rhs )
return -1;
return lhs.key() > rhs ? 1 : 0;
}
- bool operator()( int lhs, T const& rhs ) const
+ int operator()( int lhs, T const& rhs ) const
{
if ( lhs < rhs.key() )
return -1;
return lhs > rhs.key() ? 1 : 0;
}
+
+ int operator()( int lhs, int rhs ) const
+ {
+ if ( lhs < rhs )
+ return -1;
+ return lhs > rhs ? 1 : 0;
+ }
};
struct other_item {
{
return lhs.key() < rhs.key();
}
+
+ template <typename Q>
+ bool operator()( Q const& lhs, int rhs ) const
+ {
+ return lhs.key() < rhs;
+ }
+
+ template <typename T>
+ bool operator()( int lhs, T const& rhs ) const
+ {
+ return lhs < rhs.key();
+ }
};
struct mock_disposer
++val.nUpdateCount;
}, false );
EXPECT_TRUE( updResult.first );
- EXPECT_TRUE( updResult.second );
+ EXPECT_FALSE( updResult.second );
EXPECT_EQ( i.nUpdateCount, 1 );
i.nUpdateCount = 0;
}
// clear
- for ( auto& i : data ) {
+ for ( auto idx : indices ) {
+ auto& i = data[idx];
i.clear_stat();
ASSERT_TRUE( t.insert( i ));
}
ASSERT_TRUE( t.empty());
ASSERT_CONTAINER_SIZE( t, 0 );
- ASSERT_TRUE( t.begin() == t.end() );
- ASSERT_TRUE( t.cbegin() == t.cend() );
// Force retiring cycle
Tree::gc::force_dispose();
projects / libcds.git / commitdiff