On Oct 8, 3:05 pm, Terry Reedy <tjre... at udel.edu> wrote: > > doesn't imply that the sequence I need is easiest defined by > > using aninclusivelower limit. What if I wanted all none-empty > > strings/tuples keys in the tree? > > Use 'a' as the lower bound, it being the string that follows ''. No, that would be '\0'. Ian