Commits on Aug 30, 2016

1. Use bulk IntMap operations …

   Use `Data.IntMap.differenceWith` to implement `(&)` and `match`
   for `Data.Graph.Inductive.PatriciaTree`. Instead of modifying
   the graph manually, one key at a time, `differenceWith` will
   efficiently partition the set of keys to be modified along the
   structure of the graph. This should be considerably more efficient
   when inserting or matching on well-connected nodes.
   
   Fixes haskell#39

   

   treeowl committed Aug 30, 2016
   Configuration menu

   • View commit details
   • Copy full SHA for 4a78b91
   • Browse repository at this point

   Copy the full SHA

   4a78b91 View commit details

   Browse the repository at this point in the history