Hoogle Search

Within LTS Haskell 24.62 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. data LookupTable a

   perfect-hash-generator	Data.PerfectHash.Lookup

   Inputs for the lookup function. There are two arrays used in successive stages of the lookup. In this implementation, both arrays are the same length.

2. LookupTable :: Vector Int -> Vector a -> LookupTable a

   perfect-hash-generator	Data.PerfectHash.Lookup

   No documentation available.

3. data Lookup1 a

   radix-tree	Data.Radix1Tree.Word8.Lazy.Unsafe

   Key together with the value.

4. Lookup1 :: Build1 -> a -> Lookup1 a

   radix-tree	Data.Radix1Tree.Word8.Lazy.Unsafe

   No documentation available.

5. data Lookup1 a

   radix-tree	Data.Radix1Tree.Word8.Strict

   Key together with the value.

6. Lookup1 :: Build1 -> a -> Lookup1 a

   radix-tree	Data.Radix1Tree.Word8.Strict

   No documentation available.

7. data Lookup1 a

   radix-tree	Data.Radix1Tree.Word8.Strict.Unsafe

   Key together with the value.

8. Lookup1 :: Build1 -> a -> Lookup1 a

   radix-tree	Data.Radix1Tree.Word8.Strict.Unsafe

   No documentation available.

9. data LookupFormula lb gr

   swish	Swish.RDF.Graph

   Graph formula entry

10. LookupClosure :: String -> Message (Maybe HValueRef)

    ghc-lib	GHC.Runtime.Interpreter

    No documentation available.

Page 174 of many | Previous | Next