On Jul 21, 5:20 pm, Raymond Hettinger <[EMAIL PROTECTED]> wrote:
> On Jul 21, 12:08 pm, castironpi <[EMAIL PROTECTED]> wrote:
>
> > Some time ago, I was asking about the feasibility of a persistent
> > deque, a double-ended queue.
>
> > It runs into the typical space allocation problems.
>
> Try
On Jul 21, 12:08 pm, castironpi <[EMAIL PROTECTED]> wrote:
> Some time ago, I was asking about the feasibility of a persistent
> deque, a double-ended queue.
>
> It runs into the typical space allocation problems.
Try starting with a dict-based implementation of a double-ended queue
( http://asp
On 2008-07-21 21:08, castironpi wrote:
Some time ago, I was asking about the feasibility of a persistent
deque, a double-ended queue.
You might want to have a look at mxBeeBase:
http://www.egenix.com/products/python/mxBase/mxBeeBase/
Using the integer index you could probably write an on-disk
castironpi wrote:
Some time ago, I was asking about the feasibility of a persistent
deque, a double-ended queue.
It runs into the typical space allocation problems. If you're storing
a pickle, you have to allocate and fragment the file you've opened,
since pickles can be variable-length strings
Some time ago, I was asking about the feasibility of a persistent
deque, a double-ended queue.
It runs into the typical space allocation problems. If you're storing
a pickle, you have to allocate and fragment the file you've opened,
since pickles can be variable-length strings; i.e. if the new da
