boost_bimap 0.1.0

Boost C++ library boost_bimap packaged using Zanbil
Documentation 
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

  // Boost.Bimap
//
// Copyright (c) 2006-2007 Matias Capeletto
//
// Distributed under 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)

//  VC++ 8.0 warns on usage of certain Standard Library and API functions that
//  can be cause buffer overruns or other possible security issues if misused.
//  See https://web.archive.org/web/20071014014301/http://msdn.microsoft.com/msdnmag/issues/05/05/SafeCandC/default.aspx
//  But the wording of the warning is misleading and unsettling, there are no
//  portable alternative functions, and VC++ 8.0's own libraries use the
//  functions in question. So turn off the warnings.
#define _CRT_SECURE_NO_DEPRECATE
#define _SCL_SECURE_NO_DEPRECATE

#include <boost/config.hpp>

#include <boost/core/lightweight_test.hpp>

#include <string>

// Boost.Bimap
#include <boost/bimap/bimap.hpp>
#include <boost/bimap/list_of.hpp>

using namespace boost::bimaps;

struct  left_tag {};
struct right_tag {};

void test_bimap_project()
{
    typedef bimap
    <
                 tagged< int        ,  left_tag >,
        list_of< tagged< std::string, right_tag > >

    > bm_type;

    bm_type bm;

    bm.insert( bm_type::value_type(1,"1") );
    bm.insert( bm_type::value_type(2,"2") );

    bm_type::      iterator       iter = bm.begin();
    bm_type:: left_iterator  left_iter = bm.left.find(1);
    bm_type::right_iterator right_iter = bm.right.begin();

    const bm_type & cbm = bm;

    bm_type::      const_iterator       citer = cbm.begin();
    bm_type:: left_const_iterator  left_citer = cbm.left.find(1);
    bm_type::right_const_iterator right_citer = cbm.right.begin();

    // non const projection

    BOOST_TEST( bm.project_up   (bm.end()) == bm.end()       );
    BOOST_TEST( bm.project_left (bm.end()) == bm.left.end()  );
    BOOST_TEST( bm.project_right(bm.end()) == bm.right.end() );

    BOOST_TEST( bm.project_up   (iter) == iter       );
    BOOST_TEST( bm.project_left (iter) == left_iter  );
    BOOST_TEST( bm.project_right(iter) == right_iter );

    BOOST_TEST( bm.project_up   (left_iter) == iter       );
    BOOST_TEST( bm.project_left (left_iter) == left_iter  );
    BOOST_TEST( bm.project_right(left_iter) == right_iter );

    BOOST_TEST( bm.project_up   (right_iter) == iter       );
    BOOST_TEST( bm.project_left (right_iter) == left_iter  );
    BOOST_TEST( bm.project_right(right_iter) == right_iter );

    bm.project_up   ( left_iter)->right  = "u";
    bm.project_left (right_iter)->second = "l";
    bm.project_right(      iter)->first  = "r";

    // const projection

    BOOST_TEST( cbm.project_up   (cbm.end()) == cbm.end()       );
    BOOST_TEST( cbm.project_left (cbm.end()) == cbm.left.end()  );
    BOOST_TEST( cbm.project_right(cbm.end()) == cbm.right.end() );

    BOOST_TEST( cbm.project_up   (citer) == citer       );
    BOOST_TEST( cbm.project_left (citer) == left_citer  );
    BOOST_TEST( cbm.project_right(citer) == right_citer );

    BOOST_TEST( cbm.project_up   (left_citer) == citer       );
    BOOST_TEST( cbm.project_left (left_citer) == left_citer  );
    BOOST_TEST( cbm.project_right(left_citer) == right_citer );

    BOOST_TEST( cbm.project_up   (right_citer) == citer       );
    BOOST_TEST( cbm.project_left (right_citer) == left_citer  );
    BOOST_TEST( cbm.project_right(right_citer) == right_citer );

    // mixed projection

    BOOST_TEST( bm.project_up   (left_citer) == iter       );
    BOOST_TEST( bm.project_left (left_citer) == left_iter  );
    BOOST_TEST( bm.project_right(left_citer) == right_iter );

    BOOST_TEST( cbm.project_up   (right_iter) == citer       );
    BOOST_TEST( cbm.project_left (right_iter) == left_citer  );
    BOOST_TEST( cbm.project_right(right_iter) == right_citer );

    bm.project_up   ( left_citer)->right  = "u";
    bm.project_left (right_citer)->second = "l";
    bm.project_right(      citer)->first  = "r";

    // Support for tags

    BOOST_TEST( bm.project< left_tag>(iter) == left_iter  );
    BOOST_TEST( bm.project<right_tag>(iter) == right_iter );

    BOOST_TEST( bm.project< left_tag>(left_iter) == left_iter  );
    BOOST_TEST( bm.project<right_tag>(left_iter) == right_iter );

    BOOST_TEST( bm.project< left_tag>(right_iter) == left_iter  );
    BOOST_TEST( bm.project<right_tag>(right_iter) == right_iter );

    BOOST_TEST( cbm.project< left_tag>(citer) == left_citer  );
    BOOST_TEST( cbm.project<right_tag>(citer) == right_citer );

    BOOST_TEST( cbm.project< left_tag>(left_citer) == left_citer  );
    BOOST_TEST( cbm.project<right_tag>(left_citer) == right_citer );

    BOOST_TEST( cbm.project< left_tag>(right_citer) == left_citer  );
    BOOST_TEST( cbm.project<right_tag>(right_citer) == right_citer );

    bm.project< left_tag>(right_citer)->second = "l";
    bm.project<right_tag>( left_citer)->first  = "r";

}


int main()
{
    test_bimap_project();
    return boost::report_errors();
}