-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Sized sequence data-types
--   
--   A wrapper to make length-parametrized data-type from functorial
--   data-types.
@package sized
@version 1.0.0.2

module Data.Sized.Flipped

-- | Wrapper for <tt><a>Sized</a></tt> which takes length as its last
--   element, instead of the second.
--   
--   Since 0.2.0.0
newtype Flipped f a n
Flipped :: Sized f n a -> Flipped f a n
[runFlipped] :: Flipped f a n -> Sized f n a
instance Data.MonoTraversable.MonoFunctor (f a) => Data.MonoTraversable.MonoFunctor (Data.Sized.Flipped.Flipped f a n)
instance Data.MonoTraversable.MonoFoldable (f a) => Data.MonoTraversable.MonoFoldable (Data.Sized.Flipped.Flipped f a n)
instance (Data.Sized.Flipped.Flipped f1 a1 n1 GHC.Types.~ t) => Control.Lens.Wrapped.Rewrapped (Data.Sized.Flipped.Flipped f2 a2 n2) t
instance Control.Lens.Wrapped.Wrapped (Data.Sized.Flipped.Flipped f a n)
instance Data.MonoTraversable.MonoTraversable (f a) => Data.MonoTraversable.MonoTraversable (Data.Sized.Flipped.Flipped f a n)
instance (GHC.Real.Integral (Control.Lens.At.Index (f a)), Control.Lens.At.Ixed (f a)) => Control.Lens.At.Ixed (Data.Sized.Flipped.Flipped f a n)
instance Data.Hashable.Class.Hashable (f a) => Data.Hashable.Class.Hashable (Data.Sized.Flipped.Flipped f a n)
instance Control.DeepSeq.NFData (f a) => Control.DeepSeq.NFData (Data.Sized.Flipped.Flipped f a n)
instance GHC.Classes.Ord (f a) => GHC.Classes.Ord (Data.Sized.Flipped.Flipped f a n)
instance GHC.Classes.Eq (f a) => GHC.Classes.Eq (Data.Sized.Flipped.Flipped f a n)
instance GHC.Show.Show (f a) => GHC.Show.Show (Data.Sized.Flipped.Flipped f a n)


-- | This module provides the functionality to make length-parametrized
--   types from existing <a>CFreeMonoid</a> sequential types.
--   
--   Most of the complexity of operations for <tt>Sized f n a</tt> are the
--   same as original operations for <tt>f</tt>. For example, <a>!!</a> is
--   O(1) for <tt>Sized Vector n a</tt> but O(i) for <tt>Sized [] n a</tt>.
--   
--   This module also provides powerful view types and pattern synonyms to
--   inspect the sized sequence. See <a>Views and Patterns</a> for more
--   detail.
module Data.Sized

-- | <tt>Sized</tt> wraps a sequential type <tt>f</tt> and makes
--   length-parametrized version.
--   
--   Here, <tt>f</tt> must be the instance of <tt>CFreeMonoid</tt> (f a)
--   a<tt> for all </tt>a@.
--   
--   Since 0.2.0.0
data Sized (f :: Type -> Type) (n :: Nat) a

-- | <a>Sized</a> vector with the length is existentially quantified. This
--   type is used mostly when the return type's length cannot be statically
--   determined beforehand.
--   
--   <tt>SomeSized sn xs :: SomeSized f a</tt> stands for the <a>Sized</a>
--   sequence <tt>xs</tt> of element type <tt>a</tt> and length
--   <tt>sn</tt>.
--   
--   Since 0.7.0.0
data SomeSized f a
[SomeSized] :: SNat n -> Sized f n a -> SomeSized f a
class Dom f a => DomC f a

-- | Returns the length of wrapped containers. If you use
--   <tt>unsafeFromList</tt> or similar unsafe functions, this function may
--   return different value from type-parameterized length.
--   
--   Since 0.8.0.0 (type changed)
length :: forall f (n :: Nat) a. (Dom f a, KnownNat n) => Sized f n a -> Int

-- | <tt>SNat</tt> version of <a>length</a>.
--   
--   Since 0.8.0.0 (type changed)
sLength :: forall f (n :: Nat) a. (Dom f a, KnownNat n) => Sized f n a -> SNat n

-- | Test if the sequence is empty or not.
--   
--   Since 0.7.0.0
null :: forall f (n :: Nat) a. (CFoldable f, Dom f a) => Sized f n a -> Bool

-- | (Unsafe) indexing with <tt>Int</tt>s. If you want to check boundary
--   statically, use <a>%!!</a> or <a>sIndex</a>.
--   
--   Since 0.7.0.0
(!!) :: forall f (m :: Nat) a. (CFoldable f, Dom f a, 1 <= m) => Sized f m a -> Int -> a

-- | Safe indexing with <a>Ordinal</a>s.
--   
--   Since 0.7.0.0
(%!!) :: forall f (n :: Nat) c. (CFoldable f, Dom f c) => Sized f n c -> Ordinal n -> c

-- | Flipped version of <a>!!</a>.
--   
--   Since 0.7.0.0
index :: forall f (m :: Nat) a. (CFoldable f, Dom f a, 1 <= m) => Int -> Sized f m a -> a

-- | Flipped version of <a>%!!</a>.
--   
--   Since 0.7.0.0
sIndex :: forall f (n :: Nat) c. (CFoldable f, Dom f c) => Ordinal n -> Sized f n c -> c

-- | Take the first element of non-empty sequence. If you want to make
--   case-analysis for general sequence, see <a>Views and Patterns</a>
--   section.
--   
--   Since 0.7.0.0
head :: forall f (n :: Nat) a. (CFoldable f, Dom f a, 0 < n) => Sized f n a -> a

-- | Take the last element of non-empty sequence. If you want to make
--   case-analysis for general sequence, see <a>Views and Patterns</a>
--   section.
--   
--   Since 0.7.0.0
last :: forall f (n :: Nat) a. (0 < n, CFoldable f, Dom f a) => Sized f n a -> a

-- | Take the <a>head</a> and <a>tail</a> of non-empty sequence. If you
--   want to make case-analysis for general sequence, see <a>Views and
--   Patterns</a> section.
--   
--   Since 0.7.0.0
uncons :: forall f (n :: Nat) a. (KnownNat n, CFreeMonoid f, Dom f a, 1 <= n) => Sized f n a -> Uncons f n a

-- | <a>uncons</a> with explicit specified length <tt>n</tt>
--   
--   Since 0.7.0.0
uncons' :: forall f (n :: Nat) a proxy. (KnownNat n, CFreeMonoid f, Dom f a) => proxy n -> Sized f (Succ n) a -> Uncons f (Succ n) a
data Uncons f (n :: Nat) a
[Uncons] :: forall f (n :: Nat) a. KnownNat n => a -> Sized f n a -> Uncons f (1 + n) a

-- | Take the <a>init</a> and <a>last</a> of non-empty sequence. If you
--   want to make case-analysis for general sequence, see <a>Views and
--   Patterns</a> section.
--   
--   Since 0.7.0.0
unsnoc :: forall f (n :: Nat) a. (KnownNat n, CFreeMonoid f, Dom f a, 0 < n) => Sized f n a -> Unsnoc f n a

-- | <a>unsnoc'</a> with explicit specified length <tt>n</tt>
--   
--   Since 0.7.0.0
unsnoc' :: forall f (n :: Nat) a proxy. (KnownNat n, CFreeMonoid f, Dom f a) => proxy n -> Sized f (Succ n) a -> Unsnoc f (Succ n) a
data Unsnoc f n a
[Unsnoc] :: forall f n a. Sized f (n :: Nat) a -> a -> Unsnoc f (Succ n) a

-- | Take the tail of non-empty sequence. If you want to make case-analysis
--   for general sequence, see <a>Views and Patterns</a> section.
--   
--   Since 0.7.0.0
tail :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => Sized f (1 + n) a -> Sized f n a

-- | Take the initial segment of non-empty sequence. If you want to make
--   case-analysis for general sequence, see <a>Views and Patterns</a>
--   section.
--   
--   Since 0.7.0.0
init :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => Sized f (n + 1) a -> Sized f n a

-- | <tt>take k xs</tt> takes first <tt>k</tt> element of <tt>xs</tt> where
--   the length of <tt>xs</tt> should be larger than <tt>k</tt>.
--   
--   Since 0.7.0.0
take :: forall (n :: Nat) f (m :: Nat) a. (CFreeMonoid f, Dom f a, n <= m) => SNat n -> Sized f m a -> Sized f n a

-- | <tt><a>takeAtMost</a> k xs</tt> takes first at most <tt>k</tt>
--   elements of <tt>xs</tt>.
--   
--   Since 0.7.0.0
takeAtMost :: forall (n :: Nat) f m a. (CFreeMonoid f, Dom f a) => SNat n -> Sized f m a -> Sized f (Min n m) a

-- | <tt>drop k xs</tt> drops first <tt>k</tt> element of <tt>xs</tt> and
--   returns the rest of sequence, where the length of <tt>xs</tt> should
--   be larger than <tt>k</tt>.
--   
--   Since 0.7.0.0
drop :: forall (n :: Nat) f (m :: Nat) a. (CFreeMonoid f, Dom f a, n <= m) => SNat n -> Sized f m a -> Sized f (m - n) a

-- | <tt>splitAt k xs</tt> split <tt>xs</tt> at <tt>k</tt>, where the
--   length of <tt>xs</tt> should be less than or equal to <tt>k</tt>.
--   
--   Since 0.7.0.0
splitAt :: forall (n :: Nat) f m a. (CFreeMonoid f, Dom f a, n <= m) => SNat n -> Sized f m a -> (Sized f n a, Sized f (m -. n) a)

-- | <tt>splitAtMost k xs</tt> split <tt>xs</tt> at <tt>k</tt>. If
--   <tt>k</tt> exceeds the length of <tt>xs</tt>, then the second result
--   value become empty.
--   
--   Since 0.7.0.0
splitAtMost :: forall (n :: Nat) f (m :: Nat) a. (CFreeMonoid f, Dom f a) => SNat n -> Sized f m a -> (Sized f (Min n m) a, Sized f (m -. n) a)

-- | Empty sequence.
--   
--   Since 0.7.0.0 (type changed)
empty :: forall f a. (Monoid (f a), Dom f a) => Sized f 0 a

-- | Sequence with one element.
--   
--   Since 0.7.0.0
singleton :: forall f a. (CPointed f, Dom f a) => a -> Sized f 1 a

-- | Consruct the <a>Sized</a> sequence from base type, but the length
--   parameter is dynamically determined and existentially quantified; see
--   also <a>SomeSized</a>.
--   
--   Since 0.7.0.0
toSomeSized :: forall f a. (Dom f a, CFoldable f) => f a -> SomeSized f a

-- | Replicates the same value.
--   
--   Since 0.7.0.0
replicate :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => SNat n -> a -> Sized f n a

-- | <a>replicate</a> with the length inferred.
--   
--   Since 0.7.0.0
replicate' :: forall f (n :: Nat) a. (KnownNat (n :: Nat), CFreeMonoid f, Dom f a) => a -> Sized f n a

-- | Construct a sequence of the given length by applying the function to
--   each index.
--   
--   Since 0.7.0.0
generate :: forall f (n :: Nat) (a :: Type). (CFreeMonoid f, Dom f a) => SNat n -> (Ordinal n -> a) -> Sized f n a

-- | <a>generate</a> with length inferred.
--   
--   Since 0.8.0.0
generate' :: forall f (n :: Nat) (a :: Type). (KnownNat n, CFreeMonoid f, Dom f a) => (Ordinal n -> a) -> Sized f n a

-- | Append an element to the head of sequence.
--   
--   Since 0.8.0.0
cons :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => a -> Sized f n a -> Sized f (1 + n) a

-- | Infix version of <a>cons</a>.
--   
--   Since 0.8.0.0
(<|) :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => a -> Sized f n a -> Sized f (1 + n) a
infixr 5 <|

-- | Append an element to the tail of sequence.
--   
--   Since 0.7.0.0
snoc :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => Sized f n a -> a -> Sized f (n + 1) a

-- | Infix version of <a>snoc</a>.
--   
--   Since 0.7.0.0
(|>) :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => Sized f n a -> a -> Sized f (n + 1) a
infixl 5 |>

-- | Append two lists.
--   
--   Since 0.7.0.0
append :: forall f (n :: Nat) (m :: Nat) a. (CFreeMonoid f, Dom f a) => Sized f n a -> Sized f m a -> Sized f (n + m) a

-- | Infix version of <a>append</a>.
--   
--   Since 0.7.0.0
(++) :: forall f (n :: Nat) (m :: Nat) a. (CFreeMonoid f, Dom f a) => Sized f n a -> Sized f m a -> Sized f (n + m) a
infixr 5 ++

-- | Concatenates multiple sequences into one.
--   
--   Since 0.7.0.0
concat :: forall f' (m :: Nat) f (n :: Nat) a. (CFreeMonoid f, CFunctor f', CFoldable f', Dom f a, Dom f' (f a), Dom f' (Sized f n a)) => Sized f' m (Sized f n a) -> Sized f (m * n) a

-- | Zipping two sequences. Length is adjusted to shorter one.
--   
--   Since 0.7.0.0
zip :: forall f (n :: Nat) a (m :: Nat) b. (Dom f a, CZip f, Dom f b, Dom f (a, b)) => Sized f n a -> Sized f m b -> Sized f (Min n m) (a, b)

-- | <a>zip</a> for the sequences of the same length.
--   
--   Since 0.7.0.0
zipSame :: forall f (n :: Nat) a b. (Dom f a, CZip f, Dom f b, Dom f (a, b)) => Sized f n a -> Sized f n b -> Sized f n (a, b)

-- | Zipping two sequences with funtion. Length is adjusted to shorter one.
--   
--   Since 0.7.0.0
zipWith :: forall f (n :: Nat) a (m :: Nat) b c. (Dom f a, CZip f, Dom f b, CFreeMonoid f, Dom f c) => (a -> b -> c) -> Sized f n a -> Sized f m b -> Sized f (Min n m) c

-- | <a>zipWith</a> for the sequences of the same length.
--   
--   Since 0.7.0.0
zipWithSame :: forall f (n :: Nat) a b c. (Dom f a, CZip f, Dom f b, CFreeMonoid f, Dom f c) => (a -> b -> c) -> Sized f n a -> Sized f n b -> Sized f n c

-- | Unzipping the sequence of tuples.
--   
--   Since 0.7.0.0
unzip :: forall f (n :: Nat) a b. (CUnzip f, Dom f a, Dom f b, Dom f (a, b)) => Sized f n (a, b) -> (Sized f n a, Sized f n b)

-- | Unzipping the sequence of tuples.
--   
--   Since 0.7.0.0
unzipWith :: forall f (n :: Nat) a b c. (CUnzip f, Dom f a, Dom f b, Dom f c) => (a -> (b, c)) -> Sized f n a -> (Sized f n b, Sized f n c)

-- | Map function.
--   
--   Since 0.7.0.0
map :: forall f (n :: Nat) a b. (CFreeMonoid f, Dom f a, Dom f b) => (a -> b) -> Sized f n a -> Sized f n b

-- | Reverse function.
--   
--   Since 0.7.0.0
reverse :: forall f (n :: Nat) a. (Dom f a, CFreeMonoid f) => Sized f n a -> Sized f n a

-- | Intersperces.
--   
--   Since 0.7.0.0
intersperse :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => a -> Sized f n a -> Sized f ((2 * n) -. 1) a

-- | Remove all duplicates.
--   
--   Since 0.7.0.0
nub :: forall f (n :: Nat) a. (Dom f a, Eq a, CFreeMonoid f) => Sized f n a -> SomeSized f a

-- | Sorting sequence by ascending order.
--   
--   Since 0.7.0.0
sort :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a, Ord a) => Sized f n a -> Sized f n a

-- | Generalized version of <a>sort</a>.
--   
--   Since 0.7.0.0
sortBy :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => (a -> a -> Ordering) -> Sized f n a -> Sized f n a

-- | Insert new element into the presorted sequence.
--   
--   Since 0.7.0.0
insert :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a, Ord a) => a -> Sized f n a -> Sized f (Succ n) a

-- | Generalized version of <a>insert</a>.
--   
--   Since 0.7.0.0
insertBy :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => (a -> a -> Ordering) -> a -> Sized f n a -> Sized f (Succ n) a

-- | Convert to list.
--   
--   Since 0.7.0.0
toList :: forall f (n :: Nat) a. (CFoldable f, Dom f a) => Sized f n a -> [a]

-- | If the given list is shorter than <tt>n</tt>, then returns
--   <tt>Nothing</tt> Otherwise returns <tt>Sized f n a</tt> consisting of
--   initial <tt>n</tt> element of given list.
--   
--   Since 0.7.0.0 (type changed)
fromList :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => SNat n -> [a] -> Maybe (Sized f n a)

-- | <a>fromList</a> with the result length inferred.
--   
--   Since 0.7.0.0
fromList' :: forall f (n :: Nat) a. (Dom f a, CFreeMonoid f, KnownNat n) => [a] -> Maybe (Sized f n a)

-- | Unsafe version of <a>fromList</a>. If the length of the given list
--   does not equal to <tt>n</tt>, then something unusual happens.
--   
--   Since 0.7.0.0
unsafeFromList :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => SNat n -> [a] -> Sized f n a

-- | <a>unsafeFromList</a> with the result length inferred.
--   
--   Since 0.7.0.0
unsafeFromList' :: forall f (n :: Nat) a. (KnownNat n, CFreeMonoid f, Dom f a) => [a] -> Sized f n a

-- | Construct a <tt>Sized f n a</tt> by padding default value if the given
--   list is short.
--   
--   Since 0.5.0.0 (type changed)
fromListWithDefault :: forall f (n :: Nat) a. (Dom f a, CFreeMonoid f) => SNat n -> a -> [a] -> Sized f n a

-- | <a>fromListWithDefault</a> with the result length inferred.
--   
--   Since 0.7.0.0
fromListWithDefault' :: forall f (n :: Nat) a. (KnownNat n, CFreeMonoid f, Dom f a) => a -> [a] -> Sized f n a

-- | Forget the length and obtain the wrapped base container.
--   
--   Since 0.7.0.0
unsized :: forall f (n :: Nat) a. Sized f n a -> f a

-- | If the length of the input is shorter than <tt>n</tt>, then returns
--   <tt>Nothing</tt>. Otherwise returns <tt>Sized f n a</tt> consisting of
--   initial <tt>n</tt> element of the input.
--   
--   Since 0.7.0.0
toSized :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => SNat (n :: Nat) -> f a -> Maybe (Sized f n a)

-- | <a>toSized</a> with the result length inferred.
--   
--   Since 0.7.0.0
toSized' :: forall f (n :: Nat) a. (Dom f a, CFreeMonoid f, KnownNat n) => f a -> Maybe (Sized f n a)

-- | Unsafe version of <a>toSized</a>. If the length of the given list does
--   not equal to <tt>n</tt>, then something unusual happens.
--   
--   Since 0.7.0.0
unsafeToSized :: forall f (n :: Nat) a. SNat n -> f a -> Sized f n a

-- | <a>unsafeToSized</a> with the result length inferred.
--   
--   Since 0.7.0.0
unsafeToSized' :: forall f (n :: Nat) a. (KnownNat n, Dom f a) => f a -> Sized f n a

-- | Construct a <tt>Sized f n a</tt> by padding default value if the given
--   list is short.
--   
--   Since 0.7.0.0
toSizedWithDefault :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => SNat (n :: Nat) -> a -> f a -> Sized f n a

-- | <a>toSizedWithDefault</a> with the result length inferred.
--   
--   Since 0.7.0.0
toSizedWithDefault' :: forall f (n :: Nat) a. (KnownNat n, CFreeMonoid f, Dom f a) => a -> f a -> Sized f n a

-- | The type <tt>Partitioned f n a</tt> represents partitioned sequence of
--   length <tt>n</tt>. Value <tt>Partitioned lenL ls lenR rs</tt> stands
--   for:
--   
--   <ul>
--   <li>Entire sequence is divided into <tt>ls</tt> and <tt>rs</tt>, and
--   their length are <tt>lenL</tt> and <tt>lenR</tt> resp.</li>
--   <li><pre>lenL + lenR = n</pre></li>
--   </ul>
--   
--   Since 0.7.0.0
data Partitioned f n a
[Partitioned] :: Dom f a => SNat n -> Sized f n a -> SNat m -> Sized f m a -> Partitioned f (n + m) a

-- | Take the initial segment as long as elements satisfys the predicate.
--   
--   Since 0.7.0.0
takeWhile :: forall f (n :: Nat) a. (Dom f a, CFreeMonoid f) => (a -> Bool) -> Sized f n a -> SomeSized f a

-- | Drop the initial segment as long as elements satisfys the predicate.
--   
--   Since 0.7.0.0
dropWhile :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => (a -> Bool) -> Sized f n a -> SomeSized f a

-- | Split the sequence into the longest prefix of elements that satisfy
--   the predicate and the rest.
--   
--   Since 0.7.0.0
span :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => (a -> Bool) -> Sized f n a -> Partitioned f n a

-- | Split the sequence into the longest prefix of elements that do not
--   satisfy the predicate and the rest.
--   
--   Since 0.7.0.0
break :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => (a -> Bool) -> Sized f n a -> Partitioned f n a

-- | Split 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
partition :: forall f (n :: Nat) a. (CFreeMonoid f, Dom f a) => (a -> Bool) -> Sized f n a -> Partitioned f n a

-- | Membership test; see also <a>notElem</a>.
--   
--   Since 0.7.0.0
elem :: forall f (n :: Nat) a. (CFoldable f, Dom f a, Eq a) => a -> Sized f n a -> Bool

-- | Negation of <a>elem</a>.
--   
--   Since 0.7.0.0
notElem :: forall f (n :: Nat) a. (CFoldable f, Dom f a, Eq a) => a -> Sized f n a -> Bool

-- | Find the element satisfying the predicate.
--   
--   Since 0.7.0.0
find :: forall f (n :: Nat) a. (CFoldable f, Dom f a) => (a -> Bool) -> Sized f n a -> Maybe a

-- | <tt><a>findIndex</a> p xs</tt> find the element satisfying <tt>p</tt>
--   and returns its index if exists.
--   
--   Since 0.7.0.0
findIndex :: forall f (n :: Nat) a. (CFoldable f, Dom f a) => (a -> Bool) -> Sized f n a -> Maybe Int

-- | <a>Ordinal</a> version of <a>findIndex</a>.
--   
--   Since 0.7.0.0
sFindIndex :: forall f (n :: Nat) a. (KnownNat (n :: Nat), CFoldable f, Dom f a) => (a -> Bool) -> Sized f n a -> Maybe (Ordinal n)

-- | <tt><a>findIndices</a> p xs</tt> find all elements satisfying
--   <tt>p</tt> and returns their indices.
--   
--   Since 0.7.0.0
findIndices :: forall f (n :: Nat) a. (CFoldable f, Dom f a) => (a -> Bool) -> Sized f n a -> [Int]

-- | <a>Ordinal</a> version of <a>findIndices</a>.
--   
--   Since 0.7.0.0
sFindIndices :: forall f (n :: Nat) a. (CFoldable f, Dom f a, KnownNat (n :: Nat)) => (a -> Bool) -> Sized f n a -> [Ordinal n]

-- | Returns the index of the given element in the list, if exists.
--   
--   Since 0.7.0.0
elemIndex :: forall f (n :: Nat) a. (CFoldable f, Eq a, Dom f a) => a -> Sized f n a -> Maybe Int

-- | Ordinal version of <a>elemIndex</a>. Since 0.7.0.0, we no longer do
--   boundary check inside the definition.
--   
--   Since 0.7.0.0
sElemIndex :: forall f (n :: Nat) a. (KnownNat n, CFoldable f, Dom f a, Eq a) => a -> Sized f n a -> Maybe (Ordinal n)

-- | Since 0.5.0.0 (type changed)
--   
--   Ordinal version of <a>elemIndex</a>. Since 0.7.0.0, we no longer do
--   boundary check inside the definition.
--   
--   Since 0.7.0.0

-- | <i>Deprecated: No difference with sElemIndex; use sElemIndex
--   instead.</i>
sUnsafeElemIndex :: forall f (n :: Nat) a. (KnownNat n, CFoldable f, Dom f a, Eq a) => a -> Sized f n a -> Maybe (Ordinal n)

-- | Returns all indices of the given element in the list.
--   
--   Since 0.7.0.0
elemIndices :: forall f (n :: Nat) a. (CFoldable f, Dom f a, Eq a) => a -> Sized f n a -> [Int]

-- | Ordinal version of <a>elemIndices</a>
--   
--   Since 0.7.0.0
sElemIndices :: forall f (n :: Nat) a. (CFoldable f, KnownNat (n :: Nat), Dom f a, Eq a) => a -> Sized f n a -> [Ordinal n]

-- | Case analysis for the cons-side of sequence.
--   
--   Since 0.5.0.0 (type changed)
viewCons :: forall f (n :: Nat) a. (KnownNat n, CFreeMonoid f, Dom f a) => Sized f n a -> ConsView f n a

-- | View of the left end of sequence (cons-side).
--   
--   Since 0.7.0.0
data ConsView f n a
[NilCV] :: ConsView f 0 a
[:-] :: (KnownNat n, KnownNat (1 + n)) => a -> Sized f n a -> ConsView f (1 + n) a
infixr 5 :-

-- | Case analysis for the snoc-side of sequence.
--   
--   Since 0.5.0.0 (type changed)
viewSnoc :: forall f (n :: Nat) a. (KnownNat n, CFreeMonoid f, Dom f a) => Sized f n a -> SnocView f n a

-- | View of the left end of sequence (snoc-side).
--   
--   Since 0.7.0.0
data SnocView f n a
[NilSV] :: SnocView f 0 a
[:-::] :: KnownNat (n :: Nat) => Sized f n a -> a -> SnocView f (n + 1) a
infixl 5 :-::

-- | Pattern synonym for a nil sequence.
pattern Nil :: forall f (n :: Nat) a. (KnownNat n, CFreeMonoid f, Dom f a) => n ~ 0 => Sized f n a

-- | Pattern synonym for cons-side uncons.
pattern (:<) :: forall (f :: Type -> Type) a (n :: Nat). (Dom f a, KnownNat n, CFreeMonoid f) => forall (n1 :: Nat). (n ~ (1 + n1), KnownNat n1) => a -> Sized f n1 a -> Sized f n a
infixr 5 :<

-- | Pattern synonym for snoc-side unsnoc.
pattern (:>) :: forall (f :: Type -> Type) a (n :: Nat). (Dom f a, KnownNat n, CFreeMonoid f) => forall (n1 :: Nat). (n ~ (n1 + 1), KnownNat n1) => Sized f n1 a -> a -> Sized f n a
infixl 5 :>
instance Control.Subcategory.Functor.Dom f a => Data.Sized.DomC f a
instance (GHC.Base.Functor f, Control.Subcategory.Foldable.CFreeMonoid f, Control.Subcategory.Zip.CZip f, GHC.TypeNats.KnownNat n, forall a. Data.Sized.DomC f a) => GHC.Base.Applicative (Data.Sized.Internal.Sized f n)
instance GHC.Show.Show (f a) => GHC.Show.Show (Data.Sized.SomeSized f a)
instance GHC.Classes.Eq (f a) => GHC.Classes.Eq (Data.Sized.SomeSized f a)
instance (Control.Subcategory.Foldable.CFreeMonoid f, GHC.TypeNats.KnownNat n) => Control.Subcategory.Pointed.CPointed (Data.Sized.Internal.Sized f n)
instance (Control.Subcategory.Foldable.CFreeMonoid f, Control.Subcategory.Zip.CZip f) => Control.Subcategory.Applicative.Class.CApplicative (Data.Sized.Internal.Sized f n)
instance (Control.Subcategory.Zip.CZip f, Control.Subcategory.Foldable.CFreeMonoid f) => Control.Subcategory.Semialign.CSemialign (Data.Sized.Internal.Sized f n)
instance (Control.Subcategory.Zip.CZip f, Control.Subcategory.Foldable.CFreeMonoid f) => Control.Subcategory.Zip.CZip (Data.Sized.Internal.Sized f n)
instance (GHC.TypeNats.KnownNat n, Control.Subcategory.Zip.CZip f, Control.Subcategory.Foldable.CFreeMonoid f) => Control.Subcategory.Zip.CRepeat (Data.Sized.Internal.Sized f n)
instance Control.Subcategory.Foldable.CTraversable f => Control.Subcategory.Foldable.CTraversable (Data.Sized.Internal.Sized f n)


-- | <i>Deprecated: Use Data.Sized instead</i>
module Data.Sized.Builtin