Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. patchIntMapNewElementsMap :: PatchIntMap a -> IntMap a

    patch Data.Patch.IntMap

    Convert the given PatchIntMap a into an IntMap a with all the inserts/updates in the given patch.

  2. traverseIntMapPatchWithKey :: Applicative f => (Int -> a -> f b) -> PatchIntMap a -> f (PatchIntMap b)

    patch Data.Patch.IntMap

    Map an effectful function Int -> a -> f b over all as in the given PatchIntMap a (that is, all inserts/updates), producing a f (PatchIntMap b).

  3. unPatchIntMap :: PatchIntMap a -> IntMap (Maybe a)

    patch Data.Patch.IntMap

    No documentation available.

  4. histogramDiscreteIntMap :: T T Int -> (Int, T Int)

    synthesizer-core Synthesizer.Plain.Analysis

    Input list must be finite. If the input signal is empty, the offset is undefined. List is scanned once, counting may be slower.

  5. histogramIntMap :: C y => y -> T T y -> (Int, T Int)

    synthesizer-core Synthesizer.Plain.Analysis

    No documentation available.

  6. histogramLinearIntMap :: C y => T T y -> (Int, T y)

    synthesizer-core Synthesizer.Plain.Analysis

    No documentation available.

  7. histogramDiscreteIntMap :: T Int -> (Int, T Int)

    synthesizer-core Synthesizer.State.Analysis

    Input list must be finite. If the input signal is empty, the offset is undefined. List is scanned once, counting may be slower.

  8. histogramIntMap :: C y => y -> T y -> (Int, T Int)

    synthesizer-core Synthesizer.State.Analysis

    No documentation available.

  9. histogramLinearIntMap :: C y => T y -> (Int, T y)

    synthesizer-core Synthesizer.State.Analysis

    No documentation available.

  10. type PointMapFn x y = (Limit x, Limit y) -> Point

    Chart Graphics.Rendering.Chart.Geometry

    A function mapping between points.

Page 9 of many | Previous | Next