!C]J      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHINone,-.12456;=>?@AHMRSUVX 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.0Jsized Since 0.2.0.0Ksized Since 0.4.0.0Lsized Since 0.2.0.0Msized Since 0.3.0.0Nsized Since 0.2.0.0Osized Since 0.6.0.0Psized Since 0.6.0.0Qsized Since 0.2.0.0Rsized Since 0.2.0.0Ssized Since 0.2.0.0TUNone%,-.12456=>?@AHMRSUVXgasized Wrapper for ? which takes length as its last element, instead of the second. Since 0.2.0.0None%%&',-./12456;=>?@AHMRSUVX_gkq [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 cons-side nil.!sized#Pattern synonym for a nil sequence."sized%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.8.0.0 (type changed)$sizedSing 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 Vs. Since 0.7.0.0(sizedFlipped version of &. Since 0.7.0.0)sizedFlipped version of '. Since 0.7.0.0*sizedqTake 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+sizedpTake 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 0[ 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 1 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.00sizedhTake 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.01sizedsTake 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.02sized take k xs takes first k element of xs where the length of xs should be larger than k. Since 0.7.0.03sized3 k xs takes first at most k elements of xs. Since 0.7.0.04sized 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.05sized splitAt k xs split xs at k, where the length of xs! should be less than or equal to k. Since 0.7.0.06sizedsplitAtMost k xs split xs at k. If k exceeds the length of xs,, then the second result value become empty. Since 0.7.0.07sizedEmpty sequence.Since 0.7.0.0 (type changed)8sizedSequence with one element. Since 0.7.0.09sized Consruct the z sequence from base type, but the length parameter is dynamically determined and existentially quantified; see also . Since 0.7.0.0:sizedReplicates the same value. Since 0.7.0.0;sized: with the length inferred. Since 0.7.0.0<sizedPConstruct 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.0AsizedInfix version of @. Since 0.7.0.0BsizedAppend two lists. Since 0.7.0.0CsizedInfix version of B. Since 0.7.0.0Dsized)Concatenates multiple sequences into one. Since 0.7.0.0Esized9Zipping two sequences. Length is adjusted to shorter one. Since 0.7.0.0FsizedE& for the sequences of the same length. Since 0.7.0.0GsizedFZipping two sequences with funtion. Length is adjusted to shorter one. Since 0.7.0.0HsizedG& for the sequences of the same length. Since 0.7.0.0Isized!Unzipping the sequence of tuples. Since 0.7.0.0Jsized!Unzipping the sequence of tuples. Since 0.7.0.0Ksized Map function. Since 0.7.0.0LsizedReverse function. Since 0.7.0.0Msized Intersperces. Since 0.7.0.0NsizedRemove all duplicates. Since 0.7.0.0Osized$Sorting sequence by ascending order. Since 0.7.0.0PsizedGeneralized version of O. Since 0.7.0.0Qsized/Insert new element into the presorted sequence. Since 0.7.0.0RsizedGeneralized version of Q. Since 0.7.0.0SsizedConvert to list. Since 0.7.0.0Tsized"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)UsizedT! with the result length inferred. Since 0.7.0.0VsizedUnsafe version of T7. If the length of the given list does not equal to n!, then something unusual happens. Since 0.7.0.0WsizedV! with the result length inferred. Since 0.7.0.0Xsized Construct a  Sized f n a5 by padding default value if the given list is short.Since 0.5.0.0 (type changed)YsizedX! with the result length inferred. Since 0.7.0.0Zsized8Forget the length and obtain the wrapped base container. Since 0.7.0.0[sized+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.0\sized[! with the result length inferred. Since 0.7.0.0]sizedUnsafe version of [7. 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.0asizedDTake the initial segment as long as elements satisfys the predicate. Since 0.7.0.0bsizedDDrop the initial segment as long as elements satisfys the predicate. Since 0.7.0.0csizedeSplit the sequence into the longest prefix of elements that satisfy the predicate and the rest. Since 0.7.0.0dsizedlSplit the sequence into the longest prefix of elements that do not satisfy the predicate and the rest. Since 0.7.0.0esizedSplit 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.0fsizedMembership test; see also g. Since 0.7.0.0gsized Negation of f. Since 0.7.0.0hsized*Find the element satisfying the predicate. Since 0.7.0.0isizedi p xs find the element satisfying p! and returns its index if exists. Since 0.7.0.0jsizedV version of i. Since 0.7.0.0ksizedk p xs find all elements satisfying p and returns their indices. Since 0.7.0.0lsizedV version of k. Since 0.7.0.0msized>Returns the index of the given element in the list, if exists. Since 0.7.0.0nsizedOrdinal version of mI. Since 0.7.0.0, we no longer do boundary check inside the definition. Since 0.7.0.0osizedSince 0.5.0.0 (type changed)Ordinal version of mI. Since 0.7.0.0, we no longer do boundary check inside the definition. Since 0.7.0.0psized5Returns all indices of the given element in the list. Since 0.7.0.0qsizedOrdinal version of p Since 0.7.0.0rsized,Case analysis for the cons-side of sequence.Since 0.5.0.0 (type changed)ssized,Case analysis for the snoc-side of sequence.Since 0.5.0.0 (type changed)wsizedN.B. Since calign is just zipping for fixed n, we require more strong W constraint here.|sized#Applicative instance, generalizing .f !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrsf#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrs!" 555"5?5A5C5None%&'-.@AHSUVXgk_~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 sequence 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.0sizedSized wraps a sequential type f' and makes length-parametrized version.Here, f must satisfy X f and Dom f a. Since 0.2.0.0sized"Pattern synonym for snoc-side nil.sized%Pattern synonym for snoc-side unsnoc.sized"Pattern synonym for cons-side nil.sized#Pattern synonym for a nil sequence.sized%Pattern synonym for cons-side uncons.sized Since 0.8.0.0sized Since 0.8.0.0sized Since 0.8.0.0sized Since 0.8.0.0sized8Returns 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.8.0.0 (type changed)sizedSing version of .Since 0.8.0.0 (type changed)sized%Test if the sequence is empty or not. Since 0.7.0.0sized(Unsafe) indexing with Int4s. If you want to check boundary statically, use  or . Since 0.7.0.0sizedSafe indexing with s. Since 0.7.0.0sizedFlipped version of . Since 0.7.0.0sizedFlipped version of . Since 0.7.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.7.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.7.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.7.0.0sized with explicit specified length n Since 0.7.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.7.0.0sized with explicit specified length n Since 0.7.0.0sizedhTake 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.0sizedsTake 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.0sized take k xs takes first k element of xs where the length of xs should be larger than k. Since 0.7.0.0sized k xs takes first at most k elements of xs. Since 0.7.0.0sized 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.0sized splitAt k xs split xs at k, where the length of xs! should be less than or equal to k. Since 0.7.0.0sizedsplitAtMost k xs split xs at k. If k exceeds the length of xs,, then the second result value become empty. Since 0.7.0.0sizedEmpty sequence.Since 0.7.0.0 (type changed)sizedSequence with one element. Since 0.7.0.0sized Consruct the z sequence from base type, but the length parameter is dynamically determined and existentially quantified; see also  SomeSized'. Since 0.7.0.0sizedReplicates the same value. Since 0.7.0.0sized with the length inferred. Since 0.7.0.0sizedPConstruct a sequence of the given length by applying the function to each index. Since 0.7.0.0sized with length inferred. Since 0.8.0.0sized*Append an element to the head of sequence. Since 0.7.0.0sized*Append an element to the tail of sequence. Since 0.7.0.0sizedInfix version of . Since 0.7.0.0sized*Append an element to the tail of sequence. Since 0.7.0.0sizedInfix version of . Since 0.7.0.0sizedAppend two lists. Since 0.7.0.0sized)Concatenates multiple sequences into one. Since 0.7.0.0sized9Zipping two sequences. Length is adjusted to shorter one. Since 0.7.0.0sized& for the sequences of the same length. Since 0.7.0.0sizedFZipping two sequences with funtion. Length is adjusted to shorter one. Since 0.7.0.0sized& for the sequences of the same length. Since 0.7.0.0sized!Unzipping the sequence of tuples. Since 0.7.0.0sized!Unzipping the sequence of tuples. Since 0.7.0.0sized Map function. Since 0.7.0.0sizedReverse function. Since 0.7.0.0sized Intersperces. Since 0.7.0.0sizedRemove all duplicates. Since 0.7.0.0sized$Sorting sequence by ascending order. Since 0.7.0.0sizedGeneralized version of . Since 0.7.0.0sized/Insert new element into the presorted sequence. Since 0.7.0.0sizedGeneralized version of . Since 0.7.0.0sizedConvert to list. Since 0.7.0.0sized"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)sized! with the result length inferred. Since 0.7.0.0sizedUnsafe version of 7. If the length of the given list does not equal to n!, then something unusual happens. Since 0.7.0.0sized! with the result length inferred. Since 0.7.0.0sized Construct a  Sized f n a5 by padding default value if the given list is short.Since 0.5.0.0 (type changed)sized! with the result length inferred. Since 0.7.0.0sized8Forget the length and obtain the wrapped base container. Since 0.7.0.0sized+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.0sized! with the result length inferred. Since 0.7.0.0sizedUnsafe version of 7. If the length of the given list does not equal to n!, then something unusual happens. Since 0.7.0.0sized! with the result length inferred. Since 0.7.0.0sized Construct a  Sized f n a5 by padding default value if the given list is short. Since 0.7.0.0sized! with the result length inferred. Since 0.7.0.0sizedDTake the initial segment as long as elements satisfys the predicate. Since 0.7.0.0sizedDDrop the initial segment as long as elements satisfys the predicate. Since 0.7.0.0sizedeSplit the sequence into the longest prefix of elements that satisfy the predicate and the rest. Since 0.7.0.0sizedlSplit the sequence into the longest prefix of elements that do not satisfy the predicate and the rest. Since 0.7.0.0sizedSplit 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.0sizedMembership test; see also . Since 0.7.0.0sized Negation of . Since 0.7.0.0sized*Find the element satisfying the predicate. Since 0.7.0.0sized p xs find the element satisfying p! and returns its index if exists. Since 0.7.0.0sized version of . Since 0.7.0.0sized p xs find all elements satisfying p and returns their indices. Since 0.7.0.0sized version of . Since 0.7.0.0sized>Returns the index of the given element in the list, if exists. Since 0.8.0.0sizedOrdinal version of J. Since 0.7.0.0, we no longer do boundary check inside the definition.  Since 0.7.0.0sizedOrdinal version of J. Since 0.7.0.0, we no longer do boundary check inside the definition.  Since 0.7.0.0sized5Returns all indices of the given element in the list. Since 0.8.0.0sizedOrdinal version of  Since 0.8.0.0sized,Case analysis for the cons-side of sequence.Since 0.5.0.0 (type changed)sized,Case analysis for the snoc-side of sequence.Since 0.8.0.0 (type changed)g~g~559 9 None%&'-.@AHSUVXgk_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 sequence 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.0sizedSized wraps a sequential type f' and makes length-parametrized version.Here, f must satisfy X f and Dom f a. Since 0.2.0.0sized"Pattern synonym for snoc-side nil.sized%Pattern synonym for snoc-side unsnoc.sized"Pattern synonym for cons-side nil.sized#Pattern synonym for a nil sequence.sized%Pattern synonym for cons-side uncons.sized Since 0.8.0.0sized Since 0.8.0.0sized Since 0.8.0.0sized Since 0.8.0.0sized8Returns 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.8.0.0 (type changed)sizedSing version of .Since 0.8.0.0 (type changed)sized%Test if the sequence is empty or not. Since 0.7.0.0sized(Unsafe) indexing with Int4s. If you want to check boundary statically, use  or . Since 0.7.0.0sizedSafe indexing with s. Since 0.7.0.0sizedFlipped version of . Since 0.7.0.0sizedFlipped version of . Since 0.7.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.7.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.7.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.7.0.0sized with explicit specified length n Since 0.7.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.7.0.0sized with explicit specified length n Since 0.7.0.0sizedhTake 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.0sizedsTake 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.0sized take k xs takes first k element of xs where the length of xs should be larger than k. Since 0.7.0.0 sized  k xs takes first at most k elements of xs. Since 0.7.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 k. Since 0.7.0.0 sized splitAt k xs split xs at k, where the length of xs! should be less than or equal to k. Since 0.7.0.0 sizedsplitAtMost k xs split xs at k. If k exceeds the length of xs,, then the second result value become empty. Since 0.7.0.0 sizedEmpty sequence.Since 0.7.0.0 (type changed)sizedSequence with one element. Since 0.7.0.0sized Consruct the z sequence from base type, but the length parameter is dynamically determined and existentially quantified; see also  SomeSized'. Since 0.7.0.0sizedReplicates the same value. Since 0.7.0.0sized with the length inferred. Since 0.7.0.0sizedPConstruct a sequence of the given length by applying the function to each index. Since 0.7.0.0sized with length inferred. Since 0.8.0.0sized*Append an element to the head of sequence. Since 0.7.0.0sized*Append an element to the tail of sequence. Since 0.7.0.0sizedInfix version of . Since 0.7.0.0sized*Append an element to the tail of sequence. Since 0.7.0.0sizedInfix version of . Since 0.7.0.0sizedAppend two lists. Since 0.7.0.0sized)Concatenates multiple sequences into one. Since 0.7.0.0sized9Zipping two sequences. Length is adjusted to shorter one. Since 0.7.0.0sized& for the sequences of the same length. Since 0.7.0.0sizedFZipping two sequences with funtion. Length is adjusted to shorter one. Since 0.7.0.0sized& for the sequences of the same length. Since 0.7.0.0sized!Unzipping the sequence of tuples. Since 0.7.0.0 sized!Unzipping the sequence of tuples. Since 0.7.0.0!sized Map function. Since 0.7.0.0"sizedReverse function. Since 0.7.0.0#sized Intersperces. Since 0.7.0.0$sizedRemove all duplicates. Since 0.7.0.0%sized$Sorting sequence by ascending order. Since 0.7.0.0&sizedGeneralized version of %. Since 0.7.0.0'sized/Insert new element into the presorted sequence. Since 0.7.0.0(sizedGeneralized version of '. Since 0.7.0.0)sizedConvert to list. Since 0.7.0.0*sized"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)+sized*! with the result length inferred. Since 0.7.0.0,sizedUnsafe version of *7. 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.5.0.0 (type changed)/sized.! with the result length inferred. Since 0.7.0.00sized8Forget the length and obtain the wrapped base container. Since 0.7.0.01sized+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.02sized1! with the result length inferred. Since 0.7.0.03sizedUnsafe version of 17. If the length of the given list does not equal to n!, then something unusual happens. Since 0.7.0.04sized3! with the result length inferred. Since 0.7.0.05sized Construct a  Sized f n a5 by padding default value if the given list is short. Since 0.7.0.06sized5! with the result length inferred. Since 0.7.0.07sizedDTake the initial segment as long as elements satisfys the predicate. Since 0.7.0.08sizedDDrop the initial segment as long as elements satisfys the predicate. Since 0.7.0.09sizedeSplit the sequence into the longest prefix of elements that satisfy the predicate and the rest. Since 0.7.0.0:sizedlSplit the sequence into the longest prefix of elements that do not satisfy the predicate and the rest. Since 0.7.0.0;sizedSplit 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.0<sizedMembership test; see also =. Since 0.7.0.0=sized Negation of <. Since 0.7.0.0>sized*Find the element satisfying the predicate. Since 0.7.0.0?sized? p xs find the element satisfying p! and returns its index if exists. Since 0.7.0.0@sized version of ?. Since 0.7.0.0AsizedA p xs find all elements satisfying p and returns their indices. Since 0.7.0.0Bsized version of A. Since 0.7.0.0Csized>Returns the index of the given element in the list, if exists. Since 0.7.0.0DsizedOrdinal version of CJ. Since 0.7.0.0, we no longer do boundary check inside the definition.  Since 0.7.0.0EsizedOrdinal version of CJ. Since 0.7.0.0, we no longer do boundary check inside the definition.  Since 0.7.0.0Fsized5Returns all indices of the given element in the list. Since 0.8.0.0GsizedOrdinal version of F Since 0.8.0.0Hsized,Case analysis for the cons-side of sequence.Since 0.5.0.0 (type changed)Isized,Case analysis for the snoc-side of sequence.Since 0.8.0.0 (type changed)g      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIg      !"#$%&'()*+,-./0123456789:;<=>?@ABCEDFGHI559 9 Y        !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~!"#$%&'()*+,-./0123456789:;<=>?@ACBDFEGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnoprqstuv!"#$%&'()*+,-./0123456789:;<=>?@ACBDFEGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnoprqstuv$sized-0.8.0.0-A5G9n4YjIjzILfXufTCrZ3 Data.SizedData.Sized.FlippedData.Sized.BuiltinData.Sized.PeanoData.Sized.Internal Data.MonoidZipListSizedFlipped runFlipped $fShowFlipped $fEqFlipped $fOrdFlipped$fNFDataFlipped$fHashableFlipped $fIxedFlipped$fMonoTraversableFlipped$fWrappedFlipped$fRewrappedFlippedt$fMonoFoldableFlipped$fMonoFunctorFlippedDomCSnocViewNilSV:-::ConsViewNilCV:- PartitionedUnsnocUncons SomeSized'NilR:>NilLNil:<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 SomeSizedOrdinal"$fTraversableWithIndexOrdinalSized$fFoldableWithIndexOrdinalSized$fFunctorWithIndexOrdinalSizedD:R:IxValueSizedD:R:IndexSized$fMonoTraversableSized$fMonoTraversableSized0$fMonoTraversableSized1$fMonoFunctorSized$fMonoFoldableSizedrunSized*type-natural-0.9.0.0-Ab05PnnE7F3MoUEZKWWaIData.Type.Ordinal,subcategories-0.1.0.0-8tZgEzMnVW7GvqwPNnCEKHControl.Subcategory.ZipCZipControl.Subcategory.Foldable CFreeMonoid