The persistent-equivalence package

[ Tags: bsd3, data, library ] [ Propose Tags ]

This is a persistent data structure for equivalence relations (known in the imperative world as union-find or disjoint set union). It exhibits optimal performance when used in a linear pattern, but degrades when other access patterns are used.

The basic idea is as given by Conchon and Filliatre in their 2007 paper, "A persistent union-find data structure." Unlike the implementation given in the paper, this version is safe with multiple threads, but does not optimize for backtracking.

Version 0.3 contains some performance improvements for concurrent applications, and removes the repr function, which was poorly defined and had no good uses.


Versions 0.1, 0.1.1, 0.2, 0.3
Dependencies array (==0.3.*), base (>=3 && <5), diffarray (==0.1.*) [details]
License BSD3
Author Chris Smith <>
Maintainer Chris Smith <>
Category Data
Uploaded Sat Oct 1 05:17:52 UTC 2011 by ChrisSmith
Distributions NixOS:0.3
Downloads 1430 total (23 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI




Maintainer's Corner

For package maintainers and hackage trustees