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_MAP_TEST_MICHAEL_ITERABLE_MAP_HP_H
32 #define CDSUNIT_MAP_TEST_MICHAEL_ITERABLE_MAP_HP_H
34 #include "test_michael_iterable.h"
38 class michael_iterable_hp: public michael_iterable_map
40 typedef michael_iterable_map base_class;
46 // Precondition: map is empty
47 // Postcondition: map is empty
49 base_class::test( m );
51 EXPECT_TRUE( m.empty());
52 EXPECT_CONTAINER_SIZE( m, 0 );
54 size_t const kkSize = base_class::kSize;
56 std::vector<key_type> arrKeys;
57 for ( int i = 0; i < static_cast<int>(kkSize); ++i )
58 arrKeys.push_back( key_type( i ));
59 shuffle( arrKeys.begin(), arrKeys.end());
61 std::vector< value_type > arrVals;
62 for ( size_t i = 0; i < kkSize; ++i ) {
64 val.nVal = static_cast<int>( i );
65 val.strVal = std::to_string( i );
66 arrVals.push_back( val );
69 for ( auto const& i : arrKeys )
70 EXPECT_TRUE( m.insert( i ));
71 EXPECT_FALSE( m.empty());
72 EXPECT_CONTAINER_SIZE( m, kkSize );
76 for ( auto it = m.begin(); it != m.end(); ++it ) {
77 EXPECT_EQ( it->second.nVal, 0 );
78 it->second.nVal = it->first.nKey * 2;
81 EXPECT_EQ( nCount, kkSize );
84 for ( auto it = m.cbegin(); it != m.cend(); ++it ) {
85 EXPECT_EQ( it->second.nVal, it->first.nKey * 2 );
88 EXPECT_EQ( nCount, kkSize );
91 typedef typename Map::guarded_ptr guarded_ptr;
94 for ( auto const& i : arrKeys ) {
95 value_type const& val = arrVals.at( i.nKey );
99 EXPECT_EQ( gp->first.nKey, i.nKey );
103 EXPECT_EQ( gp->first.nKey, i.nKey );
105 gp = m.get_with( other_item( i.nKey ), other_less());
107 EXPECT_EQ( gp->first.nKey, i.nKey );
109 switch ( i.nKey % 4 ) {
111 gp = m.extract( i.nKey );
117 gp = m.extract( val.strVal );
120 gp = m.extract_with( other_item( i.nKey ), other_less());
124 EXPECT_EQ( gp->first.nKey, i.nKey );
127 gp = m.get( i.nKey );
131 gp = m.get_with( other_item( i.nKey ), other_less());
134 EXPECT_TRUE( m.empty());
135 EXPECT_CONTAINER_SIZE( m, 0u );
138 for ( auto const& i : arrKeys )
139 EXPECT_TRUE( m.insert( i ));
140 EXPECT_FALSE( m.empty());
141 EXPECT_CONTAINER_SIZE( m, kkSize );
143 for ( auto it = m.begin(); it != m.end(); ++it ) {
144 EXPECT_TRUE( m.erase_at( it ));
145 EXPECT_FALSE( m.erase_at( it ));
147 EXPECT_TRUE( m.empty());
148 EXPECT_CONTAINER_SIZE( m, 0u );
152 } // namespace cds_test
154 #endif // #ifndef CDSUNIT_MAP_TEST_MICHAEL_ITERABLE_MAP_HP_H