Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

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

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

   reroute	Web.Routing.Router

   No documentation available.

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

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

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

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

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

   sbv	Data.SBV

   Generalization of any

8. satConcurrentWithAny :: Satisfiable a => SMTConfig -> [Query b] -> a -> IO (Solver, NominalDiffTime, SatResult)

   sbv	Data.SBV

   Find a satisfying assignment to a property using a single solver, but providing several query problems of interest, with each query running in a separate thread and return the first one that returns. This can be useful to use symbolic mode to drive to a location in the search space of the solver and then refine the problem in query mode. If the computation is very hard to solve for the solver than running in concurrent mode may provide a large performance benefit.

9. satWithAny :: Satisfiable a => [SMTConfig] -> a -> IO (Solver, NominalDiffTime, SatResult)

   sbv	Data.SBV

   Find a satisfying assignment to 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. proveConcurrentWithAny :: SMTConfig -> Symbolic SVal -> [Query SVal] -> IO (Solver, NominalDiffTime, ThmResult)

    sbv	Data.SBV.Dynamic

    Prove a property with query mode using multiple threads. Each query computation will spawn a thread and a unique instance of your solver to run asynchronously. The Symbolic SVal is duplicated for each thread. This function will return the first query computation that completes, killing the others.

Page 202 of many | Previous | Next