h$p9     None !"#$%&'()*+,-./01234 Safe-Inferred5 rrb-vector Compose (State Int) f a56789:None,;<=>?NoneO@ABCDNone   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). The element at the index or E if the index is out of range. rrb-vector O(\log n)". The element at the index. Calls F 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). 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. zip = zipWith (,) 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-vector O(\log n). The first element and the vector without the first element, or E 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 E if the vector is empty.viewr (fromList [1, 2, 3])Just (fromList [1,2],3) 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] 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.%GHIJKLMNOPQ 555None 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.None9RSTUVWXYZ[\]^_`abcdefghijklmnop         !"#$%  &  !'()*+,-./012334556789:;<.=>?@AB@CDEFGHIJKLMNOPQRPQSPQTPQUPQVPQWPQXPQYPQZPQ[PQ\PQ]PQ^P_`P_aP_bP_cP_dP5eP5fP5gP5hP5iP5jP5kP5lP5mP5nP5oP5pP5q)rrb-vector-0.1.0.0-3bA0VrvApZP3uKHZ1qQxzuData.RRBVectorData.RRBVector.Internal.DebugData.RRBVector.Internal.ArrayData.RRBVector.Internal.IndexedData.RRBVector.Internal.IntRefData.RRBVector.Internal.BufferData.RRBVector.InternalVectorempty singletonfromListlookupindex!?!updateadjustadjust'mapreversezipzipWithunzipviewlviewrsplitAtinsertAtdeleteAt><<||>takedropshowTreefromListUnbalanced MutableArrayArrayfrom2headlastsnocconsmap'traverse traverse'newreadwritefreezethawIndexed runIndexed WithIndex evalIndexedIntRef newIntRef readIntRef writeIntRef modifyIntRefBufferpushgetsizebase GHC.MaybeNothingGHC.ErrerrorEmptyRootTreeBalanced UnbalancedLeaf blockShift blockSizeuptreeSize computeSizes0indexed-traversable-0.1.1-Dw8MIJyvCj8IZQDXOa8TBpData.Foldable.WithIndexitoListifoldlMifoldrMifind iconcatMapiforM_imapM_ifor_ itraverse_noneinoneiallianyData.Traversable.WithIndex imapAccumL imapAccumRiforMimapMiforifoldMapDefault imapDefaultFunctorWithIndeximapFoldableWithIndexifoldl'ifoldr'ifoldlifoldrifoldMap ifoldMap'TraversableWithIndex itraverse