Hoogle Search

Within LTS Haskell 24.10 (ghc-9.10.2)

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

Exact lookup

1. bitReverse16# :: Word# -> Word#

   ihaskell	IHaskellPrelude

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

2. bitReverse32# :: Word# -> Word#

   ihaskell	IHaskellPrelude

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

3. bitReverse64# :: Word64# -> Word64#

   ihaskell	IHaskellPrelude

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

4. bitReverse8# :: Word# -> Word#

   ihaskell	IHaskellPrelude

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

5. termReverse :: Bool -> IO ()

   isocline	System.Console.Isocline

   Set the terminal text reverse video mode.

6. 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.

7. SBVReverse :: Kind -> SeqOp

   sbv	Data.SBV.Internals

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

8. 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
   

9. creverse :: (CFreeMonoid f, Dom f a) => f a -> f a

   subcategories	Control.Subcategory.Foldable

   No documentation available.

10. lneqReversed :: forall (n :: Nat) (m :: Nat) . SNat n -> SNat m -> (n <? m) :~: (m >? n)

    type-natural	Data.Type.Natural.Lemma.Order

    Since 1.2.0.0 (type changed)

Page 69 of many | Previous | Next