Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. _stepFunctionsStateMachineTags :: StepFunctionsStateMachine -> Maybe [StepFunctionsStateMachineTagsEntry]

   stratosphere	Stratosphere.Resources.StepFunctionsStateMachine

   No documentation available.

2. _stepFunctionsStateMachineTracingConfiguration :: StepFunctionsStateMachine -> Maybe StepFunctionsStateMachineTracingConfiguration

   stratosphere	Stratosphere.Resources.StepFunctionsStateMachine

   No documentation available.

3. enumerateFromStepIntegral :: forall t (m :: Type -> Type) a . (IsStream t, Monad m, Integral a) => a -> a -> t m a

   streamly	Streamly.Internal.Data.Stream.IsStream

   enumerateFromStepIntegral from step generates an infinite stream whose first element is from and the successive elements are in increments of step. CAUTION: This function is not safe for finite integral types. It does not check for overflow, underflow or bounds.

   >>> Stream.toList $ Stream.take 4 $ Stream.enumerateFromStepIntegral 0 2
   [0,2,4,6]
   
   >>> Stream.toList $ Stream.take 3 $ Stream.enumerateFromStepIntegral 0 (-2)
   [0,-2,-4]
   

4. runSteps :: Extensions -> Maybe FilePath -> [Step] -> Lines -> Either String Lines

   stylish-haskell	Language.Haskell.Stylish

   No documentation available.

5. configSteps :: Config -> [Step]

   stylish-haskell	Language.Haskell.Stylish.Config

   No documentation available.

6. makeStep :: String -> (Lines -> Module -> Lines) -> Step

   stylish-haskell	Language.Haskell.Stylish.Step

   No documentation available.

7. checkStep :: Ord ex => [Rule ex] -> [ex] -> Step ex -> Bool

   swish	Swish.Proof

   A proof step is valid if rule is in list of rules and the antecedents are sufficient to obtain the conclusion and the antecedents are in the list of formulae already proven. Note: this function depends on the ruleName of any rule being unique among all rules. In particular the name of the step rule being in correspondence with the name of one of the indicated valid rules of inference.

8. type RDFProofStep = Step RDFGraph

   swish	Swish.RDF.Proof

   A step in an RDF proof.

9. makeRDFProofStep :: RDFRule -> [RDFFormula] -> RDFFormula -> RDFProofStep

   swish	Swish.RDF.Proof

   Make an RDF graph proof step.

10. _stepdrop :: Time -> Pattern a -> Pattern a

    tidal	Sound.Tidal.Boot

    No documentation available.

Page 102 of many | Previous | Next