const -syb

const :: a -> b -> a
base Prelude, base Data.Function
Constant function.
Const :: a -> Const a b
base Control.Applicative
newtype Const a b
base Control.Applicative
data Constr
base Data.Data
Representation of constructors. Note that equality on constructors with different types may not work -- i.e. the constructors for False and Nothing may compare equal.
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)
data ConstrRep
base Data.Data
Public representation of constructors
constrRep :: Constr -> ConstrRep
base Data.Data
Gets the public presentation of constructors
constrType :: Constr -> DataType
base Data.Data
Gets the datatype of a constructor
Constant :: Src
OpenGL Graphics.Rendering.OpenGL.GL.Texturing.Environments
Constant :: a -> Constant a b
transformers Data.Functor.Constant
newtype Constant a b
transformers Data.Functor.Constant
Constant functor.
ConstantAlpha :: BlendingFactor
OpenGL Graphics.Rendering.OpenGL.GL.PerFragment
ConstantBorder :: (Color4 GLfloat) -> ConvolutionBorderMode
OpenGL Graphics.Rendering.OpenGL.GL.PixelRectangles.Convolution
ConstantColor :: BlendingFactor
OpenGL Graphics.Rendering.OpenGL.GL.PerFragment
constantColor :: StateVar (Color4 GLfloat)
OpenGL Graphics.Rendering.OpenGL.GL.Texturing.Environments
package constraints
package
Constraint manipulation Version 0.3.0.1
package constructive-algebra
package
A library of algebra focusing mainly on commutative ring theory from a constructive point of view. Classical structures are implemented without Noetherian assumptions. This means that it is not assumed that all ideals are finitely generated. For example, instead of principal ideal domains one gets Bezout domains which are integral domains in which all finitely generated ideals are principal (and not necessarily that all ideals are principal). This give a good framework for implementing many interesting algorithms. Version 0.3.0
module Data.Functor.Constant
transformers Data.Functor.Constant
The constant functor.

Show more results