Backward iteration for M-BPTREE

[BrianSipos]

I have an ordered set of numeric intervals defined using BPTREE_DEF() and I would like to be able to search for a value in the set and then iterate to its predecessor (the previous value by order). But it appears that the BPTREE only allows forward iteration using name_next() function.

Is it possible to provide a name_prev() function to iterate toward the front of the set? Or does the internal structure not allow that currently?

Note that my request is for a backward traversal from an forward iterator, not a reverse iterator. Thanks!

[P-p-H-d]

The internal structure does not allow that currently.
If it is really needed now you can use instead RBTREE which supports the PREVIOUS operator.

[BrianSipos]

Okay thank you. The RBTREE will work in my case.