Int -> CInt

toEnum :: Enum a => Int -> a
base Prelude
bit :: Bits a => Int -> a
base Data.Bits
clearBit :: Bits a => a -> Int -> a
base Data.Bits
complementBit :: Bits a => a -> Int -> a
base Data.Bits
rotate :: Bits a => a -> Int -> a
base Data.Bits
rotateL :: Bits a => a -> Int -> a
base Data.Bits
rotateR :: Bits a => a -> Int -> a
base Data.Bits
setBit :: Bits a => a -> Int -> a
base Data.Bits
shift :: Bits a => a -> Int -> a
base Data.Bits
shiftL :: Bits a => a -> Int -> a
base Data.Bits
shiftR :: Bits a => a -> Int -> a
base Data.Bits
elemAt :: Int -> Set a -> a
containers Data.Set
O(log n). Retrieve an element by its index, i.e. by its zero-based index in the sorted sequence of elements. If the index is out of range (less than zero, greater or equal to size of the set), error is called. > elemAt 0 (fromList [5,3]) == 3 > elemAt 1 (fromList [5,3]) == 5 > elemAt 2 (fromList [5,3]) Error: index out of range
(!!) :: [a] -> Int -> a
base Prelude, base Data.List
List index (subscript) operator, starting from 0. It is an instance of the more general Data.List.genericIndex, which takes an index of any integral type.
index :: Seq a -> Int -> a
containers Data.Sequence
O(log(min(i,n-i))). The element at the specified position, counting from 0. The argument should thus be a non-negative integer less than the size of the sequence. If the position is out of range, index fails with an error.
(!) :: IntMap a -> Key -> a
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
O(min(n,W)). Find the value at a key. Calls error when the element can not be found. > fromList [(5,'a'), (3,'b')] ! 1 Error: element not in the map > fromList [(5,'a'), (3,'b')] ! 5 == 'a'
unsafeCoerce :: a -> b
base Unsafe.Coerce
throwDyn :: Typeable exception => exception -> b
base Control.OldException
Raise any value as an exception, provided it is in the Typeable class.
getDistance :: Node -> LRTree a -> a
fgl Data.Graph.Inductive.Internal.RootPath
unGen :: Gen a -> StdGen -> Int -> a
QuickCheck Test.QuickCheck.Gen
gmapQi :: Data a => Int -> (forall d. Data d => d -> u) -> a -> u
base Data.Data

Show more results