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. lookupLE :: Int -> PrimeIntSet -> Maybe (Prime Int)

   arithmoi	Math.NumberTheory.Primes.IntSet

   Find the largest prime in the set, smaller or equal to the given integer, if any exists.

2. lookupLT :: Int -> PrimeIntSet -> Maybe (Prime Int)

   arithmoi	Math.NumberTheory.Primes.IntSet

   Find the largest prime in the set, smaller than the given integer, if any exists.

3. lookup_ :: forall be (db :: (Type -> Type) -> Type) table . (Database be db, Table table, BeamSqlBackend be, HasQBuilder be, SqlValableTable be (PrimaryKey table), HasTableEquality be (PrimaryKey table)) => DatabaseEntity be db (TableEntity table) -> PrimaryKey table Identity -> SqlSelect be (table Identity)

   beam-core	Database.Beam.Query

   Convenience function to generate a SqlSelect that looks up a table row given a primary key.

4. lookupRanges :: Eq b => b -> [Range b a] -> Maybe (Range b a)

   binary-search	Numeric.Search

   Look up for the first Range with the given predicate.

5. lookupQuotes :: Locale -> ((Text, Text), (Text, Text))

   citeproc	Citeproc.Locale

   No documentation available.

6. lookupAbbreviation :: CiteprocOutput a => Variable -> Val a -> Abbreviations -> Maybe (Val a)

   citeproc	Citeproc.Types

   Returns an abbreviation if the variable and its value match something in the abbreviations map.

7. lookupReference :: ItemId -> ReferenceMap a -> Maybe (Reference a)

   citeproc	Citeproc.Types

   No documentation available.

8. lookupVariable :: CiteprocOutput a => Variable -> Reference a -> Maybe (Val a)

   citeproc	Citeproc.Types

   No documentation available.

9. lookupKV :: forall k v f (es :: [Effect]) (ff :: (Type -> Type) -> Type -> Type) (c :: (Type -> Type) -> Constraint) . (Free c ff, f ~ Eff ff es, KVStore k v :> es) => k -> f (Maybe v)

   data-effects	Data.Effect.KVStore

   No documentation available.

10. lookupKV'_ :: forall k v f (es :: [Effect]) (ff :: (Type -> Type) -> Type -> Type) (c :: (Type -> Type) -> Constraint) . (Free c ff, f ~ Eff ff es, In (KVStore k v) es) => k -> f (Maybe v)

    data-effects	Data.Effect.KVStore

    No documentation available.

Page 106 of many | Previous | Next