H      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None*+,/02349:;<=DINOQRTFunctor f such that there is instance ListLike (f a) a for any a. Since 0.1.0.0Sized wraps a sequential type f' and makes length-parametrized version.Here, f must be the instance of  and  (f a) a for all a#. This constraint is expressed by +. Folding and traversing function such as  and foldl' is available via  or  class, if f is the instance of them. Since 0.2.0.0 Since 0.2.0.0 Since 0.2.0.0 Since 0.2.0.0 Since 0.2.0.0 Since 0.2.0.0 Since 0.2.0.0None $%&*+,/02349:;<=DINOQRT[bfU-View of the left end of sequence (snoc-side). Since 0.1.0.0 -View of the left end of sequence (cons-side). Since 0.1.0.0  The type Partitioned f n a+ represents partitioned sequence of length n . Value Partitioned lenL ls lenR rs stands for: Entire sequence is divided into ls and rs, and their length are lenL and lenR resp. lenL + lenR = n Since 0.1.0.0 vector with the length is existentially quantified. This type is used mostly when the return type's length cannot be statically determined beforehand. SomeSized sn xs :: SomeSized f a stands for the  sequence xs of element type a and length sn. Since 0.1.0.0%Pattern synonym for cons-side uncons.8Returns the length of wrapped containers. If you use unsafeFromListi or similar unsafe functions, this function may return different value from type-parameterized length. Since 0.1.0.0Sing version of . Since 0.2.0.0%Test if the sequence is empty or not. Since 0.1.0.0(Unsafe) indexing with Int4s. If you want to check boundary statically, use  or . Since 0.1.0.0Safe indexing with s. Since 0.1.0.0Flipped version of . Since 0.1.0.0Flipped version of . Since 0.1.0.0qTake the first element of non-empty sequence. If you want to make case-analysis for general sequence, see  #ViewsAndPatternsViews and Patterns section. Since 0.1.0.0pTake the last element of non-empty sequence. If you want to make case-analysis for general sequence, see  #ViewsAndPatternsViews and Patterns section. Since 0.1.0.0 Take the  and ![ of non-empty sequence. If you want to make case-analysis for general sequence, see  #ViewsAndPatternsViews and Patterns section. Since 0.1.0.0 Take the " and [ of non-empty sequence. If you want to make case-analysis for general sequence, see  #ViewsAndPatternsViews and Patterns section. Since 0.1.0.0!hTake the tail of non-empty sequence. If you want to make case-analysis for general sequence, see  #ViewsAndPatternsViews and Patterns section. Since 0.1.0.0"sTake the initial segment of non-empty sequence. If you want to make case-analysis for general sequence, see  #ViewsAndPatternsViews and Patterns section. Since 0.1.0.0# take k xs takes first k element of xs where the length of xs should be larger than kZ. It is really sad, that this function takes at least O(k) regardless of base container. Since 0.1.0.0$ take k xs takes first k element of xsb at most. It is really sad, that this function takes at least O(k) regardless of base container. Since 0.1.0.0% drop k xs drops first k element of xs8 and returns the rest of sequence, where the length of xs should be larger than kZ. It is really sad, that this function takes at least O(k) regardless of base container. Since 0.1.0.0& splitAt k xs split xs at k, where the length of xs! should be less than or equal to kZ. It is really sad, that this function takes at least O(k) regardless of base container. Since 0.1.0.0'splitAtMost k xs split xs at k. If k exceeds the length of xs, then the second result value become empty. It is really sad, that this function takes at least O(k) regardless of base container. Since 0.1.0.0(Empty sequence. Since 0.1.0.0)Sequence with one element. Since 0.1.0.0* Consruct the z sequence from base type, but the length parameter is dynamically determined and existentially quantified; see also . Since 0.1.0.0+Replicates the same value. Since 0.1.0.0,+ with the length inferred. Since 0.1.0.0.*Append an element to the head of sequence. Since 0.1.0.0/Infix version of .. Since 0.1.0.00*Append an element to the tail of sequence. Since 0.1.0.01Infix version of 0. Since 0.1.0.02Append two lists. Since 0.1.0.03Infix version of 2. Since 0.1.0.04)Concatenates multiple sequences into one. Since 0.1.0.059Zipping two sequences. Length is adjusted to shorter one. Since 0.1.0.065& for the sequences of the same length. Since 0.1.0.07FZipping two sequences with funtion. Length is adjusted to shorter one. Since 0.1.0.087& for the sequences of the same length. Since 0.1.0.09!Unzipping the sequence of tuples. Since 0.1.0.0: Map function. Since 0.1.0.0<Reverse function. Since 0.1.0.0= Intersperces. Since 0.1.0.0>Remove all duplicates. Since 0.1.0.0?$Sorting sequence by ascending order. Since 0.1.0.0@Generalized version of ?. Since 0.1.0.0A/Insert new element into the presorted sequence. Since 0.1.0.0BGeneralized version of A. Since 0.1.0.0CConvert to list. Since 0.1.0.0D"If the given list is shorter than n, then returns Nothing Otherwise returns  Sized f n a consisting of initial n element of given list. Since 0.1.0.0ED! with the result length inferred. Since 0.1.0.0FUnsafe version of D7. If the length of the given list does not equal to n!, then something unusual happens. Since 0.1.0.0GF! with the result length inferred. Since 0.1.0.0H Construct a  Sized f n a5 by padding default value if the given list is short. Since 0.1.0.0IH! with the result length inferred. Since 0.1.0.0J8Forget the length and obtain the wrapped base container. Since 0.1.0.0K+If the length of the input is shorter than n, then returns Nothing. Otherwise returns  Sized f n a consisting of initial n element of the input. Since 0.1.0.0LK! with the result length inferred. Since 0.1.0.0MUnsafe version of K7. If the length of the given list does not equal to n!, then something unusual happens. Since 0.1.0.0NM! with the result length inferred. Since 0.1.0.0O Construct a  Sized f n a5 by padding default value if the given list is short. Since 0.1.0.0PO! with the result length inferred. Since 0.1.0.0QDTake the initial segment as long as elements satisfys the predicate. Since 0.1.0.0RDDrop the initial segment as long as elements satisfys the predicate. Since 0.1.0.0S Invariant:  (f a) aC instance must be implemented to satisfy the following property: @length (fst (span p xs)) + length (snd (span p xs)) == length xs; Otherwise, this function introduces severe contradiction. Since 0.1.0.0T Invariant:  (f a) aC instance must be implemented to satisfy the following property: Blength (fst (break p xs)) + length (snd (break p xs)) == length xs; Otherwise, this function introduces severe contradiction. Since 0.1.0.0U Invariant:  (f a) aC instance must be implemented to satisfy the following property: Jlength (fst (partition p xs)) + length (snd (partition p xs)) == length xs; Otherwise, this function introduces severe contradiction. Since 0.1.0.0VMembership test; see also W. Since 0.1.0.0W Negation of V. Since 0.1.0.0X*Find the element satisfying the predicate. Since 0.1.0.0Y version of X.ZZ p xs find the element satisfying p! and returns its index if exists. Since 0.1.0.0[ version of Z. Since 0.1.0.0\Z implemented in terms of ][ implemented in terms of ^^ p xs find all elements satisfying p and returns their indices. Since 0.1.0.0_^ implemented in terms of ` version of ^. Since 0.1.0.0b>Returns the index of the given element in the list, if exists. Since 0.1.0.0cOrdinal version of bT It statically checks boundary invariants. If you don't internal structure on  , then d0 is much faster and also safe for most cases. Since 0.1.0.0e5Returns all indices of the given element in the list. Since 0.1.0.0fOrdinal version of e Since 0.1.0.0g,Case analysis for the cons-side of sequence. Since 0.1.0.0h,Case analysis for the snoc-side of sequence. Since 0.1.0.0i#Applicative instance, generalizing .h  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijki  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghi !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOP QRSTUVWXYZ\[]^_`abcdefg hb    !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijk5 555/51535None $%&+,<=DOTblmnopqj  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghlmnopqmlqponlmnopqo5q5None$*+,/02349:;<=DINOQRTbr Wrapper for ? which takes length as its last element, instead of the second. Since 0.2.0.0 rstz{|}~rstz{|}rst}|{zrstz{|}~None $%&+,<=DOTbj  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefgh55      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopq rsstuvwxyz{|}~ r r$sized-0.2.1.0-85JdzGbJwJx7NlODSUfIQf Data.SizedData.Sized.BuiltinData.Sized.FlippedData.Sized.PeanoData.Sized.Internal Data.MonoidZipList ListLikeFSizedinstLL instFunctor withListLikeFwithListLikeF'SnocViewNilSV:-::ConsViewNilCV::- Partitioned SomeSizedNilR:>NilL:<lengthsLengthnull!!%!!indexsIndexheadlastunconsuncons'unsnocunsnoc'tailinittake takeAtMostdropsplitAt splitAtMostempty singleton toSomeSized replicate replicate'generatecons<|snoc|>append++concatzipzipSamezipWith zipWithSameunzipmapfmapreverse interspersenubsortsortByinsertinsertBytoListfromList fromList'unsafeFromListunsafeFromList'fromListWithDefaultfromListWithDefault'unsizedtoSizedtoSized' unsafeToSizedunsafeToSized'toSizedWithDefaulttoSizedWithDefault' takeWhile dropWhilespanbreak partitionelemnotElemfindfindF findIndex sFindIndex findIndexIF sFindIndexIF findIndices findIndicesIF sFindIndicessFindIndicesIF elemIndex sElemIndexsUnsafeElemIndex elemIndices sElemIndicesviewConsviewSnoc$fApplicativeSized $fEqSomeSized$fShowSomeSizedOrdinalFlipped runFlipped $fShowFlipped $fEqFlipped $fOrdFlipped$fNFDataFlipped$fHashableFlipped $fIxedFlipped$fMonoTraversableFlipped$fWrappedFlipped$fRewrappedFlippedt$fMonoFoldableFlipped$fMonoFunctorFlippedbaseGHC.BaseFunctor#ListLike-4.5-3g6MY2hojKV91K6cugZ47cData.ListLike.BaseListLike Data.FoldableallFoldableData.Traversable Traversable"$fTraversableWithIndexOrdinalSized$fFoldableWithIndexOrdinalSized$fFunctorWithIndexOrdinalSized$fMonoTraversableSized$fMonoTraversableSized0$fMonoTraversableSized1LLFrunSizedinstLLFtoProxy$f:=>LLFListLike$fClassListLikeLLF$fLLFfa $fIxedSized $fShowSized+type-natural-0.7.1.2-9oKjIGd17va5CLPNxEwIvmData.Type.Ordinal lens-4.14-6it9z5BnzYrF02f6jdqA9mControl.Lens.IndexedFoldableWithIndexdemote' fromSing'D:R:UnwrappedFlipped