W      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVNone&'(+-.2346=BGHJKMFunctor f such that there is instance ListLike (f a) a for any a. Since 0.1.0.0Sized wraps a sequential type fp and makes length-parametrized version. GHC's type natural is currently poor, so we adopt Peano numeral here.Here, f must be the instance of W and X (f a) a for all a#. This constraint is expressed by +. Folding and traversing function such as Y and Z is available via [ or \ class, if f is the instance of them. Since 0.1.0.0] Since 0.1.0.0^_`abcdefghijklmn] _`bcdefg^_`abcdefghijklmn]None !"&'(*+-./2346=BGJKMTXP-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 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.0 SNat version of  . Since 0.1.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 os. 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.0hTake 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.0sTake 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.0splitAtMost 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.0Empty sequence. Since 0.1.0.0Sequence 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.0%*Append an element to the tail of sequence. Since 0.1.0.0&Infix version of %. Since 0.1.0.0'Append two lists. Since 0.1.0.0(Infix version of '. Since 0.1.0.0))Concatenates multiple sequences into one. Since 0.1.0.0*9Zipping two sequences. Length is adjusted to shorter one. Since 0.1.0.0+*& for the sequences of the same length. Since 0.1.0.0,FZipping two sequences with funtion. Length is adjusted to shorter one. Since 0.1.0.0-,& for the sequences of the same length. Since 0.1.0.0.!Unzipping the sequence of tuples. Since 0.1.0.0/ Map function. Since 0.1.0.00Reverse function. Since 0.1.0.01 Intersperces. Since 0.1.0.02Remove all duplicates. Since 0.1.0.03$Sorting sequence by ascending order. Since 0.1.0.04Generalized version of 3. Since 0.1.0.05/Insert new element into the presorted sequence. Since 0.1.0.06Generalized version of 5. Since 0.1.0.07Convert to list. Since 0.1.0.08"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.098! with the result length inferred. Since 0.1.0.0:Unsafe version of 88. If the length of the given list does not equal to n!, then something unusual happens. Since 0.1.0.0;:! with the result length inferred. Since 0.1.0.0< Construct a  Sized f n a5 by padding default value if the given list is short. Since 0.1.0.0=<! with the result length inferred. Since 0.1.0.0>8Forget the length and obtain the wrapped base container. Since 0.1.0.0?+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.0@?! with the result length inferred. Since 0.1.0.0AUnsafe version of ?8. If the length of the given list does not equal to n!, then something unusual happens. Since 0.1.0.0BA! with the result length inferred. Since 0.1.0.0C Construct a  Sized f n a5 by padding default value if the given list is short. Since 0.1.0.0DC! with the result length inferred. Since 0.1.0.0EDTake the initial segment as long as elements satisfys the predicate. Since 0.1.0.0FDDrop the initial segment as long as elements satisfys the predicate. Since 0.1.0.0G Invariant: ListLike (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.0H Invariant: ListLike (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.0I Invariant: ListLike (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.0JMembership test; see also K. Since 0.1.0.0K Negation of J. Since 0.1.0.0L*Find the element satisfying the predicate. Since 0.1.0.0MM p xs find the element satisfying p! and returns its index if exists. Since 0.1.0.0No version of M. Since 0.1.0.0OO p xs find all elements satisfying p and returns their indices. Since 0.1.0.0Po version of O. Since 0.1.0.0Q>Returns the index of the given element in the list, if exists. Since 0.1.0.0ROrdinal version of Q Since 0.1.0.0S5Returns all indices of the given element in the list. Since 0.1.0.0TOrdinal version of S Since 0.1.0.0U,Case analysis for the cons-side of sequence. Since 0.1.0.0V,Case analysis for the snoc-side of sequence. Since 0.1.0.0p%Pattern synonym for cons-side uncons.Z  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVpqrst[  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVpqrsW  !"#$%&'()*+,-./0123456789:;<=>?@ABCD EFGHIJKLMNOPQRSTUVT   !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVpqrst$&(pru        !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]X^_[`aXbcXdefghijklmnopqrstuvwxyz{|}~ sized-0.1.0.0 Data.SizedData.Sized.Internal ListLikeFSizedSnocView:-::NilSVConsView::-NilCV Partitioned SomeSizedlengthsLengthnull!!%!!indexsIndexheadlastunconsunsnoctailinittake takeAtMostdropsplitAt splitAtMostempty singleton toSomeSized replicate replicate'cons<|snoc|>append++concatzipzipSamezipWith zipWithSameunzipmapreverse interspersenubsortsortByinsertinsertBytoListfromList fromList'unsafeFromListunsafeFromList'fromListWithDefaultfromListWithDefault'unsizedtoSizedtoSized' unsafeToSizedunsafeToSized'toSizedWithDefaulttoSizedWithDefault' takeWhile dropWhilespanbreak partitionelemnotElemfind findIndex sFindIndex findIndices sFindIndices elemIndex sElemIndex elemIndices sElemIndicesviewConsviewSnocbaseGHC.BaseFunctorListLike-4.1.0Data.ListLike.BaseListLikeGHC.ListallData.ListLike.FoldableLLfoldl' Data.FoldableFoldableData.Traversable Traversable$fFoldableLLSizedaLLFrunSizedinstLLFinstLL instFunctorgivenListLikeFgivenListLikeF' withListLikeFwithListLikeF'toProxy$f:=>ListLikeFoldableLL$fClassFoldableLLListLike$f:=>LLFListLike$fClassListLikeLLF$fLLFfa $fShowSizedtype-natural-0.2.3.1Data.Type.OrdinalOrdinal:<NilL:>NilR $fEqSomeSized