File: test_bit_vector.cpp

package info (click to toggle)
stlport4.6 4.6.2-7
  • links: PTS, VCS
  • area: main
  • in suites: squeeze, wheezy
  • size: 7,056 kB
  • ctags: 16,390
  • sloc: ansic: 46,190; cpp: 18,805; sh: 266; asm: 93; perl: 58; makefile: 10
file content (129 lines) | stat: -rw-r--r-- 4,866 bytes parent folder | download | duplicates (5)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
/***********************************************************************************
	test_bit_vector.cpp
	
 * Copyright (c) 1997
 * Mark of the Unicorn, Inc.
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Mark of the Unicorn makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.

***********************************************************************************/
#include "Tests.h"

#if defined( EH_BIT_VECTOR_IMPLEMENTED )

# if defined (EH_NEW_HEADERS)
# ifdef __SUNPRO_CC
# include <stdio.h>
# endif
#include <vector>
# else
#include <bvector.h>
# endif

#include "LeakCheck.h"
#include "test_construct.h"
#include "test_assign_op.h"
#include "test_push_back.h"
#include "test_insert.h"
#include "test_push_front.h"

typedef EH_BIT_VECTOR BitVector;

inline sequence_container_tag
container_category(const BitVector&)
{
	return sequence_container_tag();
}

USING_CSTD_NAME(size_t)

  //
// test_BitVector_reserve
//
struct test_BitVector_reserve
{
    test_BitVector_reserve( size_t n ) : fAmount(n)
    {
        gTestController.SetCurrentTestName("BitVector::reserve()");
    }
	
    void operator()( BitVector& v ) const
    {
        v.reserve( fAmount );
    }
private:
    size_t fAmount;
};

/*===================================================================================
	test_bit_vector

	EFFECTS:  Performs tests on bit vectors
====================================================================================*/
void test_bit_vector()
{
	#define __WORD_BIT (int(CHAR_BIT*sizeof(unsigned int)))
	
	// Make some bit vectors to work with.
    BitVector emptyVector;
    BitVector testVector, testVector2;
    
    EH_ASSERT( testVector.size() == 0 );
    
    size_t BitVectorSize = random_number( random_base );
    // Half the time, choose a size that will guarantee immediate reallocation
    if ( random_number(2) )
    	BitVectorSize = BitVectorSize / __WORD_BIT * __WORD_BIT;
	
    EH_ASSERT( testVector.size() == 0 );
    testVector.reserve(BitVectorSize);
    EH_ASSERT( testVector.size() == 0 );
    while ( testVector.size() < BitVectorSize )
    {
        testVector.push_back( bool(random_number(2)) );
        testVector2.push_back( bool(random_number(2)) );
    }
	
	// Test insertions
    StrongCheck( testVector, test_insert_one<BitVector>(testVector) );
    StrongCheck( testVector, test_insert_one<BitVector>(testVector,0) );
    StrongCheck( testVector, test_insert_one<BitVector>(testVector, (int)testVector.size()) );

    StrongCheck( testVector, test_insert_n<BitVector>(testVector, random_number(random_base) ) );
    StrongCheck( testVector, test_insert_n<BitVector>(testVector, random_number(random_base),0 ) );
    StrongCheck( testVector, test_insert_n<BitVector>(testVector, random_number(random_base), (int)testVector.size()) );
# if 0	
	// Allocate some random bools to insert
    size_t insCnt = 1 + random_number(random_base);
    bool *insFirst = new BitVector::value_type[insCnt];
    for ( size_t n = 0; n < insCnt; n++ )
        insFirst[n] = random_number(2);
    StrongCheck( testVector, insert_range_tester(testVector, insFirst, insFirst+insCnt) );
    StrongCheck( testVector, insert_range_at_begin_tester(testVector, insFirst, insFirst+insCnt) );
    StrongCheck( testVector, insert_range_at_end_tester(testVector, insFirst, insFirst+insCnt) );
    ConstCheck( 0, test_construct_pointer_range<BitVector>( insFirst, insFirst + insCnt ) );
    delete[] insFirst;
# endif
    StrongCheck( testVector, insert_range_tester(testVector, testVector2.begin(), testVector2.end() ) );
    StrongCheck( testVector, insert_range_at_begin_tester(testVector, testVector2.begin(), 
							  testVector2.end() ) );
    StrongCheck( testVector, insert_range_at_end_tester(testVector, testVector2.begin(), 
							  testVector2.end() ) );
    StrongCheck( testVector, test_BitVector_reserve( testVector.capacity() + random_number(50) ) );
    StrongCheck( testVector, test_push_back<BitVector>(testVector) );
    StrongCheck( emptyVector, test_push_back<BitVector>(emptyVector) );	

    ConstCheck( 0, test_default_construct<BitVector>() );
    ConstCheck( 0, test_construct_n<BitVector>( random_number(random_base) ) );
    ConstCheck( 0, test_construct_n_instance<BitVector>( random_number(random_base) ) );
    ConstCheck( 0, test_construct_iter_range<BitVector>( testVector2 ) );
    ConstCheck( testVector, test_copy_construct<BitVector>() );
    WeakCheck( testVector, test_assign_op<BitVector>( testVector2 ) );
}
# endif /* BIT_VECTOR_IMPLEMENTED */