class unsortedtablemap(mapbase) """map implementation using an unordered list "" def init (self) """create an empty map ""list of item' self table def getitem (selfk) """return value associated with key (raise keyerror if not found"" for item in self table if =item key return item value raise keyerrorkey errorrepr( ) def setitem (selfkv) """assign value to key koverwriting existing value if present "" for item in self tablefound match if =item keyreassign value item value return and quit did not find match for key self table append(self item( , ) def delitem (selfk) """remove item associated with key (raise keyerror if not found"" for in range(len(self table))found match if =self table[jkeyremove item self table pop( return and quit raise keyerrorkey errorrepr( ) def len (self) """return number of items in the map "" return len(self table def iter (self) """generate iteration of the map keys "" for item in self tableyield the key yield item key code fragment an implementation of map using python list as an unsorted table parent class mapbase is given in code fragment