And that is exactly what I was looking for!
Thanks!
Tamer
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.
On Wed, Dec 11, 2013 at 3:27 AM, Tamer Higazi tamerito...@arcor.de wrote:
Perhaps it's my fault, the way I stored the data.
The point is, that I am looking the fastest and performant way to grab the
data from a big pool.
I do not think folks are suggesting you iterate over the big pool
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
you might be interested in
https://pypi.python.org/pypi/souper/
which addresses this kind of problem
hth Jens
On 2013-12-10 23:46, Tamer Higazi wrote:
Hi people!
I am working a lot with IOB and OOB Trees as well with PersistentDict
and PersistentList to store my Data in ZODB.
I want to ask if
ZODB has nothing built-in. You build it on top of the ZODB. I think
what you are looking for is something like Hypatia -
https://github.com/Pylons/hypatia
On Tue, Dec 10, 2013 at 4:46 PM, Tamer Higazi tamerito...@arcor.de wrote:
Hi people!
I am working a lot with IOB and OOB Trees as well
Hi Tamer,
It depends on what you're trying to achieve. BTrees should not be mutated
whilst iterating over them, so depending on how you have structured your
data, you might do something like:
for key in [x for x in BTree.keys() if x.startswith('aa')]:
# Do stuff
Or perhaps something else
