And that is exactly what I was looking for!
On 11.12.2013 14:27, Vincent Pelletier wrote:
On Wed, 11 Dec 2013 12:27:19 +0200,
Tamer Higazi <tamerito...@arcor.de> wrote :
If i would have 100.000 - 500.000 entries, where 150 would match, I
don't want to go over those completely.
So, if there is a pythonic way to get it solved on a performant way, or
a ZODB way as well that would be wondefull.
BTrees have a very nice API, which allow scanning only a subset of keys
by providing min and max boundaries:
for key, value in some_btree.items(
min='aa', max='b', excludemax=True):
# Do stuff
should do what you want.
For more information about ZODB, see http://zodb.org/
ZODB-Dev mailing list - ZODB-Dev@zope.org