summaryrefslogtreecommitdiff
path: root/devel/hs-vector-algorithms
AgeCommit message (Collapse)AuthorFilesLines
2022-08-22hs-vector-algorithms: update to 0.9.0.1.wiz4-11/+16
## Version 0.9.0.1 (2022-07-28) - Allow building with vector-0.13.*. ## Version 0.9.0.0 (2022-05-19) - Add nub related functions. - Add sortUniq related functions (sorts, then removes duplicates).
2022-08-20hs*: recursive bump for new dependencies neededwiz2-4/+4
for hs-aeson, hs-vector
2022-02-26Bump all Haskell packages after enabling "split sections" in mk/haskell.mkpho2-4/+4
2022-02-12revbump after changing the default Haskell compilerpho2-4/+4
2022-01-18Bump packages that depends on GHCpho2-4/+4
2021-10-26archivers: Replace RMD160 checksums with BLAKE2s checksumsnia1-2/+2
All checksums have been double-checked against existing RMD160 and SHA512 hashes Could not be committed due to merge conflict: devel/py-traitlets/distinfo The following distfiles were unfetchable (note: some may be only fetched conditionally): ./devel/pvs/distinfo pvs-3.2-solaris.tgz ./devel/eclipse/distinfo eclipse-sourceBuild-srcIncluded-3.0.1.zip
2021-10-07devel: Remove SHA1 hashes for distfilesnia1-2/+1
2021-05-03*: Bump PKGREVISION for ghc-9.0.1pho2-3/+4
2021-04-23Update to vector-algorithms-0.8.0.4pho4-63/+63
* Fix out of range access in Intro.partialSort. * Update QuickCheck dependency bounds.
2020-05-11hs-*: add PLIST filesrillig1-0/+55
These PLIST files have been autogenerated by mk/haskell.mk using HS_UPDATE_PLIST=yes during a bulk build. They will help to track changes to the packages. The Haskell packages didn't have PLIST files because their paths contained package hashes. These hashes are now determined by mk/haskell.mk, which makes it easy to generate easy to read PLIST files.
2020-01-02Update to vector-algorithms-0.8.0.3pho4-59/+10
Version 0.8.0.3 (2019-12-02) Fix out-of-bounds access in Timsort. Version 0.8.0.2 (2019-11-28) Bump upper bounds on primitive and QuickCheck. Expose 'terminate' function from 'AmericanFlag' module. Fix an off-by-one error in Data.Vector.Algorithms.Heaps.heapInsert.
2015-12-13Update to 0.7.0.1szptvlfn4-12/+14
Changes from http://hub.darcs.net/dolio/vector-algorithms/changes TAG 0.7.0.1 dolio August 13, 2015 Version bump dolio August 13, 2015 Bump upper bound on vector bgamari August 11, 2015 Updated base bound due to unsafeShiftR Pointed out by Adam Bergmark dolio May 05, 2015 TAG 0.7 dolio May 05, 2015 Updated copyrights in license file dolio May 05, 2015 Copyright updates dolio April 27, 2015 Moved the gallop searches to the search module Also added versions that don't take bounds dolio April 27, 2015 Finished explaining the timsort algorithm dolio April 27, 2015 Improved intro and heap documentation. dolio April 26, 2015 Made an argument stricter in the timsort searches dolio April 26, 2015 Added an option to build with llvm dolio April 23, 2015 Implemented insertion in the heap module. dolio April 21, 2015 Fixed a comment in AmericanFlag caused by a replace dolio April 19, 2015 Added dump-simpl flag to benchmark build dolio April 19, 2015 Resolved version bump conflict dolio April 19, 2015 TAG 0.6.0.4 dolio April 01, 2015 Allow building with primitive 0.6 dolio April 01, 2015 Fix maintainance of invariant for length of runs Timsort maintains a list of sorted segments (called ?runs?) in an list called ?runLen?. To ensure that a small array suffices for this, timsort imposes an invariant on the lengths of runs: each run must be shorter than the preceding run in ?runs? and the sum of the lengths of two consecutive runs must be lower than the length of the run preceding the two runs. In effect, the (reverted) sequence of run lengths grows at least as fast as the fibonacci sequence. The operation that adds a new run to the list of runs (and merges runs, if necessary) makes sure that the new list ?runLen? satisfies runLen [n-2] > runLen [n-1] + runLen [n] runLen [n-1] > runLen [n] It has recently been discovered that this doesn't suffice to maintain the invariant for all triples of consecutive runs: http://envisage-project.eu/proving-android-java-and-python-sorting-algorithm-is-broken-and-how-to-fix-it/ This patch fixes this problem. Correctness of the new implementation has been checked with QuickCheck: https://gist.github.com/timjb/cca12b004a0c782ca622 timjb February 26, 2015 Added a cabal flag to dump core dolio February 10, 2015 cabal updates: added copyright and bumped the upcoming version dolio February 10, 2015 Implement timsort Differences from timsort.txt: Galloping is used only once, when an element is chosen 7 times from the same run; this threshold is not updated according to how successful galloping is. timjb February 08, 2015
2015-11-03Add SHA512 digests for distfiles for devel categoryagc1-1/+2
Issues found with existing distfiles: distfiles/eclipse-sourceBuild-srcIncluded-3.0.1.zip distfiles/fortran-utils-1.1.tar.gz distfiles/ivykis-0.39.tar.gz distfiles/enum-1.11.tar.gz distfiles/pvs-3.2-libraries.tgz distfiles/pvs-3.2-linux.tgz distfiles/pvs-3.2-solaris.tgz distfiles/pvs-3.2-system.tgz No changes made to these distinfo files. Otherwise, existing SHA1 digests verified and found to be the same on the machine holding the existing distfiles (morden). All existing SHA1 digests retained for now as an audit trail.
2015-05-09Because this error:szptvlfn2-4/+4
ERROR: hs-primitive>=0.5.4 is not installed; can't buildlink files. Bump PKGREVISION for hs-primitive-0.5.4.0
2014-11-23Bump PKGREVISION for hs-transformers-0.4.2.0szptvlfn2-4/+4
2014-10-18Bump PKGREVISION for hs-vector-0.10.12.1szptvlfn2-3/+4
2014-08-29make it clear what package depend onszptvlfn1-1/+2
discussed with wiz@.
2014-08-16Import vector-algorithms-0.6.0.3 as devel/hs-vector-algorithms,szptvlfn5-0/+80
packaged for wip. Efficient algorithms for vector arrays
generated by cgit v1.2.3 (git 2.46.0) at 2026-03-18 23:38:26 +0000