cons -text

cons :: Char -> ByteString -> ByteString
bytestring Data.ByteString.Lazy.Char8
O(1) cons is analogous to '(:)' for lists.
cons :: Char -> ByteString -> ByteString
bytestring Data.ByteString.Char8
O(n) cons is analogous to (:) for lists, but of different complexity, as it requires a memcpy.
cons :: Word8 -> ByteString -> ByteString
bytestring Data.ByteString.Lazy
O(1) cons is analogous to '(:)' for lists.
cons :: Word8 -> ByteString -> ByteString
bytestring Data.ByteString
O(n) cons is analogous to (:) for lists, but of different complexity, as it requires a memcpy.
const :: a -> b -> a
base Prelude, base Data.Function
Constant function.
constrFields :: Constr -> [String]
base Data.Data
Gets the field labels of a constructor. The list of labels is returned in the same order as they were given in the original constructor declaration.
constrFixity :: Constr -> Fixity
base Data.Data
Gets the fixity of a constructor
constrIndex :: Constr -> ConIndex
base Data.Data
Gets the index of a constructor (algebraic datatypes only)
constrRep :: Constr -> ConstrRep
base Data.Data
Gets the public presentation of constructors
constrType :: Constr -> DataType
base Data.Data
Gets the datatype of a constructor
cons' :: Char -> ByteString -> ByteString
bytestring Data.ByteString.Lazy.Char8
O(1) Unlike cons, 'cons\'' is strict in the ByteString that we are consing onto. More precisely, it forces the head and the first chunk. It does this because, for space efficiency, it may coalesce the new byte onto the first 'chunk' rather than starting a new 'chunk'. So that means you can't use a lazy recursive contruction like this: > let xs = cons\' c xs in xs You can however use cons, as well as repeat and cycle, to build infinite lazy ByteStrings.
cons' :: Word8 -> ByteString -> ByteString
bytestring Data.ByteString.Lazy
O(1) Unlike cons, 'cons\'' is strict in the ByteString that we are consing onto. More precisely, it forces the head and the first chunk. It does this because, for space efficiency, it may coalesce the new byte onto the first 'chunk' rather than starting a new 'chunk'. So that means you can't use a lazy recursive contruction like this: > let xs = cons\' c xs in xs You can however use cons, as well as repeat and cycle, to build infinite lazy ByteStrings.
package console-program
package
This library provides an infrastructure to build command line programs. It provides the following features: * declare any number of "commands" (modes of operation) of the program; * declare options of these commands; * collect options from a configuration file and the command line, and execute the proper command. Examples of using this library may be found in the Examples directory in the package tarball. It provides functionality similar to the cmdargs package. Main differences: * console-program does not use unsafePerformIO, and tries to give a more haskellish, referentially transparent interface; * it allows a full tree of commands, instead of a list, so a command can have subcommands; * it parses a configuration file, in addition to the command line arguments. Version 0.3.1.1
package const-math-ghc-plugin
package
This plugin evaluates constant math expressions at compile-time. For details and full usage information, see; https://github.com/kfish/const-math-ghc-plugin To use it to compile foo.hs: > $ cabal install const-math-ghc-plugin > $ ghc -fplugin ConstMath.Plugin foo.hs To use it to build a cabal package packagename: > $ cabal install --ghc-options="-package const-math-ghc-plugin > -fplugin ConstMath.Plugin" packagename Math should run faster. Version 1.0.0.0
constantColor :: StateVar (Color4 GLfloat)
OpenGL Graphics.Rendering.OpenGL.GL.Texturing.Environments
package constrained-normal
package
The package provides normal forms for monads and related structures, similarly to the Operational package. The difference is that we parameterise the normal forms on a constraint, and apply that constraint to all existential types within the normal form. This allows monad (and other) instances to be generated for underlying types that require constraints on their return-like and bind-like operations, e.g. Set. This is documented in the following paper: The Constrained-Monad Problem.  Neil Sculthorpe and Jan Bracker and George Giorgidze and Andy Gill.  2013. http://www.ittc.ku.edu/~neil/papers_and_talks/constrained-monad-problem.pdf The functionality exposed by this library is also used internally by the Set-Monad and RMonad packages. Version 1.0.0
constraintK :: Kind
template-haskell Language.Haskell.TH.Lib, template-haskell Language.Haskell.TH
package constraints
package
Constraint manipulation Version 0.3.4.2
constrs :: Data a => [a]
syb Data.Generics.Builders
Return a list of values of a datatype. Each value is one of the possible constructors of the datatype, populated with empty values.
package constructible
package
The constructible reals are the subset of the real numbers that can be represented exactly using field operations (addition, subtraction, multiplication, division) and positive square roots. They support exact computations, equality comparisons, and ordering. Version 0.1.0.1

Show more results