which holds pieces of memory that hold indices that can be referenced by the data pointer. There is also an array of data pointers &ndash; this is in "index" order. When operations take place on the array (insert, delete, sort), the pointers in the hashtab are updated with new indices. </p>
<h2 class="groupheader">Function Documentation</h2>
<a id="ga5083e00af855e9b1a20ee5321c8fe3c9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ga5083e00af855e9b1a20ee5321c8fe3c9">&#9670;&nbsp;</a></span>index