|
Tahir |
at Oct 14, 2014 at 5:33 pm
|
⇧ |
| |
I have code for Ctries in Go (but without snapshot hence not open sourced
yet and I need to write some more test first anyway). But I've realized
that the algorithm is more interesting than the implementation, namely the
use of indirection nodes (could probably be used to have more granular
locks on some objects too).
The thing is that you always have to tread cautiously when you nest lock
free structures. The result of a naive composition is not thread safe in
general.
Typically when you deal with concurrent inserts/deletes in the lock free
container and the lock free object.
On Monday, October 13, 2014 6:27:52 PM UTC+1, Jason E. Aten wrote:
Is anyone aware of open source golang implementation(s) of the data
structures underlying clojure's persistent vectors and trees; e.g. Phil
Bagwell's data structures?
Thanks.
J
--
You received this message because you are subscribed to the Google Groups "golang-nuts" group.
To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscribe@googlegroups.com.
For more options, visit
https://groups.google.com/d/optout.