split

Combinator library for splitting lists.

Version on this page:	0.2.3.1
LTS Haskell 24.49:	0.2.5
Stackage Nightly 2026-07-07:	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.3.1@sha256:8abfa250e28222cf7212da16f47060000c931ceacd80db18f950cb2917acfe73,2520

Module documentation for 0.2.3.1

Data
- Data.List
  - Data.List.Split
    - Data.List.Split.Internals

Depends on 1 package(full list with versions):

base

Used by 18 packages in nightly-2016-05-27(full list with versions):

amqp, boxes, debian-build, Genbank, gl, handwriting, hbayes, hxt-css, packdeps, prednote, protobuf-simple, redis-resp, rest-core, rest-gen, servant-server, shake-language-c, web-routes, yesod-bin

A collection of various methods for splitting lists into parts, akin to the "split" function found in several mainstream languages. Here is its tale:

Once upon a time the standard Data.List module held no function for splitting a list into parts according to a delimiter. Many a brave lambda-knight strove to add such a function, but their striving was in vain, for Lo, the Supreme Council fell to bickering amongst themselves what was to be the essential nature of the One True Function which could cleave a list in twain (or thrain, or any required number of parts).

And thus came to pass the split package, comprising divers functions for splitting a list asunder, each according to its nature. And the Supreme Council had no longer any grounds for argument, for the favored method of each was contained therein.

To get started, see the Data.List.Split module.