Hoogle Search
Within LTS Haskell 24.38 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
deriving-compat Data.Deriving.Internal No documentation available.
flipAL :: (Eq key, Eq val) => [(key, val)] -> [(val, [key])]MissingH Data.List.Utils Flips an association list. Converts (key1, val), (key2, val) pairs to (val, [key1, key2]).
flipM :: (Ord key, Ord val) => Map key val -> Map val [key]MissingH Data.Map.Utils Flips a Map. See flipAL for more on the similar function for lists.
flippedLookupM :: (Ord val, Ord key) => val -> Map key val -> [key]MissingH Data.Map.Utils Returns a list of all keys in the Map whose value matches the parameter. If the value does not occur in the Map, the empty list is returned.
flipSwap :: SwapFlag -> SwapFlagghc-lib-parser GHC.Types.Basic No documentation available.
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]
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]
flipY :: Subtractive a => Point a -> Point anumhask-space NumHask.Space.Point reflect on x-axis
-
numhask-space NumHask.Space.Rect flip axes
>>> flipAxes (Rect 1 2 3 4) Rect 3 4 1 2
flipFlopHysteresis :: Ord y => (y, y) -> BinaryLevel -> T y BinaryLevelsynthesizer-core Synthesizer.Causal.Analysis No documentation available.