Hoogle Search

Within LTS Haskell 24.48 (ghc-9.10.3)

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

  1. forStack :: Args i [i]

    fold-debounce-conduit Data.Conduit.FoldDebounce

    Args for stacks. Input events are accumulated in a stack, i.e., the last event is at the head of the list.

  2. forVoid :: Args i ()

    fold-debounce-conduit Data.Conduit.FoldDebounce

    Args that discards input events. The data stream from the debounced source indicates the presence of data from the original source.

  3. package force-layout

    Simple force-directed layout Simulation engine for doing simple force-based layout, e.g. for trees or graphs. See the diagrams-contrib package for usage examples.

  4. force :: forall v n f . Functor f => (v n -> f (v n)) -> Particle v n -> f (Particle v n)

    force-layout Physics.ForceLayout

    No documentation available.

  5. forceLayout :: forall (v :: Type -> Type) n . (Metric v, Num n, Ord n) => ForceLayoutOpts n -> Ensemble v n -> Ensemble v n

    force-layout Physics.ForceLayout

    Run a simluation from a starting ensemble, yielding either the first ensemble to have kinetic energy below the energyLimit (if given), or the ensemble that results after a number of steps equal to the stepLimit (if given), whichever comes first. Otherwise forceLayout will not terminate.

  6. forces :: forall v n f . Functor f => ([([Edge], Point v n -> Point v n -> v n)] -> f [([Edge], Point v n -> Point v n -> v n)]) -> Ensemble v n -> f (Ensemble v n)

    force-layout Physics.ForceLayout

    No documentation available.

  7. package forma

    Parse and validate forms in JSON format Parse and validate forms in JSON format.

  8. package format-numbers

    Various number formatting functions Various number formatting functions

  9. forP :: (Traversable t, Applicative f) => t (a ? p) -> (forall name . () => ((a ~~ name) ::: p name) -> f b) -> f (t b)

    gdp Data.Refined

    Same as traverse, with the argument order flipped.

  10. forP_ :: (Foldable t, Applicative f) => t (a ? p) -> (forall name . () => ((a ~~ name) ::: p name) -> f b) -> f ()

    gdp Data.Refined

    Same as traverse_, with the argument order flipped.

Page 163 of many | Previous | Next