Hoogle Search

Within LTS Haskell 24.9 (ghc-9.10.2)

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

  1. reverseDirection :: CList a -> CList a

    data-clist Data.CircularList

    Reverse the direction of rotation.

  2. reverseDirection :: CList a -> CList a

    data-clist Data.CircularList.Internal

    Reverse the direction of rotation.

  3. reverseDropFromEndG :: (Integral b, InsertLeft t a, Monoid (t a)) => b -> t a -> t a

    monoid-insertleft Data.InsertLeft

    Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming 9 (4): 355–372, July 1999. that is available at the URL: https://www.cs.nott.ac.uk/~pszgmh/fold.pdf. Drops the specified quantity from the right end of the structure and then reverses the result.

  4. reverseDropG :: (Integral b, InsertLeft t a, Monoid (t a)) => b -> t a -> t a

    monoid-insertleft Data.InsertLeft

    Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming 9 (4): 355–372, July 1999. that is available at the URL: https://www.cs.nott.ac.uk/~pszgmh/fold.pdf. Is analogous to the dropping the specified quantity from the structure and then reversing the result. Uses strict variant of the foldl, so is strict and the data must be finite. Not recommended for performance reasons. For lists just use @ (reverse . drop n) combination.

  5. reverseTakeFromEndG :: (Integral b, InsertLeft t a, Monoid (t a)) => b -> t a -> t a

    monoid-insertleft Data.InsertLeft

    Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming 9 (4): 355–372, July 1999. that is available at the URL: https://www.cs.nott.ac.uk/~pszgmh/fold.pdf. Takes the specified quantity from the right end of the structure and then reverses the result.

  6. reverseTakeG :: (Integral b, InsertLeft t a, Monoid (t a)) => b -> t a -> t a

    monoid-insertleft Data.InsertLeft

    Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming 9 (4): 355–372, July 1999. that is available at the URL: https://www.cs.nott.ac.uk/~pszgmh/fold.pdf. Is analogous to the taking the specified quantity from the structure and then reversing the result. Uses strict variant of the foldl, so is not suitable for large amounts of data. Not recommended for performance reasons. For lists just use the combination (reverse . take n).

  7. reversePartial :: PartialOrdering -> PartialOrdering

    partialord Data.PartialOrd

    No documentation available.

  8. reverseThreeNotes :: RandomGen g => g -> [([Pitch], [Pitch])]

    reactive-midyim Reactive.Banana.MIDI.Training

    No documentation available.

  9. reverseReverse :: IO Proof

    sbv Documentation.SBV.Examples.KnuckleDragger.Lists 

    reverse (reverse xs) == xs
    We have: 
    >>> reverseReverse
Inductive lemma: revApp
Step: Base                            Q.E.D.
Step: 1                               Q.E.D.
Step: 2                               Q.E.D.
Step: 3                               Q.E.D.
Step: 4                               Q.E.D.
Step: 5                               Q.E.D.
Result:                               Q.E.D.
Inductive lemma: reverseReverse
Step: Base                            Q.E.D.
Step: 1                               Q.E.D.
Step: 2                               Q.E.D.
Step: 3                               Q.E.D.
Step: 4                               Q.E.D.
Result:                               Q.E.D.
[Proven] reverseReverse

  10. reverseBits :: EncodingInfo -> Option

    soxlib Sound.SoxLib

    No documentation available.

Page 31 of many | Previous | Next