/usr/share/doc/stx-btree-doc/doxygen-html/a00021.html is in stx-btree-doc 0.8.6-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 | <!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"/>
<title>STX B+ Tree Template Classes: stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator Class Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body onload='searchBox.OnSelectItem(0);'>
<!-- Generated by Doxygen 1.7.3 -->
<script type="text/javascript"><!--
var searchBox = new SearchBox("searchBox", "search",false,'Search');
--></script>
<div id="top">
<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.8.6</span></div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</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 id="searchli">
<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="a00002.html">btree</a> </li>
<li class="navelem"><a class="el" href="a00021.html">reverse_iterator</a> </li>
</ul>
</div>
</div>
<div class="header">
<div class="summary">
<a href="#pub-types">Public Types</a> |
<a href="#pub-methods">Public Member Functions</a> |
<a href="#pri-attribs">Private Attributes</a> |
<a href="#friends">Friends</a> </div>
<div class="headertitle">
<h1>stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator Class Reference</h1> </div>
</div>
<div class="contents">
<!-- doxytag: class="stx::btree::reverse_iterator" -->
<p>STL-like mutable reverse iterator object for B+ tree items.
<a href="#_details">More...</a></p>
<p><code>#include <<a class="el" href="a00026_source.html">btree.h</a>></code></p>
<p><a href="a00052.html">List of all members.</a></p>
<table class="memberdecls">
<tr><td colspan="2"><h2><a name="pub-types"></a>
Public Types</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef <a class="el" href="a00002.html#af810ea957b4247a5f10e036f9037a1f5">btree::key_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a9ad3c16ba850b9bddae463abad3fff14">key_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">The key type of the btree. Returned by <a class="el" href="a00021.html#aa539b8ccacade31a39b06f3be5f9dca1" title="Key of the current slot.">key()</a>. <a href="#a9ad3c16ba850b9bddae463abad3fff14"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef <a class="el" href="a00002.html#a6ddb01dade0834e6083b6924cb843382">btree::data_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#ac17fe21141077fd844981e7bc5ab9e19">data_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">The data type of the btree. Returned by <a class="el" href="a00021.html#a2a9fef5ba7487843494e800da41dce98" title="Writable reference to the current data object.">data()</a>. <a href="#ac17fe21141077fd844981e7bc5ab9e19"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef <a class="el" href="a00002.html#ae4f2da0c8b8ae6bf399a83746b6c037a">btree::value_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#ae34305b88b9831fc836852ce6b6a0583">value_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">The value type of the btree. Returned by <a class="el" href="a00021.html#a9a97dfa0a04b0f774352f003c2501b7b" title="Dereference the iterator, this is not a value_type& because key and value are not stored together...">operator*()</a>. <a href="#ae34305b88b9831fc836852ce6b6a0583"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef <a class="el" href="a00002.html#a659c879d43d515dc16f0ba33ab37d655">btree::pair_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a1a697ac5a5e899ae5a47785b56a30bdb">pair_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">The pair type of the btree. <a href="#a1a697ac5a5e899ae5a47785b56a30bdb"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef <a class="el" href="a00021.html#ae34305b88b9831fc836852ce6b6a0583">value_type</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a5295bb7660641f02400ea00c4d34cc41">reference</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Reference to the value_type. STL required. <a href="#a5295bb7660641f02400ea00c4d34cc41"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef <a class="el" href="a00021.html#ae34305b88b9831fc836852ce6b6a0583">value_type</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a80170a433c52680a92900cff5a5c8138">pointer</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Pointer to the value_type. STL required. <a href="#a80170a433c52680a92900cff5a5c8138"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef <br class="typebreak"/>
std::bidirectional_iterator_tag </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a60e084421b5057017a2de3e11230dd22">iterator_category</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">STL-magic iterator category. <a href="#a60e084421b5057017a2de3e11230dd22"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef ptrdiff_t </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a1244a137b86ca73d3a708b6f97eb9b68">difference_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">STL-magic. <a href="#a1244a137b86ca73d3a708b6f97eb9b68"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">typedef <a class="el" href="a00021.html">reverse_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a5345e9df879eaaf81b1b88c635ab4290">self</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Our own type. <a href="#a5345e9df879eaaf81b1b88c635ab4290"></a><br/></td></tr>
<tr><td colspan="2"><h2><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#acb4a128a57e59e30de69360f3088f62f">reverse_iterator</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Default-Constructor of a reverse iterator. <a href="#acb4a128a57e59e30de69360f3088f62f"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a57ff1e5dc47155521415e84e35b95fe7">reverse_iterator</a> (typename <a class="el" href="a00018.html">btree::leaf_node</a> *l, unsigned short s)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Initializing-Constructor of a mutable reverse iterator. <a href="#a57ff1e5dc47155521415e84e35b95fe7"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#ad0fb7f6b370fb8c09e72e1f5fc3d5d34">reverse_iterator</a> (const <a class="el" href="a00017.html">iterator</a> &it)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Copy-constructor from a mutable iterator. <a href="#ad0fb7f6b370fb8c09e72e1f5fc3d5d34"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00021.html#a5295bb7660641f02400ea00c4d34cc41">reference</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a9a97dfa0a04b0f774352f003c2501b7b">operator*</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Dereference the iterator, this is not a value_type& because key and value are not stored together. <a href="#a9a97dfa0a04b0f774352f003c2501b7b"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00021.html#a80170a433c52680a92900cff5a5c8138">pointer</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#aa1914b35927021dd2f5ba540633f6fd2">operator-></a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Dereference the iterator. <a href="#aa1914b35927021dd2f5ba540633f6fd2"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">const <a class="el" href="a00021.html#a9ad3c16ba850b9bddae463abad3fff14">key_type</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#aa539b8ccacade31a39b06f3be5f9dca1">key</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Key of the current slot. <a href="#aa539b8ccacade31a39b06f3be5f9dca1"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00021.html#ac17fe21141077fd844981e7bc5ab9e19">data_type</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a2a9fef5ba7487843494e800da41dce98">data</a> () const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Writable reference to the current data object. <a href="#a2a9fef5ba7487843494e800da41dce98"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00021.html">self</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a5e6c612e9161b3c292fcd0b31db87e55">operator++</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Prefix++ advance the iterator to the next slot. <a href="#a5e6c612e9161b3c292fcd0b31db87e55"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00021.html">self</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a50aaccc29fa0c7e6099add26d8e1664d">operator++</a> (int)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Postfix++ advance the iterator to the next slot. <a href="#a50aaccc29fa0c7e6099add26d8e1664d"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00021.html">self</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a1f990f815e6ed3368f5a49b9eb1f9c34">operator--</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Prefix-- backstep the iterator to the last slot. <a href="#a1f990f815e6ed3368f5a49b9eb1f9c34"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00021.html">self</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a547dc769203b1e290b09d3c4cf923324">operator--</a> (int)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Postfix-- backstep the iterator to the last slot. <a href="#a547dc769203b1e290b09d3c4cf923324"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a6512b83f52af5e9efa03212ca6ebd323">operator==</a> (const <a class="el" href="a00021.html">self</a> &x) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Equality of iterators. <a href="#a6512b83f52af5e9efa03212ca6ebd323"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#af9044a9e54fe7bb3fbfae47b2d894447">operator!=</a> (const <a class="el" href="a00021.html">self</a> &x) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Inequality of iterators. <a href="#af9044a9e54fe7bb3fbfae47b2d894447"></a><br/></td></tr>
<tr><td colspan="2"><h2><a name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00018.html">btree::leaf_node</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a2d39bfef226fdd883967c36bde15fcea">currnode</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">The currently referenced leaf node of the tree. <a href="#a2d39bfef226fdd883967c36bde15fcea"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">unsigned short </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#ac744e46df8b16dc4eac6a3f8fbbdaffb">currslot</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">One slot past the current key/data slot referenced. <a href="#ac744e46df8b16dc4eac6a3f8fbbdaffb"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="el" href="a00021.html#ae34305b88b9831fc836852ce6b6a0583">value_type</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a6fd76e88e8e83f06126967c7bc3325bf">temp_value</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Evil! A temporary value_type to STL-correctly deliver operator* and operator-> <a href="#a6fd76e88e8e83f06126967c7bc3325bf"></a><br/></td></tr>
<tr><td colspan="2"><h2><a name="friends"></a>
Friends</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a67171474c4da6cc8efe0c7fafefd2b2d">iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Friendly to the <a class="el" href="a00011.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a>, so it may access the two data items directly. <a href="#a67171474c4da6cc8efe0c7fafefd2b2d"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#ac220ce1c155db1ac44146c12d178056f">const_iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Also friendly to the <a class="el" href="a00011.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a>, so it may access the two data items directly. <a href="#ac220ce1c155db1ac44146c12d178056f"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="a00021.html#a776e261b45ef26d713a4d105a8d7c240">const_reverse_iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Also friendly to the <a class="el" href="a00011.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a>, so it may access the two data items directly. <a href="#a776e261b45ef26d713a4d105a8d7c240"></a><br/></td></tr>
</table>
<hr/><a name="_details"></a><h2>Detailed Description</h2>
<div class="textblock"><h3>template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>><br/>
class stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator</h3>
<p>STL-like mutable reverse iterator object for B+ tree items. </p>
<p>The iterator points to a specific slot number in a leaf. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00785">785</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
</div><hr/><h2>Member Typedef Documentation</h2>
<a class="anchor" id="ac17fe21141077fd844981e7bc5ab9e19"></a><!-- doxytag: member="stx::btree::reverse_iterator::data_type" ref="ac17fe21141077fd844981e7bc5ab9e19" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="a00002.html#a6ddb01dade0834e6083b6924cb843382">btree::data_type</a> <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::<a class="el" href="a00021.html#ac17fe21141077fd844981e7bc5ab9e19">reverse_iterator::data_type</a></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>The data type of the btree. Returned by <a class="el" href="a00021.html#a2a9fef5ba7487843494e800da41dce98" title="Writable reference to the current data object.">data()</a>. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00794">794</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
</div>
</div>
<a class="anchor" id="a1244a137b86ca73d3a708b6f97eb9b68"></a><!-- doxytag: member="stx::btree::reverse_iterator::difference_type" ref="a1244a137b86ca73d3a708b6f97eb9b68" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef ptrdiff_t <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::<a class="el" href="a00021.html#a1244a137b86ca73d3a708b6f97eb9b68">reverse_iterator::difference_type</a></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>STL-magic. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00812">812</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
</div>
</div>
<a class="anchor" id="a60e084421b5057017a2de3e11230dd22"></a><!-- doxytag: member="stx::btree::reverse_iterator::iterator_category" ref="a60e084421b5057017a2de3e11230dd22" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef std::bidirectional_iterator_tag <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::<a class="el" href="a00021.html#a60e084421b5057017a2de3e11230dd22">reverse_iterator::iterator_category</a></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>STL-magic iterator category. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00809">809</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
</div>
</div>
<a class="anchor" id="a9ad3c16ba850b9bddae463abad3fff14"></a><!-- doxytag: member="stx::btree::reverse_iterator::key_type" ref="a9ad3c16ba850b9bddae463abad3fff14" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="a00002.html#af810ea957b4247a5f10e036f9037a1f5">btree::key_type</a> <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::<a class="el" href="a00021.html#a9ad3c16ba850b9bddae463abad3fff14">reverse_iterator::key_type</a></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>The key type of the btree. Returned by <a class="el" href="a00021.html#aa539b8ccacade31a39b06f3be5f9dca1" title="Key of the current slot.">key()</a>. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00791">791</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
</div>
</div>
<a class="anchor" id="a1a697ac5a5e899ae5a47785b56a30bdb"></a><!-- doxytag: member="stx::btree::reverse_iterator::pair_type" ref="a1a697ac5a5e899ae5a47785b56a30bdb" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="a00002.html#a659c879d43d515dc16f0ba33ab37d655">btree::pair_type</a> <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::<a class="el" href="a00021.html#a1a697ac5a5e899ae5a47785b56a30bdb">reverse_iterator::pair_type</a></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>The pair type of the btree. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00800">800</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
</div>
</div>
<a class="anchor" id="a80170a433c52680a92900cff5a5c8138"></a><!-- doxytag: member="stx::btree::reverse_iterator::pointer" ref="a80170a433c52680a92900cff5a5c8138" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="a00021.html#ae34305b88b9831fc836852ce6b6a0583">value_type</a>* <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::<a class="el" href="a00021.html#a80170a433c52680a92900cff5a5c8138">reverse_iterator::pointer</a></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Pointer to the value_type. STL required. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00806">806</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
</div>
</div>
<a class="anchor" id="a5295bb7660641f02400ea00c4d34cc41"></a><!-- doxytag: member="stx::btree::reverse_iterator::reference" ref="a5295bb7660641f02400ea00c4d34cc41" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="a00021.html#ae34305b88b9831fc836852ce6b6a0583">value_type</a>& <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::<a class="el" href="a00021.html#a5295bb7660641f02400ea00c4d34cc41">reverse_iterator::reference</a></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Reference to the value_type. STL required. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00803">803</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
</div>
</div>
<a class="anchor" id="a5345e9df879eaaf81b1b88c635ab4290"></a><!-- doxytag: member="stx::btree::reverse_iterator::self" ref="a5345e9df879eaaf81b1b88c635ab4290" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="a00021.html">reverse_iterator</a> <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::<a class="el" href="a00021.html">reverse_iterator::self</a></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Our own type. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00815">815</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
</div>
</div>
<a class="anchor" id="ae34305b88b9831fc836852ce6b6a0583"></a><!-- doxytag: member="stx::btree::reverse_iterator::value_type" ref="ae34305b88b9831fc836852ce6b6a0583" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="a00002.html#ae4f2da0c8b8ae6bf399a83746b6c037a">btree::value_type</a> <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::<a class="el" href="a00021.html#ae34305b88b9831fc836852ce6b6a0583">reverse_iterator::value_type</a></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>The value type of the btree. Returned by <a class="el" href="a00021.html#a9a97dfa0a04b0f774352f003c2501b7b" title="Dereference the iterator, this is not a value_type& because key and value are not stored together...">operator*()</a>. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00797">797</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
</div>
</div>
<hr/><h2>Constructor & Destructor Documentation</h2>
<a class="anchor" id="acb4a128a57e59e30de69360f3088f62f"></a><!-- doxytag: member="stx::btree::reverse_iterator::reverse_iterator" ref="acb4a128a57e59e30de69360f3088f62f" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::reverse_iterator </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Default-Constructor of a reverse iterator. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00848">848</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
</div>
</div>
<a class="anchor" id="a57ff1e5dc47155521415e84e35b95fe7"></a><!-- doxytag: member="stx::btree::reverse_iterator::reverse_iterator" ref="a57ff1e5dc47155521415e84e35b95fe7" args="(typename btree::leaf_node *l, unsigned short s)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::reverse_iterator </td>
<td>(</td>
<td class="paramtype">typename <a class="el" href="a00018.html">btree::leaf_node</a> * </td>
<td class="paramname"><em>l</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned short </td>
<td class="paramname"><em>s</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Initializing-Constructor of a mutable reverse iterator. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00853">853</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
</div>
</div>
<a class="anchor" id="ad0fb7f6b370fb8c09e72e1f5fc3d5d34"></a><!-- doxytag: member="stx::btree::reverse_iterator::reverse_iterator" ref="ad0fb7f6b370fb8c09e72e1f5fc3d5d34" args="(const iterator &it)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::reverse_iterator </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a00017.html">iterator</a> & </td>
<td class="paramname"><em>it</em></td><td>)</td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Copy-constructor from a mutable iterator. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00858">858</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
</div>
</div>
<hr/><h2>Member Function Documentation</h2>
<a class="anchor" id="a2a9fef5ba7487843494e800da41dce98"></a><!-- doxytag: member="stx::btree::reverse_iterator::data" ref="a2a9fef5ba7487843494e800da41dce98" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00021.html#ac17fe21141077fd844981e7bc5ab9e19">data_type</a>& <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::data </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Writable reference to the current data object. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00891">891</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
<p>References <a class="el" href="a00026_source.html#l00048">BTREE_ASSERT</a>, <a class="el" href="a00026_source.html#l00821">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currnode</a>, <a class="el" href="a00026_source.html#l00824">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currslot</a>, and <a class="el" href="a00026_source.html#l00304">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::leaf_node::slotdata</a>.</p>
</div>
</div>
<a class="anchor" id="aa539b8ccacade31a39b06f3be5f9dca1"></a><!-- doxytag: member="stx::btree::reverse_iterator::key" ref="aa539b8ccacade31a39b06f3be5f9dca1" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">const <a class="el" href="a00021.html#a9ad3c16ba850b9bddae463abad3fff14">key_type</a>& <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::key </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Key of the current slot. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00884">884</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
<p>References <a class="el" href="a00026_source.html#l00048">BTREE_ASSERT</a>, <a class="el" href="a00026_source.html#l00821">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currnode</a>, <a class="el" href="a00026_source.html#l00824">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currslot</a>, and <a class="el" href="a00026_source.html#l00301">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::leaf_node::slotkey</a>.</p>
</div>
</div>
<a class="anchor" id="af9044a9e54fe7bb3fbfae47b2d894447"></a><!-- doxytag: member="stx::btree::reverse_iterator::operator!=" ref="af9044a9e54fe7bb3fbfae47b2d894447" args="(const self &x) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator!= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a00021.html">self</a> & </td>
<td class="paramname"><em>x</em></td><td>)</td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Inequality of iterators. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00980">980</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
<p>References <a class="el" href="a00026_source.html#l00821">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currnode</a>, and <a class="el" href="a00026_source.html#l00824">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currslot</a>.</p>
</div>
</div>
<a class="anchor" id="a9a97dfa0a04b0f774352f003c2501b7b"></a><!-- doxytag: member="stx::btree::reverse_iterator::operator*" ref="a9a97dfa0a04b0f774352f003c2501b7b" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00021.html#a5295bb7660641f02400ea00c4d34cc41">reference</a> <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator* </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Dereference the iterator, this is not a value_type& because key and value are not stored together. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00864">864</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
<p>References <a class="el" href="a00026_source.html#l00048">BTREE_ASSERT</a>, <a class="el" href="a00026_source.html#l00821">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currnode</a>, <a class="el" href="a00026_source.html#l00824">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currslot</a>, <a class="el" href="a00026_source.html#l00304">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::leaf_node::slotdata</a>, <a class="el" href="a00026_source.html#l00301">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::leaf_node::slotkey</a>, and <a class="el" href="a00026_source.html#l00837">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::temp_value</a>.</p>
</div>
</div>
<a class="anchor" id="a5e6c612e9161b3c292fcd0b31db87e55"></a><!-- doxytag: member="stx::btree::reverse_iterator::operator++" ref="a5e6c612e9161b3c292fcd0b31db87e55" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00021.html">self</a>& <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator++ </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Prefix++ advance the iterator to the next slot. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00898">898</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
<p>References <a class="el" href="a00026_source.html#l00821">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currnode</a>, <a class="el" href="a00026_source.html#l00824">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currslot</a>, <a class="el" href="a00026_source.html#l00295">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::leaf_node::prevleaf</a>, and <a class="el" href="a00026_source.html#l00232">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node::slotuse</a>.</p>
</div>
</div>
<a class="anchor" id="a50aaccc29fa0c7e6099add26d8e1664d"></a><!-- doxytag: member="stx::btree::reverse_iterator::operator++" ref="a50aaccc29fa0c7e6099add26d8e1664d" args="(int)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00021.html">self</a> <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator++ </td>
<td>(</td>
<td class="paramtype">int </td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Postfix++ advance the iterator to the next slot. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00916">916</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
<p>References <a class="el" href="a00026_source.html#l00821">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currnode</a>, <a class="el" href="a00026_source.html#l00824">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currslot</a>, <a class="el" href="a00026_source.html#l00295">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::leaf_node::prevleaf</a>, and <a class="el" href="a00026_source.html#l00232">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node::slotuse</a>.</p>
</div>
</div>
<a class="anchor" id="a1f990f815e6ed3368f5a49b9eb1f9c34"></a><!-- doxytag: member="stx::btree::reverse_iterator::operator--" ref="a1f990f815e6ed3368f5a49b9eb1f9c34" args="()" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00021.html">self</a>& <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator-- </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Prefix-- backstep the iterator to the last slot. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00936">936</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
<p>References <a class="el" href="a00026_source.html#l00821">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currnode</a>, <a class="el" href="a00026_source.html#l00824">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currslot</a>, <a class="el" href="a00026_source.html#l00298">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::leaf_node::nextleaf</a>, and <a class="el" href="a00026_source.html#l00232">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node::slotuse</a>.</p>
</div>
</div>
<a class="anchor" id="a547dc769203b1e290b09d3c4cf923324"></a><!-- doxytag: member="stx::btree::reverse_iterator::operator--" ref="a547dc769203b1e290b09d3c4cf923324" args="(int)" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00021.html">self</a> <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator-- </td>
<td>(</td>
<td class="paramtype">int </td>
<td class="paramname"></td><td>)</td>
<td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Postfix-- backstep the iterator to the last slot. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00954">954</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
<p>References <a class="el" href="a00026_source.html#l00821">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currnode</a>, <a class="el" href="a00026_source.html#l00824">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currslot</a>, <a class="el" href="a00026_source.html#l00298">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::leaf_node::nextleaf</a>, and <a class="el" href="a00026_source.html#l00232">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node::slotuse</a>.</p>
</div>
</div>
<a class="anchor" id="aa1914b35927021dd2f5ba540633f6fd2"></a><!-- doxytag: member="stx::btree::reverse_iterator::operator->" ref="aa1914b35927021dd2f5ba540633f6fd2" args="() const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00021.html#a80170a433c52680a92900cff5a5c8138">pointer</a> <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator-> </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Dereference the iterator. </p>
<p>Do not use this if possible, use <a class="el" href="a00021.html#aa539b8ccacade31a39b06f3be5f9dca1" title="Key of the current slot.">key()</a> and <a class="el" href="a00021.html#a2a9fef5ba7487843494e800da41dce98" title="Writable reference to the current data object.">data()</a> instead. The B+ tree does not stored key and data together. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00875">875</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
<p>References <a class="el" href="a00026_source.html#l00048">BTREE_ASSERT</a>, <a class="el" href="a00026_source.html#l00821">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currnode</a>, <a class="el" href="a00026_source.html#l00824">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currslot</a>, <a class="el" href="a00026_source.html#l00304">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::leaf_node::slotdata</a>, <a class="el" href="a00026_source.html#l00301">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::leaf_node::slotkey</a>, and <a class="el" href="a00026_source.html#l00837">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::temp_value</a>.</p>
</div>
</div>
<a class="anchor" id="a6512b83f52af5e9efa03212ca6ebd323"></a><!-- doxytag: member="stx::btree::reverse_iterator::operator==" ref="a6512b83f52af5e9efa03212ca6ebd323" args="(const self &x) const " -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator== </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a00021.html">self</a> & </td>
<td class="paramname"><em>x</em></td><td>)</td>
<td> const<code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Equality of iterators. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00974">974</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
<p>References <a class="el" href="a00026_source.html#l00821">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currnode</a>, and <a class="el" href="a00026_source.html#l00824">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::currslot</a>.</p>
</div>
</div>
<hr/><h2>Friends And Related Function Documentation</h2>
<a class="anchor" id="ac220ce1c155db1ac44146c12d178056f"></a><!-- doxytag: member="stx::btree::reverse_iterator::const_iterator" ref="ac220ce1c155db1ac44146c12d178056f" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">friend class <a class="el" href="a00011.html">const_iterator</a><code> [friend]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Also friendly to the <a class="el" href="a00011.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a>, so it may access the two data items directly. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00830">830</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
</div>
</div>
<a class="anchor" id="a776e261b45ef26d713a4d105a8d7c240"></a><!-- doxytag: member="stx::btree::reverse_iterator::const_reverse_iterator" ref="a776e261b45ef26d713a4d105a8d7c240" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">friend class <a class="el" href="a00012.html">const_reverse_iterator</a><code> [friend]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Also friendly to the <a class="el" href="a00011.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a>, so it may access the two data items directly. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00833">833</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
</div>
</div>
<a class="anchor" id="a67171474c4da6cc8efe0c7fafefd2b2d"></a><!-- doxytag: member="stx::btree::reverse_iterator::iterator" ref="a67171474c4da6cc8efe0c7fafefd2b2d" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">friend class <a class="el" href="a00017.html">iterator</a><code> [friend]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Friendly to the <a class="el" href="a00011.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a>, so it may access the two data items directly. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00827">827</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
</div>
</div>
<hr/><h2>Member Data Documentation</h2>
<a class="anchor" id="a2d39bfef226fdd883967c36bde15fcea"></a><!-- doxytag: member="stx::btree::reverse_iterator::currnode" ref="a2d39bfef226fdd883967c36bde15fcea" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00018.html">btree::leaf_node</a>* <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::<a class="el" href="a00021.html#a2d39bfef226fdd883967c36bde15fcea">reverse_iterator::currnode</a><code> [private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>The currently referenced leaf node of the tree. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00821">821</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
<p>Referenced by <a class="el" href="a00026_source.html#l00891">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::data()</a>, <a class="el" href="a00026_source.html#l00884">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::key()</a>, <a class="el" href="a00026_source.html#l00980">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator!=()</a>, <a class="el" href="a00026_source.html#l00864">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator*()</a>, <a class="el" href="a00026_source.html#l00898">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator++()</a>, <a class="el" href="a00026_source.html#l00936">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator--()</a>, <a class="el" href="a00026_source.html#l00875">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator->()</a>, and <a class="el" href="a00026_source.html#l00974">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator==()</a>.</p>
</div>
</div>
<a class="anchor" id="ac744e46df8b16dc4eac6a3f8fbbdaffb"></a><!-- doxytag: member="stx::btree::reverse_iterator::currslot" ref="ac744e46df8b16dc4eac6a3f8fbbdaffb" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname">unsigned short <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::<a class="el" href="a00021.html#ac744e46df8b16dc4eac6a3f8fbbdaffb">reverse_iterator::currslot</a><code> [private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>One slot past the current key/data slot referenced. </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00824">824</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
<p>Referenced by <a class="el" href="a00026_source.html#l00891">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::data()</a>, <a class="el" href="a00026_source.html#l00884">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::key()</a>, <a class="el" href="a00026_source.html#l00980">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator!=()</a>, <a class="el" href="a00026_source.html#l00864">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator*()</a>, <a class="el" href="a00026_source.html#l00898">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator++()</a>, <a class="el" href="a00026_source.html#l00936">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator--()</a>, <a class="el" href="a00026_source.html#l00875">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator->()</a>, and <a class="el" href="a00026_source.html#l00974">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator==()</a>.</p>
</div>
</div>
<a class="anchor" id="a6fd76e88e8e83f06126967c7bc3325bf"></a><!-- doxytag: member="stx::btree::reverse_iterator::temp_value" ref="a6fd76e88e8e83f06126967c7bc3325bf" args="" -->
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>> </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00021.html#ae34305b88b9831fc836852ce6b6a0583">value_type</a> <a class="el" href="a00002.html">stx::btree</a>< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::<a class="el" href="a00021.html#a6fd76e88e8e83f06126967c7bc3325bf">reverse_iterator::temp_value</a><code> [mutable, private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Evil! A temporary value_type to STL-correctly deliver operator* and operator-> </p>
<p>Definition at line <a class="el" href="a00026_source.html#l00837">837</a> of file <a class="el" href="a00026_source.html">btree.h</a>.</p>
<p>Referenced by <a class="el" href="a00026_source.html#l00864">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator*()</a>, and <a class="el" href="a00026_source.html#l00875">stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator->()</a>.</p>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>stx/<a class="el" href="a00026_source.html">btree.h</a></li>
</ul>
</div>
<!--- 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="" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<hr class="footer"/><address class="footer"><small>Generated on Wed May 18 2011 10:12:05 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.3 </small></address>
</body>
</html>
|