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.

Exact lookup

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

   relational-schemas	Database.Custom.SQLite3

   Unsafely specify sequence table.

2. BadSequence :: Response

   smtp-mail	Network.Mail.SMTP.Types

   No documentation available.

3. bisequenceA :: (Bitraversable t, Applicative f) => t (f a) (f b) -> f (t a b)

   verset	Verset

   Alias for bisequence.

4. bisequenceA_ :: (Bifoldable t, Applicative f) => t (f a) (f b) -> f ()

   verset	Verset

   Alias for bisequence_.

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

   verset	Verset

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

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

   xmonad-contrib	XMonad.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*
   

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

   xmonad-contrib	XMonad.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"]
   

8. parseKeySequence :: forall (l :: Type -> Type) . XConfig l -> Parser [(KeyMask, KeySym)]

   xmonad-contrib	XMonad.Util.EZConfig

   Parse a sequence of key combinations separated by spaces, e.g. "M-c x C-S-2" (mod+c, x, ctrl+shift+2).

9. readKeySequence :: forall (l :: Type -> Type) . XConfig l -> String -> Maybe (NonEmpty (KeyMask, KeySym))

   xmonad-contrib	XMonad.Util.EZConfig

   Parse a sequence of keys, returning Nothing if there is a parse failure (no parse, or ambiguous parse).

Page 96 of many | Previous | Next