h&u&      !"#$% Safe-Inferred%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJ Safe-Inferred K rrb-vector A mutable L reference.M rrb-vectorO(1). Create a new K that is initialized with 0.N rrb-vectorO(1). Read the content of the K.O rrb-vectorO(1). Write a value to the K.KMNO Safe-InferredP rrb-vector-A mutable array buffer with a fixed capacity.Q rrb-vectorO(n)4. Create a new empty buffer with the given capacity.R 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.S rrb-vectorO(n). Freeze the content of the buffer and return it. This resets the buffer so that it is empty.T rrb-vectorO(1)(. Return the current size of the buffer.PQRST 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-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 U if the index is out of range. rrb-vector O(\log n)". The element at the index. Calls V 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 U 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 U 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. rrb-vector O(\log n)(. Delete the element at the given index. 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]*WXYZ[\]^_`a 555 Safe-Inferred$ 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.  !"#$% $%#"!  Safe-Inferred?@ABCDEFGHIJKL@MNOPQRPST*)('&UVWXYZ[\][\^[\_[\`[\a[\b[\c[\d[\e[\f[\g[\h[\i[jk[jl[jm[jn[jo[pq[pr[ps[pt[pu[pv[pw[px[py[pz[p{[p|[p})rrb-vector-0.2.0.0-EN2VADO3gWIJHoMP3bnTklData.RRBVectorData.RRBVector.Internal.DebugData.RRBVector.Internal.ArrayData.RRBVector.Internal.IntRefData.RRBVector.Internal.BufferData.RRBVector.InternalVectorTreeShiftempty singletonfromList replicatelookupindex!?!updateadjustadjust'mapmap'reversezipzipWithunzip unzipWithviewlviewrtakedropsplitAtinsertAtdeleteAt><<||>Leaf UnbalancedBalancedRootEmptyshowTreefromListUnbalanced MutableArrayArray ifoldrStep ifoldlStep ifoldrStep' ifoldlStep'from2 replicateSnocheadlastsnoccons++imapStep imapStep'traverse traverse' itraverseStepitraverseStep'newreadwritefreezethawIntRefghc-prim GHC.TypesInt newIntRef readIntRef writeIntRefBufferpushgetsizebase GHC.MaybeNothingGHC.Errerror blockShift blockSizeupdowntreeSize computeSizes0indexed-traversable-0.1.2-4ybMxZUiKIVBQjwlGIsU65Data.Foldable.WithIndexitoListifoldlMifoldrMifind iconcatMapiforM_imapM_ifor_ itraverse_noneinoneiallianyData.Traversable.WithIndex imapAccumL imapAccumRiforMimapMifor WithIndexifoldMapDefault imapDefaultFunctorWithIndeximapFoldableWithIndexifoldl'ifoldr'ifoldlifoldrifoldMap ifoldMap'TraversableWithIndex itraverse