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.
lookupEvent :: Query -> Maybe (Event Text Text)hyperbole Web.Hyperbole.Effect.Event No documentation available.
lookupParam :: ByteString -> Query -> Maybe Texthyperbole Web.Hyperbole.Effect.Event Lower-level lookup straight from the request
-
hyperbole Web.Hyperbole.Effect.Query Parse a single parameter from the query string if available
-
hyperbole Web.Hyperbole.Effect.Session Return a session if it exists
lookupConstraintsList :: VarRef -> TMonad [Constraint]jmacro Language.Javascript.JMacro.TypeCheck No documentation available.
lookupEnv :: Ident -> TMonad JTypejmacro Language.Javascript.JMacro.TypeCheck No documentation available.
lookupGE :: Ord k => k -> Map ph k v -> Maybe (Key ph k, v)justified-containers Data.Map.Justified O(log n). Find the smallest key greater than or equal to the given one and return the corresponding (key,value) pair, with evidence for the key.
withMap (M.fromList [(3,'a'), (5,'b')]) $ \table -> lookupGE 3 table == Just (Key 3, 'a') withMap (M.fromList [(3,'a'), (5,'b')]) $ \table -> lookupGE 4 table == Just (Key 5, 'b') withMap (M.fromList [(3,'a'), (5,'b')]) $ \table -> lookupGE 6 table == Nothing
lookupGT :: Ord k => k -> Map ph k v -> Maybe (Key ph k, v)justified-containers Data.Map.Justified O(log n). Find the smallest key greater than the given one and return the corresponding (key,value) pair, with evidence for the key.
withMap (M.fromList [(3,'a'), (5,'b')]) $ \table -> lookupGT 4 table == Just (Key 5, 'b') withMap (M.fromList [(3,'a'), (5,'b')]) $ \table -> lookupGT 5 table == Nothing
lookupLE :: Ord k => k -> Map ph k v -> Maybe (Key ph k, v)justified-containers Data.Map.Justified O(log n). Find the largest key smaller than or equal to the given one and return the corresponding (key,value) pair, with evidence for the key.
withMap (M.fromList [(3,'a'), (5,'b')]) $ \table -> lookupLE 2 table == Nothing withMap (M.fromList [(3,'a'), (5,'b')]) $ \table -> lookupLE 4 table == Just (Key 3, 'a') withMap (M.fromList [(3,'a'), (5,'b')]) $ \table -> lookupLE 5 table == Just (Key 5, 'b')
lookupLT :: Ord k => k -> Map ph k v -> Maybe (Key ph k, v)justified-containers Data.Map.Justified O(log n). Find the largest key smaller than the given one and return the corresponding (key,value) pair, with evidence for the key.
withMap (M.fromList [(3,'a'), (5,'b')]) $ \table -> lookupLT 3 table == Nothing withMap (M.fromList [(3,'a'), (5,'b')]) $ \table -> lookupLT 4 table == Just (Key 3, 'a')