id -package

id :: a -> a
base Prelude, base Data.Function
Identity function.
id :: Category cat => cat a a
base Control.Category
identifier :: GenTokenParser s u m -> ParsecT s u m String
parsec Text.Parsec.Token, parsec Text.ParserCombinators.Parsec.Token
This lexeme parser parses a legal identifier. Returns the identifier string. This parser will fail on identifiers that are reserved words. Legal identifier (start) characters and reserved words are defined in the LanguageDef that is passed to makeTokenParser. An identifier is treated as a single token using try.
identifier :: String -> HtmlAttr
html Text.Html, xhtml Text.XHtml.Strict, xhtml Text.XHtml.Frameset, xhtml Text.XHtml.Transitional
identLetter :: GenLanguageDef s u m -> ParsecT s u m Char
parsec Text.Parsec.Token, parsec Text.ParserCombinators.Parsec.Token, parsec Text.ParserCombinators.Parsec.Language
This parser should accept any legal tail characters of identifiers. For example alphaNum <|> char "_".
identStart :: GenLanguageDef s u m -> ParsecT s u m Char
parsec Text.Parsec.Token, parsec Text.ParserCombinators.Parsec.Token, parsec Text.ParserCombinators.Parsec.Language
This parser should accept any start characters of identifiers. For example letter <|> char "_".
idleCallback :: SettableStateVar (Maybe IdleCallback)
GLUT Graphics.UI.GLUT.Callbacks.Global
Controls the global idle callback so a GLUT program can perform background processing tasks or continuous animation when window system events are not being received. If enabled, the idle callback is continuously called when events are not being received. The current window and current menu will not be changed before the idle callback. Programs with multiple windows and/or menus should explicitly set the current window and/or /current menu/ and not rely on its current setting. The amount of computation and rendering done in an idle callback should be minimized to avoid affecting the program's interactive response. In general, not more than a single frame of rendering should be done in an idle callback.
Ident :: String -> Lexeme
base Text.Read.Lex, base Text.Read
Haskell identifier, e.g. foo, Baz
module Control.Monad.Identity
mtl Control.Monad.Identity
* Computation type: Simple function application. * Binding strategy: The bound function is applied to the input value. Identity x >>= f == Identity (f x) * Useful for: Monads can be derived from monad transformers applied to the Identity monad. * Zero and plus: None. * Example type: Identity a The Identity monad is a monad that does not embody any computational strategy. It simply applies the bound function to its input without any modification. Computationally, there is no reason to use the Identity monad instead of the much simpler act of simply applying functions to their arguments. The purpose of the Identity monad is its fundamental role in the theory of monad transformers. Any monad transformer applied to the Identity monad yields a non-transformer version of that monad.
module Control.Monad.Trans.Identity
transformers Control.Monad.Trans.Identity
The identity monad transformer. This is useful for functions parameterized by a monad transformer.
module Data.Functor.Identity
transformers Data.Functor.Identity
The identity functor and monad. This trivial type constructor serves two purposes: * It can be used with functions parameterized by functor or monad classes. * It can be used as a base monad to which a series of monad transformers may be applied to construct a composite monad. Most monad transformer modules include the special case of applying the transformer to Identity. For example, State s is an abbreviation for StateT s Identity.
Identity :: a -> Identity a
transformers Data.Functor.Identity
newtype Identity a
transformers Data.Functor.Identity
Identity functor and monad.
IdentityT :: m a -> IdentityT m a
transformers Control.Monad.Trans.Identity
newtype IdentityT m a
transformers Control.Monad.Trans.Identity
The trivial monad transformer, which maps a monad to an equivalent monad.
type IdleCallback = IO ()
GLUT Graphics.UI.GLUT.Callbacks.Global
iDom :: Graph gr => gr a b -> Node -> [(Node, Node)]
fgl Data.Graph.Inductive.Query.Dominators
return immediate dominators for each node of a graph, given a root
data CGid
base System.Posix.Types
data CPid
base System.Posix.Types
data CUid
base System.Posix.Types

Show more results