split: Combinator library for splitting lists.
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.
[Skip to Readme]
|Versions [RSS]||0.1, 0.1.1, 0.1.2, 0.1.2.1, 0.1.2.2, 0.1.2.3, 0.1.3, 0.1.4, 0.1.4.1, 0.1.4.2, 0.1.4.3, 0.2.0.0, 0.2.1.0, 0.2.1.1, 0.2.1.2, 0.2.1.3, 0.2.2, 0.2.3, 0.2.3.1, 0.2.3.2, 0.2.3.3, 0.2.3.4, 0.2.3.5|
|Dependencies||base (<4.7) [details]|
|Copyright||(c) Brent Yorgey, Louis Wasserman 2008-2012|
|Source repo||head: darcs get http://hub.darcs.net/byorgey/split|
|Uploaded||by BrentYorgey at 2012-09-24T16:46:03Z|
|Distributions||Arch:0.2.3.5, Debian:0.2.3.4, Fedora:0.2.3.4, FreeBSD:0.2.2, LTSHaskell:0.2.3.5, NixOS:0.2.3.5, Stackage:0.2.3.5, openSUSE:0.2.3.4|
|Downloads||226448 total (319 in the last 30 days)|
|Rating||2.25 (votes: 2) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]