data-ordlist – new releases on Hackagehttps://hackage.haskell.org/package/data-ordlistNew releases of package 'data-ordlist' on Hackage.http://www.rssboard.org/rss-specificationenadmin@hackage.haskell.orgadmin@hackage.haskell.orgThu, 20 Nov 2014 00:57:41 UTCThu, 20 Nov 2014 00:57:41 UTCrss-feeddata-ordlist-0.4.7.0 (Set and bag operations on ordered lists)https://hackage.haskell.org/package/data-ordlist-0.4.7.0https://hackage.haskell.org/package/data-ordlist-0.4.7.0Thu, 20 Nov 2014 00:57:41 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Leon P Smith <leon@melding-monads.com></dd><dt>Uploaded</dt><dd>by LeonSmith at 2014-11-20T00:57:41Z</dd><dt>Maintainer</dt><dd>Leon P Smith <leon@melding-monads.com></dd></dl><hr /><p>Version 0.4.7.0: (2014-11-19)</p>
<ul>
<li><code>foldt</code> tweaked to be made slightly lazier, thus also affecting
<code>mergeAll</code>, <code>mergeAllBy</code>, <code>unionAll</code>, and <code>unionAllBy</code>. Thanks
goes to Will Ness for providing the following example that
previously entered into an infinite non-productive loop:
</li>
</ul>
<pre><code> let ps=3:minus[5,7..] (unionAll [[p*p,p*(p+2)..]|p<-ps]) in take 100 (2:ps)
</code></pre>
<pre><code>Note that the _de facto_ semantics of `foldt` has been modified
slightly: instead of computing the sum of a list, it computes
the sum of a list plus zero. Of course, if zero is a true
identity of plus, then this change is of no semantic consequence.
</code></pre>
<p>Version 0.4.6.1: (2014-04-19)</p>
<ul>
<li>
<p>Added strictness annotations inside of sortOn and nubSortOn</p>
</li>
<li>
<p>Tweaked documentation of nubSort</p>
</li>
<li>
<p>Conditionally reexport sortOn from Data.List when available.
(See <a href="https://ghc.haskell.org/trac/ghc/changeset/44512e3c855d8fb36ab6580f4f97f842ebcf4c6c/ghc">GHC commit 44512e3c</a>)</p>
</li>
</ul>
<p>Version 0.4.6: (2014-02-15)</p>
<ul>
<li>
<p>Generalized type signature of <code>isectBy</code>, <code>minusBy</code>, and <code>minusBy'</code>,
leaving the definition unchanged.</p>
</li>
<li>
<p>Made the documentation of <code>union</code> more precise.</p>
</li>
</ul>
<p>Version 0.4.5: (2012-03-12)</p>
<ul>
<li>
<p>New function, <code>minus'</code></p>
</li>
<li>
<p>Exported <code>foldt</code> and <code>foldt'</code></p>
</li>
<li>
<p>Documentation improvements</p>
</li>
<li>
<p>Reverted the implementation of <code>mergeAll</code> and <code>unionAll</code> to version
0.4.2 because the simplified implementation would force the head of
the inner list appearing at the next highest power of 2 well before
it was necessary to do so.</p>
</li>
</ul>
<p>Version 0.4.4: (2010-12-24)</p>
<ul>
<li>
<p>Simplified the implementation of <code>mergeAll</code> and <code>unionAll</code> based on
comments from Will Ness.</p>
<p><a href="http://www.haskell.org/pipermail/haskell-cafe/2010-December/087587.html">http://www.haskell.org/pipermail/haskell-cafe/2010-December/087587.html</a></p>
</li>
</ul>
<p>Version 0.4.3: (2010-03-02)</p>
<ul>
<li>
<p>Improved the implementation of <code>nubSort</code>, mirroring the improvements made
to <code>Data.List.sort</code> in GHC-6.13.20091224 and first released in GHC-7.0.1.
Thanks to Gwern Branwen for calling the change to my attention. Instead
of initially breaking the input list into singletons before the merge
process, the improved version breaks the input list into monotonic runs.</p>
<p><a href="http://www.haskell.org/pipermail/libraries/2010-March/013066.html">http://www.haskell.org/pipermail/libraries/2010-March/013066.html</a></p>
</li>
<li>
<p>Minor formatting improvements in the Haddock documentation.</p>
</li>
</ul>
<p>Version 0.4.2: (2010-02-18)</p>
<ul>
<li>
<p>Fixed non-productive loop in <code>unionAll</code> when applied to an infinite list
of lists. Thanks to Omar Antolín Camarena for reporting the bug and
Heinrich Apfelmus for some useful comments.</p>
<p><a href="http://www.haskell.org/pipermail/haskell-cafe/2010-February/073403.html">http://www.haskell.org/pipermail/haskell-cafe/2010-February/073403.html</a>
<a href="http://www.haskell.org/pipermail/haskell-cafe/2010-February/073437.html">http://www.haskell.org/pipermail/haskell-cafe/2010-February/073437.html</a></p>
</li>
<li>
<p>Added regression test to test suite.</p>
</li>
</ul>
<p>Version 0.4.1: (2010-02-17)</p>
<ul>
<li>
<p>Simplified the implementation of <code>mergeAll</code> and <code>unionAll</code> thanks
to some pointers by Heinrich Apfelmus. This introduced an infinite
non-productive loop into <code>unionAll</code>, which was fixed in 0.4.2 without
giving up the simplifications.</p>
<p><a href="http://www.haskell.org/pipermail/haskell-cafe/2010-February/073356.html">http://www.haskell.org/pipermail/haskell-cafe/2010-February/073356.html</a></p>
</li>
<li>
<p>Minor documentation fixes</p>
</li>
</ul>
<p>Version 0.4: (2010-02-15)</p>
<ul>
<li>
<p>The "CHANGES" file was added to document the changes between releases.</p>
</li>
<li>
<p>Documentation Improvements</p>
</li>
<li>
<p>A rough first pass at a test suite</p>
</li>
<li>
<p>The functions <code>mergeAll</code> and <code>unionAll</code> were added. They operate
on a possibly infinite list of possibly infinite ordered lists; assuming
the heads of the lists are ordered.</p>
<p>Thanks goes to Omar Antolín Camarena, Heinrich Apfelmus, and Dave Bayer.</p>
<p>Omar Antolín Camarena suggested the addition, located the article
used as the basis for the implementation, and was quite helpful with
testing and debugging.</p>
<p>Heinrich Apfelmus wrote his "Implicit Heaps" article, where he
simplified an algorithm by Dave Bayer. It is this article that forms
the basis of our implementation.</p>
<p><a href="http://apfelmus.nfshost.com/articles/implicit-heaps.html">http://apfelmus.nfshost.com/articles/implicit-heaps.html</a></p>
<p>Dave Bayer posted his 'venturi' implementation to the haskell-cafe
mailing list on 2007 Jul 22. It also appears as "BayerPrimes.hs"
inside of Melissa O'Neill's "haskell-primes.zip":</p>
<p><a href="http://www.haskell.org/pipermail/haskell-cafe/2007-July/029391.html">http://www.haskell.org/pipermail/haskell-cafe/2007-July/029391.html</a>
<a href="http://www.cs.hmc.edu/~oneill/code/haskell-primes.zip">http://www.cs.hmc.edu/~oneill/code/haskell-primes.zip</a></p>
</li>
</ul>
<p>Version 0.2: (2010-02-07)</p>
<ul>
<li>
<p>The module name was changed from <code>Data.OrdList</code> to <code>Data.List.Ordered</code></p>
</li>
<li>
<p>Fixed bugs in <code>insertSetBy</code>, <code>insertBagBy</code>, and <code>nub</code>. The insertion
functions assumed reversed lists, while <code>nub</code> failed to remove duplicates.</p>
<p>Thanks to Topi Karvonen for reporting the first issue!</p>
</li>
<li>
<p>Changed semantics of <code>insertSetBy</code> slightly: the new version replaces an
element if it is already there. If the old semantics turns out to be
important, a new function can be added at a later date.</p>
</li>
<li>
<p>Changed semantics of <code>nubBy</code>: the new version negates the binary relation,
so that <code>new_nubBy f == old_nubBy (not . f)</code>. It is now in better keeping
with the spirit of the rest of the library, and mades the bug in <code>nub</code>
more obvious.</p>
</li>
<li>
<p>Better documentation, I hope. At the very least, the process of
documenting <code>nubBy</code> revealed the bug in <code>nub</code>.</p>
</li>
</ul>
<p>Version 0.0.1: (2009-07-10)</p>
<ul>
<li>The initial release, sadly, did not contain the source file
</li>
</ul>
<p>Version 0.0: (2009-07-10)</p>
<ul>
<li>Initial Release
</li>
</ul>
LeonSmithdata-ordlist-0.4.6.1 (Set and bag operations on ordered lists)https://hackage.haskell.org/package/data-ordlist-0.4.6.1https://hackage.haskell.org/package/data-ordlist-0.4.6.1Sat, 19 Apr 2014 23:16:49 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Leon P Smith <leon@melding-monads.com></dd><dt>Uploaded</dt><dd>by LeonSmith at 2014-04-19T23:16:49Z</dd><dt>Maintainer</dt><dd>Leon P Smith <leon@melding-monads.com></dd></dl><hr /><p>Version 0.4.6.1: (2014-04-19)</p>
<ul>
<li>
<p>Added strictness annotations inside of sortOn and nubSortOn</p>
</li>
<li>
<p>Tweaked documentation of nubSort</p>
</li>
<li>
<p>Conditionally reexport sortOn from Data.List when available.
(See <a href="https://ghc.haskell.org/trac/ghc/changeset/44512e3c855d8fb36ab6580f4f97f842ebcf4c6c/ghc">GHC commit 44512e3c</a>)</p>
</li>
</ul>
<p>Version 0.4.6: (2014-02-15)</p>
<ul>
<li>
<p>Generalized type signature of <code>isectBy</code>, <code>minusBy</code>, and <code>minusBy'</code>,
leaving the definition unchanged.</p>
</li>
<li>
<p>Made the documentation of <code>union</code> more precise.</p>
</li>
</ul>
<p>Version 0.4.5: (2012-03-12)</p>
<ul>
<li>
<p>New function, <code>minus'</code></p>
</li>
<li>
<p>Exported <code>foldt</code> and <code>foldt'</code></p>
</li>
<li>
<p>Documentation improvements</p>
</li>
<li>
<p>Reverted the implementation of <code>mergeAll</code> and <code>unionAll</code> to version
0.4.2 because the simplified implementation would force the head of
the inner list appearing at the next highest power of 2 well before
it was necessary to do so.</p>
</li>
</ul>
<p>Version 0.4.4: (2010-12-24)</p>
<ul>
<li>
<p>Simplified the implementation of <code>mergeAll</code> and <code>unionAll</code> based on
comments from Will Ness.</p>
<p><a href="http://www.haskell.org/pipermail/haskell-cafe/2010-December/087587.html">http://www.haskell.org/pipermail/haskell-cafe/2010-December/087587.html</a></p>
</li>
</ul>
<p>Version 0.4.3: (2010-03-02)</p>
<ul>
<li>
<p>Improved the implementation of <code>nubSort</code>, mirroring the improvements made
to <code>Data.List.sort</code> in GHC-6.13.20091224 and first released in GHC-7.0.1.
Thanks to Gwern Branwen for calling the change to my attention. Instead
of initially breaking the input list into singletons before the merge
process, the improved version breaks the input list into monotonic runs.</p>
<p><a href="http://www.haskell.org/pipermail/libraries/2010-March/013066.html">http://www.haskell.org/pipermail/libraries/2010-March/013066.html</a></p>
</li>
<li>
<p>Minor formatting improvements in the Haddock documentation.</p>
</li>
</ul>
<p>Version 0.4.2: (2010-02-18)</p>
<ul>
<li>
<p>Fixed non-productive loop in <code>unionAll</code> when applied to an infinite list
of lists. Thanks to Omar Antolín Camarena for reporting the bug and
Heinrich Apfelmus for some useful comments.</p>
<p><a href="http://www.haskell.org/pipermail/haskell-cafe/2010-February/073403.html">http://www.haskell.org/pipermail/haskell-cafe/2010-February/073403.html</a>
<a href="http://www.haskell.org/pipermail/haskell-cafe/2010-February/073437.html">http://www.haskell.org/pipermail/haskell-cafe/2010-February/073437.html</a></p>
</li>
<li>
<p>Added regression test to test suite.</p>
</li>
</ul>
<p>Version 0.4.1: (2010-02-17)</p>
<ul>
<li>
<p>Simplified the implementation of <code>mergeAll</code> and <code>unionAll</code> thanks
to some pointers by Heinrich Apfelmus. This introduced an infinite
non-productive loop into <code>unionAll</code>, which was fixed in 0.4.2 without
giving up the simplifications.</p>
<p><a href="http://www.haskell.org/pipermail/haskell-cafe/2010-February/073356.html">http://www.haskell.org/pipermail/haskell-cafe/2010-February/073356.html</a></p>
</li>
<li>
<p>Minor documentation fixes</p>
</li>
</ul>
<p>Version 0.4: (2010-02-15)</p>
<ul>
<li>
<p>The "CHANGES" file was added to document the changes between releases.</p>
</li>
<li>
<p>Documentation Improvements</p>
</li>
<li>
<p>A rough first pass at a test suite</p>
</li>
<li>
<p>The functions <code>mergeAll</code> and <code>unionAll</code> were added. They operate
on a possibly infinite list of possibly infinite ordered lists; assuming
the heads of the lists are ordered.</p>
<p>Thanks goes to Omar Antolín Camarena, Heinrich Apfelmus, and Dave Bayer.</p>
<p>Omar Antolín Camarena suggested the addition, located the article
used as the basis for the implementation, and was quite helpful with
testing and debugging.</p>
<p>Heinrich Apfelmus wrote his "Implicit Heaps" article, where he
simplified an algorithm by Dave Bayer. It is this article that forms
the basis of our implementation.</p>
<p><a href="http://apfelmus.nfshost.com/articles/implicit-heaps.html">http://apfelmus.nfshost.com/articles/implicit-heaps.html</a></p>
<p>Dave Bayer posted his 'venturi' implementation to the haskell-cafe
mailing list on 2007 Jul 22. It also appears as "BayerPrimes.hs"
inside of Melissa O'Neill's "haskell-primes.zip":</p>
<p><a href="http://www.haskell.org/pipermail/haskell-cafe/2007-July/029391.html">http://www.haskell.org/pipermail/haskell-cafe/2007-July/029391.html</a>
<a href="http://www.cs.hmc.edu/~oneill/code/haskell-primes.zip">http://www.cs.hmc.edu/~oneill/code/haskell-primes.zip</a></p>
</li>
</ul>
<p>Version 0.2: (2010-02-07)</p>
<ul>
<li>
<p>The module name was changed from <code>Data.OrdList</code> to <code>Data.List.Ordered</code></p>
</li>
<li>
<p>Fixed bugs in <code>insertSetBy</code>, <code>insertBagBy</code>, and <code>nub</code>. The insertion
functions assumed reversed lists, while <code>nub</code> failed to remove duplicates.</p>
<p>Thanks to Topi Karvonen for reporting the first issue!</p>
</li>
<li>
<p>Changed semantics of <code>insertSetBy</code> slightly: the new version replaces an
element if it is already there. If the old semantics turns out to be
important, a new function can be added at a later date.</p>
</li>
<li>
<p>Changed semantics of <code>nubBy</code>: the new version negates the binary relation,
so that <code>new_nubBy f == old_nubBy (not . f)</code>. It is now in better keeping
with the spirit of the rest of the library, and mades the bug in <code>nub</code>
more obvious.</p>
</li>
<li>
<p>Better documentation, I hope. At the very least, the process of
documenting <code>nubBy</code> revealed the bug in <code>nub</code>.</p>
</li>
</ul>
<p>Version 0.0.1: (2009-07-10)</p>
<ul>
<li>The initial release, sadly, did not contain the source file
</li>
</ul>
<p>Version 0.0: (2009-07-10)</p>
<ul>
<li>Initial Release
</li>
</ul>
LeonSmithdata-ordlist-0.4.6 (Set and bag operations on ordered lists)https://hackage.haskell.org/package/data-ordlist-0.4.6https://hackage.haskell.org/package/data-ordlist-0.4.6Sat, 15 Feb 2014 07:20:08 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Leon P Smith <leon@melding-monads.com></dd><dt>Uploaded</dt><dd>by LeonSmith at 2014-02-15T07:20:08Z</dd><dt>Maintainer</dt><dd>Leon P Smith <leon@melding-monads.com></dd></dl><hr /><p>Version 0.4.6: (2014-02-15)</p>
<ul>
<li>
<p>Generalized type signature of <code>isectBy</code>, <code>minusBy</code>, and <code>minusBy'</code>,
leaving the definition unchanged.</p>
</li>
<li>
<p>Made the documentation of <code>union</code> more precise.</p>
</li>
</ul>
<p>Version 0.4.5: (2012-03-12)</p>
<ul>
<li>
<p>New function, <code>minus'</code></p>
</li>
<li>
<p>Exported <code>foldt</code> and <code>foldt'</code></p>
</li>
<li>
<p>Documentation improvements</p>
</li>
<li>
<p>Reverted the implementation of <code>mergeAll</code> and <code>unionAll</code> to version
0.4.2 because the simplified implementation would force the head of
the inner list appearing at the next highest power of 2 well before
it was necessary to do so.</p>
</li>
</ul>
<p>Version 0.4.4: (2010-12-24)</p>
<ul>
<li>
<p>Simplified the implementation of <code>mergeAll</code> and <code>unionAll</code> based on
comments from Will Ness.</p>
<p><a href="http://www.haskell.org/pipermail/haskell-cafe/2010-December/087587.html">http://www.haskell.org/pipermail/haskell-cafe/2010-December/087587.html</a></p>
</li>
</ul>
<p>Version 0.4.3: (2010-03-02)</p>
<ul>
<li>
<p>Improved the implementation of <code>nubSort</code>, mirroring the improvements made
to <code>Data.List.sort</code> in GHC-6.13.20091224 and first released in GHC-7.0.1.
Thanks to Gwern Branwen for calling the change to my attention. Instead
of initially breaking the input list into singletons before the merge
process, the improved version breaks the input list into monotonic runs.</p>
<p><a href="http://www.haskell.org/pipermail/libraries/2010-March/013066.html">http://www.haskell.org/pipermail/libraries/2010-March/013066.html</a></p>
</li>
<li>
<p>Minor formatting improvements in the Haddock documentation.</p>
</li>
</ul>
<p>Version 0.4.2: (2010-02-18)</p>
<ul>
<li>
<p>Fixed non-productive loop in <code>unionAll</code> when applied to an infinite list
of lists. Thanks to Omar Antolín Camarena for reporting the bug and
Heinrich Apfelmus for some useful comments.</p>
<p><a href="http://www.haskell.org/pipermail/haskell-cafe/2010-February/073403.html">http://www.haskell.org/pipermail/haskell-cafe/2010-February/073403.html</a>
<a href="http://www.haskell.org/pipermail/haskell-cafe/2010-February/073437.html">http://www.haskell.org/pipermail/haskell-cafe/2010-February/073437.html</a></p>
</li>
<li>
<p>Added regression test to test suite.</p>
</li>
</ul>
<p>Version 0.4.1: (2010-02-17)</p>
<ul>
<li>
<p>Simplified the implementation of <code>mergeAll</code> and <code>unionAll</code> thanks
to some pointers by Heinrich Apfelmus. This introduced an infinite
non-productive loop into <code>unionAll</code>, which was fixed in 0.4.2 without
giving up the simplifications.</p>
<p><a href="http://www.haskell.org/pipermail/haskell-cafe/2010-February/073356.html">http://www.haskell.org/pipermail/haskell-cafe/2010-February/073356.html</a></p>
</li>
<li>
<p>Minor documentation fixes</p>
</li>
</ul>
<p>Version 0.4: (2010-02-15)</p>
<ul>
<li>
<p>The "CHANGES" file was added to document the changes between releases.</p>
</li>
<li>
<p>Documentation Improvements</p>
</li>
<li>
<p>A rough first pass at a test suite</p>
</li>
<li>
<p>The functions <code>mergeAll</code> and <code>unionAll</code> were added. They operate
on a possibly infinite list of possibly infinite ordered lists; assuming
the heads of the lists are ordered.</p>
<p>Thanks goes to Omar Antolín Camarena, Heinrich Apfelmus, and Dave Bayer.</p>
<p>Omar Antolín Camarena suggested the addition, located the article
used as the basis for the implementation, and was quite helpful with
testing and debugging.</p>
<p>Heinrich Apfelmus wrote his "Implicit Heaps" article, where he
simplified an algorithm by Dave Bayer. It is this article that forms
the basis of our implementation.</p>
<p><a href="http://apfelmus.nfshost.com/articles/implicit-heaps.html">http://apfelmus.nfshost.com/articles/implicit-heaps.html</a></p>
<p>Dave Bayer posted his 'venturi' implementation to the haskell-cafe
mailing list on 2007 Jul 22. It also appears as "BayerPrimes.hs"
inside of Melissa O'Neill's "haskell-primes.zip":</p>
<p><a href="http://www.haskell.org/pipermail/haskell-cafe/2007-July/029391.html">http://www.haskell.org/pipermail/haskell-cafe/2007-July/029391.html</a>
<a href="http://www.cs.hmc.edu/~oneill/code/haskell-primes.zip">http://www.cs.hmc.edu/~oneill/code/haskell-primes.zip</a></p>
</li>
</ul>
<p>Version 0.2: (2010-02-07)</p>
<ul>
<li>
<p>The module name was changed from <code>Data.OrdList</code> to <code>Data.List.Ordered</code></p>
</li>
<li>
<p>Fixed bugs in <code>insertSetBy</code>, <code>insertBagBy</code>, and <code>nub</code>. The insertion
functions assumed reversed lists, while <code>nub</code> failed to remove duplicates.</p>
<p>Thanks to Topi Karvonen for reporting the first issue!</p>
</li>
<li>
<p>Changed semantics of <code>insertSetBy</code> slightly: the new version replaces an
element if it is already there. If the old semantics turns out to be
important, a new function can be added at a later date.</p>
</li>
<li>
<p>Changed semantics of <code>nubBy</code>: the new version negates the binary relation,
so that <code>new_nubBy f == old_nubBy (not . f)</code>. It is now in better keeping
with the spirit of the rest of the library, and mades the bug in <code>nub</code>
more obvious.</p>
</li>
<li>
<p>Better documentation, I hope. At the very least, the process of
documenting <code>nubBy</code> revealed the bug in <code>nub</code>.</p>
</li>
</ul>
<p>Version 0.0.1: (2009-07-10)</p>
<ul>
<li>The initial release, sadly, did not contain the source file
</li>
</ul>
<p>Version 0.0: (2009-07-10)</p>
<ul>
<li>Initial Release
</li>
</ul>
LeonSmithdata-ordlist-0.4.5 (Set and bag operations on ordered lists)https://hackage.haskell.org/package/data-ordlist-0.4.5https://hackage.haskell.org/package/data-ordlist-0.4.5Mon, 12 Mar 2012 07:30:17 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Leon P Smith <leon@melding-monads.com></dd><dt>Uploaded</dt><dd>by LeonSmith at 2012-03-12T07:30:17Z</dd><dt>Maintainer</dt><dd>Leon P Smith <leon@melding-monads.com></dd></dl><hr /><pre>Version 0.4.5: (2012-03-12)
* New function, `minus'`
* Exported `foldt` and `foldt'`
* Documentation improvements
* Reverted the implementation of `mergeAll` and `unionAll` to version
0.4.2 because the simplified implementation would force the head of
the inner list appearing at the next highest power of 2 well before
it was necessary to do so.
Version 0.4.4: (2010-12-24)
* Simplified the implementation of `mergeAll` and `unionAll` based on
comments from Will Ness.
<http://www.haskell.org/pipermail/haskell-cafe/2010-December/087587.html>
Version 0.4.3: (2010-03-02)
* Improved the implementation of `nubSort`, mirroring the improvements made
to `Data.List.sort` in GHC-6.13.20091224 and first released in GHC-7.0.1.
Thanks to Gwern Branwen for calling the change to my attention. Instead
of initially breaking the input list into singletons before the merge
process, the improved version breaks the input list into monotonic runs.
<http://www.haskell.org/pipermail/libraries/2010-March/013066.html>
* Minor formatting improvements in the Haddock documentation.
Version 0.4.2: (2010-02-18)
* Fixed non-productive loop in `unionAll` when applied to an infinite list
of lists. Thanks to Omar Antolín Camarena for reporting the bug and
Heinrich Apfelmus for some useful comments.
<http://www.haskell.org/pipermail/haskell-cafe/2010-February/073403.html>
<http://www.haskell.org/pipermail/haskell-cafe/2010-February/073437.html>
* Added regression test to test suite.
Version 0.4.1: (2010-02-17)
* Simplified the implementation of `mergeAll` and `unionAll` thanks
to some pointers by Heinrich Apfelmus. This introduced an infinite
non-productive loop into `unionAll`, which was fixed in 0.4.2 without
giving up the simplifications.
<http://www.haskell.org/pipermail/haskell-cafe/2010-February/073356.html>
* Minor documentation fixes
Version 0.4: (2010-02-15)
* The "CHANGES" file was added to document the changes between releases.
* Documentation Improvements
* A rough first pass at a test suite
* The functions `mergeAll` and `unionAll` were added. They operate
on a possibly infinite list of possibly infinite ordered lists; assuming
the heads of the lists are ordered.
Thanks goes to Omar Antolín Camarena, Heinrich Apfelmus, and Dave Bayer.
Omar Antolín Camarena suggested the addition, located the article
used as the basis for the implementation, and was quite helpful with
testing and debugging.
Heinrich Apfelmus wrote his "Implicit Heaps" article, where he
simplified an algorithm by Dave Bayer. It is this article that forms
the basis of our implementation.
<http://apfelmus.nfshost.com/articles/implicit-heaps.html>
Dave Bayer posted his 'venturi' implementation to the haskell-cafe
mailing list on 2007 Jul 22. It also appears as "BayerPrimes.hs"
inside of Melissa O'Neill's "haskell-primes.zip":
<http://www.haskell.org/pipermail/haskell-cafe/2007-July/029391.html>
<http://www.cs.hmc.edu/~oneill/code/haskell-primes.zip>
Version 0.2: (2010-02-07)
* The module name was changed from `Data.OrdList` to `Data.List.Ordered`
* Fixed bugs in `insertSetBy`, `insertBagBy`, and `nub`. The insertion
functions assumed reversed lists, while `nub` failed to remove duplicates.
Thanks to Topi Karvonen for reporting the first issue!
* Changed semantics of `insertSetBy` slightly: the new version replaces an
element if it is already there. If the old semantics turns out to be
important, a new function can be added at a later date.
* Changed semantics of `nubBy`: the new version negates the binary relation,
so that `new_nubBy f == old_nubBy (not . f)`. It is now in better keeping
with the spirit of the rest of the library, and mades the bug in `nub`
more obvious.
* Better documentation, I hope. At the very least, the process of
documenting `nubBy` revealed the bug in `nub`.
Version 0.0.1: (2009-07-10)
* The initial release, sadly, did not contain the source file
Version 0.0: (2009-07-10)
* Initial Release
</pre>LeonSmithdata-ordlist-0.4.4 (Set and bag operations on ordered lists)https://hackage.haskell.org/package/data-ordlist-0.4.4https://hackage.haskell.org/package/data-ordlist-0.4.4Fri, 24 Dec 2010 05:28:03 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Leon P Smith <leon@melding-monads.com></dd><dt>Uploaded</dt><dd>by LeonSmith at 2010-12-24T05:28:03Z</dd><dt>Maintainer</dt><dd>Leon P Smith <leon@melding-monads.com></dd></dl><hr /><pre>Version 0.4.4: (2010-12-24)
* Simplified the implementation of `mergeAll` and `unionAll` based on
comments from Will Ness.
Version 0.4.3: (2010-03-02)
* Improved the implementation of `nubSort`, mirroring the improvements made
to `Data.List.sort` currently in GHC HEAD. Instead of initially breaking
the input list into singletons before the merge process, the improved
version breaks the input list into monotonic runs.
* Minor formatting improvements in the Haddock documentation.
Version 0.4.2: (2010-02-18)
* Fixed non-productive loop in `unionAll` when applied to an infinite list
of lists. Thanks to Omar Antolín Camarena for reporting the bug and
Heinrich Apfelmus for some useful comments.
* Added regression test to test suite.
Version 0.4.1: (2010-02-17)
* Simplified the implementation of `mergeAll` and `unionAll` thanks
to some pointers by Heinrich Apfelmus. This introduced an infinite
non-productive loop into `unionAll`, which was later fixed without
giving up the simplifications.
* Minor documentation fixes
Version 0.4: (2010-02-15)
* The "CHANGES" file was added to document the changes between releases.
* Documentation Improvements
* A rough first pass at a test suite
* The functions `mergeAll` and `unionAll` were added. They operate
on a possibly infinite list of possibly infinite ordered lists; assuming
the heads of the lists are ordered.
Thanks goes to Omar Antolín Camarena, Heinrich Apfelmus, and Dave Bayer.
Omar Antolín Camarena suggested the addition, located the article
used as the basis for the implementation, and was quite helpful with
testing and debugging.
Heinrich Apfelmus wrote his "Implicit Heaps" article, where he
simplified an algorithm by Dave Bayer. It is this article that forms
the basis of our implementation.
<http://apfelmus.nfshost.com/articles/implicit-heaps.html>
Dave Bayer posted his 'venturi' implementation to the haskell-cafe
mailing list on 2007 Jul 22. It also appears as "BayerPrimes.hs"
inside of Melissa O'Neill's "haskell-primes.zip":
<http://www.mail-archive.com/haskell-cafe@haskell.org/msg27612.html>
<http://www.cs.hmc.edu/~oneill/code/haskell-primes.zip>
Version 0.2: (2010-02-07)
* The module name was changed from `Data.OrdList` to `Data.List.Ordered`
* Fixed bugs in `insertSetBy`, `insertBagBy`, and `nub`. The insertion
functions assumed reversed lists, while `nub` failed to remove duplicates.
Thanks to Topi Karvonen for reporting the first issue!
* Changed semantics of `insertSetBy` slightly: the new version replaces an
element if it is already there. If the old semantics turns out to be
important, a new function can be added at a later date.
* Changed semantics of `nubBy`: the new version negates the binary relation,
so that `new_nubBy f == old_nubBy (not . f)`. It is now in better keeping
with the spirit of the rest of the library, and mades the bug in `nub`
more obvious.
* Better documentation, I hope. At the very least, the process of
documenting `nubBy` revealed the bug in `nub`.
Version 0.0.1: (2009-07-10)
* The initial release, sadly, did not contain the source file
Version 0.0: (2009-07-10)
* Initial Release
</pre>LeonSmithdata-ordlist-0.4.3 (Set and bag operations on ordered lists)https://hackage.haskell.org/package/data-ordlist-0.4.3https://hackage.haskell.org/package/data-ordlist-0.4.3Wed, 3 Mar 2010 04:01:28 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Leon P Smith <leon@melding-monads.com></dd><dt>Uploaded</dt><dd>by LeonSmith at 2010-03-03T04:01:28Z</dd><dt>Maintainer</dt><dd>Leon P Smith <leon@melding-monads.com></dd></dl><hr /><pre>Version 0.4.3: (2010-03-02)
* Improved the implementation of `nubSort`, mirroring the improvements made
to `Data.List.sort` currently in GHC HEAD. Instead of initially breaking
the input list into singletons before the merge process, the improved
version breaks the input list into monotonic runs.
* Minor formatting improvements in the Haddock documentation.
Version 0.4.2: (2010-02-18)
* Fixed non-productive loop in `unionAll` when applied to an infinite list
of lists. Thanks to Omar Antolín Camarena for reporting the bug and
Heinrich Apfelmus for some useful comments.
* Added regression test to test suite.
Version 0.4.1: (2010-02-17)
* Simplified the implementation of `mergeAll` and `unionAll` thanks
to some pointers by Heinrich Apfelmus.
* Minor documentation fixes
Version 0.4: (2010-02-15)
* The "CHANGES" file was added to document the changes between releases.
* Documentation Improvements
* A rough first pass at a test suite
* The functions `mergeAll` and `unionAll` were added. They operate
on a possibly infinite list of possibly infinite ordered lists; assuming
the heads of the lists are ordered.
Thanks goes to Omar Antolín Camarena, Heinrich Apfelmus, and Dave Bayer.
Omar Antolín Camarena suggested the addition, located the article
used as the basis for the implementation, and was quite helpful with
testing and debugging.
Heinrich Apfelmus wrote his "Implicit Heaps" article, where he
simplified an algorithm by Dave Bayer. It is this article that forms
the basis of our implementation.
<http://apfelmus.nfshost.com/articles/implicit-heaps.html>
Dave Bayer posted his 'venturi' implementation to the haskell-cafe
mailing list on 2007 Jul 22. It also appears as "BayerPrimes.hs"
inside of Melissa O'Neill's "haskell-primes.zip":
<http://www.mail-archive.com/haskell-cafe@haskell.org/msg27612.html>
<http://www.cs.hmc.edu/~oneill/code/haskell-primes.zip>
Version 0.2: (2010-02-07)
* The module name was changed from `Data.OrdList` to `Data.List.Ordered`
* Fixed bugs in `insertSetBy`, `insertBagBy`, and `nub`. The insertion
functions assumed reversed lists, while `nub` failed to remove duplicates.
Thanks to Topi Karvonen for reporting the first issue!
* Changed semantics of `insertSetBy` slightly: the new version replaces an
element if it is already there. If the old semantics turns out to be
important, a new function can be added at a later date.
* Changed semantics of `nubBy`: the new version negates the binary relation,
so that `new_nubBy f == old_nubBy (not . f)`. It is now in better keeping
with the spirit of the rest of the library, and mades the bug in `nub`
more obvious.
* Better documentation, I hope. At the very least, the process of
documenting `nubBy` revealed the bug in `nub`.
Version 0.0.1: (2009-07-10)
* The initial release, sadly, did not contain the source file
Version 0.0: (2009-07-10)
* Initial Release
</pre>LeonSmithdata-ordlist-0.4.2 (Set and bag operations on ordered lists)https://hackage.haskell.org/package/data-ordlist-0.4.2https://hackage.haskell.org/package/data-ordlist-0.4.2Thu, 18 Feb 2010 04:35:55 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Leon P Smith <leon@melding-monads.com></dd><dt>Uploaded</dt><dd>by LeonSmith at 2010-02-18T04:35:55Z</dd><dt>Maintainer</dt><dd>Leon P Smith <leon@melding-monads.com></dd></dl><hr /><pre>Version 0.4.2: (2010-02-18)
* Fixed non-productive loop in `unionAll` when applied to an infinite list
of lists. Thanks to Omar Antolín Camarena for reporting the bug and
Heinrich Apfelmus for some useful comments.
* Added regression test to test suite.
Version 0.4.1: (2010-02-17)
* Simplified the implementation of `mergeAll` and `unionAll` thanks
to some pointers by Heinrich Apfelmus.
* Minor documentation fixes
Version 0.4: (2010-02-15)
* The "CHANGES" file was added to document the changes between releases.
* Documentation Improvements
* A rough first pass at a test suite
* The functions `mergeAll` and `unionAll` were added. They operate
on a possibly infinite list of possibly infinite ordered lists; assuming
the heads of the lists are ordered.
Thanks goes to Omar Antolín Camarena, Heinrich Apfelmus, and Dave Bayer.
Omar Antolín Camarena suggested the addition, located the article
used as the basis for the implementation, and was quite helpful with
testing and debugging.
Heinrich Apfelmus wrote his "Implicit Heaps" article, where he
simplified an algorithm by Dave Bayer. It is this article that forms
the basis of our implementation.
<http://apfelmus.nfshost.com/articles/implicit-heaps.html>
Dave Bayer posted his 'venturi' implementation to the haskell-cafe
mailing list on 2007 Jul 22. It also appears as "BayerPrimes.hs"
inside of Melissa O'Neill's "haskell-primes.zip":
<http://www.mail-archive.com/haskell-cafe@haskell.org/msg27612.html>
<http://www.cs.hmc.edu/~oneill/code/haskell-primes.zip>
Version 0.2: (2010-02-07)
* The module name was changed from `Data.OrdList` to `Data.List.Ordered`
* Fixed bugs in `insertSetBy`, `insertBagBy`, and `nub`. The insertion
functions assumed reversed lists, while `nub` failed to remove duplicates.
Thanks to Topi Karvonen for reporting the first issue!
* Changed semantics of `insertSetBy` slightly: the new version replaces an
element if it is already there. If the old semantics turns out to be
important, a new function can be added at a later date.
* Changed semantics of `nubBy`: the new version negates the binary relation,
so that `new_nubBy f == old_nubBy (not . f)`. It is now in better keeping
with the spirit of the rest of the library, and mades the bug in `nub`
more obvious.
* Better documentation, I hope. At the very least, the process of
documenting `nubBy` revealed the bug in `nub`.
Version 0.0.1: (2009-07-10)
* The initial release, sadly, did not contain the source file
Version 0.0: (2009-07-10)
* Initial Release
</pre>LeonSmithdata-ordlist-0.4.1 (Set and bag operations on ordered lists)https://hackage.haskell.org/package/data-ordlist-0.4.1https://hackage.haskell.org/package/data-ordlist-0.4.1Wed, 17 Feb 2010 06:19:17 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Leon P Smith <leon@melding-monads.com></dd><dt>Uploaded</dt><dd>by LeonSmith at 2010-02-17T06:19:17Z</dd><dt>Maintainer</dt><dd>Leon P Smith <leon@melding-monads.com></dd></dl><hr /><pre>Version 0.4.1: (2010-02-17)
* Simplified the implementation of `mergeAll` and `unionAll` thanks
to some pointers by Heinrich Apfelmus
* Minor documentation fixes
Version 0.4: (2010-02-15)
* The "CHANGES" file was added to document the changes between releases.
* Documentation Improvements
* A rough first pass at a test suite
* The functions `mergeAll` and `unionAll` were added. They operate
on a possibly infinite list of possibly infinite ordered lists; assuming
the heads of the lists are ordered.
Thanks goes to Omar Antolín Camarena, Heinrich Apfelmus, and Dave Bayer.
Omar Antolín Camarena suggested the addition, located the article
used as the basis for the implementation, and was quite helpful with
testing and debugging.
Heinrich Apfelmus wrote his "Implicit Heaps" article, where he
simplified an algorithm by Dave Bayer. It is this article that forms
the basis of our implementation.
<http://apfelmus.nfshost.com/articles/implicit-heaps.html>
Dave Bayer posted his 'venturi' implementation to the haskell-cafe
mailing list on 2007 Jul 22. It also appears as "BayerPrimes.hs"
inside of Melissa O'Neill's "haskell-primes.zip":
<http://www.mail-archive.com/haskell-cafe@haskell.org/msg27612.html>
<http://www.cs.hmc.edu/~oneill/code/haskell-primes.zip>
Version 0.2: (2010-02-07)
* The module name was changed from `Data.OrdList` to `Data.List.Ordered`
* Fixed bugs in `insertSetBy`, `insertBagBy`, and `nub`. The insertion
functions assumed reversed lists, while `nub` failed to remove duplicates.
Thanks to Topi Karvonen for reporting the first issue!
* Changed semantics of `insertSetBy` slightly: the new version replaces an
element if it is already there. If the old semantics turns out to be
important, a new function can be added at a later date.
* Changed semantics of `nubBy`: the new version negates the binary relation,
so that `new_nubBy f == old_nubBy (not . f)`. It is now in better keeping
with the spirit of the rest of the library, and mades the bug in `nub`
more obvious.
* Better documentation, I hope. At the very least, the process of
documenting `nubBy` revealed the bug in `nub`.
Version 0.0.1: (2009-07-10)
* The initial release, sadly, did not contain the source file
Version 0.0: (2009-07-10)
* Initial Release
</pre>LeonSmithdata-ordlist-0.4 (Set and bag operations on ordered lists)https://hackage.haskell.org/package/data-ordlist-0.4https://hackage.haskell.org/package/data-ordlist-0.4Mon, 15 Feb 2010 06:46:23 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Leon P Smith <leon@melding-monads.com></dd><dt>Uploaded</dt><dd>by LeonSmith at 2010-02-15T06:46:23Z</dd><dt>Maintainer</dt><dd>Leon P Smith <leon@melding-monads.com></dd></dl><hr /><pre>Version 0.4: (2010-02-15)
* The "CHANGES" file was added to document the changes between releases.
* Documentation Improvements
* A rough first pass at a test suite
* The functions `mergeAll` and `unionAll` were added. They operate
on a possibly infinite list of possibly infinite ordered lists; assuming
the heads of the lists are ordered.
Thanks goes to Omar Antolín Camarena, Heinrich Apfelmus, and Dave Bayer.
Omar Antolín Camarena suggested the addition, located the article
used as the basis for the implementation, and was quite helpful with
testing and debugging.
Heinrich Apfelmus wrote his "Implicit Heaps" article, where he
simplified an algorithm by Dave Bayer. It is this article that forms
the basis of our implementation.
<http://apfelmus.nfshost.com/articles/implicit-heaps.html>
Dave Bayer posted his 'venturi' implementation to the haskell-cafe
mailing list on 2007 Jul 22. It also appears as "BayerPrimes.hs"
inside of Melissa O'Neill's "haskell-primes.zip":
<http://www.mail-archive.com/haskell-cafe@haskell.org/msg27612.html>
<http://www.cs.hmc.edu/~oneill/code/haskell-primes.zip>
Version 0.2: (2010-02-07)
* The module name was changed from `Data.OrdList` to `Data.List.Ordered`
* Fixed bugs in `insertSetBy`, `insertBagBy`, and `nub`. The insertion
functions assumed reversed lists, while `nub` failed to remove duplicates.
Thanks to Topi Karvonen for reporting the first issue!
* Changed semantics of `insertSetBy` slightly: the new version replaces an
element if it is already there. If the old semantics turns out to be
important, a new function can be added at a later date.
* Changed semantics of `nubBy`: the new version negates the binary relation,
so that `new_nubBy f == old_nubBy (not . f)`. It is now in better keeping
with the spirit of the rest of the library, and mades the bug in `nub`
more obvious.
* Better documentation, I hope. At the very least, the process of
documenting `nubBy` revealed the bug in `nub`.
Version 0.0.1: (2009-07-10)
* The initial release, sadly, did not contain the source file
Version 0.0: (2009-07-10)
* Initial Release
</pre>LeonSmithdata-ordlist-0.2 (Set and bag operations on ordered lists)https://hackage.haskell.org/package/data-ordlist-0.2https://hackage.haskell.org/package/data-ordlist-0.2Sun, 7 Feb 2010 01:37:27 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Leon P Smith <leon@melding-monads.com></dd><dt>Uploaded</dt><dd>by LeonSmith at 2010-02-07T01:37:27Z</dd><dt>Maintainer</dt><dd>Leon P Smith <leon@melding-monads.com></dd></dl><hr />(No changelog found.)LeonSmithdata-ordlist-0.0.1 (Set and bag operations on ordered lists)https://hackage.haskell.org/package/data-ordlist-0.0.1https://hackage.haskell.org/package/data-ordlist-0.0.1Fri, 10 Jul 2009 20:12:46 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Leon P Smith <leon@melding-monads.com></dd><dt>Uploaded</dt><dd>by LeonSmith at 2009-07-10T20:12:46Z</dd><dt>Maintainer</dt><dd>Leon P Smith <leon@melding-monads.com></dd></dl><hr />(No changelog found.)LeonSmithdata-ordlist-0.0 (Set and bag operations on ordered lists)https://hackage.haskell.org/package/data-ordlist-0.0https://hackage.haskell.org/package/data-ordlist-0.0Fri, 10 Jul 2009 12:25:31 UTC<dl><dt>Homepage</dt><dd><a href=""></a></dd><dt>Author</dt><dd>Leon P Smith <leon@melding-monads.com></dd><dt>Uploaded</dt><dd>by LeonSmith at 2009-07-10T12:25:31Z</dd><dt>Maintainer</dt><dd>Leon P Smith <leon@melding-monads.com></dd></dl><hr />(No changelog found.)LeonSmith