2 * Copyright (c) 2006 The Regents of The University of Michigan
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
34 #include "base/range_map.hh"
35 #include "base/types.hh"
42 typedef range_multimap
<Addr
, int> multimap_t
;
45 multimap_t::iterator i
;
46 std::pair
<multimap_t::iterator
, multimap_t::iterator
> jk
;
48 i
= r
.insert(RangeIn
<Addr
>(10,40),5);
50 i
= r
.insert(RangeIn
<Addr
>(10,40),6);
52 i
= r
.insert(RangeIn
<Addr
>(60,90),3);
55 jk
= r
.find(RangeIn(20,30));
56 assert(jk
.first
!= r
.end());
57 cout
<< jk
.first
->first
<< " " << jk
.first
->second
<< endl
;
58 cout
<< jk
.second
->first
<< " " << jk
.second
->second
<< endl
;
60 i
= r
.insert(RangeIn
<Addr
>(0,3),5);
63 for( i
= r
.begin(); i
!= r
.end(); i
++)
64 cout
<< i
->first
<< " " << i
->second
<< endl
;
66 jk
= r
.find(RangeIn(20,30));
67 assert(jk
.first
!= r
.end());
68 cout
<< jk
.first
->first
<< " " << jk
.first
->second
<< endl
;
69 cout
<< jk
.second
->first
<< " " << jk
.second
->second
<< endl
;