Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. type family CanMakeMany a (els :: [Type]) (targets :: [Type])

    registry Data.Registry.Solver

    Compute if a registry can be added to another registry

  2. hookAny :: forall (m :: Type -> Type) reqTypes n b middleware . (Monad m, Eq reqTypes, Hashable reqTypes) => reqTypes -> ([Text] -> n b) -> RegistryT n b middleware reqTypes m ()

    reroute Web.Routing.Router

    No documentation available.

  3. hookAnyMethod :: forall (m :: Type -> Type) n b middleware reqTypes . Monad m => ([Text] -> n b) -> RegistryT n b middleware reqTypes m ()

    reroute Web.Routing.Router

    No documentation available.

  4. hookRouteAnyMethod :: forall (m :: Type -> Type) (as :: [Type]) n b middleware reqTypes . Monad m => PathInternal as -> HVectElim' (n b) as -> RegistryT n b middleware reqTypes m ()

    reroute Web.Routing.Router

    No documentation available.

  5. rs_anyMethod :: RegistryState (n :: Type -> Type) b reqTypes -> !Registry n b

    reroute Web.Routing.Router

    No documentation available.

  6. commonLispNumberAnyBase :: Parser Integer

    s-cargot Data.SCargot.Common

    A parser for Common Lisp's arbitrary-base number syntax, of the form #[base]r[number], where the base is given in decimal. Note that this syntax begins with a #, which means it might conflict with defined reader macros.

  7. gnuM4NumberAnyBase :: Parser Integer

    s-cargot Data.SCargot.Common

    A parser for GNU m4's arbitrary-base number syntax, of the form 0r[base]:[number], where the base is given in decimal.

  8. proveConcurrentWithAny :: Provable a => SMTConfig -> [Query b] -> a -> IO (Solver, NominalDiffTime, ThmResult)

    sbv Data.SBV

    Prove a property by running many queries each isolated to their own thread concurrently and return the first that finishes, killing the others

  9. proveWithAny :: Provable a => [SMTConfig] -> a -> IO (Solver, NominalDiffTime, ThmResult)

    sbv Data.SBV

    Prove a property with multiple solvers, running them in separate threads. Only the result of the first one to finish will be returned, remaining threads will be killed. Note that we send an exception to the losing processes, but we do *not* actually wait for them to finish. In rare cases this can lead to zombie processes. In previous experiments, we found that some processes take their time to terminate. So, this solution favors quick turnaround.

  10. sAny :: (a -> SBool) -> [a] -> SBool

    sbv Data.SBV

    Generalization of any

Page 203 of many | Previous | Next