Re: RFC 179 (v1) More functions from set theory to manipulate arrays

[Chaim Frenkel]

>>>>> "TC" == Tom Christiansen <[EMAIL PROTECTED]> writes:

TC> The overhead is not that it should be a module, but rather, 
TC> the sillily/evilly inefficient thing that *you* are doing.  
TC> Or trying to do.

Why, For example, I need it as a sorted array 90% of the time. Some of
the time I need/want to add a unique element. So, what do I do, keep
it as an array and sort every time I access it? Keep two copies one as
the hash the other as an array?

TC> We have modules to do this.  We have hashes to do this.  
TC> We have the technology.  It is ignored.  Ignorance of
TC> technology is no excuse for adding strange basic types
TC> and operations on them into the very heart of a programming
TC> language.

I'm not ignorant of the technology. But having a method that directly
represents my thought process, and does something that I need would be
a win for me.

Time for another missive in language design of why pop and push,
shift and unshift are in, but union and intersection are not.

<chaim>
-- 
Chaim Frenkel                                        Nonlinear Knowledge, Inc.
[EMAIL PROTECTED]                                               +1-718-236-0183