This file is indexed.

/usr/share/doc/libsparsehash-dev/html/sparsetable.html is in libsparsehash-dev 2.0.2-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
 802
 803
 804
 805
 806
 807
 808
 809
 810
 811
 812
 813
 814
 815
 816
 817
 818
 819
 820
 821
 822
 823
 824
 825
 826
 827
 828
 829
 830
 831
 832
 833
 834
 835
 836
 837
 838
 839
 840
 841
 842
 843
 844
 845
 846
 847
 848
 849
 850
 851
 852
 853
 854
 855
 856
 857
 858
 859
 860
 861
 862
 863
 864
 865
 866
 867
 868
 869
 870
 871
 872
 873
 874
 875
 876
 877
 878
 879
 880
 881
 882
 883
 884
 885
 886
 887
 888
 889
 890
 891
 892
 893
 894
 895
 896
 897
 898
 899
 900
 901
 902
 903
 904
 905
 906
 907
 908
 909
 910
 911
 912
 913
 914
 915
 916
 917
 918
 919
 920
 921
 922
 923
 924
 925
 926
 927
 928
 929
 930
 931
 932
 933
 934
 935
 936
 937
 938
 939
 940
 941
 942
 943
 944
 945
 946
 947
 948
 949
 950
 951
 952
 953
 954
 955
 956
 957
 958
 959
 960
 961
 962
 963
 964
 965
 966
 967
 968
 969
 970
 971
 972
 973
 974
 975
 976
 977
 978
 979
 980
 981
 982
 983
 984
 985
 986
 987
 988
 989
 990
 991
 992
 993
 994
 995
 996
 997
 998
 999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
<HTML>
<!-- The API of this class and the documentation -- but not the
     implementation! -- are based on that for SGI's hash_set class:
  -->
<!--
  -- Copyright (c) 1996-1999
  -- Silicon Graphics Computer Systems, Inc.
  --
  -- Permission to use, copy, modify, distribute and sell this software
  -- and its documentation for any purpose is hereby granted without fee,
  -- provided that the above copyright notice appears in all copies and
  -- that both that copyright notice and this permission notice appear
  -- in supporting documentation.  Silicon Graphics makes no
  -- representations about the suitability of this software for any
  -- purpose.  It is provided "as is" without express or implied warranty.
  --
  -- Copyright (c) 1994
  -- Hewlett-Packard Company
  --
  -- Permission to use, copy, modify, distribute and sell this software
  -- and its documentation for any purpose is hereby granted without fee,
  -- provided that the above copyright notice appears in all copies and
  -- that both that copyright notice and this permission notice appear
  -- in supporting documentation.  Hewlett-Packard Company makes no
  -- representations about the suitability of this software for any
  -- purpose.  It is provided "as is" without express or implied warranty.
  --
  -->

<HEAD>
<Title>sparsetable&lt;T, GROUP_SIZE&gt;</Title>
</HEAD>

<BODY>

<p><i>[Note: this document is formatted similarly to the SGI STL
implementation documentation pages, and refers to concepts and classes
defined there.  However, neither this document nor the code it
describes is associated with SGI, nor is it necessary to have SGI's
STL implementation installed in order to use this class.]</i></p>

<H1>sparsetable&lt;T, GROUP_SIZE&gt;</H1>

<p>A <tt>sparsetable</tt> is a <A
href="http://www.sgi.com/tech/stl/RandomAccessContainer.html">Random
Access Container</A> that supports constant time random access to
elements, and constant time insertion and removal of elements.  It
implements the "array" or "table" abstract data type.  The number of
elements in a <tt>sparsetable</tt> is set at constructor time, though
you can change it at any time by calling <tt>resize()</tt>.</p>

<p><tt>sparsetable</tt> is distinguished from other array
implementations, including the default C implementation, in its stingy
use of memory -- in particular, unused array elements require only 1 bit
of disk space to store, rather than <tt>sizeof(T)</tt> bytes -- and by
the ability to save and restore contents to disk.  On the other hand,
this array implementation, while still efficient, is slower than other
array implementations.</p>

<A NAME="assigned">
<p>A <tt>sparsetable</tt> distinguishes between table elements that
have been <i>assigned</i> and those that are <i>unassigned</i>.
Assigned table elements are those that have had a value set via
<tt>set()</tt>, <tt>operator()</tt>, assignment via an iterator, and
so forth.  Unassigned table elements are those that have not had a
value set in one of these ways, or that have been explicitly
unassigned via a call to <tt>erase()</tt> or <tt>clear()</tt>.  Lookup
is valid on both assigned and unassigned table elements; for
unassigned elements, lookup returns the default value
<tt>T()</tt>.</p>
</A>

<p>This class is appropriate for applications that need to store large
arrays in memory, or for applications that need these arrays to be
persistent.</p>


<h3>Example</h3>

<pre>
#include &lt;sparsehash/sparsetable&gt;

using google::sparsetable;      // namespace where class lives by default

sparsetable&lt;int&gt; t(100);
t[5] = 6;
cout &lt;&lt; "t[5] = " &lt;&lt t[5];
cout &lt;&lt; "Default value = " &lt;&lt t[99];
</pre>


<h3>Definition</h3>

Defined in the header <A href="sparsetable">sparsetable</A>.  This
class is not part of the C++ standard.


<h3>Template parameters</h3>

<table border>
<TR><TH>Parameter</TH><TH>Description</TH><TH>Default</TH></TR>

<TR>
<TD VAlign=top>
   <tt>T</tt>
</TD>
<TD VAlign=top>
   The sparsetable's value type: the type of object that is stored in
   the table.
</TD>
<TD VAlign=top>
   &nbsp;
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>GROUP_SIZE</tt>
</TD>
<TD VAlign=top>
   The number of elements in each sparsetable group (see <A
   HREF="implementation.html">the implementation doc</A> for more details
   on this value).  This almost never need be specified; the default
   template parameter value works well in all situations.
</TD>
<TD VAlign=top>
   &nbsp;
</TD>
</TR>

</table>


<h3>Model of</h3>

<A href="http://www.sgi.com/tech/stl/RandomAccessContainer.html">Random Access Container</A>


<h3>Type requirements</h3>

None, except for those imposed by the requirements of 
<A
href="http://www.sgi.com/tech/stl/RandomAccessContainer.html">Random
Access Container</A>


<h3>Public base classes</h3>

None.


<h3>Members</h3>

<table border>
<TR><TH>Member</TH><TH>Where defined</TH><TH>Description</TH></TR>

<TR>
<TD VAlign=top>
   <tt>value_type</tt>
</TD>
<TD VAlign=top>
   <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   The type of object, <tt>T</tt>, stored in the table.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>pointer</tt>
</TD>
<TD VAlign=top>
   <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   Pointer to <tt>T</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>reference</tt>
</TD>
<TD VAlign=top>
   <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   Reference to <tt>T</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_reference</tt>
</TD>
<TD VAlign=top>
   <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   Const reference to <tt>T</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>size_type</tt>
</TD>
<TD VAlign=top>
   <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   An unsigned integral type.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>difference_type</tt>
</TD>
<TD VAlign=top>
   <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   A signed integral type.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>iterator</tt>
</TD>
<TD VAlign=top>
   <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   Iterator used to iterate through a <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_iterator</tt>
</TD>
<TD VAlign=top>
   <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   Const iterator used to iterate through a <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>reverse_iterator</tt>
</TD>
<TD VAlign=top>
   <A
   href="http://www.sgi.com/tech/stl/ReversibleContainer.html">Reversible
   Container</A>
</TD>
<TD VAlign=top>
   Iterator used to iterate backwards through a <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_reverse_iterator</tt>
</TD>
<TD VAlign=top>
   <A
   href="http://www.sgi.com/tech/stl/ReversibleContainer.html">Reversible
   Container</A>
</TD>
<TD VAlign=top>
   Const iterator used to iterate backwards through a
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>nonempty_iterator</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Iterator used to iterate through the
   <A HREF="#assigned">assigned</A> elements of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_nonempty_iterator</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Const iterator used to iterate through the
   <A HREF="#assigned">assigned</A> elements of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>reverse_nonempty_iterator</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Iterator used to iterate backwards through the
   <A HREF="#assigned">assigned</A> elements of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_reverse_nonempty_iterator</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Const iterator used to iterate backwards through the
   <A HREF="#assigned">assigned</A> elements of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>destructive_iterator</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Iterator used to iterate through the
   <A HREF="#assigned">assigned</A> elements of the
   <tt>sparsetable</tt>, erasing elements as it iterates.
   <A href="#1">[1]</A>
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>iterator begin()</tt>
</TD>
<TD VAlign=top>
   <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   Returns an <tt>iterator</tt> pointing to the beginning of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>iterator end()</tt>
</TD>
<TD VAlign=top>
    <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   Returns an <tt>iterator</tt> pointing to the end of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_iterator begin() const</tt>
</TD>
<TD VAlign=top>
    <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   Returns an <tt>const_iterator</tt> pointing to the beginning of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_iterator end() const</tt>
</TD>
<TD VAlign=top>
    <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   Returns an <tt>const_iterator</tt> pointing to the end of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>reverse_iterator rbegin()</tt>
</TD>
<TD VAlign=top>
   <A
   href="http://www.sgi.com/tech/stl/ReversibleContainer.html">Reversible
   Container</A>
</TD>
<TD VAlign=top>
   Returns a <tt>reverse_iterator</tt> pointing to the beginning of the
   reversed <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>reverse_iterator rend()</tt>
</TD>
<TD VAlign=top>
   <A
   href="http://www.sgi.com/tech/stl/ReversibleContainer.html">Reversible
   Container</A>
</TD>
<TD VAlign=top>
   Returns a <tt>reverse_iterator</tt> pointing to the end of the
   reversed <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_reverse_iterator rbegin() const</tt>
</TD>
<TD VAlign=top>
   <A
   href="http://www.sgi.com/tech/stl/ReversibleContainer.html">Reversible
   Container</A>
</TD>
<TD VAlign=top>
   Returns a <tt>const_reverse_iterator</tt> pointing to the beginning
   of the reversed <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_reverse_iterator rend() const</tt>
</TD>
<TD VAlign=top>
   <A
   href="http://www.sgi.com/tech/stl/ReversibleContainer.html">Reversible
   Container</A>
</TD>
<TD VAlign=top>
   Returns a <tt>const_reverse_iterator</tt> pointing to the end of
   the reversed <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>nonempty_iterator nonempty_begin()</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>nonempty_iterator</tt> pointing to the first
   <A HREF="#assigned">assigned</A> element of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>nonempty_iterator nonempty_end()</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>nonempty_iterator</tt> pointing to the end of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_nonempty_iterator nonempty_begin() const</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>const_nonempty_iterator</tt> pointing to the first
   <A HREF="#assigned">assigned</A> element of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_nonempty_iterator nonempty_end() const</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>const_nonempty_iterator</tt> pointing to the end of
   the <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>reverse_nonempty_iterator nonempty_rbegin()</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>reverse_nonempty_iterator</tt> pointing to the first
   <A HREF="#assigned">assigned</A> element of the reversed
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>reverse_nonempty_iterator nonempty_rend()</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>reverse_nonempty_iterator</tt> pointing to the end of
   the reversed <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_reverse_nonempty_iterator nonempty_rbegin() const</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>const_reverse_nonempty_iterator</tt> pointing to the
   first <A HREF="#assigned">assigned</A> element of the reversed
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_reverse_nonempty_iterator nonempty_rend() const</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>const_reverse_nonempty_iterator</tt> pointing to the
   end of the reversed <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>destructive_iterator destructive_begin()</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>destructive_iterator</tt> pointing to the first
   <A HREF="#assigned">assigned</A> element of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>destructive_iterator destructive_end()</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>destructive_iterator</tt> pointing to the end of
   the <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>size_type size() const</tt>
</TD>
<TD VAlign=top>
    <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   Returns the size of the <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>size_type max_size() const</tt>
</TD>
<TD VAlign=top>
    <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   Returns the largest possible size of the <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>bool empty() const</tt>
</TD>
<TD VAlign=top>
    <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   <tt>true</tt> if the <tt>sparsetable</tt>'s size is <tt>0</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>size_type num_nonempty() const</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Returns the number of sparsetable elements that are currently <A
   HREF="#assigned">assigned</A>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>sparsetable(size_type n)</tt>
</TD>
<TD VAlign=top>
    <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   Creates a <tt>sparsetable</tt> with <tt>n</tt> elements.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>sparsetable(const sparsetable&amp;)</tt>
</TD>
<TD VAlign=top>
    <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   The copy constructor.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>~sparsetable()</tt>
</TD>
<TD VAlign=top>
    <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   The destructor.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>sparsetable&amp; operator=(const sparsetable&amp;)</tt>
</TD>
<TD VAlign=top>
    <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   The assignment operator
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>void swap(sparsetable&amp;)</tt>
</TD>
<TD VAlign=top>
    <A href="http://www.sgi.com/tech/stl/Container.html">Container</A>
</TD>
<TD VAlign=top>
   Swaps the contents of two sparsetables.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>reference operator[](size_type n)</tt>
</TD>
<TD VAlign=top>
    <A
    href="http://www.sgi.com/tech/stl/RandomAccessContainer.html">Random
    Access Container</A>
</TD>
<TD VAlign=top>
   Returns the <tt>n</tt>'th element.  <A href="#2">[2]</A>
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_reference operator[](size_type n) const</tt>
</TD>
<TD VAlign=top>
    <A
    href="http://www.sgi.com/tech/stl/RandomAccessContainer.html">Random
    Access Container</A>
</TD>
<TD VAlign=top>
   Returns the <tt>n</tt>'th element.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>bool test(size_type i) const</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   true if the <tt>i</tt>'th element of the <tt>sparsetable</tt> is <A
   HREF="#assigned">assigned</A>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>bool test(iterator pos) const</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   true if the <tt>sparsetable</tt> element pointed to by <tt>pos</tt>
   is <A HREF="#assigned">assigned</A>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>bool test(const_iterator pos) const</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   true if the <tt>sparsetable</tt> element pointed to by <tt>pos</tt>
   is <A HREF="#assigned">assigned</A>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_reference get(size_type i) const</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   returns the <tt>i</tt>'th element of the <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>reference set(size_type i, const_reference val)</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Sets the <tt>i</tt>'th element of the <tt>sparsetable</tt> to value
   <tt>val</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>void erase(size_type i)</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Erases the <tt>i</tt>'th element of the <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>void erase(iterator pos)</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Erases the element of the <tt>sparsetable</tt> pointed to by
   <tt>pos</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>void erase(iterator first, iterator last)</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Erases the elements of the <tt>sparsetable</tt> in the range
   <tt>[first, last)</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>void clear()</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Erases all of the elements.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>void resize(size_type n)</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   Changes the size of sparsetable to <tt>n</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>bool write_metadata(FILE *fp)</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   See below.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>bool read_metadata(FILE *fp)</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   See below.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>bool write_nopointer_data(FILE *fp)</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   See below.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>bool read_nopointer_data(FILE *fp)</tt>
</TD>
<TD VAlign=top>
   <tt>sparsetable</tt>
</TD>
<TD VAlign=top>
   See below.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <pre>bool operator==(const sparsetable&amp;, const sparsetable&amp;)
</pre>
</TD>
<TD VAlign=top>
    <A
    href="http://www.sgi.com/tech/stl/ForwardContainer.html">Forward
    Container</A>
</TD>
<TD VAlign=top>
   Tests two sparsetables for equality.  This is a global function,
   not a member function.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <pre>bool operator&lt;(const sparsetable&amp;, const sparsetable&amp;)
</pre>
</TD>
<TD VAlign=top>
    <A
    href="http://www.sgi.com/tech/stl/ForwardContainer.html">Forward
    Container</A>
</TD>
<TD VAlign=top>
   Lexicographical comparison.  This is a global function,
   not a member function.
</TD>
</TR>

</table>


<h3>New members</h3>

These members are not defined in the <A
href="http://www.sgi.com/tech/stl/RandomAccessContainer.html">Random
Access Container</A> requirement, but are specific to
<tt>sparsetable</tt>.

<table border>
<TR><TH>Member</TH><TH>Description</TH></TR>

<TR>
<TD VAlign=top>
   <tt>nonempty_iterator</tt>
</TD>
<TD VAlign=top>
   Iterator used to iterate through the
   <A HREF="#assigned">assigned</A> elements of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_nonempty_iterator</tt>
</TD>
<TD VAlign=top>
   Const iterator used to iterate through the
   <A HREF="#assigned">assigned</A> elements of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>reverse_nonempty_iterator</tt>
</TD>
<TD VAlign=top>
   Iterator used to iterate backwards through the
   <A HREF="#assigned">assigned</A> elements of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_reverse_nonempty_iterator</tt>
</TD>
<TD VAlign=top>
   Const iterator used to iterate backwards through the
   <A HREF="#assigned">assigned</A> elements of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>destructive_iterator</tt>
</TD>
<TD VAlign=top>
   Iterator used to iterate through the
   <A HREF="#assigned">assigned</A> elements of the
   <tt>sparsetable</tt>, erasing elements as it iterates.
   <A href="#1">[1]</A>
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>nonempty_iterator nonempty_begin()</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>nonempty_iterator</tt> pointing to the first
   <A HREF="#assigned">assigned</A> element of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>nonempty_iterator nonempty_end()</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>nonempty_iterator</tt> pointing to the end of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_nonempty_iterator nonempty_begin() const</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>const_nonempty_iterator</tt> pointing to the first
   <A HREF="#assigned">assigned</A> element of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_nonempty_iterator nonempty_end() const</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>const_nonempty_iterator</tt> pointing to the end of
   the <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>reverse_nonempty_iterator nonempty_rbegin()</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>reverse_nonempty_iterator</tt> pointing to the first
   <A HREF="#assigned">assigned</A> element of the reversed
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>reverse_nonempty_iterator nonempty_rend()</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>reverse_nonempty_iterator</tt> pointing to the end of
   the reversed <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_reverse_nonempty_iterator nonempty_rbegin() const</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>const_reverse_nonempty_iterator</tt> pointing to the
   first <A HREF="#assigned">assigned</A> element of the reversed
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_reverse_nonempty_iterator nonempty_rend() const</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>const_reverse_nonempty_iterator</tt> pointing to the
   end of the reversed <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>destructive_iterator destructive_begin()</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>destructive_iterator</tt> pointing to the first
   <A HREF="#assigned">assigned</A> element of the
   <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>destructive_iterator destructive_end()</tt>
</TD>
<TD VAlign=top>
   Returns a <tt>destructive_iterator</tt> pointing to the end of
   the <tt>sparsetable</tt>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>size_type num_nonempty() const</tt>
</TD>
<TD VAlign=top>
   Returns the number of sparsetable elements that are currently <A
   HREF="#assigned">assigned</A>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>bool test(size_type i) const</tt>
</TD>
<TD VAlign=top>
   true if the <tt>i</tt>'th element of the <tt>sparsetable</tt> is <A
   HREF="#assigned">assigned</A>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>bool test(iterator pos) const</tt>
</TD>
<TD VAlign=top>
   true if the <tt>sparsetable</tt> element pointed to by <tt>pos</tt>
   is <A HREF="#assigned">assigned</A>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>bool test(const_iterator pos) const</tt>
</TD>
<TD VAlign=top>
   true if the <tt>sparsetable</tt> element pointed to by <tt>pos</tt>
   is <A HREF="#assigned">assigned</A>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>const_reference get(size_type i) const</tt>
</TD>
<TD VAlign=top>
   returns the <tt>i</tt>'th element of the <tt>sparsetable</tt>.  If
   the <tt>i</tt>'th element is <A HREF="#assigned">assigned</A>, the
   assigned value is returned, otherwise, the default value
   <tt>T()</tt> is returned.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>reference set(size_type i, const_reference val)</tt>
</TD>
<TD VAlign=top>
   Sets the <tt>i</tt>'th element of the <tt>sparsetable</tt> to value
   <tt>val</tt>, and returns a reference to the <tt>i</tt>'th element
   of the table.  This operation causes the <tt>i</tt>'th element to
   be <A HREF="#assigned">assigned</A>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>void erase(size_type i)</tt>
</TD>
<TD VAlign=top>
   Erases the <tt>i</tt>'th element of the <tt>sparsetable</tt>.  This
   operation causes the <tt>i</tt>'th element to be <A
   HREF="#assigned">unassigned</A>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>void erase(iterator pos)</tt>
</TD>
<TD VAlign=top>
   Erases the element of the <tt>sparsetable</tt> pointed to by
   <tt>pos</tt>.  This operation causes the <tt>i</tt>'th element to
   be <A HREF="#assigned">unassigned</A>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>void erase(iterator first, iterator last)</tt>
</TD>
<TD VAlign=top>
   Erases the elements of the <tt>sparsetable</tt> in the range
   <tt>[first, last)</tt>.  This operation causes these elements to
   be <A HREF="#assigned">unassigned</A>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>void clear()</tt>
</TD>
<TD VAlign=top>
   Erases all of the elements.  This causes all elements to be
   <A HREF="#assigned">unassigned</A>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>void resize(size_type n)</tt>
</TD>
<TD VAlign=top>
   Changes the size of sparsetable to <tt>n</tt>.  If <tt>n</tt> is
   greater than the old size, new, <A HREF="#assigned">unassigned</A>
   elements are appended.  If <tt>n</tt> is less than the old size,
   all elements in position &gt;<tt>n</tt> are deleted.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>bool write_metadata(FILE *fp)</tt>
</TD>
<TD VAlign=top>
   Write hashtable metadata to <tt>fp</tt>.  See <A HREF="#io">below</A>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>bool read_metadata(FILE *fp)</tt>
</TD>
<TD VAlign=top>
   Read hashtable metadata from <tt>fp</tt>.  See <A HREF="#io">below</A>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>bool write_nopointer_data(FILE *fp)</tt>
</TD>
<TD VAlign=top>
   Write hashtable contents to <tt>fp</tt>.  This is valid only if the
   hashtable key and value are "plain" data.  See <A HREF="#io">below</A>.
</TD>
</TR>

<TR>
<TD VAlign=top>
   <tt>bool read_nopointer_data(FILE *fp)</tt>
</TD>
<TD VAlign=top>
   Read hashtable contents to <tt>fp</tt>.  This is valid only if the
   hashtable key and value are "plain" data.  See <A HREF="#io">below</A>.
</TD>
</TR>

</table>


<h3>Notes</h3>

<P><A name="1">[1]</A>

<tt>sparsetable::destructive_iterator</tt> iterates through a
sparsetable like a normal iterator, but <tt>++it</tt> may delete the
element being iterated past.  Obviously, this iterator can only be
used once on a given table!  One application of this iterator is to
copy data from a sparsetable to some other data structure without
using extra memory to store the data in both places during the
copy.</p>

<P><A name="2">[2]</A>

Since <tt>operator[]</tt> might insert a new element into the
<tt>sparsetable</tt>, it can't possibly be a <tt>const</tt> member
function.  In theory, since it might insert a new element, it should
cause the element it refers to to become <A
HREF="#assigned">assigned</A>.  However, this is undesirable when
<tt>operator[]</tt> is used to examine elements, rather than assign
them.   Thus, as an implementation trick, <tt>operator[]</tt> does not
really return a <tt>reference</tt>.  Instead it returns an object that
behaves almost exactly like a <tt>reference</tt>.  This object,
however, delays setting the appropriate sparsetable element to <A
HREF="#assigned">assigned</A> to when it is actually assigned to.</p>

<p>For a bit more detail: the object returned by <tt>operator[]</tt>
is an opaque type which defines <tt>operator=</tt>, <tt>operator
reference()</tt>, and <tt>operator&</tt>.  The first operator controls
assigning to the value.  The second controls examining the value.  The
third controls pointing to the value.</p>

<p>All three operators perform exactly as an object of type
<tt>reference</tt> would perform.  The only problems that arise is
when this object is accessed in situations where C++ cannot do the
conversion by default.  By far the most common situation is with
variadic functions such as <tt>printf</tt>.  In such situations, you
may need to manually cast the object to the right type:</p>
<pre>
   printf("%d", static_cast&lt;typename table::reference&gt;(table[i]));
</pre>


<h3><A NAME=io>Input/Output</A></h3>

<p>It is possible to save and restore <tt>sparsetable</tt> objects
to disk.  Storage takes place in two steps.  The first writes the
table metadata.  The second writes the actual data.</p>

<p>To write a sparsetable to disk, first call <tt>write_metadata()</tt>
on an open file pointer.  This saves the sparsetable information in a
byte-order-independent format.</p>

<p>After the metadata has been written to disk, you must write the
actual data stored in the sparsetable to disk.  If the value is
"simple" enough, you can do this by calling
<tt>write_nopointer_data()</tt>.  "Simple" data is data that can be
safely copied to disk via <tt>fwrite()</tt>.  Native C data types fall
into this category, as do structs of native C data types.  Pointers
and STL objects do not.</p>

<p>Note that <tt>write_nopointer_data()</tt> does not do any endian
conversion.  Thus, it is only appropriate when you intend to read the
data on the same endian architecture as you write the data.</p>

<p>If you cannot use <tt>write_nopointer_data()</tt> for any reason,
you can write the data yourself by iterating over the
<tt>sparsetable</tt> with a <tt>const_nonempty_iterator</tt> and
writing the key and data in any manner you wish.</p>

<p>To read the hashtable information from disk, first you must create
a <tt>sparsetable</tt> object.  Then open a file pointer to point
to the saved sparsetable, and call <tt>read_metadata()</tt>.  If you
saved the data via <tt>write_nopointer_data()</tt>, you can follow the
<tt>read_metadata()</tt> call with a call to
<tt>read_nopointer_data()</tt>.  This is all that is needed.</p>

<p>If you saved the data through a custom write routine, you must call
a custom read routine to read in the data.  To do this, iterate over
the <tt>sparsetable</tt> with a <tt>nonempty_iterator</tt>; this
operation is sensical because the metadata has already been set up.
For each iterator item, you can read the key and value from disk, and
set it appropriately.  The code might look like this:</p>
<pre>
   for (sparsetable&lt;int*&gt;::nonempty_iterator it = t.nonempty_begin();
        it != t.nonempty_end(); ++it) {
       *it = new int;
       fread(*it, sizeof(int), 1, fp);
   }
</pre>

<p>Here's another example, where the item stored in the sparsetable is
a C++ object with a non-trivial constructor.  In this case, you must
use "placement new" to construct the object at the correct memory
location.</p>
<pre>
   for (sparsetable&lt;ComplicatedCppClass&gt;::nonempty_iterator it = t.nonempty_begin();
        it != t.nonempty_end(); ++it) {
       int constructor_arg;   // ComplicatedCppClass takes an int to construct
       fread(&constructor_arg, sizeof(int), 1, fp);
       new (&(*it)) ComplicatedCppClass(constructor_arg);     // placement new
   }
</pre>


<h3>See also</h3>

<p>The following are SGI STL concepts and classes related to
<tt>sparsetable</tt>.</p>

<A href="http://www.sgi.com/tech/stl/Container.html">Container</A>,
<A href="http://www.sgi.com/tech/stl/RandomAccessContainer.html">Random Access Container</A>,
<tt><A href="sparse_hash_set.html">sparse_hash_set</A></tt>,
<tt><A href="sparse_hash_map.html">sparse_hash_map</A></tt>

</BODY>
</HTML>