| To: | scsh-news@martigny.ai.mit.edu |
|---|---|
| Subject: | Re: Object IDs are bad (was: Ousterhout and Tcl lost the plot with latest paper) |
| From: | Chris.Bitmead@alcatel.com.au (Chris Bitmead uid(x22068)) |
| Date: | 28 Apr 1997 11:34:36 +1000 |
| Organization: | Alcatel Australia Limited |
ark@research.att.com (Andrew Koenig) writes: > > In the tree example that you started with, what is wrong with just > > passing round the whole subtree so that it can be compared with as > > necessary? Any reasonable implementation will only be passing round a > > pointer so you lose nothing. > > Because it will compare equal with any other subtree that happens to > have the same structure, which is not what I want. So all you have to do is generate a unique name for each node, right? Just an incremental number perhaps. |
| Previous by Date: | Re: Ousterhout and Tcl lost the plot with latest paper, Chris Bitmead uid(x22068) |
|---|---|
| Next by Date: | Re: Object IDs are good ( was: Object IDs are bad ), Paul Wilson |
| Previous by Thread: | Re: Object IDs are bad (was: Ousterhout and Tcl lost the plot with latest paper), Andrew Koenig |
| Next by Thread: | Re: Object IDs are bad (was: Ousterhout and Tcl lost the plot with latest paper), Andrew Koenig |
| Indexes: | [Date] [Thread] [Top] [All Lists] |