Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

  1. effectReverseStereo :: MonadIO m => Channel -> Bool -> m (m ())

    sdl2-mixer SDL.Mixer

    Swaps the left and right channel sound. If given True, will swap the sound channels. Returns an action that, when executed, removes this effect. That action simply calls effectReverseStereo with False.

  2. setReverseStereo :: MonadIO m => Channel -> CInt -> m CInt

    sdl2-mixer SDL.Raw.Mixer

    No documentation available.

  3. safeReverse :: Slist a -> Slist a

    slist Slist

    O(n). Returns the elements of the slist in reverse order. On infinite slists returns the initial slist.

    >>> safeReverse $ slist "Hello"
    Slist {sList = "olleH", sSize = Size 5}
    
    >> reverse $ infiniteSlist [1..]
    Slist {sList = [1..], sSize = Infinity}
    

  4. encryptedPassportElementReverseSide :: EncryptedPassportElement -> Maybe PassportFile

    telegram-bot-api Telegram.Bot.API.Types.EncryptedPassportElement

    Encrypted file with the reverse side of the document, provided by the user. Available for “driver_license” and “identity_card”. The file can be decrypted and verified using the accompanying EncryptedCredentials.

  5. PassportErrorSourceReverseSide :: PassportErrorSource

    telegram-bot-api Telegram.Bot.API.Types.PassportElementError

    No documentation available.

  6. rotationsortReverse :: Ord a => [a] -> [a]

    tensort Data.Tensort.Subalgorithms.Rotationsort

    Takes a list and returns a sorted list using a Reverse Rotationsort algorithm. I was having some issues with the swaps for larger input lists, so for now this function is only implemented for lists of length 3 or less.

    Examples

    >>> rotationsortReverse ([1,3,2] :: [Int])
    [1,2,3]
    
    >>> rotationsortReverse ([(3, 1), (1, 3), (2, 2)] :: [(Int, Int)])
    [(1,3),(2,2),(3,1)]
    

  7. rotationsortReverseAmbi :: Ord a => [a] -> [a]

    tensort Data.Tensort.Subalgorithms.Rotationsort

    Takes a list and returns a sorted list using an Ambidextrous Reverse Rotationsort algorithm. I was having some issues with the swaps for larger input lists, so for now this function is only implemented for lists of length 3 or less.

    Examples

    >>> rotationsortReverseAmbi ([1,3,2] :: [Int])
    [1,2,3]
    
    >>> rotationsortReverseAmbi ([(3, 1), (1, 3), (2, 2)] :: [(Int, Int)])
    [(1,3),(2,2),(3,1)]
    

  8. _TB_REVERSE :: Word16

    termbox-bindings-c Termbox.Bindings.C

    No documentation available.

  9. _TB_REVERSE :: Tb_attrs

    termbox-bindings-hs Termbox.Bindings.Hs

    No documentation available.

  10. mreverse :: forall (v :: Type -> Type) s a . MRotcev v s a -> MRotcev v s a

    vector-rotcev Data.Vector.Rotcev

    Reverse a mutable vector in O(1) time and space.

Page 77 of many | Previous | Next