Int -zlib

data Int :: *
base Prelude, base Data.Int, base GHC.Exts
A fixed-precision integer type with at least the range [-2^29 .. 2^29-1]. The exact range for a given implementation can be determined by using Prelude.minBound and Prelude.maxBound from the Prelude.Bounded class.
module Data.Int
base Data.Int
Signed integer types
Int :: Integer -> Lexeme
base Text.Read.Lex, base Text.Read
Integer literal
module Data.Text.Lazy.Builder.Int
text Data.Text.Lazy.Builder.Int
Int :: DataType
OpenGL Graphics.Rendering.OpenGL.GL.VertexArrays
data Integer :: *
base Prelude
Arbitrary-precision integers.
class (Real a, Enum a) => Integral a
base Prelude
Integral numbers, supporting integer division. Minimal complete definition: quotRem and toInteger
data Int16
base Data.Int
16-bit signed integer type
data Int32
base Data.Int
32-bit signed integer type
data Int64
base Data.Int
64-bit signed integer type
data Int8
base Data.Int
8-bit signed integer type
IntConstr :: Integer -> ConstrRep
base Data.Data
data IntPtr
base Foreign.Ptr
A signed integral type that can be losslessly converted to and from Ptr. This type is also compatible with the C99 type intptr_t, and can be marshalled to and from that type safely.
IntRep :: DataRep
base Data.Data
module Data.IntMap
containers Data.IntMap
An efficient implementation of maps from integer keys to values (dictionaries). This module re-exports the value lazy Data.IntMap.Lazy API, plus several deprecated value strict functions. Please note that these functions have different strictness properties than those in Data.IntMap.Strict: they only evaluate the result of the combining function. For example, the default value to insertWith' is only evaluated if the combining function is called and uses it. These modules are intended to be imported qualified, to avoid name clashes with Prelude functions, e.g. > import Data.IntMap (IntMap) > import qualified Data.IntMap as IntMap The implementation is based on big-endian patricia trees. This data structure performs especially well on binary operations like union and intersection. However, my benchmarks show that it is also (much) faster on insertions and deletions when compared to a generic size-balanced map implementation (see Data.Map). * Chris Okasaki and Andy Gill, "Fast Mergeable Integer Maps", Workshop on ML, September 1998, pages 77-86, http://citeseer.ist.psu.edu/okasaki98fast.html * D.R. Morrison, "/PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric/", Journal of the ACM, 15(4), October 1968, pages 514-534. Operation comments contain the operation time complexity in the Big-O notation http://en.wikipedia.org/wiki/Big_O_notation. Many operations have a worst-case complexity of O(min(n,W)). This means that the operation can become linear in the number of elements with a maximum of W -- the number of bits in an Int (32 or 64).
module Data.IntSet
containers Data.IntSet
An efficient implementation of integer sets. These modules are intended to be imported qualified, to avoid name clashes with Prelude functions, e.g. > import Data.IntSet (IntSet) > import qualified Data.IntSet as IntSet The implementation is based on big-endian patricia trees. This data structure performs especially well on binary operations like union and intersection. However, my benchmarks show that it is also (much) faster on insertions and deletions when compared to a generic size-balanced set implementation (see Data.Set). * Chris Okasaki and Andy Gill, "Fast Mergeable Integer Maps", Workshop on ML, September 1998, pages 77-86, http://citeseer.ist.psu.edu/okasaki98fast.html * D.R. Morrison, "/PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric/", Journal of the ACM, 15(4), October 1968, pages 514-534. Additionally, this implementation places bitmaps in the leaves of the tree. Their size is the natural size of a machine word (32 or 64 bits) and greatly reduce memory footprint and execution times for dense sets, e.g. sets other. The asymptotics are not affected by this optimization. Many operations have a worst-case complexity of O(min(n,W)). This means that the operation can become linear in the number of elements with a maximum of W -- the number of bits in an Int (32 or 64).
module Data.Text.Internal
text Data.Text.Internal
A module containing private Text internals. This exposes the Text representation and low level construction functions. Modules which extend the Text system may need to use this module. You should not use this module unless you are determined to monkey with the internals, as the functions here do just about nothing to preserve data invariants. You have been warned!
module Data.Text.Lazy.Internal
text Data.Text.Lazy.Internal
A module containing private Text internals. This exposes the Text representation and low level construction functions. Modules which extend the Text system may need to use this module. You should not use this module unless you are determined to monkey with the internals, as the functions here do just about nothing to preserve data invariants. You have been warned!
Int' :: VariableType
OpenGL Graphics.Rendering.OpenGL.GL.Shaders.Attribs
data IntegerHandling
OpenGL Graphics.Rendering.OpenGL.GL.VertexSpec

Show more results