- Get***() functions find pair, never add/allocate. Pairs are sorted so a query is O(log N) - Set***() functions find pair, insertion on demand if missing. - Sorted insertion is costly, paid once. A typical frame shouldn't need to insert any new pair.
source not stored for this graph (policy: none)