Hanno Schlichting wrote:
> On Tue, Jul 13, 2010 at 11:23 AM, Suresh V. wrote:
>> While trying to run manage_cleanup on my BTreeFolder2, I get a KeyError
>> from the classify function in Module BTrees.check:
>>
>> def classify(obj):
>> return _type2kind[type(obj)]
>>
>> I see that obj is None a
Morning,
On 07/13/2010 09:11 PM, Jim Fulton wrote:
> I need to get back to finishing 3.10. :)
Heh. Are any particular bugs you'd like to get solved? Today is a bug
day and I might look at one or two.
Christian
--
Christian Theune · c...@gocept.com
gocept gmbh & co. kg · forsterstraße 29 · 061
I need to get back to finishing 3.10. :)
This particular release has some fixes that address our last known
remaining issues with using persistent ZEO caches.
This release also supports Python 2.7.
Jim
--
Jim Fulton
___
For more information about ZODB
Hello, in ZODB.DB, I saw this:
There's no limit on the number of connections this can keep track of,
but a warning is logged if there are more than pool_size active
connections, and a critical problem if more than twice pool_size.
I think it mean that the number of connections should be less than
On Tue, Jul 13, 2010 at 7:51 AM, Pedro Ferreira
wrote:
...
> Hmm... no, in fact the problem is that most of the time I will have only one
> value per index entry.So, in a relational DB i would do something like:
As I mentioned in some text you didn't quote, you could use a strategy
of storing a s
> If you use the timestamp as the key and you want to retrieve all values
> between two timestamps (inclusive), you can do
>
> my_btree.values(min=start, max=end)
>
Yes, but, as I mentioned in my answer to Jim's mail, my concern is the
performance of this "range" operation for a very la
> So, the issue is that you have multiple items with the same
> key. This is simply handled by using sets as values ion a BTree.
> There are existing index implementations that do this.
>
>
Hmm... no, in fact the problem is that most of the time I will have only
one value per index entry.So,
On Tue, Jul 13, 2010 at 4:35 AM, Pedro Ferreira
wrote:
> Hello,
>>> I am currently trying to devise a way to index and retrieve some
>>> millions of objects according to their modification date/time.
> So, in a relational DB i would do something like:
>
> SELECT * FROM table WHERE timestamp >= X
On Tue, Jul 13, 2010 at 4:35 AM, Pedro Ferreira
wrote:
> Hello,
>>>
>>> I am currently trying to devise a way to index and retrieve some
>>> millions of objects according to their modification date/time. One of
>>> the problems I'm facing is that of index "granularity": I'd like to
>>> provide "to
On Tue, Jul 13, 2010 at 11:23 AM, Suresh V. wrote:
> While trying to run manage_cleanup on my BTreeFolder2, I get a KeyError
> from the classify function in Module BTrees.check:
>
> def classify(obj):
> return _type2kind[type(obj)]
>
> I see that obj is None at this point.
>
> Anyway I can pat
While trying to run manage_cleanup on my BTreeFolder2, I get a KeyError
from the classify function in Module BTrees.check:
def classify(obj):
return _type2kind[type(obj)]
I see that obj is None at this point.
Anyway I can patch the code to run around this?
Thanks.
Suresh
___
Hello,
>> I am currently trying to devise a way to index and retrieve some
>> millions of objects according to their modification date/time. One of
>> the problems I'm facing is that of index "granularity": I'd like to
>> provide "to the second" granularity,
>>
> will there ever be more than
12 matches
Mail list logo
