Hoogle Search

Within LTS Haskell 24.58 (ghc-9.10.3)

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

  1. TixModule :: String -> Hash -> Int -> [Integer] -> TixModule

    hpc Trace.Hpc.Tix

    No documentation available.

  2. getTixFileName :: FilePath -> FilePath

    hpc Trace.Hpc.Tix

    getTixFullName takes a binary or .tix-file name, and normalizes it into a .tix-file name. 

    getTixFileName "example.hs" == "example.tix"
getTixFileName "example.tar.gz" == "example.tar.tix"
getTixFileName "example.tix" == "example.tix"

  3. readTix :: FilePath -> IO (Maybe Tix)

    hpc Trace.Hpc.Tix

    Read a .tix File.

  4. tixModuleHash :: TixModule -> Hash

    hpc Trace.Hpc.Tix

    No documentation available.

  5. tixModuleName :: TixModule -> String

    hpc Trace.Hpc.Tix

    No documentation available.

  6. tixModuleTixs :: TixModule -> [Integer]

    hpc Trace.Hpc.Tix

    No documentation available.

  7. writeTix :: FilePath -> Tix -> IO ()

    hpc Trace.Hpc.Tix

    Write a .tix File.

  8. openConnectionUnix :: FilePath -> IO Connection

    http-streams Network.Http.Client

    Open a connection to a Unix domain socket. 

    main :: IO ()
main = do
c <- openConnectionUnix "/var/run/docker.sock"
...
closeConnection c

  9. commonPrefixes :: JSString -> JSString -> Maybe (JSString, JSString, JSString)

    jsaddle Data.JSString

    O(n) Find the longest non-empty common prefix of two strings and return it, along with the suffixes of each string at which they no longer match. If the strings do not have a common prefix or either one is empty, this function returns Nothing. Examples: 

    commonPrefixes "foobar" "fooquux" == Just ("foo","bar","quux")
commonPrefixes "veeble" "fetzer"  == Nothing
commonPrefixes "" "baz"           == Nothing

  10. isInfixOf :: JSString -> JSString -> Bool

    jsaddle Data.JSString

    The isInfixOf function takes two JSStrings and returns True iff the first is contained, wholly and intact, anywhere within the second. Complexity depends on how the JavaScript engine implements String.prototype.find.

Page 280 of many | Previous | Next