Help | Examples | About | API | Blog | Hackage | Haskell
Concurrently search more than 6250 packages and more than 585655 functions! (Index generated: Tue, 25 Mar 2014 16:41:17 UTC )
Found 163 functions, 5 packages and 33 completions.
Generalised permutation parser combinator
General permutation parser combinators that will work with any parser combinator library. No changelog available
Troels Henriksen
A programming language for simple GUIs
Sindre is a language inspired by Awk, meant for creating very simple graphical user interfaces. No changelog available
Troels Henriksen
Stock FieldN combos and generators
This package provides some stock lenses for swizzling tuple elements. For instance: > (1,2,3)^._13 (1, 3) The package provide all lenses that are in increasing order, for FieldN classes 1-9. If you want to swap the order or permute the elements, you need to make your own. Custom combos are provided by a Template Haskell function. > ('a','b','c','d') ^. $(tl [4,1,2,3]) ('d','a','b','c') No changelog available
Jonathan Fischoff
A visual generic menu
Grid-oriented element selection inspired by XMonadContrib's GridSelect. No changelog available
Troels Henriksen
Permutations of effectful computations
No changelog available
Martijn van Steenbergen, Sjoerd Visscher
Text.Parsec.Perm.permute:: StreamPermParser s st a -> Parsec s st a
parsec
No description.
Source
System.Console.GetOpt.Permute:: Permute
base

freely intersperse options and non-options

Source
Text.ParserCombinators.Parsec.Perm.permute:: StreamPermParser s st a -> Parsec s st a
parsec
No description.
Source
Data.Permute.permute:: Int -> Permute
permutation

Construct an identity permutation of the given size.

Source
Text.Parser.Permutation.permute:: Permutation m a -> m a
parsers
No description.
Source
System.Console.CmdArgs.GetOpt.Permute:: Permute
cmdargs
No description.
Source
Data.Permute.Permute:: data
permutation

The immutable permutation data type. Internally, a permutation of size n is stored as an 0-based array of n Ints. The permutation represents a reordering of the integers 0, ..., (n-1). The permutation sents the value p[i] to i.

Source
Data.Permute.Permute:: module
permutation

Immutable permutations.

Source
Agda.Utils.Permutation.permute:: Permutation -> [a] -> [a]
Agda

permute [1,2,0] [x0,x1,x2] = [x1,x2,x0] More precisely, permute indices list = sublist, generates sublist from list by picking the elements of list as indicated by indices. permute [1,3,0] [x0,x1,x2,x3] = [x1,x3,x0]

Agda typing: permute (Perm {m} n is) : Vec A m -> Vec A n

Source
Data.Array.Accelerate.permute:: (Exp a -> Exp a -> Exp a) -> Acc (Array ix' a) -> (Exp ix -> Exp ix') -> Acc (Array ix a) -> Acc (Array ix' a)
accelerate

Forward permutation specified by an index mapping. The result array is initialised with the given defaults and any further values that are permuted into the result array are added to the current value using the given combination function.

The combination function must be associative and commutative. Elements that are mapped to the magic value ignore by the permutation function are dropped.

Powered by Haskell, HXT, Snap, and
Please send any feedback to hayoo@holumbus.org