cons -package

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 :: Char -> Text -> Text
text Data.Text.Lazy
O(n) Adds a character to the front of a Text. This function is more costly than its List counterpart because it requires copying a new array. Subject to fusion.
cons :: Char -> Text -> Text
text Data.Text
O(n) Adds a character to the front of a Text. This function is more costly than its List counterpart because it requires copying a new array. Subject to fusion. Performs replacement on invalid scalar values.
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.
constantColor :: StateVar (Color4 GLfloat)
OpenGL Graphics.Rendering.OpenGL.GL.Texturing.Environments
constraintK :: Kind
template-haskell Language.Haskell.TH.Lib, template-haskell Language.Haskell.TH
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.
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.

Show more results