Seq a -> [a]

toList :: Foldable t => t a -> [a]
base Data.Foldable
List of elements of a structure.
repeat :: a -> [a]
base Prelude, base Data.List
repeat x is an infinite list, with x the value of every element.
shrinkNothing :: a -> [a]
QuickCheck Test.QuickCheck.Arbitrary, QuickCheck Test.QuickCheck
Returns no shrinking alternatives.
many :: Alternative f => f a -> f [a]
base Control.Applicative
some :: Alternative f => f a -> f [a]
base Control.Applicative
findIndicesL :: (a -> Bool) -> Seq a -> [Int]
containers Data.Sequence
findIndicesL p finds all indices of elements that satisfy p, in ascending order.
findIndicesR :: (a -> Bool) -> Seq a -> [Int]
containers Data.Sequence
findIndicesR p finds all indices of elements that satisfy p, in descending order.
index :: Seq a -> Int -> a
containers Data.Sequence
O(log(min(i,n-i))). The element at the specified position, counting from 0. The argument should thus be a non-negative integer less than the size of the sequence. If the position is out of range, index fails with an error.
iterate :: (a -> a) -> a -> [a]
base Prelude, base Data.List
iterate f x returns an infinite list of repeated applications of f to x: > iterate f x == [x, f x, f (f x), ...]
genericReplicate :: Integral i => i -> a -> [a]
base Data.List
The genericReplicate function is an overloaded version of replicate, which accepts any Integral value as the number of repetitions to make.
intersperse :: a -> [a] -> [a]
base Data.List
The intersperse function takes an element and a list and `intersperses' that element between the elements of the list. For example, > intersperse ',' "abcde" == "a,b,c,d,e"
replicate :: Int -> a -> [a]
base Prelude, base Data.List
replicate n x is a list of length n with x the value of every element. It is an instance of the more general Data.List.genericReplicate, in which n may be of any integral type.
pure :: Applicative f => a -> f a
base Control.Applicative
shrinkRealFrac :: RealFrac a => a -> [a]
QuickCheck Test.QuickCheck.Arbitrary, QuickCheck Test.QuickCheck
Shrink a fraction.
shrinkIntegral :: Integral a => a -> [a]
QuickCheck Test.QuickCheck.Arbitrary, QuickCheck Test.QuickCheck
Shrink an integral number.
enumFrom :: Enum a => a -> [a]
base Prelude
shrink :: Arbitrary a => a -> [a]
QuickCheck Test.QuickCheck.Arbitrary, QuickCheck Test.QuickCheck
id :: a -> a
base Prelude, base Data.Function
Identity function.
breakpoint :: a -> a
base GHC.Exts
inline :: a -> a
base GHC.Exts
The call '(inline f)' reduces to f, but inline has a BuiltInRule that tries to inline f (if it has an unfolding) unconditionally The NOINLINE pragma arranges that inline only gets inlined (and hence eliminated) late in compilation, after the rule has had a good chance to fire.

Show more results