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.
lookupGE :: forall s a . (Ord a, KnownSet s a) => a -> Maybe (Element s a)refined-containers Data.Set.Refined Find the smallest element greater or equal to the given one.
lookupGT :: forall s a . (Ord a, KnownSet s a) => a -> Maybe (Element s a)refined-containers Data.Set.Refined Find the smallest element greater than the given one.
lookupLE :: forall s a . (Ord a, KnownSet s a) => a -> Maybe (Element s a)refined-containers Data.Set.Refined Find the largest element smaller or equal to the given one.
lookupLT :: forall s a . (Ord a, KnownSet s a) => a -> Maybe (Element s a)refined-containers Data.Set.Refined Find the largest element smaller than the given one.
lookupAll :: Ord k => TMapChan k a -> k -> STM [a]tmapchan Control.Concurrent.STM.TMapChan No documentation available.
lookupAll :: (Eq k, Hashable k) => TMapChan k a -> k -> STM [a]tmapchan Control.Concurrent.STM.TMapChan.Hash No documentation available.
lookupVar :: BindingMonad t v m => v -> m (Maybe (UTerm t v))unification-fd Control.Unification Given a variable pointing to UTerm t v, return the term it's bound to, or Nothing if the variable is unbound.
lookupRankVar :: RankedBindingMonad t v m => v -> m (Rank t v)unification-fd Control.Unification.Types Given a variable pointing to UTerm t v, return its rank and the term it's bound to.
lookupVar :: BindingMonad t v m => v -> m (Maybe (UTerm t v))unification-fd Control.Unification.Types Given a variable pointing to UTerm t v, return the term it's bound to, or Nothing if the variable is unbound.
lookupFlattened :: Union a -> Node -> (Node, a)union-find-array Data.Union Version of lookup that assumes the forest to be flattened. (cf. flatten.) Do not use otherwise: It will give wrong results!