File: ptr_circular_buffer.cpp

package info (click to toggle)
boost1.83 1.83.0-5
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 545,632 kB
  • sloc: cpp: 3,857,086; xml: 125,552; ansic: 34,414; python: 25,887; asm: 5,276; sh: 4,799; ada: 1,681; makefile: 1,629; perl: 1,212; pascal: 1,139; sql: 810; yacc: 478; ruby: 102; lisp: 24; csh: 6
file content (198 lines) | stat: -rw-r--r-- 6,879 bytes parent folder | download | duplicates (15)
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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
//
// Boost.Pointer Container
//
//  Copyright Thorsten Ottosen 2003-2005. Use, modification and
//  distribution is subject to the Boost Software License, Version
//  1.0. (See accompanying file LICENSE_1_0.txt or copy at
//  http://www.boost.org/LICENSE_1_0.txt)
//
// For more information, see http://www.boost.org/libs/ptr_container/
//
 
#include <boost/test/unit_test.hpp>
#include "sequence_test_data.hpp"
#include <boost/ptr_container/ptr_circular_buffer.hpp>
#include <boost/ptr_container/ptr_list.hpp>
#include <boost/assign/list_inserter.hpp>

template<class T>
struct set_capacity< ptr_circular_buffer<T> >
{
    void operator()( ptr_circular_buffer<T>& c ) const
    {
        c.set_capacity( 100u ); 
    }
};

void test_ptr_circular_buffer()
{ 
    reversible_container_test< ptr_circular_buffer<Base>, Base, Derived_class >();
    reversible_container_test< ptr_circular_buffer<Value>, Value, Value >();

#ifdef BOOST_NO_SFINAE
#else
    reversible_container_test< ptr_circular_buffer< nullable<Base> >, Base, Derived_class >();
    reversible_container_test< ptr_circular_buffer< nullable<Value> >, Value, Value >();
#endif    

    container_assignment_test< ptr_circular_buffer<Base>, ptr_circular_buffer<Derived_class>, 
                               Derived_class>();
    container_assignment_test< ptr_circular_buffer< nullable<Base> >, 
                               ptr_circular_buffer< nullable<Derived_class> >, 
                               Derived_class>();
    container_assignment_test< ptr_circular_buffer< nullable<Base> >, 
                               ptr_circular_buffer<Derived_class>, 
                               Derived_class>();
    container_assignment_test< ptr_circular_buffer<Base>, 
                               ptr_circular_buffer< nullable<Derived_class> >, 
                               Derived_class>();                           
                               
    test_transfer< ptr_circular_buffer<Derived_class>, ptr_circular_buffer<Base>, Derived_class>();
    test_transfer< ptr_circular_buffer<Derived_class>, ptr_list<Base>, Derived_class>();
     
    random_access_algorithms_test< ptr_circular_buffer<int> >();


    BOOST_TEST_MESSAGE( "starting ptr_circular_buffer test" );
    ptr_circular_buffer<int> vec( 100u );
    BOOST_CHECK( vec.capacity() >= 100u );

#ifdef BOOST_PTR_CONTAINER_NO_EXCEPTIONS    
#else

    BOOST_CHECK_THROW( vec.push_back(0), bad_ptr_container_operation );
    BOOST_CHECK_THROW( (vec.insert( vec.begin(), 0 )), bad_ptr_container_operation );
    BOOST_CHECK_THROW( vec.at( 42 ), bad_ptr_container_operation );
    vec.push_back( new int(0) );
    BOOST_CHECK_THROW( (vec.replace(10u, new int(0))), bad_ptr_container_operation );
    BOOST_CHECK_THROW( (vec.replace(0u, 0)), bad_ptr_container_operation ); 
    BOOST_CHECK_THROW( (vec.replace(vec.begin(), 0 )), bad_ptr_container_operation );

#endif

    vec.clear();
    assign::push_back( vec )( new int(2) )
                            ( new int(4) )
                            ( new int(6) )
                            ( new int(8) );
    ptr_circular_buffer<int> vec2( 100u );
    assign::push_back( vec2 )
                        ( new int(1) )
                        ( new int(3) )
                        ( new int(5) )
                        ( new int(7) );
    BOOST_CHECK_EQUAL( vec.size(), vec2.size() );
    BOOST_CHECK( vec > vec2 );
    BOOST_CHECK( vec != vec2 );
    BOOST_CHECK( !(vec == vec2) );
    BOOST_CHECK( vec2 < vec );
    BOOST_CHECK( vec2 <= vec );
    BOOST_CHECK( vec >= vec2 );

    BOOST_TEST_MESSAGE( "push_front test" );    
    assign::push_front( vec2 )
                      ( new int(2) )
                      ( new int(4) )
                      ( new int(6) )
                      ( new int(8) );
    BOOST_CHECK_EQUAL( vec2.size(), 8u );
    BOOST_CHECK_EQUAL( vec2[0], 8 );
    BOOST_CHECK_EQUAL( vec2.front(), 8 );
    BOOST_CHECK_EQUAL( vec2.back(), 7 );

    //vec2.linearize();
    vec2.rset_capacity( vec2.size() - 2u );
    vec2.rresize( 0 );
    //vec2.reverse();

    BOOST_TEST_MESSAGE( "when full test" );    

    ptr_circular_buffer<int> vec3;
    BOOST_CHECK_EQUAL( vec3.capacity(),  0u );
    vec3.set_capacity( 2u );
    BOOST_CHECK_EQUAL( vec3.capacity(),  2u );

    vec3.push_back( new int(1) );
    vec3.push_back( new int(2) );
    BOOST_CHECK_EQUAL( vec3.size(), 2u );
    BOOST_CHECK( vec3.full() ); 

    vec3.push_back( new int(3) );
    BOOST_CHECK_EQUAL( vec3.front(), 2 );
    BOOST_CHECK_EQUAL( vec3.back(), 3 );

    vec3.push_front( new int(4) );
    BOOST_CHECK_EQUAL( vec3.size(), 2u );
    BOOST_CHECK_EQUAL( vec3.front(), 4 );
    BOOST_CHECK_EQUAL( vec3.back(), 2 );
        
    vec3.insert( vec3.end(), new int(5) );
    BOOST_CHECK_EQUAL( vec3.front(), 2 );
    BOOST_CHECK_EQUAL( vec3.back(), 5 );

    vec3.rinsert( vec3.begin(), new int(6) );
    BOOST_CHECK_EQUAL( vec3.front(), 6 );
    BOOST_CHECK_EQUAL( vec3.back(), 2 );

    BOOST_TEST_MESSAGE( "transfer test" );    
    ptr_circular_buffer<int> vec4(2u);
    vec4.transfer( vec4.end(), vec3 );
    BOOST_CHECK_EQUAL( vec4.size(), 2u );
    BOOST_CHECK_EQUAL( vec3.size(), 0u );
    vec3.set_capacity(1u);
    vec3.transfer( vec3.end(), vec4 ); 
    BOOST_CHECK_EQUAL( vec4.size(), 0u );
    BOOST_CHECK_EQUAL( vec3.size(), 1u );
    BOOST_CHECK_EQUAL( vec3.front(), 2 );

    BOOST_TEST_MESSAGE( "rerase test" );   
    vec.rerase( vec.begin() );
    vec.rerase( boost::make_iterator_range( vec ) ); 

    BOOST_TEST_MESSAGE( "array test" );    
    const int data_size = 10;
    int** array = new int*[data_size];
    for( int i = 0; i != data_size; ++i ) 
        array[i] = new int(i);
        
    vec.transfer( vec.begin(), array, data_size );
    int** array2 = vec.c_array();
    BOOST_CHECK( array2 != array );

    ptr_circular_buffer<int>::array_range array_range = vec.array_one();
    array_range = vec.array_two();
    ptr_circular_buffer<int>::const_array_range const_array_range = array_range;
    const_array_range = const_cast< const ptr_circular_buffer<int>& >(vec).array_one();
    const_array_range = const_cast< const ptr_circular_buffer<int>& >(vec).array_two();
    
    BOOST_TEST_MESSAGE( "finishing ptr_circular_buffer test" );    
    
}



void test_circular_buffer()
{ 
    boost::circular_buffer<void*> b(25u);
    BOOST_CHECK_EQUAL( b.capacity(),  25u );
    b.push_back( 0 );
    BOOST_CHECK_EQUAL( b.size(),  1u );
    boost::circular_buffer<void*> b2( b.begin(), b.end() );
    BOOST_CHECK_EQUAL( b2.size(), b.size() );
}

using boost::unit_test::test_suite;

test_suite* init_unit_test_suite( int argc, char* argv[] )
{
    test_suite* test = BOOST_TEST_SUITE( "Pointer Container Test Suite" );

    test->add( BOOST_TEST_CASE( &test_circular_buffer ) );
    test->add( BOOST_TEST_CASE( &test_ptr_circular_buffer ) );

    return test;
}