A data structure that uses a linked list to store pairs of keys and values. Any key must appear at most once in the dictionary, but values may appear multiple times. Key operations are get(key), put(key, value), and contains(key) methods. The value associated to a key is the value in the last cal
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected