!      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None,-.12456=>?@AHMRSUVX sizedFunctor f such that there is instance ListLike (f a) a for any a. Since 0.1.0.0sizedSized 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.0sized Since 0.2.0.0sized Since 0.4.0.0sized Since 0.2.0.0sized Since 0.3.0.0sized Since 0.2.0.0sized Since 0.6.0.0sized Since 0.6.0.0sized Since 0.2.0.0sized Since 0.2.0.0sized Since 0.2.0.0None!%&',-.12456=>?@AHMRSUVX_gk Vsized-View of the left end of sequence (snoc-side). Since 0.1.0.0 sized-View of the left end of sequence (cons-side). Since 0.1.0.0 sized 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.0sized 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.0sized%Pattern synonym for cons-side uncons.sized8Returns 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.0sizedSing version of .Since 0.5.0.0 (type changed)sized%Test if the sequence is empty or not. Since 0.1.0.0sized(Unsafe) indexing with Int4s. If you want to check boundary statically, use  or . Since 0.1.0.0sizedSafe indexing with s. Since 0.1.0.0sizedFlipped version of . Since 0.1.0.0sizedFlipped version of . Since 0.1.0.0sizedqTake 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.0sizedpTake 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.0sized 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.0sized 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!sizedhTake 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"sizedsTake 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#sized 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$sized 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%sized 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&sized 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'sizedsplitAtMost 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(sizedEmpty sequence.Since 0.5.0.0 (type changed))sizedSequence with one element. Since 0.1.0.0*sized Consruct the z sequence from base type, but the length parameter is dynamically determined and existentially quantified; see also . Since 0.1.0.0+sizedReplicates the same value. Since 0.1.0.0,sized+ with the length inferred. Since 0.1.0.0.sized*Append an element to the head of sequence. Since 0.1.0.0/sizedInfix version of .. Since 0.1.0.00sized*Append an element to the tail of sequence. Since 0.1.0.01sizedInfix version of 0. Since 0.1.0.02sizedAppend two lists. Since 0.1.0.03sizedInfix version of 2. Since 0.1.0.04sized)Concatenates multiple sequences into one. Since 0.1.0.05sized9Zipping two sequences. Length is adjusted to shorter one. Since 0.1.0.06sized5& for the sequences of the same length. Since 0.1.0.07sizedFZipping two sequences with funtion. Length is adjusted to shorter one. Since 0.1.0.08sized7& for the sequences of the same length. Since 0.1.0.09sized!Unzipping the sequence of tuples. Since 0.1.0.0:sized Map function. Since 0.1.0.0<sizedReverse function. Since 0.1.0.0=sized Intersperces. Since 0.1.0.0>sizedRemove all duplicates. Since 0.1.0.0?sized$Sorting sequence by ascending order. Since 0.1.0.0@sizedGeneralized version of ?. Since 0.1.0.0Asized/Insert new element into the presorted sequence. Since 0.1.0.0BsizedGeneralized version of A. Since 0.1.0.0CsizedConvert to list. Since 0.1.0.0Dsized"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.5.0.0 (type changed)EsizedD! with the result length inferred. Since 0.1.0.0FsizedUnsafe version of D7. If the length of the given list does not equal to n!, then something unusual happens. Since 0.1.0.0GsizedF! with the result length inferred. Since 0.1.0.0Hsized Construct a  Sized f n a5 by padding default value if the given list is short.Since 0.5.0.0 (type changed)IsizedH! with the result length inferred. Since 0.1.0.0Jsized8Forget the length and obtain the wrapped base container. Since 0.1.0.0Ksized+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.0LsizedK! with the result length inferred. Since 0.1.0.0MsizedUnsafe version of K7. If the length of the given list does not equal to n!, then something unusual happens. Since 0.1.0.0NsizedM! with the result length inferred. Since 0.1.0.0Osized Construct a  Sized f n a5 by padding default value if the given list is short. Since 0.1.0.0PsizedO! with the result length inferred. Since 0.1.0.0QsizedDTake the initial segment as long as elements satisfys the predicate. Since 0.1.0.0RsizedDDrop the initial segment as long as elements satisfys the predicate. Since 0.1.0.0Ssized 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.0Tsized 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.0Usized 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.0VsizedMembership test; see also W. Since 0.1.0.0Wsized Negation of V. Since 0.1.0.0Xsized*Find the element satisfying the predicate. Since 0.1.0.0Ysized version of X.ZsizedZ p xs find the element satisfying p! and returns its index if exists. Since 0.1.0.0[sized version of Z. Since 0.1.0.0\sizedZ implemented in terms of ]sized[ implemented in terms of ^sized^ p xs find all elements satisfying p and returns their indices. Since 0.1.0.0_sized^ implemented in terms of `sized version of ^. Since 0.1.0.0bsized>Returns the index of the given element in the list, if exists. Since 0.1.0.0csizedOrdinal 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.5.0.0 (type changed)dsizedSince 0.5.0.0 (type changed)esized5Returns all indices of the given element in the list. Since 0.1.0.0fsizedOrdinal version of e Since 0.1.0.0gsized,Case analysis for the cons-side of sequence.Since 0.5.0.0 (type changed)hsized,Case analysis for the snoc-side of sequence.Since 0.5.0.0 (type changed)isized#Applicative instance, generalizing .i  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghi !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOP QRSTUVWXYZ\[]^_`abcdefg h5 555/51535None%,-.12456=>?@AHMRSUVXglsized Wrapper for ? which takes length as its last element, instead of the second. Since 0.2.0.0lmntuvwlmnwvutNone%&'-.@AHSXghj  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefgh~j~  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefgh55None %&'-.@AHSXg|j  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghj  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefgh55      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrrstuvwxyz{|}~   $sized-0.6.0.0-4jvZjjvH13JFM2VssuHKTY Data.SizedData.Sized.FlippedData.Sized.BuiltinData.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$fShowSomeSizedFlipped runFlipped $fShowFlipped $fEqFlipped $fOrdFlipped$fNFDataFlipped$fHashableFlipped $fIxedFlipped$fMonoTraversableFlipped$fWrappedFlipped$fRewrappedFlippedt$fMonoFoldableFlipped$fMonoFunctorFlippedOrdinalbaseGHC.BaseFunctor%ListLike-4.7.1-A9SJ29Ywfk6C9odlW35vn4Data.ListLike.BaseListLike Data.FoldableallFoldableData.Traversable Traversable"$fTraversableWithIndexOrdinalSized$fFoldableWithIndexOrdinalSized$fFunctorWithIndexOrdinalSizedD:R:IxValueSizedD:R:IndexSized$fMonoTraversableSized$fMonoTraversableSized0$fMonoTraversableSized1$fMonoFunctorSized$fMonoFoldableSizedrunSized*type-natural-0.9.0.0-Ab05PnnE7F3MoUEZKWWaIData.Type.Ordinal"lens-4.19.2-DaRWbZHYVYpBUq1F3SQEkCControl.Lens.IndexedFoldableWithIndex