úÎ!.D*’5      !"#$%&'()*+,-./01234NoneSX5btreecThe new node that will go to the right, the key propagated to the parent, the inserted value.btree_This is provided for completeness but is not something typically useful in producetion code.6btreeHThe second value in the tuple is true when the index match was exact.7btree—Insert an element in the array, shifting the values right of the index. The array size should be big enough for this shift, this is not checked.8btreeVa | b | c | d | e | X | X | ----------------------------- unsafeInsertPrimArray 5 3 k marrbtreeHShow the internal structure of a Map, useful for debugging, not exported btreeMax number of children per node9btreelength of array:btreelength of arrays7btreeSize of the original arraybtreeIndexbtreeValuebtreeArray to modify8btreeSize of the original arraybtreeIndexbtreeValuebtreeArray to modify     NoneSXôbtree_This is provided for completeness but is not something typically useful in producetion code.btreeMax number of children per node  NoneMSX`)¶$btreecRelease all memory allocated by the b-tree. Do not attempt to use the b-tree after calling this.;btreeœThis lookup is O(log n). It provides the index of the first element greater than the argument. Precondition, the array provided is sorted low to high.1btree]This is provided for convenience but is not something typically useful in production code. <btreeminitial size, if you pick something greater than 0, you need to write to those indices after calling this.+btree\value modification, happens for newly inserted elements and for previously existing elements,btree\value modification, happens for newly inserted elements and for previously existing elements-btree\value modification, happens for newly inserted elements and for previously existing elements.btree%modifications to newly inserted valuebtree%modification to value if key is found/btree%modifications to newly inserted valuebtree%modification to value if key is found=btreedestbtree dest offsetbtreesourcebtree source offsetbtreelength>btreeSize of the original arraybtreeIndexbtreeValuebtreeArray to modify?btreeSize of the original arraybtreeIndexbtreeArray to modify@btreeSize of the original arraybtreeIndexbtreeArray to modifyAbtreelength of arraysBbtreelength of array !"#$%&'()*+,-./01" !#$%&'*+,.01()/-C         !"#$%&'()*+,-./01+*2"btree-0.4.0-Fds6CfZk1GXHcBWL7neD3s BTree.Store BTree.LinearBTree)initialize-0.1.1.0-AOvUJ5ZjG0g6v8S9fRlvuS InitializeinitializeElemsinitializeElemOff initializedeinitializeElemsdeinitializeElemOff deinitialize DeinitializeContext contextDegreenewlookupinsert toAscListfromList foldrWithKey modifyWithMdebugMapDecisionKeepDeletefreewithwith_index indexNode modifyWithM_inlineModifyWithM modifyWithPtrinlineModifyWithPtr$fDeinitializeBTree$fInitializeBTree$fStorableBTreeSplit findIndexGteunsafeInsertArrayunsafeInsertPrimArray foldrArrayfoldrPrimArrayPairsfindIndexOfGtElemnewNodecopyArr insertArr removeArr insertInitArr