h$,)      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{None-./23567<>? sizedSized wraps a sequential type f' and makes length-parametrized version.Here, f must be the instance of  CFreeMonoid (f a) a for all a@. Since 0.2.0.0|sized Since 0.2.0.0}sized Since 0.4.0.0~sized 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&-./23567>?sized Wrapper for ? which takes length as its last element, instead of the second. Since 0.2.0.0None &'(-./023<>?(^sized-View of the left end of sequence (snoc-side). Since 0.7.0.0sized-View of the left end of sequence (cons-side). Since 0.7.0.0sized 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.7.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.7.0.0sized%Pattern synonym for snoc-side unsnoc.sized#Pattern synonym for a nil sequence. sized%Pattern synonym for cons-side uncons.!sized8Returns the length of wrapped containers. If you use unsafeFromList or similar unsafe functions, this function may return different value from type-parameterized length.Since 0.8.0.0 (type changed)"sizedSNat version of !.Since 0.8.0.0 (type changed)#sized%Test if the sequence is empty or not. Since 0.7.0.0$sized(Unsafe) indexing with Int4s. If you want to check boundary statically, use % or '. Since 0.7.0.0%sizedSafe indexing with s. Since 0.7.0.0&sizedFlipped version of $. Since 0.7.0.0'sizedFlipped version of %. Since 0.7.0.0(sizedTake the first element of non-empty sequence. If you want to make case-analysis for general sequence, see  #ViewsAndPatternsViews and Patterns section. Since 0.7.0.0)sizedTake the last element of non-empty sequence. If you want to make case-analysis for general sequence, see  #ViewsAndPatternsViews and Patterns section. Since 0.7.0.0*sized Take the ( and . of non-empty sequence. If you want to make case-analysis for general sequence, see  #ViewsAndPatternsViews and Patterns section. Since 0.7.0.0+sized* with explicit specified length n Since 0.7.0.0,sized Take the / and ) of non-empty sequence. If you want to make case-analysis for general sequence, see  #ViewsAndPatternsViews and Patterns section. Since 0.7.0.0-sized- with explicit specified length n Since 0.7.0.0.sizedTake the tail of non-empty sequence. If you want to make case-analysis for general sequence, see  #ViewsAndPatternsViews and Patterns section. Since 0.7.0.0/sizedTake the initial segment of non-empty sequence. If you want to make case-analysis for general sequence, see  #ViewsAndPatternsViews and Patterns section. Since 0.7.0.00sized take k xs takes first k element of xs where the length of xs should be larger than k. Since 0.7.0.01sized1 k xs takes first at most k elements of xs. Since 0.7.0.02sized drop k xs drops first k element of xs8 and returns the rest of sequence, where the length of xs should be larger than k. Since 0.7.0.03sized splitAt k xs split xs at k, where the length of xs! should be less than or equal to k. Since 0.7.0.04sizedsplitAtMost k xs split xs at k. If k exceeds the length of xs,, then the second result value become empty. Since 0.7.0.05sizedEmpty sequence.Since 0.7.0.0 (type changed)6sizedSequence with one element. Since 0.7.0.07sized Consruct the  sequence from base type, but the length parameter is dynamically determined and existentially quantified; see also . Since 0.7.0.08sizedReplicates the same value. Since 0.7.0.09sized8 with the length inferred. Since 0.7.0.0:sizedConstruct a sequence of the given length by applying the function to each index. Since 0.7.0.0;sized: with length inferred. Since 0.8.0.0<sized*Append an element to the head of sequence. Since 0.8.0.0=sizedInfix version of <. Since 0.8.0.0>sized*Append an element to the tail of sequence. Since 0.7.0.0?sizedInfix version of >. Since 0.7.0.0@sizedAppend two lists. Since 0.7.0.0AsizedInfix version of @. Since 0.7.0.0Bsized)Concatenates multiple sequences into one. Since 0.7.0.0Csized9Zipping two sequences. Length is adjusted to shorter one. Since 0.7.0.0DsizedC& for the sequences of the same length. Since 0.7.0.0EsizedZipping two sequences with funtion. Length is adjusted to shorter one. Since 0.7.0.0FsizedE& for the sequences of the same length. Since 0.7.0.0Gsized!Unzipping the sequence of tuples. Since 0.7.0.0Hsized!Unzipping the sequence of tuples. Since 0.7.0.0Isized Map function. Since 0.7.0.0JsizedReverse function. Since 0.7.0.0Ksized Intersperces. Since 0.7.0.0LsizedRemove all duplicates. Since 0.7.0.0Msized$Sorting sequence by ascending order. Since 0.7.0.0NsizedGeneralized version of M. Since 0.7.0.0Osized/Insert new element into the presorted sequence. Since 0.7.0.0PsizedGeneralized version of O. Since 0.7.0.0QsizedConvert to list. Since 0.7.0.0Rsized"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.7.0.0 (type changed)SsizedR! with the result length inferred. Since 0.7.0.0TsizedUnsafe version of R7. If the length of the given list does not equal to n!, then something unusual happens. Since 0.7.0.0UsizedT! with the result length inferred. Since 0.7.0.0Vsized Construct a  Sized f n a5 by padding default value if the given list is short.Since 0.5.0.0 (type changed)WsizedV! with the result length inferred. Since 0.7.0.0Xsized8Forget the length and obtain the wrapped base container. Since 0.7.0.0Ysized+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.7.0.0ZsizedY! with the result length inferred. Since 0.7.0.0[sizedUnsafe version of Y7. If the length of the given list does not equal to n!, then something unusual happens. Since 0.7.0.0\sized[! with the result length inferred. Since 0.7.0.0]sized Construct a  Sized f n a5 by padding default value if the given list is short. Since 0.7.0.0^sized]! with the result length inferred. Since 0.7.0.0_sizedTake the initial segment as long as elements satisfys the predicate. Since 0.7.0.0`sizedDrop the initial segment as long as elements satisfys the predicate. Since 0.7.0.0asizedSplit the sequence into the longest prefix of elements that satisfy the predicate and the rest. Since 0.7.0.0bsizedSplit the sequence into the longest prefix of elements that do not satisfy the predicate and the rest. Since 0.7.0.0csizedSplit the sequence in two parts, the first one containing those elements that satisfy the predicate and the second one those that don't. Since 0.7.0.0dsizedMembership test; see also e. Since 0.7.0.0esized Negation of d. Since 0.7.0.0fsized*Find the element satisfying the predicate. Since 0.7.0.0gsizedg p xs find the element satisfying p! and returns its index if exists. Since 0.7.0.0hsized version of g. Since 0.7.0.0isizedi p xs find all elements satisfying p and returns their indices. Since 0.7.0.0jsized version of i. Since 0.7.0.0ksized>Returns the index of the given element in the list, if exists. Since 0.7.0.0lsizedOrdinal version of k. Since 0.7.0.0, we no longer do boundary check inside the definition. Since 0.7.0.0msizedSince 0.5.0.0 (type changed)Ordinal version of k. Since 0.7.0.0, we no longer do boundary check inside the definition. Since 0.7.0.0nsized5Returns all indices of the given element in the list. Since 0.7.0.0osizedOrdinal version of n Since 0.7.0.0psized,Case analysis for the cons-side of sequence.Since 0.5.0.0 (type changed)qsized,Case analysis for the snoc-side of sequence.Since 0.5.0.0 (type changed)usizedN.B. Since calign is just zipping for fixed n, we require more strong  constraint here.zsized#Applicative instance, generalizing . !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopq!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopq 555 5=5?5A5None)o !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopq      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~$sized-1.0.0.0-60u185ZJXTGB6sNyZatP9Z Data.SizedData.Sized.FlippedData.Sized.Internal Data.MonoidZipListData.Sized.BuiltinSizedFlipped runFlipped $fShowFlipped $fEqFlipped $fOrdFlipped$fNFDataFlipped$fHashableFlipped $fIxedFlipped$fMonoTraversableFlipped$fWrappedFlipped$fRewrappedFlippedt$fMonoFoldableFlipped$fMonoFunctorFlippedDomCSnocViewNilSV:-::ConsViewNilCV:- PartitionedUnsnocUncons SomeSized:>Nil:<lengthsLengthnull!!%!!indexsIndexheadlastunconsuncons'unsnocunsnoc'tailinittake takeAtMostdropsplitAt splitAtMostempty singleton toSomeSized replicate replicate'generate generate'cons<|snoc|>append++concatzipzipSamezipWith zipWithSameunzip unzipWithmapreverse interspersenubsortsortByinsertinsertBytoListfromList fromList'unsafeFromListunsafeFromList'fromListWithDefaultfromListWithDefault'unsizedtoSizedtoSized' unsafeToSizedunsafeToSized'toSizedWithDefaulttoSizedWithDefault' takeWhile dropWhilespanbreak partitionelemnotElemfind findIndex sFindIndex findIndices sFindIndices elemIndex sElemIndexsUnsafeElemIndex elemIndices sElemIndicesviewConsviewSnoc$fCTraversableSized$fCRepeatSized $fCZipSized$fCSemialignSized$fCApplicativeSized$fCPointedSized $fEqSomeSized$fShowSomeSized$fApplicativeSized$fDomCfa"$fTraversableWithIndexOrdinalSized$fFoldableWithIndexOrdinalSized$fFunctorWithIndexOrdinalSizedD:R:IxValueSizedD:R:IndexSized$fMonoTraversableSized$fMonoTraversableSized0$fMonoTraversableSized1$fMonoFunctorSized$fMonoFoldableSizedrunSized*type-natural-1.0.0.0-b7g6PRWPOyDSMaf0On4PvData.Type.OrdinalOrdinal,subcategories-0.1.0.0-IFl71G75DU0FNkZ44kUGrCControl.Subcategory.ZipCZip