Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. package http-reverse-proxy

   Reverse proxy HTTP requests, either over raw sockets or with WAI Provides a simple means of reverse-proxying HTTP requests. The raw approach uses the same technique as leveraged by keter, whereas the WAI approach performs full request/response parsing via WAI and http-conduit.

2. bitReverse# :: Word# -> Word#

   ihaskell	IHaskellPrelude

   Reverse the order of the bits in a word.

3. bitReverse16# :: Word# -> Word#

   ihaskell	IHaskellPrelude

   Reverse the order of the bits in a 16-bit word.

4. bitReverse32# :: Word# -> Word#

   ihaskell	IHaskellPrelude

   Reverse the order of the bits in a 32-bit word.

5. bitReverse64# :: Word64# -> Word64#

   ihaskell	IHaskellPrelude

   Reverse the order of the bits in a 64-bit word.

6. bitReverse8# :: Word# -> Word#

   ihaskell	IHaskellPrelude

   Reverse the order of the bits in a 8-bit word.

7. termReverse :: Bool -> IO ()

   isocline	System.Console.Isocline

   Set the terminal text reverse video mode.

8. sizedReverse :: Int -> (Ptr Word8 -> IO a) -> Poke

   ptr-poker	PtrPoker.Poke

   Having the amount of bytes to be written precomputed, executes an action, which fills the pointer going downward, starting from the pointer that follows the chunk. I.e., you have to decrement the pointer before writing the first byte, decrement it again before writing the second byte and so on.

9. SBVReverse :: Kind -> SeqOp

   sbv	Data.SBV.Internals

   reverse k. Where k is either [a] or String. Reverses the argument, accordingly.

10. mapReverse :: IO Proof

    sbv	Documentation.SBV.Examples.KnuckleDragger.Lists

    map f . reverse == reverse . map f
    

    >>> mapReverse
    Inductive lemma: mapAppend
    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: mapReverse
    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.
    Step: 6                               Q.E.D.
    Result:                               Q.E.D.
    [Proven] mapReverse
    

Page 69 of many | Previous | Next