úÎ!B5?@ABCDEFGHIJKLMNOPQRSTUVWXYZNoneQVï[btreecThe 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.\btreeHThe second value in the tuple is true when the index match was exact.]btree—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.^btreeVa | b | c | d | e | X | X | ----------------------------- unsafeInsertPrimArray 5 3 k marr btreeHShow the internal structure of a Map, useful for debugging, not exportedbtreeMax number of children per node_btreelength of array`btreelength of arrays]btreeSize of the original arraybtreeIndexbtreeValuebtreeArray to modify^btreeSize of the original arraybtreeIndexbtreeValuebtreeArray to modify     NoneQVâbtree_This is provided for completeness but is not something typically useful in producetion code.btreeMax number of children per node   NoneKQV^4Ubtree Can be overridden for efficiencybtree€Free any memory pointed to by elements of the array. This has a default implementation but may be overriden for efficency.btree„Initialize the memory at a pointer. An implementation of this function may do nothing, or if the data contains more pointers,  initialize may allocate additional memory. btree Can be overridden for efficiency!btree—Initialize a pointer representing an array with a given number of elements. This has a default implementation but may be overriden for efficency.$btreecRelease all memory allocated by the b-tree. Do not attempt to use the b-tree after calling this.abtreeœ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. bbtreeminitial 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 foundcbtreedestbtree dest offsetbtreesourcebtree source offsetbtreelengthdbtreeSize of the original arraybtreeIndexbtreeValuebtreeArray to modifyebtreeSize of the original arraybtreeIndexbtreeArray to modifyfbtreeSize of the original arraybtreeIndexbtreeArray to modifygbtreelength of arrayshbtreelength of array !"#$%&'()*+,-./01" !#$%&'*+,.01()/-NoneDQV^;ÕSbtree+This should not be used in production code.Tbtree…Deletes all elements from the linked list, copying them into the buffer specified by the pointer. Returns an empty linked list.UbtreeDump the elements into a i>, mapping over them first. This is a fairly niche function.Vbtree-Does not affect the contents of the ArrayListXbtree Final consumer of the ArrayList.Obtree predicateHIJKLMNOPQRSTUVWXHIJKXLMNOPQRTUSWVj             !"  #$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSMLTUVW"btree-0.3.1-9JjKP87RCv326lCaGwbDCY BTree.LinearBTree BTree.Store ArrayListContext contextDegreenewlookupinsert toAscListfromList foldrWithKey modifyWithMdebugMapDecisionKeepDelete Deinitialize deinitializedeinitializeElemOffdeinitializeElems Initialize initializeinitializeElemOffinitializeElemsfreewithwith_index indexNode modifyWithM_inlineModifyWithM modifyWithPtrinlineModifyWithPtr$fStorableBTree$fInitializeChar$fInitializeWord32$fInitializeInt64$fInitializeInt$fInitializeWord$fInitializeWord64$fInitializeWord16$fInitializeWord8$fInitializeBTree$fDeinitializeChar$fDeinitializeInt64$fDeinitializeInt$fDeinitializeWord32$fDeinitializeWord$fDeinitializeWord64$fDeinitializeWord16$fDeinitializeWord8$fDeinitializeBTree$fDeinitializeUninitialized$fInitializeUninitialized$fStorableUninitializedsizepushR pushArrayRpopL dropWhileLdropWhileScanL dropScanLdropLdumpListdumpdumpMap showDebugclear$fInitializeArrayList$fStorableArrayListSplit findIndexGteunsafeInsertArrayunsafeInsertPrimArray foldrArrayfoldrPrimArrayPairsfindIndexOfGtElemnewNodecopyArr insertArr removeArr insertInitArr(primitive-0.6.4.0-39Pwmm1zkQX6bM7xFUT3JcData.Primitive.PrimArrayMutablePrimArray