Par
Zp: Separator, Paragraph
(parens p) parses "P", "(P0)", "((P0))", etc, p parses "P" in the current precedence context and parses "P0" in precedence context zero
A parser for versions in the format produced by showVersion.
The partition function takes a predicate a list and returns the pair of lists of elements which do and do not satisfy the predicate, respectively; i.e.,
> partition p xs == (filter p xs, filter (not . p) xs)
Partitions a list of Either into two lists All the Left elements are extracted, in order, to the first component of the output. Similarly the Right elements are extracted to the second component of the output.
Parallel Constructs
This module corresponds to section 3.8.4 (Texture Parameters), section 3.8.7 (Texture Wrap Mode), section 3.8.8 (Texture Minification), and section 3.8.9 (Texture Magnification) of the OpenGL 2.1 specs.
Monads for the Haskell parser and lexer.
Haskell parser.
Utilities for the Haskell parser.
Indicates that it may be beneficial to evaluate the first argument in parallel with the second. Returns the value of the second argument.
a `par` b is exactly equivalent semantically to b.
par is generally used when the value of a is likely to be required later, but not immediately. Also it is a good idea to ensure that a is not a trivial computation, otherwise the cost of spawning it in parallel overshadows the benefits obtained by running it in parallel.
Note that actual parallelism is only supported by certain implementations (GHC with the -threaded option, and GPH, for now). On other implementations, par a b = b.
A paragraph formatting utility. Provided with input text that is arbitrarily split amongst several strings, this utility will reformat the text into paragraphs which do not exceed the specified width. Paragraphs are delimited by blank lines in the input.
Version 1.1
Paragon suite
Version 0.1.16
The purpose of this project is to design a high-level language for implementing explicit partial-differential equations solvers on supercomputers as well as todays advanced personal computers. A language to describe the knowledge on algebraic concepts, physical equations, integration algorithms, optimization techniques, and hardware designs --- all the necessaries of the simulations in abstract, modular, re-usable and combinable forms.
> How to use
The module Language.Paraiso.OM.Builder contains the Builder monad, its typeclass instance declarations and functions that can be used to build Paraiso programs. Reserved words are load, store, imm, loadIndex, loadSize, shift, reduce and broadcast.
Paraiso frontend uses Data.Tensor.Typelevel http://hackage.haskell.org/package/typelevel-tensor, the library for tensor calculus of arbitrary rank and dimension. Vector and Axis are two main concepts. The type Vector represents rank-1 tensor, and tensors of higher ranks are recursively defined as Vector of Vectors. With Axis you can refer to the components of Vectors, compose them, or contract them. See the wiki for more detail: http://www.paraiso-lang.org/wiki/
* 0.2.0.0 Companion : genetic algorithm support for automated tuning.
* 0.1.0.0 Binary : enhanced backend, code generator for OpenMP and CUDA
* 0.0.0.0 Atmosphere : code generator for single CPU
Version 0.2.0.3
This package provides a library for parallel programming.
Version 3.2.0.3
This package provides combinators for sequencing IO actions onto a thread pool. The thread pool is guaranteed to contain no more unblocked threads than a user-specified upper limit, thus minimizing contention.
Furthermore, the parallel combinators can be used reentrantly - your parallel actions can spawn more parallel actions - without violating this property of the thread pool.
The package is inspired by the thread http://thread.gmane.org/gmane.comp.lang.haskell.cafe/56499/focus=56521. Thanks to Neil Mitchell and Bulat Ziganshin for some of the code this package is based on.
Version 0.3.2
This Haskell library provides an implementation of parallel search based on the search tree provided by the package tree-monad.
Version 0.4.1
Show more results