Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

1. requestBodies :: HasRequestBodies s a => Lens' s a

   openapi3	Data.OpenApi.Lens

   No documentation available.

2. requestBody :: HasRequestBody s a => Lens' s a

   openapi3	Data.OpenApi.Lens

   No documentation available.

3. required :: HasRequired s a => Lens' s a

   openapi3	Data.OpenApi.Lens

   No documentation available.

4. Required :: forall value . WireDefault value

   proto-lens	Data.ProtoLens.Message

   No documentation available.

5. isRequired :: FieldDescriptor msg -> Bool

   proto-lens	Data.ProtoLens.Message

   Whether the given field is required. Specifically, if its FieldAccessor is a Required PlainField.

6. data Seq a

   protolude	Protolude

   General-purpose finite sequences.

7. deepseq :: NFData a => a -> b -> b

   protolude	Protolude

   deepseq: fully evaluates the first argument, before returning the second. The name deepseq is used to illustrate the relationship to seq: where seq is shallow in the sense that it only evaluates the top level of its argument, deepseq traverses the entire data structure evaluating it completely. deepseq can be useful for forcing pending exceptions, eradicating space leaks, or forcing lazy I/O to happen. It is also useful in conjunction with parallel Strategies (see the parallel package). There is no guarantee about the ordering of evaluation. The implementation may evaluate the components of the structure in any order or in parallel. To impose an actual order on evaluation, use pseq from Control.Parallel in the parallel package.

8. seq :: a -> b -> b

   protolude	Protolude

   The value of seq a b is bottom if a is bottom, and otherwise equal to b. In other words, it evaluates the first argument a to weak head normal form (WHNF). seq is usually introduced to improve performance by avoiding unneeded laziness. A note on evaluation order: the expression seq a b does not guarantee that a will be evaluated before b. The only guarantee given by seq is that the both a and b will be evaluated before seq returns a value. In particular, this means that b may be evaluated before a. If you need to guarantee a specific order of evaluation, you must use the function pseq from the "parallel" package.

9. sequenceA_ :: (Foldable t, Applicative f) => t (f a) -> f ()

   protolude	Protolude

   Evaluate each action in the structure from left to right, and ignore the results. For a version that doesn't ignore the results see sequenceA. sequenceA_ is just like sequence_, but generalised to Applicative actions.

   Examples

   Basic usage:

   >>> sequenceA_ [print "Hello", print "world", print "!"]
   "Hello"
   "world"
   "!"
   

10. sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()

    protolude	Protolude

    Evaluate each monadic action in the structure from left to right, and ignore the results. For a version that doesn't ignore the results see sequence. sequence_ is just like sequenceA_, but specialised to monadic actions.

Page 355 of many | Previous | Next