Seq -base

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).
data Seq a
containers Data.Sequence
General-purpose finite sequences.
module Data.Sequence
containers Data.Sequence
General purpose finite sequences. Apart from being finite and having strict operations, sequences also differ from lists in supporting a wider variety of operations efficiently. An amortized running time is given for each operation, with n referring to the length of the sequence and i being the integral index used by some operations. These bounds hold even in a persistent (shared) setting. The implementation uses 2-3 finger trees annotated with sizes, as described in section 4.2 of * Ralf Hinze and Ross Paterson, "Finger trees: a simple general-purpose data structure", Journal of Functional Programming 16:2 (2006) pp 197-217. http://www.soi.city.ac.uk/~ross/papers/FingerTree.html Note: Many of these operations have the same names as similar operations on lists in the Prelude. The ambiguity may be resolved using either qualification or the hiding clause.
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.
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

Show more results