sl@0
|
1 |
/***********************************************************************************
|
sl@0
|
2 |
test_hash_set.cpp
|
sl@0
|
3 |
|
sl@0
|
4 |
* Copyright (c) 1997
|
sl@0
|
5 |
* Mark of the Unicorn, Inc.
|
sl@0
|
6 |
*
|
sl@0
|
7 |
* Permission to use, copy, modify, distribute and sell this software
|
sl@0
|
8 |
* and its documentation for any purpose is hereby granted without fee,
|
sl@0
|
9 |
* provided that the above copyright notice appear in all copies and
|
sl@0
|
10 |
* that both that copyright notice and this permission notice appear
|
sl@0
|
11 |
* in supporting documentation. Mark of the Unicorn makes no
|
sl@0
|
12 |
* representations about the suitability of this software for any
|
sl@0
|
13 |
* purpose. It is provided "as is" without express or implied warranty.
|
sl@0
|
14 |
|
sl@0
|
15 |
***********************************************************************************/
|
sl@0
|
16 |
#include "Tests.h"
|
sl@0
|
17 |
|
sl@0
|
18 |
#if defined( EH_HASHED_CONTAINERS_IMPLEMENTED )
|
sl@0
|
19 |
|
sl@0
|
20 |
# include <hash_set>
|
sl@0
|
21 |
|
sl@0
|
22 |
#include "TestClass.h"
|
sl@0
|
23 |
#include "LeakCheck.h"
|
sl@0
|
24 |
#include "test_construct.h"
|
sl@0
|
25 |
#include "test_assign_op.h"
|
sl@0
|
26 |
#include "test_push_back.h"
|
sl@0
|
27 |
#include "test_insert.h"
|
sl@0
|
28 |
#include "test_push_front.h"
|
sl@0
|
29 |
#include "ThrowCompare.h"
|
sl@0
|
30 |
#include "test_hash_resize.h"
|
sl@0
|
31 |
|
sl@0
|
32 |
typedef EH_STD::__hash_multiset__<TestClass, ThrowHash, ThrowEqual,
|
sl@0
|
33 |
eh_allocator(TestClass) > TestMultiSet;
|
sl@0
|
34 |
|
sl@0
|
35 |
inline multiset_tag
|
sl@0
|
36 |
container_category(const TestMultiSet&)
|
sl@0
|
37 |
{
|
sl@0
|
38 |
return multiset_tag();
|
sl@0
|
39 |
}
|
sl@0
|
40 |
|
sl@0
|
41 |
void test_hash_multiset()
|
sl@0
|
42 |
{
|
sl@0
|
43 |
# if !(defined (_MSC_VER) && (_MSC_VER < 1100))
|
sl@0
|
44 |
TestMultiSet testMultiSet, testMultiSet2;
|
sl@0
|
45 |
|
sl@0
|
46 |
const size_t hash_setSize = random_number(random_base);
|
sl@0
|
47 |
|
sl@0
|
48 |
while ( testMultiSet.size() < hash_setSize )
|
sl@0
|
49 |
{
|
sl@0
|
50 |
TestMultiSet::value_type x;
|
sl@0
|
51 |
testMultiSet.insert( x );
|
sl@0
|
52 |
testMultiSet2.insert( TestMultiSet::value_type() );
|
sl@0
|
53 |
}
|
sl@0
|
54 |
|
sl@0
|
55 |
# if defined( EH_HASH_CONTAINERS_SUPPORT_RESIZE )
|
sl@0
|
56 |
WeakCheck( testMultiSet, test_hash_resize<TestMultiSet>() );
|
sl@0
|
57 |
// TestMultiSet == TestMultiSet: no such operator! - ptr
|
sl@0
|
58 |
// StrongCheck( testMultiSet, test_insert_noresize<TestMultiSet>(testMultiSet) );
|
sl@0
|
59 |
# endif
|
sl@0
|
60 |
WeakCheck( testMultiSet, test_insert_value<TestMultiSet>(testMultiSet) );
|
sl@0
|
61 |
|
sl@0
|
62 |
size_t insCnt = random_number(random_base);
|
sl@0
|
63 |
TestMultiSet::value_type *insFirst = new TestMultiSet::value_type[1+insCnt];
|
sl@0
|
64 |
WeakCheck( testMultiSet, insert_range_tester(testMultiSet, insFirst, insFirst+insCnt) );
|
sl@0
|
65 |
ConstCheck( 0, test_construct_pointer_range<TestMultiSet>(insFirst, insFirst+insCnt) );
|
sl@0
|
66 |
delete[] insFirst;
|
sl@0
|
67 |
|
sl@0
|
68 |
WeakCheck( testMultiSet, insert_range_tester(testMultiSet, testMultiSet2.begin(), testMultiSet2.end() ) );
|
sl@0
|
69 |
|
sl@0
|
70 |
ConstCheck( 0, test_default_construct<TestMultiSet>() );
|
sl@0
|
71 |
# if EH_HASH_CONTAINERS_SUPPORT_ITERATOR_CONSTRUCTION
|
sl@0
|
72 |
ConstCheck( 0, test_construct_iter_range_n<TestMultiSet>( testMultiSet2 ) );
|
sl@0
|
73 |
# endif
|
sl@0
|
74 |
ConstCheck( testMultiSet, test_copy_construct<TestMultiSet>() );
|
sl@0
|
75 |
|
sl@0
|
76 |
WeakCheck( testMultiSet, test_assign_op<TestMultiSet>( testMultiSet2 ) );
|
sl@0
|
77 |
# endif
|
sl@0
|
78 |
}
|
sl@0
|
79 |
|
sl@0
|
80 |
typedef EH_STD::__hash_set__<TestClass, ThrowHash, ThrowEqual, eh_allocator(TestClass) > TestSet;
|
sl@0
|
81 |
|
sl@0
|
82 |
inline set_tag
|
sl@0
|
83 |
container_category(const TestSet&)
|
sl@0
|
84 |
{
|
sl@0
|
85 |
return set_tag();
|
sl@0
|
86 |
}
|
sl@0
|
87 |
|
sl@0
|
88 |
void test_hash_set()
|
sl@0
|
89 |
{
|
sl@0
|
90 |
# if !(defined (_MSC_VER) && (_MSC_VER < 1100))
|
sl@0
|
91 |
TestSet testSet, testSet2;
|
sl@0
|
92 |
|
sl@0
|
93 |
const size_t hash_setSize = random_number(random_base);
|
sl@0
|
94 |
|
sl@0
|
95 |
while ( testSet.size() < hash_setSize )
|
sl@0
|
96 |
{
|
sl@0
|
97 |
TestSet::value_type x;
|
sl@0
|
98 |
testSet.insert( x );
|
sl@0
|
99 |
testSet2.insert( TestSet::value_type() );
|
sl@0
|
100 |
}
|
sl@0
|
101 |
|
sl@0
|
102 |
# if defined( EH_HASH_CONTAINERS_SUPPORT_RESIZE )
|
sl@0
|
103 |
WeakCheck( testSet, test_hash_resize<TestSet>() );
|
sl@0
|
104 |
// TestMultiSet == TestMultiSet: no such operator! - ptr
|
sl@0
|
105 |
// StrongCheck( testSet, test_insert_noresize<TestSet>(testSet) );
|
sl@0
|
106 |
# endif
|
sl@0
|
107 |
WeakCheck( testSet, test_insert_value<TestSet>(testSet) );
|
sl@0
|
108 |
|
sl@0
|
109 |
size_t insCnt = random_number(random_base);
|
sl@0
|
110 |
TestSet::value_type *insFirst = new TestSet::value_type[1+insCnt];
|
sl@0
|
111 |
WeakCheck( testSet, insert_range_tester(testSet, insFirst, insFirst+insCnt) );
|
sl@0
|
112 |
ConstCheck( 0, test_construct_pointer_range<TestSet>(insFirst, insFirst+insCnt) );
|
sl@0
|
113 |
delete[] insFirst;
|
sl@0
|
114 |
|
sl@0
|
115 |
WeakCheck( testSet, insert_range_tester(testSet, testSet2.begin(), testSet2.end() ) );
|
sl@0
|
116 |
|
sl@0
|
117 |
ConstCheck( 0, test_default_construct<TestSet>() );
|
sl@0
|
118 |
# if EH_HASH_CONTAINERS_SUPPORT_ITERATOR_CONSTRUCTION
|
sl@0
|
119 |
ConstCheck( 0, test_construct_iter_range_n<TestSet>( testSet2 ) );
|
sl@0
|
120 |
# endif
|
sl@0
|
121 |
ConstCheck( testSet, test_copy_construct<TestSet>() );
|
sl@0
|
122 |
|
sl@0
|
123 |
WeakCheck( testSet, test_assign_op<TestSet>( testSet2 ) );
|
sl@0
|
124 |
# endif
|
sl@0
|
125 |
}
|
sl@0
|
126 |
|
sl@0
|
127 |
#endif // EH_HASHED_CONTAINERS_IMPLEMENTED
|