You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
<pclass="shortcomment cmt">creates an object providing access to a B+ tree with a branching factor of <code>order</code> and possibly creating an empty tree.</p><divclass="fullcomment"><divclass="comment cmt"><p>creates an object providing access to a B+ tree with a branching factor of <code>order</code> and possibly creating an empty tree.</p></div><dlclass="paramcmts block"><dtclass="param">order</dt><ddclass="cmt"><p>the branching factor (maximum number of branches in an internal node) of the tree</p></dd></dl></div>
111
+
<pclass="shortcomment cmt">creates an object providing access to a B+ tree with a branching factor of <code>order</code> and possibly creating an empty tree.</p>
112
112
</li></ol>
113
113
</div>
114
114
@@ -624,6 +624,24 @@ <h4 class="signature">
624
624
</span>
625
625
<pclass="shortcomment cmt">Returns the <i>null</i> node pointer.</p><divclass="fullcomment"><divclass="comment cmt"><p>Returns the <i>null</i> node pointer. For in-memory implementations this will usually be a Scala <code>null</code> value. For on-disk it would make sense for this to be <code>0L</code>.
<pclass="shortcomment cmt">Order or branching factor of the tree.</p><divclass="fullcomment"><divclass="comment cmt"><p>Order or branching factor of the tree. The order is the maximum number of branches that an internal node can have. The maximum number of elements in a leaf node is <code>order - 1</code>.
<pclass="shortcomment cmt">Returns a bounded iterator over a range of key/value pairs in the tree in sorted order.</p><divclass="fullcomment"><divclass="comment cmt"><p>Returns a bounded iterator over a range of key/value pairs in the tree in sorted order. The range of key/value pairs in the iterator is specified by <code>bounds</code>. <code>bounds</code> must contain one or two pairs where the first element in the pair is a symbol corresponding to the type of bound (i.e. '<, '<=, '>, '>=) and the second element is a key value.</p><p>An example of a bounded iterator over all elements in a tree (with <code>String</code> keys) that will include all keys that sort greater than or equal to "a" and up to but not including "e" is <code>boundedIterator( ('>=, "a"), ('<, "e") )</code>.
950
+
<pclass="shortcomment cmt">Returns a bounded iterator over a range of key/value pairs in the tree in ascending sorted key order.</p><divclass="fullcomment"><divclass="comment cmt"><p>Returns a bounded iterator over a range of key/value pairs in the tree in ascending sorted key order. The range of key/value pairs in the iterator is specified by <code>bounds</code>. <code>bounds</code> must contain one or two pairs where the first element in the pair is a symbol corresponding to the type of bound (i.e. '<, '<=, '>, '>=) and the second element is a key value.</p><p>An example of a bounded iterator over all elements in a tree (with <code>String</code> keys) that will include all keys that sort greater than or equal to "a" and up to but not including "e" is <code>boundedIterator( ('>=, "a"), ('<, "e") )</code>.
<pclass="shortcomment cmt">Returns a bounded iterator over a range of keys in the tree in sorted order.</p><divclass="fullcomment"><divclass="comment cmt"><p>Returns a bounded iterator over a range of keys in the tree in sorted order. The <code>bounds</code> parameter is the same as for <ahref="#boundedIterator(bounds:(Symbol,K)*):Iterator[(K,V)]" class="extmbr" name="xyz.hyperreal.btree.BPlusTree#boundedIterator">boundedIterator</a>.
968
+
<pclass="shortcomment cmt">Returns a bounded iterator over a range of keys in the tree in ascending sorted key order.</p><divclass="fullcomment"><divclass="comment cmt"><p>Returns a bounded iterator over a range of keys in the tree in ascending sorted key order. The <code>bounds</code> parameter is the same as for <ahref="#boundedIterator(bounds:(Symbol,K)*):Iterator[(K,V)]" class="extmbr" name="xyz.hyperreal.btree.BPlusTree#boundedIterator">boundedIterator</a>.
<pclass="shortcomment cmt">Returns a bounded iterator over a range of key positions (node/index pairs) in the tree in sorted order.</p><divclass="fullcomment"><divclass="comment cmt"><p>Returns a bounded iterator over a range of key positions (node/index pairs) in the tree in sorted order. The <code>bounds</code> parameter is the same as for <ahref="#boundedIterator(bounds:(Symbol,K)*):Iterator[(K,V)]" class="extmbr" name="xyz.hyperreal.btree.BPlusTree#boundedIterator">boundedIterator</a>.
986
+
<pclass="shortcomment cmt">Returns a bounded iterator over a range of key positions (node/index pairs) in the tree in ascending sorted key order.</p><divclass="fullcomment"><divclass="comment cmt"><p>Returns a bounded iterator over a range of key positions (node/index pairs) in the tree in ascending sorted key order. The <code>bounds</code> parameter is the same as for <ahref="#boundedIterator(bounds:(Symbol,K)*):Iterator[(K,V)]" class="extmbr" name="xyz.hyperreal.btree.BPlusTree#boundedIterator">boundedIterator</a>.
<pclass="shortcomment cmt">Returns a bounded iterator over a range of values in the tree in sorted order.</p><divclass="fullcomment"><divclass="comment cmt"><p>Returns a bounded iterator over a range of values in the tree in sorted order. The <code>bounds</code> parameter is the same as for <ahref="#boundedIterator(bounds:(Symbol,K)*):Iterator[(K,V)]" class="extmbr" name="xyz.hyperreal.btree.BPlusTree#boundedIterator">boundedIterator</a>.
1004
+
<pclass="shortcomment cmt">Returns a bounded iterator over a range of values in the tree in ascending sorted key order.</p><divclass="fullcomment"><divclass="comment cmt"><p>Returns a bounded iterator over a range of values in the tree in ascending sorted key order. The <code>bounds</code> parameter is the same as for <ahref="#boundedIterator(bounds:(Symbol,K)*):Iterator[(K,V)]" class="extmbr" name="xyz.hyperreal.btree.BPlusTree#boundedIterator">boundedIterator</a>.
<pclass="shortcomment cmt">Returns an iterator over all key positions (node/index pairs) in the tree in ascending sorted order.</p><divclass="fullcomment"><divclass="comment cmt"><p>Returns an iterator over all key positions (node/index pairs) in the tree in ascending sorted order.
1618
+
<pclass="shortcomment cmt">Returns an iterator over all key positions (node/index pairs) in the tree in ascending sorted key order.</p><divclass="fullcomment"><divclass="comment cmt"><p>Returns an iterator over all key positions (node/index pairs) in the tree in ascending sorted key order.
<pclass="shortcomment cmt">Returns a reverse iterator over all key positions (node/index pairs) in the tree in descending sorted order.</p><divclass="fullcomment"><divclass="comment cmt"><p>Returns a reverse iterator over all key positions (node/index pairs) in the tree in descending sorted order.
1776
+
<pclass="shortcomment cmt">Returns a reverse iterator over all key positions (node/index pairs) in the tree in descending sorted key order.</p><divclass="fullcomment"><divclass="comment cmt"><p>Returns a reverse iterator over all key positions (node/index pairs) in the tree in descending sorted key order.
0 commit comments