Hoogle Search

Within LTS Haskell 24.19 (ghc-9.10.3)

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

  1. degreeSequence :: [Int] -> DegreeSequence

    graphite Data.Graph.UGraph.DegreeSequence

    Construct a DegreeSequence from a list of degrees. Negative degree values get discarded

  2. getDegreeSequence :: (Hashable v, Eq v) => UGraph v e -> Maybe DegreeSequence

    graphite Data.Graph.UGraph.DegreeSequence

    Get the DegreeSequence of a simple UGraph. If the graph is not simple (see isSimple) the result is Nothing

  3. isGraphicalSequence :: DegreeSequence -> Bool

    graphite Data.Graph.UGraph.DegreeSequence

    Tell if a DegreeSequence is a Graphical Sequence A Degree Sequence is a Graphical Sequence if a corresponding UGraph for it exists. Uses the Havel-Hakimi algorithm

  4. OP_CHECKSEQUENCEVERIFY :: ScriptOp

    haskoin-core Haskoin.Script.Common

    No documentation available.

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

    ihaskell IHaskellPrelude

    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*

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

    incipit-base Incipit.Base

    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"]

  7. noteSequence :: forall (m :: Type -> Type) msg . RelativeTicks m -> Bool -> [Bool -> msg] -> Bundle m msg

    reactive-midyim Reactive.Banana.MIDI.Process

    No documentation available.

  8. C_Sequence :: forall (o :: Type -> Type) a1 . Elems o '[a1] -> Classifier_ o (Seq a1)

    recover-rtti Debug.RecoverRTTI

    No documentation available.

  9. oddSequence1 :: IO Proof

    sbv Documentation.SBV.Examples.KnuckleDragger.StrongInduction

    Prove that the sequence 1, 3, S_{k-2} + 2 S_{k-1} is always odd. We have: 

    >>> oddSequence1
Inductive lemma (strong): oddSequence
Step: Measure is non-negative         Q.E.D.
Step: 1 (3 way case split)
Step: 1.1                           Q.E.D.
Step: 1.2                           Q.E.D.
Step: 1.3.1                         Q.E.D.
Step: 1.3.2                         Q.E.D.
Step: 1.3.3                         Q.E.D.
Step: 1.Completeness                Q.E.D.
Result:                               Q.E.D.
[Proven] oddSequence

  10. oddSequence2 :: IO Proof

    sbv Documentation.SBV.Examples.KnuckleDragger.StrongInduction

    Prove that the sequence 1, 3, 2 S_{k-1} - S_{k-2} generates sequence of odd numbers. We have: 

    >>> oddSequence2
Lemma: oddSequence_0                              Q.E.D.
Lemma: oddSequence_1                              Q.E.D.
Inductive lemma (strong): oddSequence_sNp2
Step: Measure is non-negative                   Q.E.D.
Step: 1                                         Q.E.D.
Step: 2                                         Q.E.D.
Step: 3 (simplify)                              Q.E.D.
Step: 4                                         Q.E.D.
Step: 5 (simplify)                              Q.E.D.
Step: 6                                         Q.E.D.
Result:                                         Q.E.D.
Lemma: oddSequence2
Step: 1 (3 way case split)
Step: 1.1                                     Q.E.D.
Step: 1.2                                     Q.E.D.
Step: 1.3.1                                   Q.E.D.
Step: 1.3.2                                   Q.E.D.
Step: 1.Completeness                          Q.E.D.
Result:                                         Q.E.D.
[Proven] oddSequence2

Page 70 of many | Previous | Next