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.

Exact lookup

1. isSubsequenceOf :: Eq a => Slist a -> Slist a -> Bool

   slist	Slist

   Takes two slists and returns True if all the elements of the first slist occur, in order, in the second. The elements do not have to occur consecutively. isSubsequenceOf x y is equivalent to elem x (subsequences y).

   >>> isSubsequenceOf (slist "Hll") (slist "Hello World!")
   True
   
   >>> isSubsequenceOf (slist "") (slist "Hello World!")
   True
   
   >>> isSubsequenceOf (slist "Hallo") (slist "Hello World!")
   False
   

   Note: this function hangs if the second slist is infinite.

   >> isSuffixOf anything (infiniteSlist [1..])
   <hangs>
   

   Use safeIsSuffixOf instead.

2. safeIsSubsequenceOf :: Eq a => Slist a -> Slist a -> Bool

   slist	Slist

   Similar to isSubsequenceOf, but never hangs on infinite lists and returns False in that case.

   >>> safeIsSubsequenceOf (infiniteSlist [1..]) (infiniteSlist [1..])
   False
   
   >>> safeIsSubsequenceOf (infiniteSlist [0..]) (infiniteSlist [1..])
   False
   

3. 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}
   

4. SQLITE_CORRUPT_SEQUENCE :: ErrorFlag

   squeather	Squeather

   No documentation available.

5. SQLITE_CORRUPT_SEQUENCE :: ErrorFlag

   squeather	Squeather.Internal.Types

   No documentation available.

6. parSequence :: MonadAsync m => (Config -> Config) -> Stream m (m a) -> Stream m a

   streamly	Streamly.Data.Stream.Prelude

   Definition:

   >>> parSequence modifier = Stream.parMapM modifier id
   

   Useful idioms:

   >>> parFromListM = Stream.parSequence id . Stream.fromList
   
   >>> parFromFoldableM = Stream.parSequence id . StreamK.toStream . StreamK.fromFoldable
   

7. foldSequence :: forall t (m :: Type -> Type) a b . t m (Fold m a b) -> t m a -> t m b

   streamly	Streamly.Internal.Data.Stream.IsStream

   Apply a stream of folds to an input stream and emit the results in the output stream. Unimplemented

8. isSubsequenceOf :: (Eq a, IsStream t, Monad m) => t m a -> t m a -> m Bool

   streamly	Streamly.Internal.Data.Stream.IsStream

   Returns True if all the elements of the first stream occur, in order, in the second stream. The elements do not have to occur consecutively. A stream is a subsequence of itself.

   >>> Stream.isSubsequenceOf (Stream.fromList "hlo") (Stream.fromList "hello" :: SerialT IO Char)
   True
   

9. parseSequence :: forall t (m :: Type -> Type) a b . t m (Parser a m b) -> t m a -> t m b

   streamly	Streamly.Internal.Data.Stream.IsStream

   Apply a stream of parsers to an input stream and emit the results in the output stream. Unimplemented

10. parSequence :: MonadAsync m => (Config -> Config) -> Stream m (m a) -> Stream m a

    streamly	Streamly.Internal.Data.Stream.Prelude

    Definition:

    >>> parSequence modifier = Stream.parMapM modifier id
    

    Useful idioms:

    >>> parFromListM = Stream.parSequence id . Stream.fromList
    
    >>> parFromFoldableM = Stream.parSequence id . StreamK.toStream . StreamK.fromFoldable
    

Page 88 of many | Previous | Next