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.

  1. pattern RouteAsPath_PathSegmentType_ASCONFEDSEQUENCE :: RouteAsPath_PathSegmentType

    gogol-compute Gogol.Compute.Types

    No documentation available.

  2. pattern RouteAsPath_PathSegmentType_ASSEQUENCE :: RouteAsPath_PathSegmentType

    gogol-compute Gogol.Compute.Types

    No documentation available.

  3. pattern ChangesListSortBy_CHANGESEQUENCE :: ChangesListSortBy

    gogol-dns Gogol.DNS

    No documentation available.

  4. pattern ChangesListSortBy_CHANGESEQUENCE :: ChangesListSortBy

    gogol-dns Gogol.DNS.Types

    No documentation available.

  5. AppendModeSequence :: AppendMode

    jsaddle-dom JSDOM.Generated.Enums

    No documentation available.

  6. js_AppendModeSequence :: String

    jsaddle-dom JSDOM.Generated.Enums

    No documentation available.

  7. isSubsequenceOf :: Eq a => [a] -> [a] -> Bool

    listsafe Data.List.Safe

    The isSubsequenceOf function takes two lists and returns True if all the elements of the first list occur, in order, in the second. The elements do not have to occur consecutively. isSubsequenceOf x y is equivalent to x `elem` (subsequences y). Note: isSubsequenceOf is often used in infix form.

    Examples

    >>> "GHC" `isSubsequenceOf` "The Glorious Haskell Compiler"
    True
    
    >>> ['a','d'..'z'] `isSubsequenceOf` ['a'..'z']
    True
    
    >>> [1..10] `isSubsequenceOf` [10,9..0]
    False
    
    For the result to be True, the first list must be finite; for the result to be False, the second list must be finite:
    >>> [0,2..10] `isSubsequenceOf` [0..]
    True
    
    >>> [0..] `isSubsequenceOf` [0,2..10]
    False
    
    >>> [0,2..] `isSubsequenceOf` [0..]
    * Hangs forever*
    

  8. subsequences :: [a] -> [[a]]

    listsafe Data.List.Safe

    The subsequences function returns the list of all subsequences of the argument.

    Laziness

    subsequences does not look ahead unless it must:
    >>> take 1 (subsequences undefined)
    [[]]
    
    >>> take 2 (subsequences ('a' : undefined))
    ["","a"]
    

    Examples

    >>> subsequences "abc"
    ["","a","b","ab","c","ac","bc","abc"]
    
    This function is productive on infinite inputs:
    >>> take 8 $ subsequences ['a'..]
    ["","a","b","ab","c","ac","bc","abc"]
    

  9. package non-empty-sequence

    Non-empty sequence Please see README.md

  10. derivedSequence :: SequenceDerivable s i => Sequence s i

    relational-schemas Database.Custom.IBMDB2

    No documentation available.

Page 94 of many | Previous | Next