Read Time:38 Second
Description
Duplicate keys in associative lists can lead to non-unique keys being mistaken for an error.
A duplicate key entry — if the alist is designed properly — could be used as a constant time replace function. However, duplicate key entries could be inserted by mistake. Because of this ambiguity, duplicate key entries in an association list are not recommended and should not be allowed.
Modes of Introduction:
– Architecture and Design
Likelihood of Exploit: Low
Related Weaknesses
Consequences
Other: Quality Degradation, Varies by Context
Potential Mitigations
Phase: Architecture and Design
Description:
Use a hash table instead of an alist.
Phase: Architecture and Design
Description:
Use an alist which checks the uniqueness of hash keys with each entry before inserting the entry.