A collection of various methods for splittinglists into parts, akin to the "split" functionfound in several mainstream languages. Here isits tale:
Once upon a time the standardData.List moduleheld no function for splitting a list into partsaccording to a delimiter. Many a bravelambda-knight strove to add such a function, buttheir striving was in vain, for Lo, the SupremeCouncil fell to bickering amongst themselves whatwas to be the essential nature of the One TrueFunction which could cleave a list in twain (orthrain, or any required number of parts).
And thus came to pass the split package,comprising divers functions for splitting a listasunder, each according to its nature. And theSupreme Council had no longer any grounds forargument, for the favored method of each wascontained therein.
To get started, see theData.List.Split module.
For package maintainers and hackage trustees
Candidates
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,0.2.4,0.2.5 |
---|---|
Change log | CHANGES |
Dependencies | base (<4.10) [details] |
Tested with | ghc ==7.0.4, ghc ==7.2.1, ghc >=7.4 && <7.5, ghc ==7.6.1, ghc ==7.8.3, ghc ==7.10.3 |
License | BSD-3-Clause |
Copyright | (c) Brent Yorgey, Louis Wasserman 2008-2012 |
Author | Brent Yorgey |
Maintainer | byorgey@gmail.com |
Category | List |
Bug tracker | http://hub.darcs.net/byorgey/split/issues |
Source repo | head: darcs gethttp://hub.darcs.net/byorgey/split |
Uploaded | byBrentYorgey at2016-01-12T15:34:56Z |
Distributions | Arch:0.2.5, Debian:0.2.3.4, Fedora:0.2.3.5, FreeBSD:0.2.2, LTSHaskell:0.2.5, NixOS:0.2.5, Stackage:0.2.5, openSUSE:0.2.5 |
Reverse Dependencies | 542 direct, 7822 indirect [details] |
Downloads | 238281 total (59 in the last 30 days) |
Rating | 2.25 (votes: 2)[estimated byBayesian average] |
Your Rating |
|
Status | Docs available[build log] Last success reported on 2016-11-28[all 1 reports] |
Data.List.Split provides a wide range of strategies and a unifiedcombinator framework for splitting lists with respect to some sort ofdelimiter.------------------------------------------------------------------------Dependencies: There are no dependencies other than the base package. Data.List.Split has been tested with versions of GHC from 6.8.3 up through 7.6.1. It is completely Haskell2010 (probably also Haskell98) compliant, so it probably builds with other compilers as well. The Properties.hs file depends on QuickCheck >= 2.4, but you don't need it in order to build the library itself, only to run the tests.Build with Cabal: cabal installBuilding Haddock documentation (recommended): cabal haddock Once the documentation has been built, you can access it by pointing your browser to dist/doc/html/split/index.html.Running the tests: cabal configure --enable-tests && cabal build && cabal test