14:28 <beneroth> abu[7], to get the minKey object of a tree (e.g. rel 'id (+Need +Key +Number), (leaf 'tree) could be used. To get the object with the maxKey it is (db 'id '+Item (maxKey (tree 'id '+Item))) right? Or is there a leaf-equivalent for maxKey?

14:29 <beneroth> I guess (leaf) only needs one index access, while (db ... (maxKey)) accesses the index twice

14:32 <beneroth> I just looked at implementation of (leaf), it's just a while going through the index, so I guess it would be trivial to implement a variant leafMax or so...

14:39 <abu[7]> Hi beneroth! The number of accesses should be the same iirc, just maxKey is more complicated because is supports a range

14:40 <abu[7]> I would not worry here

14:40 <beneroth> T about the not worrying, you're right :)

14:41 <beneroth> but access should be two, or do I overlook something? 1. maxKey accessing the index to find the maximal key, 2. db accessing the index to find the obj for the key

14:42 <beneroth> other question: what's the reason for the existence of (leaf) ?

14:42 <beneroth> if you recall - otherwise nevermind ;-)

14:45 <abu[7]> The object is in the same node

14:48 <abu[7]> I don't reme member well, pro bably for a optimized access

14:48 <abu[7]> I find code like http://pb1n.de/?a24527

14:52 <beneroth> makes sense

14:52 <beneroth> thanks!

16:30 <abu[7]> beneroth, you are right with the double access of course. 'minKey' returns the *key*, not the value

16:34 <beneroth> T

16:34 <beneroth> (leaf) does single access