h*C0      !"#$%&'()*+,-./0.2.2.1 Safe-Inferred&0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTU Safe-Inferred@V rrb-vector A mutable W reference.X rrb-vectorO(1). Create a new V that is initialized with 0.Y rrb-vectorO(1). Read the content of the V.Z rrb-vectorO(1). Write a value to the V.VXYZ Safe-Inferred9[ rrb-vector-A mutable array buffer with a fixed capacity.\ rrb-vectorO(n)4. Create a new empty buffer with the given capacity.] rrb-vectorO(1). Push a new element onto the buffer. The size of the buffer must not exceed the capacity, but this is not checked.^ rrb-vectorO(n). Freeze the content of the buffer and return it. This resets the buffer so that it is empty._ rrb-vectorO(1)(. Return the current size of the buffer.[\]^_ Safe-Inferred " rrb-vector A vector.$The instances are based on those of Seq-s, which are in turn based on those of lists.` rrb-vectorInteger log base 2. rrb-vectorO(1). The empty vector. empty = fromList [] rrb-vectorO(1)!. A vector with a single element. singleton x = fromList [x] rrb-vectorO(n)". Create a new vector from a list. rrb-vector O(\log n).  replicate n x creates a vector of length n with every element set to x.replicate 5 42fromList [42,42,42,42,42] rrb-vector O(\log n). The element at the index or a if the index is out of range. rrb-vector O(\log n)". The element at the index. Calls b if the index is out of range.  rrb-vector O(\log n). A flipped version of .  rrb-vector O(\log n). A flipped version of .  rrb-vector O(\log n). Update the element at the index with a new element. If the index is out of range, the original vector is returned.  rrb-vector O(\log n). Adjust the element at the index by applying the function to it. If the index is out of range, the original vector is returned.  rrb-vector O(\log n). Like  +, but the result of the function is forced. rrb-vectorO(n)&. Apply the function to every element.map (+ 1) (fromList [1, 2, 3])fromList [2,3,4] rrb-vectorO(n). Like -, but the results of the function are forced. rrb-vectorO(n). Reverse the vector.reverse (fromList [1, 2, 3])fromList [3,2,1] rrb-vectorO(\min(n_1, n_2)). Take two vectors and return a vector of corresponding pairs. If one input is longer, excess elements are discarded from the right end. rrb-vectorO(\min(n_1, n_2)).  generalizes  by zipping with the function. rrb-vectorO(n). Unzip a vector of pairs./unzip (fromList [(1, "a"), (2, "b"), (3, "c")]))(fromList [1,2,3],fromList ["a","b","c"]) rrb-vectorO(n)!. Unzip a vector with a function. unzipWith f = unzip . map f rrb-vector O(\log n). The first element and the vector without the first element, or a if the vector is empty.viewl (fromList [1, 2, 3])Just (1,fromList [2,3]) rrb-vector O(\log n)?. The vector without the last element and the last element, or a if the vector is empty.viewr (fromList [1, 2, 3])Just (fromList [1,2],3) rrb-vector O(\log n) . The first i elements of the vector. If i is negative, the empty vector is returned. If the vector contains less than i( elements, the whole vector is returned. rrb-vector O(\log n). The vector without the first i elements. If i is negative, the whole vector is returned. If the vector contains less than i( elements, the empty vector is returned. rrb-vector O(\log n)&. Split the vector at the given index. "splitAt n v = (take n v, drop n v) rrb-vector O(\log n). Insert an element at the given index, shifting the rest of the vector over. If the index is negative, add the element to the left end of the vector. If the index is bigger than or equal to the length of the vector, add the element to the right end of the vector. rrb-vector O(\log n). Delete the element at the given index. If the index is out of range, return the original vector. rrb-vectorO(n). Find the first index from the left that satisfies the predicate. rrb-vectorO(n). Find the first index from the right that satisfies the predicate. rrb-vectorO(n). Find the indices that satisfy the predicate, starting from the left. rrb-vectorO(n). Find the indices that satisfy the predicate, starting from the right.  rrb-vectorO(\log \max(n_1, n_2)). Concatenates two vectors.%fromList [1, 2, 3] >< fromList [4, 5]fromList [1,2,3,4,5]! rrb-vector O(\log n)/. Add an element to the left end of the vector.1 <| fromList [2, 3, 4]fromList [1,2,3,4]" rrb-vector O(\log n)0. Add an element to the right end of the vector.fromList [1, 2, 3] |> 4fromList [1,2,3,4].cdefghijklm!"   5!5"5 Safe-Inferred# rrb-vector3Structural invariants a vector is expected to hold.) rrb-vectorO(n)'. Show the underlying tree of a vector.* rrb-vectorO(n)-. Create a new unbalanced vector from a list.3Note that it is not possbible to create an invalid  with this function.+ rrb-vectorCheck tree invariants. Returns Left! on finding a violated invariant.n rrb-vector3Check whether an Unbalanced node could be Balanced. )*('&%$#+ )*('&%$#+ Safe-Inferred- rrb-vector O(n \log n). Sort the vector in ascending order. The sort is stable, meaning the order of equal elements is preserved.. rrb-vector O(n \log n). Sort the vector in ascending order according to the specified comparison function. The sort is stable, meaning the order of equal elements is preserved./ rrb-vector O(n \log n). Sort the vector in ascending order by comparing the results of applying the key function to each element. The sort is stable, meaning the order of equal elements is preserved. / f is equivalent to . (  f), but only evaluates f once for each element.-./ Safe-Inferred!"  opqrstuvwxyz{|}~-./$!"  -./    !"#$%&'()*+,-./0123456789:;<=>?@ABCDE"#$FGHIJKLMNOPQRSTUVWXYZ[O\]^_`ab`cd3210/efghijklmnlmolmplmqlmrlmslmtluvluwluxluyluzlu{lu|lu}lu~lululululmlmlmlmlmlmlllll)rrb-vector-0.2.2.1-FTqkUfBL5f01nRnsLGJM16Data.RRBVectorData.RRBVector.Internal.Debug rrb-vectorData.RRBVector.Internal.ArrayData.RRBVector.Internal.IntRefData.RRBVector.Internal.BufferData.RRBVector.InternalData.RRBVector.Internal.SortingData.Ord comparingVectorTreeShiftempty singletonfromList replicatelookupindex!?!updateadjustadjust'mapmap'reversezipzipWithunzip unzipWithviewlviewrtakedropsplitAtinsertAtdeleteAt findIndexL findIndexR findIndicesL findIndicesR><<||> InvariantLeaf UnbalancedBalancedRootEmptyshowTreefromListUnbalancedvalid$fShowInvariantsortsortBysortOnArray MutableArray ifoldrStep ifoldlStep ifoldrStep' ifoldlStep'from2wrap replicateSnocheadlastsnoccons++imapStep imapStep'traverse traverse' itraverseStepitraverseStep'newreadwritefreezethawIntRefghc-prim GHC.TypesInt newIntRef readIntRef writeIntRefBufferpushgetsizelog2base GHC.MaybeNothingGHC.Errerror blockShift blockSizetreeSize computeSizesupdowncouldBeBalanced0indexed-traversable-0.1.4-3KQfryvD6CkLv2KxalzUb5 WithIndexFoldableWithIndexifoldMap ifoldMap'ifoldrifoldlifoldr'ifoldl'Data.Foldable.WithIndexianyiallinonenone itraverse_ifor_imapM_iforM_ iconcatMapifindifoldrMifoldlMitoListFunctorWithIndeximapTraversableWithIndex itraverse imapDefaultifoldMapDefaultData.Traversable.WithIndexiforimapMiforM imapAccumR imapAccumL