split

Combinator library for splitting lists.

LTS Haskell 22.30:0.2.5
Stackage Nightly 2024-07-22:0.2.5
Latest on Hackage:0.2.5

See all snapshots split appears in

BSD-3-Clause licensed by Brent Yorgey
Maintained by [email protected]
This version can be pinned in stack with:split-0.2.5@sha256:5bc1ae848bfded3087ea3e568908f1b75f56ecde6f02df3fad1a138dd5c783d5,2625

Module documentation for 0.2.5

Build Status split release on Hackage

List splitting

Data.List.Split provides a wide range of strategies and a unified combinator framework for splitting lists with respect to some sort of delimiter. See https://hackage.haskell.org/package/split/docs/Data-List-Split.html to get started using it.

Dependencies

There are no dependencies other than the base package. Data.List.Split is currently tested with versions of GHC from 7.0 up through 9.6. It is completely Haskell2010 (probably also Haskell98) compliant, so it probably builds with other compilers as well.

The tests in Properties.hs depend on QuickCheck >= 2.4, but you don’t need it in order to build the library itself, only to run the tests.