split
Combinator library for splitting lists.
| Version on this page: | 0.2.4 |
| LTS Haskell 23.21: | 0.2.5 |
| Stackage Nightly 2025-05-02: | 0.2.5 |
| Latest on Hackage: | 0.2.5 |
Maintained by [email protected]
This version can be pinned in stack with:
split-0.2.4@sha256:e9f326f46b3daf2c1432e162c047388729e1ca746e0ca5c271b1d1b93c57f1e4,2614Module documentation for 0.2.4
- Data
- Data.List
Depends on 1 package(full list with versions):
Used by 61 packages in lts-22.2(full list with versions):
Agda, amqp, ansi-terminal-game, api-field-json-th, async-extra, boxes, cabal2nix, cabal-clean, call-alloy, casing, data-serializer, dbus, debian-build, diagrams-builder, diagrams-cairo, diagrams-contrib, diagrams-html5, diagrams-postscript, diagrams-svg, diversity, fasta, fedora-haskell-tools, git-annex, gpolyline, handwriting, hashids, haskoin-core, hindent, hledger, hledger-stockquotes, hmatrix, hOpenPGP, hxt-css, ihaskell, lambdabot-core, lambdabot-irc-plugins, language-docker, matplotlib, mono-traversable, openexr-write, and many more
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.