RadixTree.upperBound

This function searches with policy sp to find the largest right subrange on which pred(value, x) is true for all x (e.g., if pred is "less than", returns the portion of the range with elements strictly greater than value). TODO Add template param (SearchPolicy sp)

TODO replace matchCommonPrefix with something more clever directly finds the next element after rawKey and returns a TreeRange at that point

struct RadixTree(K, V)
@system
upperBound
(
K key
)

Meta