Hoogle Search
Within LTS Haskell 24.12 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
lookupIndex :: Ord a => a -> Set a -> Maybe Intrio RIO.Set Lookup the index of an element, which is its zero-based index in the sorted sequence of elements. The index is a number from 0 up to, but not including, the size of the set.
isJust (lookupIndex 2 (fromList [5,3])) == False fromJust (lookupIndex 3 (fromList [5,3])) == 0 fromJust (lookupIndex 5 (fromList [5,3])) == 1 isJust (lookupIndex 6 (fromList [5,3])) == False
lookupLE :: Ord a => a -> Set a -> Maybe ario RIO.Set Find largest element smaller or equal to the given one.
lookupLE 2 (fromList [3, 5]) == Nothing lookupLE 4 (fromList [3, 5]) == Just 3 lookupLE 5 (fromList [3, 5]) == Just 5
lookupLT :: Ord a => a -> Set a -> Maybe ario RIO.Set Find largest element smaller than the given one.
lookupLT 3 (fromList [3, 5]) == Nothing lookupLT 5 (fromList [3, 5]) == Just 3
-
rio RIO.Set The maximal element of a set.
-
rio RIO.Set The minimal element of a set.
lookupHeader :: HeaderName -> [Header] -> Maybe StringHTTP Network.HTTP.Headers lookupHeader hdr hdrs locates the first header matching hdr in the list hdrs.
lookupJustDef :: Eq a => b -> a -> [(a, b)] -> berrors Control.Error No documentation available.
lookupIndex :: (HashTable h, Eq k, Hashable k) => h s k v -> k -> ST s (Maybe Word)hashtables Data.HashTable.Class Looks up the index of a key-value mapping in a hash table suitable for passing to nextByIndex.
lookupIndex :: (HashTable h, Eq k, Hashable k) => IOHashTable h k v -> k -> IO (Maybe Word)hashtables Data.HashTable.IO See the documentation for this function in lookupIndex.
lookupIndex :: (Hashable k, Eq k) => HashTable s k v -> k -> ST s (Maybe Word)hashtables Data.HashTable.ST.Cuckoo Find index of given key in the hashtable.