Many languages have a dictionary type to efficiently store values associated with keys, and to provide fast lookup for those keys—for example, key1 -> value1, key2 -> value2, and so on. Red offers two datatypes for this, the hash! and the map!.
With hash!, you get a type that has all the navigational functionality that exists for series. When the key values are simple types, they get hashed, which results in a fast value lookup. First, you define the key, then its value, then a new key with its value, and so on:
h1: make hash! [n 13 m 42 o 108]h1/m ;== 42select h1 [m] ;== 42 select h1 'm ;== 42hash? h1 ;== truehash? [n 13 m 42 o 108] ;== false
Value lookup is done with the path notation hash / key or through ...
