Every item in D contains a key from the linearly ordered data type K , called the key type of D , and an information from the data type I , called the information type of D . The number of items in D is called the size of D . A dictionary of size zero is called the empty dictionary. In both cases the item is returned.
Precondition there is an item with key k in D .
Here n is the current size of the dictionary. We count the number of occurrences of each string in a sequence of strings. Copyright 1998-2001, Algorithmic Solutions Software GmbH . All rights reserved.