File: simple_test.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 (106 lines) | stat: -rw-r--r-- 2,595 bytes parent folder | download | duplicates (21)
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
//
// 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/ptr_container/ptr_vector.hpp>
#include <boost/shared_ptr.hpp>
#include <boost/lambda/lambda.hpp>
#include <algorithm>

using namespace std;
                       
//
// A simple polymorphic class
//
class Poly
{
    int        i_;
    static int cnt_;
    
public:
    Poly() : i_( cnt_++ )  { }
    virtual ~Poly()        { }
    void foo()             { doFoo(); }
    
private:    
    virtual void doFoo()   { ++i_; }
    
public:
    friend inline bool operator>( const Poly& l, const Poly r )
    {
        return l.i_ > r.i_;
    }
};

int Poly::cnt_ = 0;

//
// Normally we need something like this to compare pointers to objects
//
template< typename T >
struct sptr_greater
{
    bool operator()( const boost::shared_ptr<T>& l, const boost::shared_ptr<T>& r ) const
    {
        return *l > *r;
    }
};
                                                         
//
// one doesn't need to introduce new names or live with long ones
//                                                         
typedef boost::shared_ptr<Poly> PolyPtr;


void simple_test()
{
    enum { size = 2000 };
    typedef vector<PolyPtr>          vector_t;
    typedef boost::ptr_vector<Poly>  ptr_vector_t;
    vector_t                         svec;   
    ptr_vector_t                     pvec;
    
    for( int i = 0; i < size; ++i ) 
    {
        svec.push_back( PolyPtr( new Poly ) ); 
        pvec.push_back( new Poly );  // no extra syntax      
    }
                   
    for( int i = 0; i < size; ++i )
    {
        svec[i]->foo();
        pvec[i].foo(); // automatic indirection
        svec[i] = PolyPtr( new Poly );
        pvec.replace( i, new Poly ); // direct pointer assignment not possible, original element is deleted
    }
    
    for( vector_t::iterator i = svec.begin(); i != svec.end(); ++i )
        (*i)->foo();
 
    for( ptr_vector_t::iterator i = pvec.begin(); i != pvec.end(); ++i )
        i->foo(); // automatic indirection
}
 
#include <boost/test/unit_test.hpp>
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( &simple_test ) );

    return test;
}