Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
lookup :: String -> EnvMap -> Maybe Stringopt-env-conf OptEnvConf.EnvMap No documentation available.
lookup :: ToHashableChunks a => LookupTable b -> a -> bperfect-hash-generator Data.PerfectHash.Lookup For embedded applications, this function would usually be re-implemented in C code.
Procedure description
The lookup procedure is three steps:- Compute the hash (with a nonce of zero) of the "key", modulo the length of the values array.
- Use the resulting value as an index into the nonces array.
The value found there represents either a direct index into the
values array or a nonce for a second round of
hashing.
- If negative, it is the former. Negate it (to obtain a positive value) and subtract one to obtain the actual index.
- Otherwise, re-compute the hash of the key, using this value instead of zero as the nonce. Again, compute the modulus with respect to the length of the values array.
- Use the result of (2) as the index into the values array.
lookup :: Show k => k -> StrMap k a -> Maybe apersistent-documentation Data.StrMap Lookup a value in the StrMap.
lookup :: Word -> Patricia a -> Maybe aradix-tree Data.Patricia.Word.Lazy Look up the value at a key in the tree.
lookup :: Word -> Patricia a -> Maybe aradix-tree Data.Patricia.Word.Strict Look up the value at a key in the tree.
lookup :: Feed1 -> Radix1Tree a -> Maybe aradix-tree Data.Radix1Tree.Word8.Lazy Look up the value at a key in the tree.
lookup :: Feed1 -> Radix1Tree a -> Maybe aradix-tree Data.Radix1Tree.Word8.Strict Look up the value at a key in the tree.
lookup :: Feed -> RadixTree a -> Maybe aradix-tree Data.RadixTree.Word8.Lazy Look up the value at a key in the tree.
lookup :: Feed -> RadixTree a -> Maybe aradix-tree Data.RadixTree.Word8.Strict Look up the value at a key in the tree.
lookup :: Word -> Zebra -> Colorradix-tree Data.Zebra.Word Look up the color of the key.