Hi All,
I was wondering whether anyone had implemented a FIFO persistent queue
class which has the following conflict resolution strategy:
two concurrent adds: adds both new items to the end of the queue in a
time-based order
one add and one remove happening concurrently: add the new item and
remove the removed item
two concurrent removes: re-raise the conflict error.
I can't imagine it'd be hard to knock one up in python if not, in which
case:
- is there any similar python code I can look at for examples?
- how would I write unit tests for the above 3 cases?
cheers,
Chris
--
Simplistix - Content Management, Zope & Python Consulting
- http://www.simplistix.co.uk
_______________________________________________
For more information about ZODB, see the ZODB Wiki:
http://www.zope.org/Wikis/ZODB/
ZODB-Dev mailing list - ZODB-Dev@zope.org
http://mail.zope.org/mailman/listinfo/zodb-dev
