Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

Exact lookup

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

   relational-query	Database.Relational.Arrow

   No documentation available.

2. unsafeSpecifySequence :: TableDerivable s => (s -> i) -> Pi s i -> Sequence s i

   relational-query	Database.Relational.Arrow

   Unsafely specify sequence table.

3. boundSequence :: SeqBinding r s i -> Sequence s i

   relational-query	Database.Relational.Sequence

   sequence table record

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

   relational-query	Database.Relational.Sequence

   No documentation available.

5. unsafeSpecifySequence :: TableDerivable s => (s -> i) -> Pi s i -> Sequence s i

   relational-query	Database.Relational.Sequence

   Unsafely specify sequence table.

6. subConsequence :: Thy -> [Class Expr] -> Expr -> Expr -> Expr -> Bool

   speculate	Test.Speculate.Engine

   Is the equation a consequence of substitution? > subConsequence (x == y) (x + y) (x + x) == True > subConsequence (x <= y) (x + y) (x + x) == False -- not sub > subConsequence (abs x == abs y) (abs x) (abs y) == True > subConsequence (abs x == 1) (x + abs x) (20) == False (artificial)

7. transConsequence :: Shy -> Equation -> Bool

   speculate	Test.Speculate.SemiReason

   No documentation available.

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

   LambdaHack	Game.LambdaHack.Core.Prelude

   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*
   

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

   LambdaHack	Game.LambdaHack.Core.Prelude

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

10. dbStateCmdSequence :: DatabaseState be -> !Seq (MigrationCommand be)

    beam-migrate	Database.Beam.Migrate.Actions

    The current sequence of commands we've committed to in this state

Page 66 of many | Previous | Next