File: foreach.cpp

package info (click to toggle)
boost1.35 1.35.0-5
  • links: PTS
  • area: main
  • in suites: lenny
  • size: 203,856 kB
  • ctags: 337,867
  • sloc: cpp: 938,683; xml: 56,847; ansic: 41,589; python: 18,999; sh: 11,566; makefile: 664; perl: 494; yacc: 456; asm: 353; csh: 6
file content (106 lines) | stat: -rw-r--r-- 2,828 bytes parent folder | download | duplicates (7)
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.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 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

// Boost.Bimap Example
//-----------------------------------------------------------------------------

#include <boost/config.hpp>

#include <string>
#include <iostream>

#include <boost/foreach.hpp>

#include <boost/bimap/bimap.hpp>
#include <boost/bimap/list_of.hpp>
#include <boost/bimap/support/lambda.hpp>

using namespace boost::bimaps;


int main()
{
    //[ code_bimap_and_boost_foreach

    typedef bimap< std::string, list_of<int> > bm_type;

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

    BOOST_FOREACH( bm_type::left_reference p, bm.left )
    {
        ++p.second; /*< We can modify the right element because we have
                        use a mutable collection type in the right side. >*/
    }

    BOOST_FOREACH( bm_type::right_const_reference p, bm.right )
    {
        std::cout << p.first << "-->" << p.second << std::endl;
    }

    //]

    // More examples

    BOOST_FOREACH( bm_type::right_reference p, bm.right )
    {
        ++p.first;
    }

    BOOST_FOREACH( bm_type::left_const_reference p, bm.left )
    {
        std::cout << p.first << "-->" << p.second << std::endl;
    }

    BOOST_FOREACH( bm_type::reference p, bm )
    {
        ++p.right;
    }

    const bm_type & cbm = bm;
    BOOST_FOREACH( bm_type::const_reference p, cbm )
    {
        std::cout << p.left << "-->" << p.right << std::endl;
    }

    BOOST_FOREACH( bm_type::const_reference p, bm )
    {
        std::cout << p.left << "-->" << p.right << std::endl;
    }

    //[ code_bimap_and_boost_foreach_using_range

    BOOST_FOREACH( bm_type::left_reference p,
                 ( bm.left.range( std::string("1") <= _key, _key < std::string("3") ) ))
    {
        ++p.second;
    }

    BOOST_FOREACH( bm_type::left_const_reference p,
                 ( bm.left.range( std::string("1") <= _key, _key < std::string("3") ) ))
    {
        std::cout << p.first << "-->" << p.second << std::endl;
    }
    //]

    return 0;
}