Difference between revisions of "Duplicate key in associative list (alist)"
|Line 62:||Line 62:|
[[Category:General Logic ]]
Revision as of 15:06, 4 August 2006
Associative lists should always have unique keys, since having non-unique keys can often be mistaken for an error.
- Design: The use of a safe data structure could be used.
- Languages: Although alists generally are used only in languages like Common Lisp - due to the functionality overlap with hash tables - an alist could appear in a language like C or C++.
- Operating platforms: Any
Likelihood of exploit
Avoidance and mitigation
- Design: Use a hash table instead of an alist.
- Design: Use an alist which checks the uniqueness of hash keys with each entry before inserting the entry.
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.
alist =  while (foo()): #now assume there is a string data with a key basename queue.append(basename,data) queue.sort()
Since basename is not necessarily unique, this may not sort how one would like it to be.