Seq -containers

module Control.Seq
parallel Control.Seq
Sequential strategies provide ways to compositionally specify the degree of evaluation of a data type between the extremes of no evaluation and full evaluation. Sequential strategies may be viewed as complimentary to the parallel ones (see module Control.Parallel.Strategies).
SeqPacket :: SocketType
network Network.Socket
SOCK_SEQPACKET
type SeqStrategy a = Strategy a
parallel Control.Parallel.Strategies
a name for Control.Seq.Strategy, for documetnation only.
module Text.Regex.Posix.Sequence
regex-posix Text.Regex.Posix.Sequence
This provides String instances for RegexMaker and RegexLike based on Text.Regex.Posix.Wrap, and a (RegexContext Regex String String) instance. To use these instance, you would normally import Text.Regex.Posix. You only need to import this module to use the medium level API of the compile, regexec, and execute functions. All of these report error by returning Left values instead of undefined or error or fail.
seq :: a -> b -> b
base Prelude
Evaluates its first argument to head normal form, and then returns its second argument as the result.
sequence :: Monad m => [m a] -> m [a]
base Prelude, base Control.Monad
Evaluate each action in the sequence from left to right, and collect the results.
sequence_ :: Monad m => [m a] -> m ()
base Prelude, base Control.Monad
Evaluate each action in the sequence from left to right, and ignore the results.
sequence :: (Traversable t, Monad m) => t (m a) -> m (t a)
base Data.Traversable
sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()
base Data.Foldable
Evaluate each monadic action in the structure from left to right, and ignore the results.
sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)
base Data.Traversable
sequenceA_ :: (Foldable t, Applicative f) => t (f a) -> f ()
base Data.Foldable
Evaluate each action in the structure from left to right, and ignore the results.
seqArray :: Ix i => Strategy a -> Strategy (Array i a)
parallel Control.Seq
Evaluate the elements of an array according to the given strategy. Evaluation of the array bounds may be triggered as a side effect.
seqArrayBounds :: Ix i => Strategy i -> Strategy (Array i a)
parallel Control.Seq
Evaluate the bounds of an array according to the given strategy.
seqFoldable :: Foldable t => Strategy a -> Strategy (t a)
parallel Control.Seq
Evaluate the elements of a foldable data structure according to the given strategy.
seqList :: Strategy a -> Strategy [a]
parallel Control.Parallel.Strategies
DEPRECATED: renamed to evalList
seqList :: Strategy a -> Strategy [a]
parallel Control.Seq
Evaluate each element of a list according to the given strategy. This function is a specialisation of seqFoldable to lists.
seqListN :: Int -> Strategy a -> Strategy [a]
parallel Control.Seq
Evaluate the first n elements of a list according to the given strategy.
seqListNth :: Int -> Strategy a -> Strategy [a]
parallel Control.Seq
Evaluate the nth element of a list (if there is such) according to the given strategy. The spine of the list up to the nth element is evaluated as a side effect.
package seqloc
package
Handle sequence locations for bioinformatics Version 0.5.1.1
package seqloc-datafiles
package
Read and write BED and GTF format genome annotations Version 0.2.2.2

Show more results