[Prev][Next][Index][Thread]

# Re: List operations (Was: More LPMOO stuff)

- Date: Wed, 16 Aug 1995 08:22:31 PDT
- From:
- Cc: anomaly@u.washington.edu, moo-cows@parc.xerox.com
- Content-Type: TEXT/PLAIN; charset=US-ASCII
- In-Reply-To: <199508152007.NAA03099@crg8.sequent.com>

    > It would save you the extra time of *typing* length(list).  The length
    > will still have to be evaluated.  In either case it's O(1), since list[0]
    > contains the length (it's inaccessible from MOOcode).  I don't think you
    > can argue that this would be a performance improvement.

    You mean, if I delete those if(thingy==0) return E_RANGE; endif lines,
    then list[1..list[0]] will return the same as just 'list'?  Wouldn't this
    both make things easier, and be a teenyweeny optimization?  Could someone
    make up a patch for this... or tell me where this code is so I can tinker
    /w it?

    - Kipp

- Prev: Re: List operations (Was: More LPMOO stuff)
- Next: Re: List operations (Was: More LPMOO stuff)
- Index: MOO-cows
- Thread: MOO-cows

Home | Subject Index | Thread Index