---
- branch: MAIN
  date: Sun Dec 13 14:11:25 UTC 2015
  files:
  - new: '1.5'
    old: '1.4'
    path: pkgsrc/devel/hs-vector-algorithms/Makefile
    pathrev: pkgsrc/devel/hs-vector-algorithms/Makefile@1.5
    type: modified
  - new: '1.2'
    old: '1.1'
    path: pkgsrc/devel/hs-vector-algorithms/PLIST
    pathrev: pkgsrc/devel/hs-vector-algorithms/PLIST@1.2
    type: modified
  - new: '1.6'
    old: '1.5'
    path: pkgsrc/devel/hs-vector-algorithms/buildlink3.mk
    pathrev: pkgsrc/devel/hs-vector-algorithms/buildlink3.mk@1.6
    type: modified
  - new: '1.3'
    old: '1.2'
    path: pkgsrc/devel/hs-vector-algorithms/distinfo
    pathrev: pkgsrc/devel/hs-vector-algorithms/distinfo@1.3
    type: modified
  id: 20151213T141125Z.c84045338ed026fd5c653a03977ddf2022f46ee4
  log: "Update to 0.7.0.1\n\nChanges from http://hub.darcs.net/dolio/vector-algorithms/changes\nTAG
    0.7.0.1\n\tdolio\tAugust 13, 2015\n\nVersion bump\n\tdolio\tAugust 13, 2015\n\nBump
    upper bound on vector\n\tbgamari\tAugust 11, 2015\n\nUpdated base bound due to
    unsafeShiftR\n\tPointed out by Adam Bergmark\n\tdolio\tMay 05, 2015\n\nTAG 0.7\n\tdolio\tMay
    05, 2015\n\nUpdated copyrights in license file\n\tdolio\tMay 05, 2015\n\nCopyright
    updates\n\tdolio\tApril 27, 2015\n\nMoved the gallop searches to the search module\n\tAlso
    added versions that don't take bounds\n\tdolio\tApril 27, 2015\n\nFinished explaining
    the timsort algorithm\n\tdolio\tApril 27, 2015\n\nImproved intro and heap documentation.\n\tdolio\tApril
    26, 2015\n\nMade an argument stricter in the timsort searches\n\tdolio\tApril
    26, 2015\n\nAdded an option to build with llvm\n\tdolio\tApril 23, 2015\n\nImplemented
    insertion in the heap module.\n\tdolio\tApril 21, 2015\n\nFixed a comment in AmericanFlag
    caused by a replace\n\tdolio\tApril 19, 2015\n\nAdded dump-simpl flag to benchmark
    build\n\tdolio\tApril 19, 2015\n\nResolved version bump conflict\n\tdolio\tApril
    19, 2015\n\nTAG 0.6.0.4\n\tdolio\tApril 01, 2015\n\nAllow building with primitive
    0.6\n\tdolio\tApril 01, 2015\n\nFix maintainance of invariant for length of runs\n\tTimsort
    maintains a list of sorted segments (called ?runs?) in an list\n\tcalled ?runLen?.
    To ensure that a small array suffices for this, timsort\n\timposes an invariant
    on the lengths of runs: each run must be shorter\n\tthan the preceding run in
    ?runs? and the sum of the lengths of two\n\tconsecutive runs must be lower than
    the length of the run preceding the\n\ttwo runs. In effect, the (reverted) sequence
    of run lengths grows at\n\tleast as fast as the fibonacci sequence. The operation
    that adds a new\n\trun to the list of runs (and merges runs, if necessary) makes
    sure that\n\tthe new list ?runLen? satisfies\n\n\trunLen [n-2] > runLen [n-1]
    + runLen [n]\n\trunLen [n-1] > runLen [n]\n\n\tIt has recently been discovered
    that this doesn't suffice to maintain\n\tthe invariant for all triples of consecutive
    runs:\n\n\thttp://envisage-project.eu/proving-android-java-and-python-sorting-algorithm-is-broken-and-how-to-fix-it/\n\n\tThis
    patch fixes this problem.\n\n\tCorrectness of the new implementation has been
    checked with QuickCheck:\n\thttps://gist.github.com/timjb/cca12b004a0c782ca622\n\ttimjb\tFebruary
    26, 2015\n\nAdded a cabal flag to dump core\n\tdolio\tFebruary 10, 2015\n\ncabal
    updates: added copyright and bumped the upcoming version\n\tdolio\tFebruary 10,
    2015\n\nImplement timsort\n\tDifferences from timsort.txt: Galloping is used only
    once, when an element is\n\tchosen 7 times from the same run; this threshold is
    not updated according to\n\thow successful galloping is.\n\ttimjb\tFebruary 08,
    2015\n"
  module: pkgsrc
  subject: 'CVS commit: pkgsrc/devel/hs-vector-algorithms'
  unixtime: '1450015885'
  user: szptvlfn