Tables
- ADT Table
- aka Dictionary, aka Mapping, aka Map (STL terminology)
- Stores <key,data> pairs
- Accesses data (insert, remove, retrieve) by key
- ADT Associative Array
- Basically, a table, with alternate interface:
- A bracket operator with special insert semantics
- The bracket operator is an AA method, not an iterator method
- Bracket operator does not support "pointer arithmetic"
- Unimodal Semantics
- Duplicate elements not allowed
- Insert operations have dual personality:
- If key is in table, then insert overwrites data
- If key is not in table, then insert adds key,data pair into table
|