Hoogle Search

Within LTS Haskell 24.61 (ghc-9.10.3)

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

  1. lookupByRememberToken :: IAuthBackend r => r -> Text -> IO (Maybe AuthUser)

    snap Snap.Snaplet.Auth

    No documentation available.

  2. lookupByUserId :: IAuthBackend r => r -> UserId -> IO (Maybe AuthUser)

    snap Snap.Snaplet.Auth

    No documentation available.

  3. lookupT :: Key -> PrefixTree a -> Maybe a

    tomland Toml.Type.PrefixTree

    Looks up the value at a key in the PrefixTree.

  4. lookupPrefixes :: Ord c => [c] -> TMap c a -> [([c], a)]

    trie-simple Data.Trie.Map

    lookupPrefixes xs tmap performs lookup for every prefixes of the input string xs and returns list of every pair of prefix and value exising in tmap.

    Example
    >>> let x = fromList [("ham", 1), ("bacon", 2), ("hamburger", 3)]

>>> lookupPrefixes "hamburger and bacon" x
[("ham",1),("hamburger",3)]

  5. lookupPrefix :: MonadPlus m => String -> Trie -> m Trie

    word-trie Data.Trie

    Takes a trie and a prefix and returns the sub-trie that of words with that prefix

  6. lookupBestMatch :: EventString -> [(EventString, a)] -> MatchResult a

    yi-keymap-vim Yi.Keymap.Vim.Common

    No documentation available.

  7. lookupGE :: Ord k => k -> IntervalMap k v -> Maybe (k, v)

    IntervalMap Data.IntervalMap.Generic.Lazy

    O(log n). Find the smallest key equal to or larger than the given one and return it along with its value.

  8. lookupGT :: Ord k => k -> IntervalMap k v -> Maybe (k, v)

    IntervalMap Data.IntervalMap.Generic.Lazy

    O(log n). Find the smallest key larger than the given one and return it along with its value.

  9. lookupLE :: Ord k => k -> IntervalMap k v -> Maybe (k, v)

    IntervalMap Data.IntervalMap.Generic.Lazy

    O(log n). Find the largest key equal to or smaller than the given one and return it along with its value.

  10. lookupLT :: Ord k => k -> IntervalMap k v -> Maybe (k, v)

    IntervalMap Data.IntervalMap.Generic.Lazy

    O(log n). Find the largest key smaller than the given one and return it along with its value.

Page 144 of many | Previous | Next