File: tut34.cpp

package info (click to toggle)
boost1.88 1.88.0-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 576,932 kB
  • sloc: cpp: 4,149,234; xml: 136,789; ansic: 35,092; python: 33,910; asm: 5,698; sh: 4,604; ada: 1,681; makefile: 1,633; pascal: 1,139; perl: 1,124; sql: 640; yacc: 478; ruby: 271; java: 77; lisp: 24; csh: 6
file content (61 lines) | stat: -rw-r--r-- 1,409 bytes parent folder | download | duplicates (20)
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
//
// 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_sequence_adapter.hpp>
#include <vector>
#include <boost/ptr_container/ptr_map_adapter.hpp>
#include <map>

template< class T >
struct my_ptr_vector : 
    public boost::ptr_sequence_adapter< std::vector<T*> >
{

};

    
template< class Key, class T, class Pred = std::less<Key>,
          class Allocator = std::allocator< std::pair<const Key, T> > >
struct my_map : public std::map<Key,T,Pred,Allocator>
{
    explicit my_map( const Pred&      pred  = Pred(), 
                     const Allocator& alloc = Allocator() ) 
    { }
};

#include <string>
struct Foo {};

typedef boost::ptr_map_adapter< my_map<std::string,Foo*> > foo_map;

template< class Key, class T, class Pred = std::less<Key> >
struct my_ptr_map : public boost::ptr_map_adapter< std::map<Key,T*,Pred> >
{

};

typedef my_ptr_map<std::string,Foo> foo_map2;
    

int main()
{
    
    my_ptr_vector<Foo> vec;
    vec.push_back( new Foo );
    foo_map  m1;
    foo_map2 m2;
    std::string s("");
    m1.insert( s, new Foo );
    m2.insert( s, new Foo );

    
}