TreeCounter: Wait-free Tree Counter

[ bsd3, data, library ] [ Propose Tags ]

A wait-free tree counter. Creates a binary tree of counters, with each leaf associated with a thread. Leaves can be split, creating a new leaf for the current thread and another that can be used by another thread. Each thread will act on different leaves, meaning the actions are wait-free. A read is performed on the counter by recursively traversing it and summing the value of the counters in the nodes and leaves of the tree.




Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 0.0.1, 0.0.2
Dependencies base (>=4.6 && <4.8), monad-loops (>=0.4.2 && <0.5), ref-mtl (>=0.2.1 && <2.3), stm (>=0.2.4 && <2.5) [details]
License BSD-3-Clause
Author Julian Sutherland
Maintainer Julian Sutherland (
Category Data
Home page
Uploaded by julek at 2015-01-24T02:25:18Z
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 1856 total (3 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2015-01-24 [all 1 reports]