Hoogle Search

Within LTS Haskell 24.2 (ghc-9.10.2)

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

Exact lookup

1. subsequences :: Infinite a -> Infinite [a]

   extra-data-yj	Data.List.Infinite

   No documentation available.

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

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

4. subsequences :: Slist a -> Slist (Slist a)

   slist	Slist

   O(2 ^ n). Returns the list of all subsequences of the argument.

   >>> subsequences mempty
   Slist {sList = [Slist {sList = [], sSize = Size 0}], sSize = Size 1}
   
   >>> subsequences $ slist "ab"
   Slist {sList = [Slist {sList = "", sSize = Size 0},Slist {sList = "a", sSize = Size 1},Slist {sList = "b", sSize = Size 1},Slist {sList = "ab", sSize = Size 2}], sSize = Size 4}
   
   >>> take 4 $ subsequences $ infiniteSlist [1..]
   Slist {sList = [Slist {sList = [], sSize = Size 0},Slist {sList = [1], sSize = Size 1},Slist {sList = [2], sSize = Size 1},Slist {sList = [1,2], sSize = Size 2}], sSize = Size 4}
   

5. subsequences :: IsSequence seq => seq -> [seq]

   classy-prelude-yesod	ClassyPrelude.Yesod

   subsequences returns a list of all subsequences of the argument.

   > subsequences "abc"
   ["","a","b","ab","c","ac","bc","abc"]
   

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

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

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

9. type family Subsequences (a1 :: [a]) :: [[a]]

   singletons-base	Data.List.Singletons

   No documentation available.

10. subsequences1 :: Infinite a -> Infinite (NonEmpty a)

    infinite-list	Data.List.Infinite

    Generate an infinite list of all non-empty finite subsequences of the argument.

    >>> take 7 (subsequences1 (0...))
    [0 :| [],1 :| [],0 :| [1],2 :| [],0 :| [2],1 :| [2],0 :| [1,2]]
    

Page 2 of many | Previous | Next