split – new releases on Hackagehttps://hackage.haskell.org/package/splitNew releases of package 'split' on Hackage.http://www.rssboard.org/rss-specificationenadmin@hackage.haskell.orgadmin@hackage.haskell.orgThu, 11 Aug 2022 16:02:17 UTCThu, 11 Aug 2022 16:02:17 UTCrss-feedsplit-0.2.3.5 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.2.3.5https://hackage.haskell.org/package/split-0.2.3.5Thu, 11 Aug 2022 16:02:17 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2022-08-11T16:02:17Z</dd><dt>Maintainer</dt><dd>byorgey@gmail.com</dd></dl><hr /><pre>* 0.2.3.5 (11 August 2022)
- Change base upper bound to < 5.
- Test with GHC 9.2 and 9.4.
* 0.2.3.4-r1 (22 February 2021)
- Allow base-4.15 for GHC-9.0
* 0.2.3.4 (22 February 2020)
- Allow base-4.14 for GHC-8.10
* 0.2.3.3-r2 (19 August 2019)
- Allow base-4.13 for GHC-8.8
* 0.2.3.3-r1 (2 August 2018)
- Allow base-4.12 for GHC-8.6
* 0.2.3.3 (23 Jan 2018)
- Update for GHC-8.4, test with GHC 7.0-8.4
* 0.2.3.2 (15 May 2017)
- Move to github.
* 0.2.3.1 (2 May 2016)
- Fix a test case which was causing occasional spurious test suite
failures due to too many discarded tests. Thanks to Doug
Beardsley and Peter Simons for reporting the issue.
* 0.2.3 (12 January 2016)
- New function 'divvy' (with associated tests) from Tim Washington.
* 0.2.2r2 (7 Jan 2016)
- allow base-4.9
* 0.2.2r1 (12 Dec 2014)
- allow base-4.8
* 0.2.2 (14 April 2013)
- Add 'dropInnerBlanks' combinator for dropping blank chunks between
consecutive delimiters while still keeping the delimiters separate.
* 0.2.1.3 (28 March 2013)
- bump upper bound to allow base-4.7
* 0.2.1.2 (28 January 2013)
- Patch from Daniel Wagner to make splitting lazier when using
keepDelimsR. Previously nothing was output until encountering a
delimiter; now it can start outputting a Text chunk before
reaching a delimiter.
* 0.2.1.1 (24 September 2012)
- Update this CHANGES file with details from the past two releases.
* 0.2.1.0 (24 September 2012)
- Go back to generic definition of 'build' (reverses change
introduced in 0.1.4.3), for simplicity and Haskell2010 compliance.
* 0.2.0.0 (21 August 2012)
- test with GHC 7.6.1 and bump base dependency to allow base-4.6
- deprecate synonyms: sepBy, sepByOneOf, unintercalate, chunk
- rename splitEvery to chunksOf
- unify Delimiter definition, and get rid of GADTs extension
* 0.1.4.3 (7 June 2012)
- Import 'build' function from GHC.Exts instead of defining it by
hand, which can lead to some speedups (since GHC has special
rewriting rules for the version in GHC.Exts). Of course this ties
it to GHC; if you want to build split under some other compiler,
let me know and I can add some CPP directives to define 'build'
conditionally.
- Remove unnecessary Rank2Types extension.
* 0.1.4.2 (21 December 2011)
- Bump version upper bound for base and Test with GHC 7.4.1rc1
* 0.1.4.1 (3 August 2011)
- Bump version upper bound for base and test with GHC 7.2.0rc1.
* 0.1.4
- Add 'splitPlacesBlanks' function from Daniel Wagner; like
'splitPlaces' but pads the output with blank lists to match the
length of the input list of places to split.
* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.</pre>BrentYorgeysplit-0.2.3.4 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.2.3.4https://hackage.haskell.org/package/split-0.2.3.4Sat, 22 Feb 2020 21:57:25 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2020-02-22T21:57:25Z</dd><dt>Maintainer</dt><dd>byorgey@gmail.com</dd></dl><hr /><pre>* 0.2.3.4 (22 February 2020)
- Allow base-4.14 for GHC-8.10
* 0.2.3.3-r2 (19 August 2019)
- Allow base-4.13 for GHC-8.8
* 0.2.3.3-r1 (2 August 2018)
- Allow base-4.12 for GHC-8.6
* 0.2.3.3 (23 Jan 2018)
- Update for GHC-8.4, test with GHC 7.0-8.4
* 0.2.3.2 (15 May 2017)
- Move to github.
* 0.2.3.1 (2 May 2016)
- Fix a test case which was causing occasional spurious test suite
failures due to too many discarded tests. Thanks to Doug
Beardsley and Peter Simons for reporting the issue.
* 0.2.3 (12 January 2016)
- New function 'divvy' (with associated tests) from Tim Washington.
* 0.2.2r2 (7 Jan 2016)
- allow base-4.9
* 0.2.2r1 (12 Dec 2014)
- allow base-4.8
* 0.2.2 (14 April 2013)
- Add 'dropInnerBlanks' combinator for dropping blank chunks between
consecutive delimiters while still keeping the delimiters separate.
* 0.2.1.3 (28 March 2013)
- bump upper bound to allow base-4.7
* 0.2.1.2 (28 January 2013)
- Patch from Daniel Wagner to make splitting lazier when using
keepDelimsR. Previously nothing was output until encountering a
delimiter; now it can start outputting a Text chunk before
reaching a delimiter.
* 0.2.1.1 (24 September 2012)
- Update this CHANGES file with details from the past two releases.
* 0.2.1.0 (24 September 2012)
- Go back to generic definition of 'build' (reverses change
introduced in 0.1.4.3), for simplicity and Haskell2010 compliance.
* 0.2.0.0 (21 August 2012)
- test with GHC 7.6.1 and bump base dependency to allow base-4.6
- deprecate synonyms: sepBy, sepByOneOf, unintercalate, chunk
- rename splitEvery to chunksOf
- unify Delimiter definition, and get rid of GADTs extension
* 0.1.4.3 (7 June 2012)
- Import 'build' function from GHC.Exts instead of defining it by
hand, which can lead to some speedups (since GHC has special
rewriting rules for the version in GHC.Exts). Of course this ties
it to GHC; if you want to build split under some other compiler,
let me know and I can add some CPP directives to define 'build'
conditionally.
- Remove unnecessary Rank2Types extension.
* 0.1.4.2 (21 December 2011)
- Bump version upper bound for base and Test with GHC 7.4.1rc1
* 0.1.4.1 (3 August 2011)
- Bump version upper bound for base and test with GHC 7.2.0rc1.
* 0.1.4
- Add 'splitPlacesBlanks' function from Daniel Wagner; like
'splitPlaces' but pads the output with blank lists to match the
length of the input list of places to split.
* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.</pre>BrentYorgeysplit-0.2.3.3 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.2.3.3https://hackage.haskell.org/package/split-0.2.3.3Wed, 24 Jan 2018 03:00:30 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2018-01-24T03:00:30Z</dd><dt>Maintainer</dt><dd>byorgey@gmail.com</dd></dl><hr /><pre>* 0.2.3.3 (23 Jan 2018)
- Update for GHC-8.4, test with GHC 7.0-8.4
* 0.2.3.2 (15 May 2017)
- Move to github.
* 0.2.3.1 (2 May 2016)
- Fix a test case which was causing occasional spurious test suite
failures due to too many discarded tests. Thanks to Doug
Beardsley and Peter Simons for reporting the issue.
* 0.2.3 (12 January 2016)
- New function 'divvy' (with associated tests) from Tim Washington.
* 0.2.2r2 (7 Jan 2016)
- allow base-4.9
* 0.2.2r1 (12 Dec 2014)
- allow base-4.8
* 0.2.2 (14 April 2013)
- Add 'dropInnerBlanks' combinator for dropping blank chunks between
consecutive delimiters while still keeping the delimiters separate.
* 0.2.1.3 (28 March 2013)
- bump upper bound to allow base-4.7
* 0.2.1.2 (28 January 2013)
- Patch from Daniel Wagner to make splitting lazier when using
keepDelimsR. Previously nothing was output until encountering a
delimiter; now it can start outputting a Text chunk before
reaching a delimiter.
* 0.2.1.1 (24 September 2012)
- Update this CHANGES file with details from the past two releases.
* 0.2.1.0 (24 September 2012)
- Go back to generic definition of 'build' (reverses change
introduced in 0.1.4.3), for simplicity and Haskell2010 compliance.
* 0.2.0.0 (21 August 2012)
- test with GHC 7.6.1 and bump base dependency to allow base-4.6
- deprecate synonyms: sepBy, sepByOneOf, unintercalate, chunk
- rename splitEvery to chunksOf
- unify Delimiter definition, and get rid of GADTs extension
* 0.1.4.3 (7 June 2012)
- Import 'build' function from GHC.Exts instead of defining it by
hand, which can lead to some speedups (since GHC has special
rewriting rules for the version in GHC.Exts). Of course this ties
it to GHC; if you want to build split under some other compiler,
let me know and I can add some CPP directives to define 'build'
conditionally.
- Remove unnecessary Rank2Types extension.
* 0.1.4.2 (21 December 2011)
- Bump version upper bound for base and Test with GHC 7.4.1rc1
* 0.1.4.1 (3 August 2011)
- Bump version upper bound for base and test with GHC 7.2.0rc1.
* 0.1.4
- Add 'splitPlacesBlanks' function from Daniel Wagner; like
'splitPlaces' but pads the output with blank lists to match the
length of the input list of places to split.
* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.</pre>BrentYorgeysplit-0.2.3.2 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.2.3.2https://hackage.haskell.org/package/split-0.2.3.2Mon, 15 May 2017 20:01:11 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2017-05-15T20:01:11Z</dd><dt>Maintainer</dt><dd>byorgey@gmail.com</dd></dl><hr /><pre>* 0.2.3.2 (15 May 2017)
- Move to github.
* 0.2.3.1 (2 May 2016)
- Fix a test case which was causing occasional spurious test suite
failures due to too many discarded tests. Thanks to Doug
Beardsley and Peter Simons for reporting the issue.
* 0.2.3 (12 January 2016)
- New function 'divvy' (with associated tests) from Tim Washington.
* 0.2.2r2 (7 Jan 2016)
- allow base-4.9
* 0.2.2r1 (12 Dec 2014)
- allow base-4.8
* 0.2.2 (14 April 2013)
- Add 'dropInnerBlanks' combinator for dropping blank chunks between
consecutive delimiters while still keeping the delimiters separate.
* 0.2.1.3 (28 March 2013)
- bump upper bound to allow base-4.7
* 0.2.1.2 (28 January 2013)
- Patch from Daniel Wagner to make splitting lazier when using
keepDelimsR. Previously nothing was output until encountering a
delimiter; now it can start outputting a Text chunk before
reaching a delimiter.
* 0.2.1.1 (24 September 2012)
- Update this CHANGES file with details from the past two releases.
* 0.2.1.0 (24 September 2012)
- Go back to generic definition of 'build' (reverses change
introduced in 0.1.4.3), for simplicity and Haskell2010 compliance.
* 0.2.0.0 (21 August 2012)
- test with GHC 7.6.1 and bump base dependency to allow base-4.6
- deprecate synonyms: sepBy, sepByOneOf, unintercalate, chunk
- rename splitEvery to chunksOf
- unify Delimiter definition, and get rid of GADTs extension
* 0.1.4.3 (7 June 2012)
- Import 'build' function from GHC.Exts instead of defining it by
hand, which can lead to some speedups (since GHC has special
rewriting rules for the version in GHC.Exts). Of course this ties
it to GHC; if you want to build split under some other compiler,
let me know and I can add some CPP directives to define 'build'
conditionally.
- Remove unnecessary Rank2Types extension.
* 0.1.4.2 (21 December 2011)
- Bump version upper bound for base and Test with GHC 7.4.1rc1
* 0.1.4.1 (3 August 2011)
- Bump version upper bound for base and test with GHC 7.2.0rc1.
* 0.1.4
- Add 'splitPlacesBlanks' function from Daniel Wagner; like
'splitPlaces' but pads the output with blank lists to match the
length of the input list of places to split.
* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.</pre>BrentYorgeysplit-0.2.3.1 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.2.3.1https://hackage.haskell.org/package/split-0.2.3.1Tue, 3 May 2016 02:13:54 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2016-05-03T02:13:54Z</dd><dt>Maintainer</dt><dd>byorgey@gmail.com</dd></dl><hr /><pre>* 0.2.3.1 (2 May 2016)
- Fix a test case which was causing occasional spurious test suite
failures due to too many discarded tests. Thanks to Doug
Beardsley and Peter Simons for reporting the issue.
* 0.2.3 (12 January 2016)
- New function 'divvy' (with associated tests) from Tim Washington.
* 0.2.2r2 (7 Jan 2016)
- allow base-4.9
* 0.2.2r1 (12 Dec 2014)
- allow base-4.8
* 0.2.2 (14 April 2013)
- Add 'dropInnerBlanks' combinator for dropping blank chunks between
consecutive delimiters while still keeping the delimiters separate.
* 0.2.1.3 (28 March 2013)
- bump upper bound to allow base-4.7
* 0.2.1.2 (28 January 2013)
- Patch from Daniel Wagner to make splitting lazier when using
keepDelimsR. Previously nothing was output until encountering a
delimiter; now it can start outputting a Text chunk before
reaching a delimiter.
* 0.2.1.1 (24 September 2012)
- Update this CHANGES file with details from the past two releases.
* 0.2.1.0 (24 September 2012)
- Go back to generic definition of 'build' (reverses change
introduced in 0.1.4.3), for simplicity and Haskell2010 compliance.
* 0.2.0.0 (21 August 2012)
- test with GHC 7.6.1 and bump base dependency to allow base-4.6
- deprecate synonyms: sepBy, sepByOneOf, unintercalate, chunk
- rename splitEvery to chunksOf
- unify Delimiter definition, and get rid of GADTs extension
* 0.1.4.3 (7 June 2012)
- Import 'build' function from GHC.Exts instead of defining it by
hand, which can lead to some speedups (since GHC has special
rewriting rules for the version in GHC.Exts). Of course this ties
it to GHC; if you want to build split under some other compiler,
let me know and I can add some CPP directives to define 'build'
conditionally.
- Remove unnecessary Rank2Types extension.
* 0.1.4.2 (21 December 2011)
- Bump version upper bound for base and Test with GHC 7.4.1rc1
* 0.1.4.1 (3 August 2011)
- Bump version upper bound for base and test with GHC 7.2.0rc1.
* 0.1.4
- Add 'splitPlacesBlanks' function from Daniel Wagner; like
'splitPlaces' but pads the output with blank lists to match the
length of the input list of places to split.
* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.</pre>BrentYorgeysplit-0.2.3 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.2.3https://hackage.haskell.org/package/split-0.2.3Tue, 12 Jan 2016 15:34:56 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2016-01-12T15:34:56Z</dd><dt>Maintainer</dt><dd>byorgey@gmail.com</dd></dl><hr /><pre>* 0.2.3 (12 January 2016)
- New function 'divvy' (with associated tests) from Tim Washington.
* 0.2.2r2 (7 Jan 2016)
- allow base-4.9
* 0.2.2r1 (12 Dec 2014)
- allow base-4.8
* 0.2.2 (14 April 2013)
- Add 'dropInnerBlanks' combinator for dropping blank chunks between
consecutive delimiters while still keeping the delimiters separate.
* 0.2.1.3 (28 March 2013)
- bump upper bound to allow base-4.7
* 0.2.1.2 (28 January 2013)
- Patch from Daniel Wagner to make splitting lazier when using
keepDelimsR. Previously nothing was output until encountering a
delimiter; now it can start outputting a Text chunk before
reaching a delimiter.
* 0.2.1.1 (24 September 2012)
- Update this CHANGES file with details from the past two releases.
* 0.2.1.0 (24 September 2012)
- Go back to generic definition of 'build' (reverses change
introduced in 0.1.4.3), for simplicity and Haskell2010 compliance.
* 0.2.0.0 (21 August 2012)
- test with GHC 7.6.1 and bump base dependency to allow base-4.6
- deprecate synonyms: sepBy, sepByOneOf, unintercalate, chunk
- rename splitEvery to chunksOf
- unify Delimiter definition, and get rid of GADTs extension
* 0.1.4.3 (7 June 2012)
- Import 'build' function from GHC.Exts instead of defining it by
hand, which can lead to some speedups (since GHC has special
rewriting rules for the version in GHC.Exts). Of course this ties
it to GHC; if you want to build split under some other compiler,
let me know and I can add some CPP directives to define 'build'
conditionally.
- Remove unnecessary Rank2Types extension.
* 0.1.4.2 (21 December 2011)
- Bump version upper bound for base and Test with GHC 7.4.1rc1
* 0.1.4.1 (3 August 2011)
- Bump version upper bound for base and test with GHC 7.2.0rc1.
* 0.1.4
- Add 'splitPlacesBlanks' function from Daniel Wagner; like
'splitPlaces' but pads the output with blank lists to match the
length of the input list of places to split.
* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.</pre>BrentYorgeysplit-0.2.2 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.2.2https://hackage.haskell.org/package/split-0.2.2Sun, 14 Apr 2013 18:47:23 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2013-04-14T18:47:23Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr /><pre>* 0.2.2 (14 April 2013)
- Add 'dropInnerBlanks' combinator for dropping blank chunks between
consecutive delimiters while still keeping the delimiters separate.
* 0.2.1.3 (28 March 2013)
- bump upper bound to allow base-4.7
* 0.2.1.2 (28 January 2013)
- Patch from Daniel Wagner to make splitting lazier when using
keepDelimsR. Previously nothing was output until encountering a
delimiter; now it can start outputting a Text chunk before
reaching a delimiter.
* 0.2.1.1 (24 September 2012)
- Update this CHANGES file with details from the past two releases.
* 0.2.1.0 (24 September 2012)
- Go back to generic definition of 'build' (reverses change
introduced in 0.1.4.3), for simplicity and Haskell2010 compliance.
* 0.2.0.0 (21 August 2012)
- test with GHC 7.6.1 and bump base dependency to allow base-4.6
- deprecate synonyms: sepBy, sepByOneOf, unintercalate, chunk
- rename splitEvery to chunksOf
- unify Delimiter definition, and get rid of GADTs extension
* 0.1.4.3 (7 June 2012)
- Import 'build' function from GHC.Exts instead of defining it by
hand, which can lead to some speedups (since GHC has special
rewriting rules for the version in GHC.Exts). Of course this ties
it to GHC; if you want to build split under some other compiler,
let me know and I can add some CPP directives to define 'build'
conditionally.
- Remove unnecessary Rank2Types extension.
* 0.1.4.2 (21 December 2011)
- Bump version upper bound for base and Test with GHC 7.4.1rc1
* 0.1.4.1 (3 August 2011)
- Bump version upper bound for base and test with GHC 7.2.0rc1.
* 0.1.4
- Add 'splitPlacesBlanks' function from Daniel Wagner; like
'splitPlaces' but pads the output with blank lists to match the
length of the input list of places to split.
* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.</pre>BrentYorgeysplit-0.2.1.3 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.2.1.3https://hackage.haskell.org/package/split-0.2.1.3Thu, 28 Mar 2013 12:31:30 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2013-03-28T12:31:30Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr /><pre>* 0.2.1.2 (28 January 2013)
- Patch from Daniel Wagner to make splitting lazier when using
keepDelimsR. Previously nothing was output until encountering a
delimiter; now it can start outputting a Text chunk before
reaching a delimiter.
* 0.2.1.1 (24 September 2012)
- Update this CHANGES file with details from the past two releases.
* 0.2.1.0 (24 September 2012)
- Go back to generic definition of 'build' (reverses change
introduced in 0.1.4.3), for simplicity and Haskell2010 compliance.
* 0.2.0.0 (21 August 2012)
- test with GHC 7.6.1 and bump base dependency to allow base-4.6
- deprecate synonyms: sepBy, sepByOneOf, unintercalate, chunk
- rename splitEvery to chunksOf
- unify Delimiter definition, and get rid of GADTs extension
* 0.1.4.3 (7 June 2012)
- Import 'build' function from GHC.Exts instead of defining it by
hand, which can lead to some speedups (since GHC has special
rewriting rules for the version in GHC.Exts). Of course this ties
it to GHC; if you want to build split under some other compiler,
let me know and I can add some CPP directives to define 'build'
conditionally.
- Remove unnecessary Rank2Types extension.
* 0.1.4.2 (21 December 2011)
- Bump version upper bound for base and Test with GHC 7.4.1rc1
* 0.1.4.1 (3 August 2011)
- Bump version upper bound for base and test with GHC 7.2.0rc1.
* 0.1.4
- Add 'splitPlacesBlanks' function from Daniel Wagner; like
'splitPlaces' but pads the output with blank lists to match the
length of the input list of places to split.
* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.</pre>BrentYorgeysplit-0.2.1.2 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.2.1.2https://hackage.haskell.org/package/split-0.2.1.2Mon, 28 Jan 2013 20:16:10 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2013-01-28T20:16:10Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr /><pre>* 0.2.1.2 (28 January 2013)
- Patch from Daniel Wagner to make splitting lazier when using
keepDelimsR. Previously nothing was output until encountering a
delimiter; now it can start outputting a Text chunk before
reaching a delimiter.
* 0.2.1.1 (24 September 2012)
- Update this CHANGES file with details from the past two releases.
* 0.2.1.0 (24 September 2012)
- Go back to generic definition of 'build' (reverses change
introduced in 0.1.4.3), for simplicity and Haskell2010 compliance.
* 0.2.0.0 (21 August 2012)
- test with GHC 7.6.1 and bump base dependency to allow base-4.6
- deprecate synonyms: sepBy, sepByOneOf, unintercalate, chunk
- rename splitEvery to chunksOf
- unify Delimiter definition, and get rid of GADTs extension
* 0.1.4.3 (7 June 2012)
- Import 'build' function from GHC.Exts instead of defining it by
hand, which can lead to some speedups (since GHC has special
rewriting rules for the version in GHC.Exts). Of course this ties
it to GHC; if you want to build split under some other compiler,
let me know and I can add some CPP directives to define 'build'
conditionally.
- Remove unnecessary Rank2Types extension.
* 0.1.4.2 (21 December 2011)
- Bump version upper bound for base and Test with GHC 7.4.1rc1
* 0.1.4.1 (3 August 2011)
- Bump version upper bound for base and test with GHC 7.2.0rc1.
* 0.1.4
- Add 'splitPlacesBlanks' function from Daniel Wagner; like
'splitPlaces' but pads the output with blank lists to match the
length of the input list of places to split.
* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.</pre>BrentYorgeysplit-0.2.1.1 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.2.1.1https://hackage.haskell.org/package/split-0.2.1.1Mon, 24 Sep 2012 16:56:14 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2012-09-24T16:56:14Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr /><pre>* 0.2.1.1 (24 September 2012)
- Update this CHANGES file with details from the past two releases.
* 0.2.1.0 (24 September 2012)
- Go back to generic definition of 'build' (reverses change
introduced in 0.1.4.3), for simplicity and Haskell2010 compliance.
* 0.2.0.0 (21 August 2012)
- test with GHC 7.6.1 and bump base dependency to allow base-4.6
- deprecate synonyms: sepBy, sepByOneOf, unintercalate, chunk
- rename splitEvery to chunksOf
- unify Delimiter definition, and get rid of GADTs extension
* 0.1.4.3 (7 June 2012)
- Import 'build' function from GHC.Exts instead of defining it by
hand, which can lead to some speedups (since GHC has special
rewriting rules for the version in GHC.Exts). Of course this ties
it to GHC; if you want to build split under some other compiler,
let me know and I can add some CPP directives to define 'build'
conditionally.
- Remove unnecessary Rank2Types extension.
* 0.1.4.2 (21 December 2011)
- Bump version upper bound for base and Test with GHC 7.4.1rc1
* 0.1.4.1 (3 August 2011)
- Bump version upper bound for base and test with GHC 7.2.0rc1.
* 0.1.4
- Add 'splitPlacesBlanks' function from Daniel Wagner; like
'splitPlaces' but pads the output with blank lists to match the
length of the input list of places to split.
* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.</pre>BrentYorgeysplit-0.2.1.0 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.2.1.0https://hackage.haskell.org/package/split-0.2.1.0Mon, 24 Sep 2012 16:46:03 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2012-09-24T16:46:03Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr /><pre>* 0.1.4.3 (7 June 2012)
- Import 'build' function from GHC.Exts instead of defining it by
hand, which can lead to some speedups (since GHC has special
rewriting rules for the version in GHC.Exts). Of course this ties
it to GHC; if you want to build split under some other compiler,
let me know and I can add some CPP directives to define 'build'
conditionally.
- Remove unnecessary Rank2Types extension.
* 0.1.4.2 (21 December 2011)
- Bump version upper bound for base and Test with GHC 7.4.1rc1
* 0.1.4.1 (3 August 2011)
- Bump version upper bound for base and test with GHC 7.2.0rc1.
* 0.1.4
- Add 'splitPlacesBlanks' function from Daniel Wagner; like
'splitPlaces' but pads the output with blank lists to match the
length of the input list of places to split.
* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.</pre>BrentYorgeysplit-0.2.0.0 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.2.0.0https://hackage.haskell.org/package/split-0.2.0.0Tue, 21 Aug 2012 18:14:57 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2012-08-21T18:14:57Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr /><pre>* 0.1.4.3 (7 June 2012)
- Import 'build' function from GHC.Exts instead of defining it by
hand, which can lead to some speedups (since GHC has special
rewriting rules for the version in GHC.Exts). Of course this ties
it to GHC; if you want to build split under some other compiler,
let me know and I can add some CPP directives to define 'build'
conditionally.
- Remove unnecessary Rank2Types extension.
* 0.1.4.2 (21 December 2011)
- Bump version upper bound for base and Test with GHC 7.4.1rc1
* 0.1.4.1 (3 August 2011)
- Bump version upper bound for base and test with GHC 7.2.0rc1.
* 0.1.4
- Add 'splitPlacesBlanks' function from Daniel Wagner; like
'splitPlaces' but pads the output with blank lists to match the
length of the input list of places to split.
* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.</pre>BrentYorgeysplit-0.1.4.3 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.1.4.3https://hackage.haskell.org/package/split-0.1.4.3Thu, 7 Jun 2012 21:15:27 UTC<dl><dt>Homepage</dt><dd><a href="http://code.haskell.org/~byorgey/code/split">http://code.haskell.org/~byorgey/code/split</a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2012-06-07T21:15:27Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr /><pre>* 0.1.4.3 (7 June 2012)
- Import 'build' function from GHC.Exts instead of defining it by
hand, which can lead to some speedups (since GHC has special
rewriting rules for the version in GHC.Exts). Of course this ties
it to GHC; if you want to build split under some other compiler,
let me know and I can add some CPP directives to define 'build'
conditionally.
- Remove unnecessary Rank2Types extension.
* 0.1.4.2 (21 December 2011)
- Bump version upper bound for base and Test with GHC 7.4.1rc1
* 0.1.4.1 (3 August 2011)
- Bump version upper bound for base and test with GHC 7.2.0rc1.
* 0.1.4
- Add 'splitPlacesBlanks' function from Daniel Wagner; like
'splitPlaces' but pads the output with blank lists to match the
length of the input list of places to split.
* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.</pre>BrentYorgeysplit-0.1.4.2 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.1.4.2https://hackage.haskell.org/package/split-0.1.4.2Wed, 21 Dec 2011 21:20:39 UTC<dl><dt>Homepage</dt><dd><a href="http://code.haskell.org/~byorgey/code/split">http://code.haskell.org/~byorgey/code/split</a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2011-12-21T21:20:39Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr /><pre>* 0.1.4.2 (21 December 2011)
- Bump version upper bound for base and Test with GHC 7.4.1rc1
* 0.1.4.1 (3 August 2011)
- Bump version upper bound for base and test with GHC 7.2.0rc1.
* 0.1.4
- Add 'splitPlacesBlanks' function from Daniel Wagner; like
'splitPlaces' but pads the output with blank lists to match the
length of the input list of places to split.
* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.
</pre>BrentYorgeysplit-0.1.4.1 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.1.4.1https://hackage.haskell.org/package/split-0.1.4.1Wed, 3 Aug 2011 18:51:36 UTC<dl><dt>Homepage</dt><dd><a href="http://code.haskell.org/~byorgey/code/split">http://code.haskell.org/~byorgey/code/split</a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2011-08-03T18:51:36Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr /><pre>* 0.1.4.1 (3 August 2011)
- Bump version upper bound for base and test with GHC 7.2.0rc1.
* 0.1.4
- Add 'splitPlacesBlanks' function from Daniel Wagner; like
'splitPlaces' but pads the output with blank lists to match the
length of the input list of places to split.
* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.</pre>BrentYorgeysplit-0.1.4 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.1.4https://hackage.haskell.org/package/split-0.1.4Wed, 13 Apr 2011 18:50:04 UTC<dl><dt>Homepage</dt><dd><a href="http://code.haskell.org/~byorgey/code/split">http://code.haskell.org/~byorgey/code/split</a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2011-04-13T18:50:04Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr /><pre>* 0.1.4
- Add 'splitPlacesBlanks' function from Daniel Wagner; like
'splitPlaces' but pads the output with blank lists to match the
length of the input list of places to split.
* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.
</pre>BrentYorgeysplit-0.1.3 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.1.3https://hackage.haskell.org/package/split-0.1.3Wed, 15 Dec 2010 01:43:30 UTC<dl><dt>Homepage</dt><dd><a href="http://code.haskell.org/~byorgey/code/split">http://code.haskell.org/~byorgey/code/split</a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2010-12-15T01:43:30Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr /><pre>* 0.1.3
- Add 'chop' list-processing function.
* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.
</pre>BrentYorgeysplit-0.1.2.3 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.1.2.3https://hackage.haskell.org/package/split-0.1.2.3Tue, 16 Nov 2010 19:52:02 UTC<dl><dt>Homepage</dt><dd><a href="http://code.haskell.org/~byorgey/code/split">http://code.haskell.org/~byorgey/code/split</a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2010-11-16T19:52:02Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr /><pre>* 0.1.2.3
- Now builds with GHC 7
* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.
</pre>BrentYorgeysplit-0.1.2.2 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.1.2.2https://hackage.haskell.org/package/split-0.1.2.2Fri, 12 Nov 2010 21:54:28 UTC<dl><dt>Homepage</dt><dd><a href="http://code.haskell.org/~byorgey/code/split">http://code.haskell.org/~byorgey/code/split</a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2010-11-12T21:54:28Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr /><pre>* 0.1.2.2
- Fix typo in documentation (davidL)
- Lazier implementation of splitInternal from Jan Christiansen.
Performance on large lists with not very many split points is now
greatly improved.
</pre>BrentYorgeysplit-0.1.2.1 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.1.2.1https://hackage.haskell.org/package/split-0.1.2.1Tue, 14 Sep 2010 22:02:52 UTC<dl><dt>Homepage</dt><dd><a href="http://code.haskell.org/~byorgey/code/split">http://code.haskell.org/~byorgey/code/split</a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2010-09-14T22:02:52Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr />(No changelog found.)BrentYorgeysplit-0.1.2 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.1.2https://hackage.haskell.org/package/split-0.1.2Sun, 6 Dec 2009 18:59:40 UTC<dl><dt>Homepage</dt><dd><a href="http://code.haskell.org/~byorgey/code/split">http://code.haskell.org/~byorgey/code/split</a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2009-12-06T18:59:40Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr />(No changelog found.)BrentYorgeysplit-0.1.1 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.1.1https://hackage.haskell.org/package/split-0.1.1Tue, 13 Jan 2009 22:02:21 UTC<dl><dt>Homepage</dt><dd><a href="http://code.haskell.org/~byorgey/code/split">http://code.haskell.org/~byorgey/code/split</a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2009-01-13T22:02:21Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr />(No changelog found.)BrentYorgeysplit-0.1 (Combinator library for splitting lists.)https://hackage.haskell.org/package/split-0.1https://hackage.haskell.org/package/split-0.1Sun, 21 Dec 2008 19:02:04 UTC<dl><dt>Homepage</dt><dd><a href="http://code.haskell.org/~byorgey/code/split">http://code.haskell.org/~byorgey/code/split</a></dd><dt>Author</dt><dd>Brent Yorgey</dd><dt>Uploaded</dt><dd>by BrentYorgey at 2008-12-21T19:02:04Z</dd><dt>Maintainer</dt><dd>byorgey@cis.upenn.edu</dd></dl><hr />(No changelog found.)BrentYorgey