How are object oriented constructs (such as CLOS or FLAVORS) implemented to
be both fast and memory efficient? You could be fast but waste memory by
having a list of methods for each type hanging off of the generic function,
then just index directly into that list to find the proper method. Or you
could use a more compact representation that requires some search each time
the function is called. Can someone briefly describe how this is done in
CLOS|FLAVORS? (What's the best way to implement generic functions?)