Guido van Rossum wrote: > Using the classic [depth-first, left-right] lookup rule, construct the > list of classes that would be searched, including duplicates. Now for > each class that occurs in the list multiple times, remove all > occurrences except for the last. The resulting list contains each > ancestor class exactly once Is this original or is it used by other languages as well? My books on Dylan and CLOS are at home but I think they do something similar. Neil
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4