| | | | | |

Ordered Table API Semantics

Table API, plus

  • Same as unordered case for operations they have in common
  • Traversal of table encounters keys in sorted order
  • Iterator i = LowerBound(k):
    i points to first pair (k1,d1) in table such that k <= k1
  • Iterator i = UpperBound(k):
    i points to first pair (k1,d1) in table such that k < k1

| | Top of Page | 10. Introduction to Maps - 5 of 11