{( , )( , ){( , )( , )( , )( , )( , )size( {( , )( , )( , )( , )( , )remove(find( )( , {( , )( , )( , )( , )find( null {( , )( , )( , )( ,elist-based dictionaries and audit trails simple way of realizing dictionary uses an unordered list to store the key-value entries such an implementation is often called log file or audit trail the primary applications of audit trails are situations where we wish to archive structured data for examplemany operating systems store log files of login requests they process the typical scenario is that there are many insertions into the dictionary but few searches for examplesearching such an operating system log file typically occurs only after something goes wrong thusa list-based dictionary supports simple and fast insertionspossibly at the expense of search timeby storing entries of dictionary in arbitrary order (see figure figure realization of dictionary by means of log file we show only the keys in this dictionaryso as to highlight its unordered list implementation