Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!think.com!samsung!munnari.oz.au!goanna!ok From: ok@goanna.cs.rmit.oz.au (Richard A. O'Keefe) Newsgroups: comp.lang.scheme Subject: Re: looking for balancing (binary/avl) tree programs Message-ID: <5863@goanna.cs.rmit.oz.au> Date: 21 May 91 01:43:27 GMT References: <1991May20.150025.16099@uicbert.eecs.uic.edu> Distribution: comp Organization: Comp Sci, RMIT, Melbourne, Australia Lines: 22 In article , markf@zurich.ai.mit.edu (Mark Friedman) writes: > I have placed pub/btree.scm on altdorf.ai.mit.edu available for > anonymous FTP. Chris Hanson wrote it (based on Knuth). I believe that > it is vanilla Scheme, except for some DEFINE-INTEGRABLE's that you may > feel free to change to DEFINE's. I've added #|...|# syntax to my copy of Elk, but it isn't standard Scheme. The calls to (error ...) will need to be changed too. (Wouldn't it be nice if the standard had specified the interface to 'error', like CLtL1 did?) The thing that really worries me is that the last line of the file that I picked up was incomplete. It read " (case-3)))))" (minus the quotes), and the file just *stopped* at that point without even the LF that one expects to terminate every line. Is anything more than the LF missing? Is there some documentation for this file? What is "wrapping" and "unwrapping" a key about? Not having a copy of Knuth V3 handy, what is the method used here? It looks as though it might be AVL, but there seems to be too much code for it to be that. -- There is no such thing as a balanced ecology; ecosystems are chaotic.