Alists with ordered keys.
The
This book defines a recognizer for alists whose key-value pairs are kept with ordered keys. A default value of 0 is returned when such an ordered alist has no associated key. Our initial use for this package is to model sparse memories while maintaining memory-style access and update functions.