úÎU²QK      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJNone%&+,/9:;<=DQRTDType synonym for Ordinal.Fixed-length list. n x is a vector of length n with x the value of every element., with the length inferred.Construct a singleton vector.Uncons the non-empty list.VConvert a list into a vector. If a given list is shorter than the length, it returns Nothing. Unsafe version of 9. If a given list is shorter than the length, it aborts. 1Convert a list into vector, with length inferred. Unsafe version of  . Convert a vector into a list.  Append two Vectors.0Extract the first element of a non-empty vector./Extract the last element of a non-empty vector.8Extract the elements after the head of a non-empty list.9Extract the elements before the last of a non-empty list. Since 1.4.2.0Test whether a Vector5 is empty, though it's clear from the type parameter.+ returns the length of a finite list as an K.* returns the length of a finite list as a L n. f xs$ is the vector obtained by applying f to each element of xs. xs. returns the elements of xs in reverse order. xs must be finite.The l function takes an element and a vector and `intersperses' that element between the elements of the vector.The : function transposes the rows and columns of its argument. Left fold.A strict version of .Left fold for non-empty vector.A strict version of . Right fold. Right fold for non-empty vector. The function ' concatenates all vectors in th vector.  - returns the conjunction of a Boolean vector.!!- returns the disjunction of a Boolean vector."#Applied to a predicate and a list, "A determines if any element of the vector satisfies the predicate.##Applied to a predicate and a list, #A determines if all element of the vector satisfies the predicate.$$: takes the sum of the numbers contained in a sized vector.%%> takes the product of the numbers contained in a sized vector.&3Maximum element of a (statically) non-empty vector.'3Minimum element of a (statically) non-empty vector.(( n xs returns the prefix of xs of length n, with n% less than or equal to the length of xs.) A variant of take which returns entire xs if n is greater than the length of xs.** n xs returns the suffix of xs after the first n elements, with n% less than or equal to the length of xs.++ n xs( returns a tuple where first element is xs prefix of length n3 and second element is the remainder of the list. n/ should be less than or equal to the length of xs., A varian of + which allows n" to be greater than the length of xs.-The -< function drops the given prefix from a vector. It returns Nothing€ if the vector did not start with the prefix given or shorter than the prefix, or Just the vector after the prefix, if it does..)Test if the element occurs in the vector?/ Negation of ..0yFind the first element which satisfies the given predicate. If there are no element satisfying the predicate, returns M.1/List index (subscript) operator, starting from sZero.2A  version of 1.3Flipped version of 1.4A  version of 3.5The 5 function returns the index (as K=) of the first element in the given list which is equal (by N?) to the query element, or Nothing if there is no such element.6 version of 5.7The 7 function extends 5[, by returning the indices of all elements equal to the query element, in ascending order.8 version of 7.9²The findIndex function takes a predicate and a vector and returns the index of the first element in the vector satisfying the predicate, or Nothing if there is no such element.: version of 9.;The ; function extends 9Z, by returning the indices of all elements satisfying the predicate, in ascending order.< version of ;.== takes two vectors and returns a vector of corresponding pairs. If one input list is short, excess elements of the longer list are discarded.>Same as =2, but the given vectors must have the same length.?? generalises =Y by zipping with the function given as the first argument, instead of a tupling function.@Same as ?2, but the given vectors must have the same length.A Inverse of >.BIndexed version of . Since 1.4.2.0C"Utility Template Haskell macro to lift plain lists upto sized vectors. Since 1.4.3.0$(sized [1,2,3 :: Int])1 :- (2 :- (3 :- Nil))D Similar to lift', but lifts the list of OD instead. This function is useful to avoid the stage restriction. Since 1.4.3.06let a = "foo" in $(sized' [[|a|],[|"bar"|],[|"baz"|]])""foo" :- ("bar" :- ("baz" :- Nil))HMonomorphic representation of  a n is [a].OPQ R !"#$%&'()*+,-./0123456789:;<=>?@ASTUBCDEFGHIVWXY  !"#$%&'()*+,-./0123456789:;<=>?@ABCDE B !"#$%&'()*+,-./01234569:;<78=>?@ACDMPQ R !"#$%&'()*+,-./0123456789:;<=>?@ASTUBCDEFGH5Z      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUMVWXYZ[\]^_`PabPacPadPaef+sized-vector-1.4.3.1-JTXvZrHvssuHNwH7BX0kg3Data.Vector.SizedIndexVectorNil:- replicate replicate' singletonunconsfromListunsafeFromList fromList'unsafeFromList'toListappendheadlasttailinitnulllengthsLengthmapreverse intersperse transposefoldlfoldl'foldl1foldl1'foldrfoldr1concatandoranyallsumproductmaximumminimumtake takeAtMostdropsplitAt splitAtMost stripPrefixelemnotElemfind!!%!!indexsIndex elemIndex sElemIndex elemIndices sElemIndices findIndex sFindIndex findIndices sFindIndiceszipzipSamezipWith zipWithSameunzipifoldlsizedsized'$fHashableVector$fNFDataVector $fEqVector$fMonomorphicableNatVector $fOrdVector $fShowVectorghc-prim GHC.TypesInt+type-natural-0.4.1.0-9avWm3ed8SAB4tdd5HUwr0Data.Type.Natural.DefinitionsSNatbaseGHC.BaseNothing GHC.Classes==template-haskellLanguage.Haskell.TH.LibExpQsZsS prependToAll rnfVectorvecHashWithSalt ordinalVecsData.Type.OrdinalordToIntOrdinalOSOZ