Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. reversePredefinedRefs :: Map Text Text

    xmlhtml Text.XmlHtml.HTML.Meta

    Reverse lookup of Html entities. The values in this map should be the "canonical" entity names that are most widely support by browsers, email clients, etc. If you encounter a situation where the value in this map is not the most widely supported, please open a pull request to change the order in the appropriate ent2names table below.

  2. reverseFileMap :: MonadLsp config m => m (FilePath -> FilePath)

    lsp Language.LSP.Server

    If the contents of a VFS has been dumped to a temporary file, map the temporary file name back to the original one.

  3. reverseMap :: VFSData -> !Map FilePath FilePath

    lsp Language.LSP.Server

    No documentation available.

  4. reverseSortEdit :: WorkspaceEdit -> WorkspaceEdit

    lsp Language.LSP.Server

    The changes in a workspace edit should be applied from the end of the file toward the start. Sort them into this order.

  5. reverseDown :: SortedList (Down a) -> SortedList a

    sorted-list Data.SortedList

    O(n). Reverse a sorted list with elements embedded in the Down type. Only available from base version 4.6.0.0.

  6. reverseBits :: Vector Bit -> Vector Bit

    bitvec Data.Bit

    Reverse the order of bits.

    >>> :set -XOverloadedLists
    
    >>> reverseBits [1,1,0,1,0]
    [0,1,0,1,1]
    
    Consider using the vector-rotcev package to reverse vectors in O(1) time.

  7. reverseInPlace :: PrimMonad m => MVector (PrimState m) Bit -> m ()

    bitvec Data.Bit

    Reverse the order of bits in-place.

    >>> :set -XOverloadedLists
    
    >>> Data.Vector.Unboxed.modify reverseInPlace [1,1,0,1,0]
    [0,1,0,1,1]
    
    Consider using the vector-rotcev package to reverse vectors in O(1) time.

  8. reverseBits :: Vector Bit -> Vector Bit

    bitvec Data.Bit.ThreadSafe

    Reverse the order of bits.

    >>> :set -XOverloadedLists
    
    >>> reverseBits [1,1,0,1,0]
    [0,1,0,1,1]
    
    Consider using the vector-rotcev package to reverse vectors in O(1) time.

  9. reverseInPlace :: PrimMonad m => MVector (PrimState m) Bit -> m ()

    bitvec Data.Bit.ThreadSafe

    Reverse the order of bits in-place.

    >>> :set -XOverloadedLists
    
    >>> Data.Vector.Unboxed.modify reverseInPlace [1,1,0,1,0]
    [0,1,0,1,1]
    
    Consider using the vector-rotcev package to reverse vectors in O(1) time.

  10. reverseProxy :: forall a' a b' b (e :: Effects) . Proxy a' a b' b e -> Proxy b b' a a' e

    bluefin-internal Bluefin.Internal.Pipes

    No documentation available.

Page 30 of many | Previous | Next