[Oberon] How to mimic an associative array (2)

[Les May]

Oberon people emphasise the virtues of simplicity.

The original suggestion by Duke is easy to understand and simple to 
implement.

Present day computers have huge memories so the size of the array to 
store these records is not an issue in most cases. Present day computers 
run very fast so search times are not likely to be an issue even if the 
array is quite large and a brute force method of searching for the key 
is used.

Why use more complicated methods if a simple method will do the job?

Les May