/
a00054.html
195 lines (178 loc) · 26.8 KB
/
a00054.html
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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>STX B+ Tree Template Classes: Member List</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
</head>
<body>
<div id="top"><!-- do not remove this div! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">STX B+ Tree Template Classes
 <span id="projectnumber">0.9</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- Generated by Doxygen 1.7.6.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li class="current"><a href="annotated.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
<li>
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="annotated.html"><span>Class List</span></a></li>
<li><a href="hierarchy.html"><span>Class Hierarchy</span></a></li>
<li><a href="functions.html"><span>Class Members</span></a></li>
</ul>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="a00036.html">stx</a> </li>
<li class="navelem"><a class="el" href="a00004.html">btree_map</a> </li>
</ul>
</div>
</div>
<div class="header">
<div class="headertitle">
<div class="title">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc > Member List</div> </div>
</div><!--header-->
<div class="contents">
This is the complete list of members for <a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a>, including all inherited members.<table>
<tr class="memlist"><td><a class="el" href="a00004.html#a5d0f64823a786b0652038b8702ae5343">allocator_type</a> typedef</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a7a93d908ea2b967d4a54946a37675e25">allow_duplicates</a></td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [static]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a34d4041f1b3e65a89e73ce9f527b0f41">begin</a>()</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#ad25d2a48e92182db08213676181470c0">begin</a>() const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#aef5dfa6e8d4286e56ea8be50a0c020a7">btree_impl</a> typedef</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#aa00c6e1abb83866bb9c96098808677c9">btree_map</a>(const allocator_type &alloc=allocator_type())</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline, explicit]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a75fc3cca006f9f80e26738761f5f012b">btree_map</a>(const key_compare &kcf, const allocator_type &alloc=allocator_type())</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline, explicit]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a1801d9d4587edf16df5dd97fca4e9d3f">btree_map</a>(InputIterator first, InputIterator last, const allocator_type &alloc=allocator_type())</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a92d53ace52f64ef0488a3df434bc2483">btree_map</a>(InputIterator first, InputIterator last, const key_compare &kcf, const allocator_type &alloc=allocator_type())</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a27d93017393e732c42e73bb1762815af">btree_map</a>(const self &other)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#adb1b413f25e7d25afe782955aeafc66a">bulk_load</a>(Iterator first, Iterator last)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#ad2795fc102f76c2a130681fa579c3310">clear</a>()</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a267163dd98f108686cf17f2604d2bf81">const_iterator</a> typedef</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a581abfef3fb0eab26b2833165f7314b7">const_reverse_iterator</a> typedef</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a96abb2181dae3af81233717c33bcb0e1">count</a>(const key_type &key) const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a76d4185d0ff8a2b0fbb572aad2ee93bb">data_type</a> typedef</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#aa9abe4fe3ec8c3ff40392c9a4fd3d587">debug</a></td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [static]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a8794673d23f9ae4525d84dc01f651309">dump</a>(std::ostream &os) const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#aeae6000acb62e6b13563efe1d1fa1660">empty</a>() const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#ab5c57d291943ba0ca01e5858027e74a0">end</a>()</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#ab0f8eb359766094f2e8d5128e4daf704">end</a>() const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#afd2d85bdaf138d241147f99ea4e02d19">equal_range</a>(const key_type &key)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#aefa6fc135b3f91255e868560461e524d">equal_range</a>(const key_type &key) const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#ad61de6ba3d5a99517d5b36e5024f8fe7">erase</a>(const key_type &key)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a23f1f270183e77c1035b829081ebc8c9">erase</a>(iterator iter)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a99a3bccbdfef9c34596275e3da4da018">erase</a>(iterator, iterator)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a4e44c51baca9a5959bacfe9f78fa3d44">erase_one</a>(const key_type &key)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a0aa2e7bf016864cb2bfe689a5967abf6">exists</a>(const key_type &key) const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a8db4682cc1dc34e2dd95d6ded2e2af65">find</a>(const key_type &key)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a9c5ac09e4fbd11e6b1c106c5d1340281">find</a>(const key_type &key) const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a76fe9e37d2d5c102cc2939a512d441eb">get_allocator</a>() const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#aa5374a517934ddbb6bae7053eeaacad3">get_stats</a>() const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a0b12dfa41eaa744ad5b9ff6edae4de4b">innerslotmax</a></td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [static]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#ac2c8fb3774e84115b1bf403f24afa4b1">insert</a>(const value_type &x)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a851a1e09834069a0554ecdff08796d51">insert</a>(const key_type &key, const data_type &data)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a1c2f94f844ca4193cd4e9dd0f4c89610">insert</a>(iterator hint, const value_type &x)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a783db2843544f7f9f3c3fb498c283d4c">insert</a>(InputIterator first, InputIterator last)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a4468eab4a560f8e59130caf052fe2940">insert2</a>(const key_type &key, const data_type &data)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a68f8b720b175c03ea28d9248dbc7fee5">insert2</a>(iterator hint, const key_type &key, const data_type &data)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a2568bb45a7daa093f6e0c1869c693597">iterator</a> typedef</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#abab498d7a1a6806b11e9be08558451ec">key_comp</a>() const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a7c428c8ee8f8ec5041739f6bb55089c1">key_compare</a> typedef</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#aa0687761c2d71344ad754a98a8650a92">key_type</a> typedef</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a3c005203452c833ae387f7263195631c">leafslotmax</a></td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [static]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a534cf90439e766792a48ff2ab73ddaf6">lower_bound</a>(const key_type &key)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#acdf38e14fcd031d9f315e2bb4d4feff3">lower_bound</a>(const key_type &key) const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#ae0655211e7a2c51312cfaf7b4cd87836">max_size</a>() const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a156a4561d7fe12679b22e3d618a69416">mininnerslots</a></td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [static]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a037f1c67f0a692c34b4408657a708221">minleafslots</a></td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [static]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a5246dc846558507311336980cc81ddcb">operator!=</a>(const self &other) const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#aa9045db3cfebd6e60b0000531a5fdeb6">operator<</a>(const self &other) const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a34082a4270e0f5de6a6c3ba06bd3476a">operator<=</a>(const self &other) const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a77317e7900903cd29f67b548a8d3ed46">operator=</a>(const self &other)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a2fdda35a2a822e8fe45cda8f5f02dd3f">operator==</a>(const self &other) const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a4b4a740ce7e953d1010fcbb6634a0df8">operator></a>(const self &other) const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a04fdaf66979b5191d70d0dfacb601c0b">operator>=</a>(const self &other) const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#ab3268177427359a66c11b7f641bb99ae">operator[]</a>(const key_type &key)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a2ca47ab7ffcd8ee2940c3fdd8690d002">print</a>(std::ostream &os) const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a0170dc9ca200e9e7a91d7a311b22ef0c">print_leaves</a>(std::ostream &os) const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a7163405774d2a2bada3166d94c6fe5d3">rbegin</a>()</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a0c8ee35fbd098077983ac3b74a20cdd2">rbegin</a>() const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a07e9e77ecd8cd828d32bca22a9f45c2a">rend</a>()</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a3745c3bc3523e3671269a5f6bf9fd2de">rend</a>() const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a40d04b8ae97fae9e0a91d75f022a8000">restore</a>(std::istream &is)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a204cd4ff4807b9c35605b1ccc3cb597a">reverse_iterator</a> typedef</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a85feee85c59b090041a84a7641574397">self</a> typedef</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a18eec4e7f698019480bb8d96b1ceabd4">selfverify</a></td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [static]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a4816cbf72826412000ffebf49eae033a">size</a>() const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a4a2f9618a073d016e89cd8f1628caae1">size_type</a> typedef</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a5569e8d5495de8db8cd8c51b5797c9b0">swap</a>(self &from)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#ae6754ad8a27ece08ef50350eb6848e77">traits</a> typedef</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a71462634691fd4ab38cde89991dd8d69">tree</a></td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [private]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a9dd49396431319c3341c4cdcf68385ed">tree_stats</a> typedef</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#af9f856c49318bfc313306f19f1eaf017">upper_bound</a>(const key_type &key)</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#abc8bb5938b3b290089e668c1352625d3">upper_bound</a>(const key_type &key) const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#ae4426f6512a95d1cb6e7cb61e23b7248">value_comp</a>() const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a87d20557ff74243cab447f15e75e2cc0">value_compare</a> typedef</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#abdb0354081cf05ed114f76b09630001e">value_type</a> typedef</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#a5001888f16d9f8fdc634cec05c67f961">verify</a>() const </td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
<tr class="memlist"><td><a class="el" href="a00004.html#acd6d30ce67dc6d665b29cafc8fdb7221">~btree_map</a>()</td><td><a class="el" href="a00004.html">stx::btree_map< _Key, _Data, _Compare, _Traits, _Alloc ></a></td><td><code> [inline]</code></td></tr>
</table></div><!-- contents -->
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark"> </span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark"> </span>Defines</a></div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<hr class="footer"/><address class="footer"><small>
Generated on Sun May 5 2013 23:38:43 for STX B+ Tree Template Classes by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.7.6.1
</small></address>
</body>
</html>