seq -containers

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
seqMap :: Strategy k -> Strategy v -> Strategy (Map k v)
parallel Control.Seq
Evaluate the keys and values of a map according to the given strategies.
seqPair :: Strategy a -> Strategy b -> Strategy (a, b)
parallel Control.Parallel.Strategies
DEPRECATED: renamed to evalTuple2
seqTraverse :: Traversable t => Strategy a -> Strategy (t a)
parallel Control.Parallel.Strategies
DEPRECATED: renamed to evalTraversable
seqTriple :: Strategy a -> Strategy b -> Strategy c -> Strategy (a, b, c)
parallel Control.Parallel.Strategies
DEPRECATED: renamed to evalTuple3
seqTuple2 :: Strategy a -> Strategy b -> Strategy (a, b)
parallel Control.Seq
seqTuple3 :: Strategy a -> Strategy b -> Strategy c -> Strategy (a, b, c)
parallel Control.Seq
seqTuple4 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy (a, b, c, d)
parallel Control.Seq
seqTuple5 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy e -> Strategy (a, b, c, d, e)
parallel Control.Seq
seqTuple6 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy e -> Strategy f -> Strategy (a, b, c, d, e, f)
parallel Control.Seq
seqTuple7 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy e -> Strategy f -> Strategy g -> Strategy (a, b, c, d, e, f, g)
parallel Control.Seq
seqTuple8 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy e -> Strategy f -> Strategy g -> Strategy h -> Strategy (a, b, c, d, e, f, g, h)
parallel Control.Seq
seqTuple9 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy e -> Strategy f -> Strategy g -> Strategy h -> Strategy i -> Strategy (a, b, c, d, e, f, g, h, i)
parallel Control.Seq
sequenceQ :: [Q a] -> Q [a]
template-haskell Language.Haskell.TH.Syntax
package sequential-index
package
Sequential index numbers between 0.0 and 1.0 that allow arbitrarily inserting new numbers in between. They can possibly used for disk-based and other special containers, where adding a new element without changing the indexes of the other elements is important. Conceptually, SequentialIndex denotes a path to an element in an imaginary binary tree. However, leafs can only be on the right side of their parent. I.e. the path must end with a '1' (or be the path to the root node, 0.0). 1.0 denotes the invalid node. Version 0.2.0.1
package sequor
package
A sequence labeler based on Collins's sequence perceptron. Version 0.4.2
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.
eILSEQ :: Errno
base Foreign.C.Error
subsequences :: [a] -> [[a]]
base Data.List
The subsequences function returns the list of all subsequences of the argument. > subsequences "abc" == ["","a","b","ab","c","ac","bc","abc"]
package alsa-seq
package
This package provides access to ALSA sequencer (MIDI support). For audio support see alsa-pcm. Included are some simple example programs. For more example programs including a GUI, see the alsa-gui programs. Version 0.6.0.2
package alsa-seq-tests
package
Tests for the ALSA sequencer library. Version 0.1
ArithSeqE :: Range -> Exp
template-haskell Language.Haskell.TH.Syntax, template-haskell Language.Haskell.TH
> { [ 1 ,2 .. 10 ] }

Show more results