Int -base

module Data.Text.Lazy.Builder.Int
text Data.Text.Lazy.Builder.Int
Int :: DataType
OpenGL Graphics.Rendering.OpenGL.GL.VertexArrays
module Codec.Compression.Zlib.Internal
zlib Codec.Compression.Zlib.Internal
Pure stream based interface to lower level zlib wrapper
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
IntegerL :: Integer -> Lit
template-haskell Language.Haskell.TH.Syntax, template-haskell Language.Haskell.TH
Used for overloaded and non-overloaded literals. We don't have a good way to represent non-overloaded literals at the moment. Maybe that doesn't matter?
Intensity :: PixelInternalFormat
OpenGL Graphics.Rendering.OpenGL.GL.PixelRectangles.ColorTable
Intensity12 :: PixelInternalFormat
OpenGL Graphics.Rendering.OpenGL.GL.PixelRectangles.ColorTable
Intensity16 :: PixelInternalFormat
OpenGL Graphics.Rendering.OpenGL.GL.PixelRectangles.ColorTable
Intensity4 :: PixelInternalFormat
OpenGL Graphics.Rendering.OpenGL.GL.PixelRectangles.ColorTable
Intensity8 :: PixelInternalFormat
OpenGL Graphics.Rendering.OpenGL.GL.PixelRectangles.ColorTable
data InterleavedArrays
OpenGL Graphics.Rendering.OpenGL.GL.VertexArrays
InterleavedAttribs :: TransformFeedbackBufferMode
OpenGL Graphics.Rendering.OpenGL.GL.TransformFeedback
Interpolate :: TextureCombineFunction
OpenGL Graphics.Rendering.OpenGL.GL.Texturing.Environments
package Interpolation
package
This package adds quasiquoter for multiline strings, interpolation and simple templating. It can handle repetition templates which makes it Handy for outputting larger structures, such as latex tables or gnuplot files. * 3.0 - Instead of Strings, the `str` quasiquoter produces values of type `(Monoid a, IsString a) => a`, making it compatible many other libraries, such as `Data.Text` and `Blaze.Builder`. * 2.6 - A handy quote for printing * 2.5.1 - version bump for ghc-7.0.1 Version 0.3.0
Interrupt :: ControlCharacter
unix System.Posix.Terminal, unix System.Posix.Terminal.ByteString

Show more results