Hoogle Search

Within LTS Haskell 24.5 (ghc-9.10.2)

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

  1. flipName :: String -> String

    bibtex Text.BibTeX.Entry

    Convert the name style "Surname, First name" into "First name Surname".

  2. flipBit :: PrimMonad m => MVector (PrimState m) Bit -> Int -> m ()

    bitvec Data.Bit

    Flip the bit at the given position. Equivalent to flip modify complement, but up to 2x faster. In general there is no reason to modify bit vectors: either you modify it with id (which is id altogether) or with complement (which is flipBit). 

    >>> :set -XOverloadedLists

>>> Data.Vector.Unboxed.modify (`flipBit` 2) [1,1,1,1]
[1,1,0,1]

  3. flipBit :: PrimMonad m => MVector (PrimState m) Bit -> Int -> m ()

    bitvec Data.Bit.ThreadSafe

    Flip the bit at the given position. Equivalent to flip modify complement, but up to 33% faster and atomic. In general there is no reason to modify bit vectors: either you modify it with id (which is id altogether) or with complement (which is flipBit). 

    >>> Data.Vector.Unboxed.modify (\v -> flipBit v 1) (read "[1,1,1]")
[1,0,1]

  4. flipSeq :: Int -> [Int]

    reactive-midyim Reactive.Banana.MIDI.Pattern

    See Haskore/FlipSong flipSeq m !! n = cross sum of the m-ary representation of n modulo m. For m=2 this yields http://www.research.att.com/cgi-bin/access.cgi/as/njas/sequences/eisA.cgi?Anum=A010060

  5. flipHVectElim :: HVectElim' x (ts :: [Type]) -> HVectElim ts x

    reroute Web.Routing.SafeRouting

    No documentation available.

  6. flipCmpNat :: forall (a :: Nat) (b :: Nat) . SNat a -> SNat b -> FlipOrdering (CmpNat a b) :~: CmpNat b a

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

    No documentation available.

  7. flipCmp :: CompareDirection -> CompareDirection

    Agda Agda.TypeChecking.Monad.Base

    Flip the direction of comparison.

  8. flipP :: Permutation -> Permutation

    Agda Agda.Utils.Permutation

    permPicks (flipP p) = permute p (downFrom (permRange p)) or permute (flipP (Perm n xs)) [0..n-1] = permute (Perm n xs) (downFrom n) Can be use to turn a permutation from (de Bruijn) levels to levels to one from levels to indices. See numberPatVars.

  9. flipHorizontally :: Pixel a => Image a -> Image a

    JuicyPixels-extra Codec.Picture.Extra

    Flip an image horizontally.

  10. flipVertically :: Pixel a => Image a -> Image a

    JuicyPixels-extra Codec.Picture.Extra

    Flip an image vertically.

Page 11 of many | Previous | Next