All Versions
Latest Version
Avg Release Cycle
187 days
Latest Release

Changelog History
Page 1

  • v5.7.0.3 Changes

    • โฌ†๏ธ Bump QuickCheck dependency
  • v5.7.0.2 Changes

    January 28, 2020
    • โฌ†๏ธ Bump dependencies.
  • v5.7.0.1 Changes

    November 26, 2018
    • ๐Ÿš€ Accidentally released the wrong version.
  • v5.7.0.0 Changes

    • โšก๏ธ Updating the GraphM class to be compatible with the MonadFail proposal and GHC's MonadFailDesugaring language extension which is enabled by default by GHC-8.6.1.
  • v5.6.0.0 Changes

    August 09, 2017
    • The previous version should have been a major version bump due to the API change.
  • v5.5.4.0 Changes

    August 09, 2017
    • ๐Ÿ‘Œ Improved type safety of shortest-path functions (in Data.Graph.Inductive.Query.SP) thanks to Nathan Collins.

      • getDistance, spLength and sp now return Maybe values.
    • ๐Ÿ›  Fixed building on GHC < 7.4; previously uncaught due to cabal-install doing the wrong thing on Travis-CI.

  • v5.5.3.1 Changes

    March 03, 2017
    • ๐Ÿ“š Hopefully clearer documentation for &, Context and the ufold-based functions.

    • Thanks to David Feuer, the existing benchmark suite is now runnable with cabal bench.

    • ๐ŸŽ Some performance improvements for PatriciaTree, thanks to David Feuer.

  • v5.5.3.0 Changes

    July 15, 2016
    • โž• Additional closure functions by Matthew Danish.

    • Bifunctor instances for base >=

    • An ST-based GraphM instance.

    • โž• Addition of order and size functions for finding the number of nodes and edges respectively in a graph (the former is an alias for the existing noNodes function).

    • The rules for faster implementations of insNode and insEdge for PatriciaTree should fire more often now.

  • v5.5.2.3 Changes

    September 08, 2015
    • Earlier fix for NFData wasn't quite complete/correct.
  • v5.5.2.2 Changes

    September 08, 2015
    • Ensure firing of specialised rules for PatriciaTree.

    • ๐Ÿ‘ Better way of only creating NFData instances when possible.