2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
6 Source code repo: http://github.com/khizmax/libcds/
7 Download: http://sourceforge.net/projects/libcds/files/
9 Redistribution and use in source and binary forms, with or without
10 modification, are permitted provided that the following conditions are met:
12 * Redistributions of source code must retain the above copyright notice, this
13 list of conditions and the following disclaimer.
15 * Redistributions in binary form must reproduce the above copyright notice,
16 this list of conditions and the following disclaimer in the documentation
17 and/or other materials provided with the distribution.
19 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
20 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
23 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
25 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
26 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
27 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 #ifndef CDSUNIT_SET_TEST_ORDERED_SET_HP_H
32 #define CDSUNIT_SET_TEST_ORDERED_SET_HP_H
34 #include "test_set_hp.h"
38 class container_ordered_set_hp: public container_set_hp
40 typedef container_set_hp base_class;
43 template <typename Set>
46 // Precondition: set is empty
47 // Postcondition: set is empty
49 base_class::test( s );
51 ASSERT_TRUE( s.empty());
52 ASSERT_CONTAINER_SIZE( s, 0 );
54 typedef typename Set::value_type value_type;
56 size_t const nSetSize = kSize;
57 std::vector< value_type > data;
58 std::vector< size_t> indices;
59 data.reserve( kSize );
60 indices.reserve( kSize );
61 for ( size_t key = 0; key < kSize; ++key ) {
62 data.push_back( value_type( static_cast<int>(key)));
63 indices.push_back( key );
65 shuffle( indices.begin(), indices.end());
67 for ( auto i : indices ) {
68 ASSERT_TRUE( s.insert( data[i] ));
70 ASSERT_FALSE( s.empty());
71 ASSERT_CONTAINER_SIZE( s, nSetSize );
73 typedef typename Set::guarded_ptr guarded_ptr;
82 EXPECT_EQ( nKey + 1, gp->key());
87 EXPECT_EQ( nCount, nSetSize );
89 ASSERT_TRUE( s.empty());
90 ASSERT_CONTAINER_SIZE( s, 0 );
93 for ( auto i : indices ) {
94 ASSERT_TRUE( s.insert( data[i] ));
96 ASSERT_FALSE( s.empty());
97 ASSERT_CONTAINER_SIZE( s, nSetSize );
101 while ( !s.empty()) {
102 gp = s.extract_max();
104 EXPECT_EQ( nKey - 1, gp->key());
109 EXPECT_EQ( nCount, nSetSize );
111 ASSERT_TRUE( s.empty());
112 ASSERT_CONTAINER_SIZE( s, 0 );
115 } // namespace cds_test
117 #endif // CDSUNIT_SET_TEST_ORDERED_SET_HP_H