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. creverse :: (CFreeMonoid f, Dom f a) => f a -> f a

   subcategories	Control.Subcategory.Foldable

   No documentation available.

2. 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)

3. package universe-reverse-instances

   Instances of standard classes that are made possible by enumerations For example this package provides a Eq (a -> b) instance:

   instance (Finite a, Eq b) => Eq (a -> b) where
   f == g = and [f x == g x | x <- universeF]
   

4. bvBitreverse :: forall sym (w :: Natural) . (1 <= w, IsExprBuilder sym) => sym -> SymBV sym w -> IO (SymBV sym w)

   what4	What4.Interface

   Swap the order of the bits in a bitvector.

5. bitReverse16 :: Word16 -> Word16

   word-compat	GHC.Word.Compat

   Reverse the order of the bits in a Word16.

6. bitReverse32 :: Word32 -> Word32

   word-compat	GHC.Word.Compat

   Reverse the order of the bits in a Word32.

7. bitReverse64 :: Word64 -> Word64

   word-compat	GHC.Word.Compat

   Reverse the order of the bits in a Word64.

8. bitReverse8 :: Word8 -> Word8

   word-compat	GHC.Word.Compat

   Reverse the order of the bits in a Word8.

9. gXandReverse :: GXFunction

   xmonad	XMonad

   No documentation available.

10. gXorReverse :: GXFunction

    xmonad	XMonad

    No documentation available.

Page 70 of many | Previous | Next