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. psHostLookup :: ProxySettings -> ByteString -> IO (Maybe (ProxyAction, Credentials))

   keter	Keter.Proxy

   Mapping from virtual hostname to port number.

2. keyCodeLookup :: KeyCode -> Key

   keycode	Web.KeyCode

   Determine the Key that a KeyCode represents. If one cannot be found, UnknownKey is returned. Since: 0.1

3. splitLookup :: Word -> Patricia a -> (Patricia a, Maybe a, Patricia a)

   radix-tree	Data.Patricia.Word.Lazy

   Split the tree into two, such that values with keys smaller than the given one are on the left, values with keys greater than the given one are on the right, and the value at the given key is returned separately.

4. unsafeLookupMax :: Patricia a -> (# a #)

   radix-tree	Data.Patricia.Word.Lazy.Unsafe

   Look up a value at the rightmost key in the tree. Throws MalformedTree if the tree is empty.

5. unsafeLookupMaxWithKey :: Patricia a -> Lookup a

   radix-tree	Data.Patricia.Word.Lazy.Unsafe

   Look up a value at the rightmost key in the tree. Throws MalformedTree if the tree is empty.

6. unsafeLookupMin :: Patricia a -> (# a #)

   radix-tree	Data.Patricia.Word.Lazy.Unsafe

   Look up a value at the leftmost key in the tree. Throws MalformedTree if the tree is empty.

7. unsafeLookupMinWithKey :: Patricia a -> Lookup a

   radix-tree	Data.Patricia.Word.Lazy.Unsafe

   Look up a value at the leftmost key in the tree. Throws MalformedTree if the tree is empty.

8. data SplitLookup l x r

   radix-tree	Data.Patricia.Word.Strict

   Result of a tree split with a lookup.

9. SplitLookup :: !Patricia l -> !Maybe x -> !Patricia r -> SplitLookup l x r

   radix-tree	Data.Patricia.Word.Strict

   No documentation available.

10. dirtyLookup :: Word -> Patricia a -> Maybe a

    radix-tree	Data.Patricia.Word.Strict

    Look up the value at a key in the tree.

Page 228 of many | Previous | Next