<amazigh>
I am wondering how I can put it for good use, any idea?
<amazigh>
It really shines with more than 1k key-value pairs.
otisolsen70 has quit [Ping timeout: 240 seconds]
<marmoute>
amazigh: is it good on cpython too ?
<amazigh>
The benchmark does the following: pick N random integers, stuff them into a dictionary, copy and sort as necessary, query every integers one by one without re-using a cursor, do the same with log-balanced search tree except there is no need for full copies all the time;
<amazigh>
With CPython 3.9, starting with 1,000 key-value pairs it is as fast as copying.
<amazigh>
With PyPy 3.7 that I downloaded a couple of weeks back, it is faster starting at 100 key-value pairs
<amazigh>
I was thinking about building somekind of redis-clone or something like that.