TreeCounter

Wait-free Tree Counter https://github.com/Julek

Latest on Hackage:

0.0.2

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

BSD3 licensed by Julian Sutherland

Maintained by Julian Sutherland (julian.sutherland10@imperial.ac.uk)

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. (UPDATE: removed useless dependency)

Depends on:

base, ref-mtl, stm

Used by 1 package:

acme-everything