Persistent Queue implementations?

[Aahz]

In article <ddc19db7.0212250157.437c3cf7 at posting.google.com>,
Armin Steinhoff <a-steinhoff at web.de> wrote:
>aahz at pythoncraft.com (Aahz) wrote in message news:<auaja2$sod$1 at panix2.panix.com>...
>> In article <au833j$a7f$1 at baldur.whoi.edu>,
>> Karl A. Krueger <kkrueger at example.edu> wrote:
>>>
>>>Using pickle in the most obvious way (pickling the whole queue) would
>>>have to be done in every put() and get() call, since the copy on disk
>>>needs to reflect the copy in memory.  And pickling the whole queue would
>>>be -slow-, since it would have to write the whole queue each time --
>>>keeping it locked for read, and thus blocking all the threads that want
>>>to write to it.
>> 
>> Just how much ACID do you need, anyway?  If you really care, you should
>> use a full-blown database.
>
>Give gadfly a try ... it's completely written in Python.

Is gadfly thread-safe?  Does it support transactions?  (I believe the
answers are "no" and "yes", but I'm not sure.)
-- 
Aahz (aahz at pythoncraft.com)           <*>         http://www.pythoncraft.com/

"I disrespectfully agree."  --SJM