BPlusTreeAlgos class - bplustree library

Constructors

BPlusTreeAlgos()

Properties

hashCode → int: The hash code for this object.
read-onlyinherited
runtimeType → Type: A representation of the runtime type of the object.
read-onlyinherited

Methods

noSuchMethod(Invocation invocation) → dynamic: Invoked when a non-existent method or property is accessed.
inherited
toString() → String: A string representation of this object.
inherited

Operators

operator ==(Object other) → bool: The equality operator.
inherited

Static Methods

delete<K>({BPlusTree<K> bptree, K keyToBeDeleted}) → BPlusCell<K>: first delete replace and cascade min value then evaluate merge or delete
find<K>(BPlusTree<K> bptree, K searchKey, Compare<K> customCompare) → Stream<K>
getHeight<K>(BPlusTree<K> bptree) → int
insert<K, V>({BPlusTree<K> bptree, K keyToBeInserted, V valueToBeInserted, bool replaceDuplicate = false}) → BPlusCell<K>
searchAllKeysEqualBasedOnCustomComparator<K>(BPlusTree<K> bptree, K searchKey, Compare<K> customCompare, {int offset = 0, int limit = -1}) → Stream<K>: It will find the start node and then go for each right sibling cell until the custom comparator returns 0
searchAllKeysInTheKeyList<K>(BPlusTree<K> bptree, List<K> keyList, {Compare<K> customCompare, int offset = 0, int limit = -1}) → Stream<K>
searchForKey<K>({BPlusTree<K> bptree, K searchKey, Compare<BPlusCell<K>> customCompare}) → BPlusCell<K>: searches for key and returns it cell from leaf node. if the searchKey is smaller than smallest than it returns null if its greater than largest than it returns largest value else it return just lesser than or equals to value
searchForKeyGTE<K>({BPlusTree<K> bptree, K searchKey, Compare<BPlusCell<K>> customCompare}) → BPlusCell<K>: searches for key and returns it cell from leaf node. if the searchKey is smaller than smallest than it returns null if its greater than largest than it returns largest value else it return just lesser than or equals to value
searchForLeafNode<K>({BPlusTree<K> bptree, K searchKey, Compare<BPlusCell<K>> customCompare}) → BPlusNode<K>: searches for the leaf node where the value is being stored: uses searchJustLesserThanOrEqual
searchForRange<K>(BPlusTree<K> bptree, K startKey, K endKey, {Compare<BPlusCell<K>> customCompare}) → Stream<BPlusCell<K>>
searchForRangeWithPagination<K>(BPlusTree<K> bptree, K startKey, K endKey, {int offset = 0, int limit = -1, Compare<BPlusCell<K>> customCompare}) → Stream<BPlusCell<K>>: Searches for a range of values,supports pagination.