Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

  1. lookupL :: Openness -> Feed -> RadixTree a -> Maybe (Lookup a)

    radix-tree Data.RadixTree.Word8.Strict

    Look up a value at a largest key smaller than (or equal to) the given key.

  2. lookupMax :: RadixTree a -> Maybe a

    radix-tree Data.RadixTree.Word8.Strict

    Look up a value at the rightmost key in the tree.

  3. lookupMaxWithKey :: RadixTree a -> Maybe (Lookup a)

    radix-tree Data.RadixTree.Word8.Strict

    Look up a value at the rightmost key in the tree.

  4. lookupMin :: RadixTree a -> Maybe a

    radix-tree Data.RadixTree.Word8.Strict

    Look up a value at the leftmost key in the tree.

  5. lookupMinWithKey :: RadixTree a -> Maybe (Lookup a)

    radix-tree Data.RadixTree.Word8.Strict

    Look up a value at the leftmost key in the tree.

  6. lookupR :: Openness -> Feed -> RadixTree a -> Maybe (Lookup a)

    radix-tree Data.RadixTree.Word8.Strict

    Look up a value at a smallest key greater than (or equal to) the given key.

  7. lookupL :: Color -> Word -> Zebra -> Maybe Word

    radix-tree Data.Zebra.Word

    Look up the key of the given color that is smaller than or equal to the given key.

  8. lookupR :: Color -> Word -> Zebra -> Maybe Word

    radix-tree Data.Zebra.Word

    Look up the key of the given color that is greater than or equal to the given key.

  9. lookupGE :: Int -> RIntSet -> Maybe Int

    range-set-list Data.RangeSet.IntMap

    O(log n). Find smallest element greater or equal to than the given one.

  10. lookupGT :: Int -> RIntSet -> Maybe Int

    range-set-list Data.RangeSet.IntMap

    O(log n). Find smallest element greater than the given one.

Page 104 of many | Previous | Next