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.

Exact lookup

1. lookupConstraintsList :: VarRef -> TMonad [Constraint]

   jmacro	Language.Javascript.JMacro.TypeCheck

   No documentation available.

2. lookupEnv :: Ident -> TMonad JType

   jmacro	Language.Javascript.JMacro.TypeCheck

   No documentation available.

3. 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
   

4. 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
   

5. 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')
   

6. 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')
   

7. lookupMay :: Ord k => k -> Map ph k v -> Maybe (Key ph k, v)

   justified-containers	Data.Map.Justified

   O(log n). Lookup the value at a key that is not already known to be in the map. Return Just the value and the key-with-evidence if the key was present, or Nothing otherwise.

8. lookupAction :: HostManager -> HostBS -> IO (Maybe (ProxyAction, Credentials))

   keter	Keter.HostManager

   No documentation available.

9. lookupBase :: ParseYamlFile a => BaseDir -> Object -> Text -> Parser a

   keter	Keter.Yaml.FilePath

   A replacement for the .: operator which will both parse a file path and apply the relative file logic.

10. lookupBaseMaybe :: ParseYamlFile a => BaseDir -> Object -> Text -> Parser (Maybe a)

    keter	Keter.Yaml.FilePath

    A replacement for the .:? operator which will both parse a file path and apply the relative file logic.

Page 135 of many | Previous | Next