Re: [DTB] issues with numeric casting/built-in functions

Sandro Hawke wrote:

> This functions-are-functions thing is worrying me, too.  This means list
> "union", "intersect", and "except" need to be defined with stable
> ordering, I think, which I believe means they're stuck with n^2
> algorithms.  

I don't think that follows. Take "intersect" for example. You can create 
a hashtable of one list then walk the other list emitting elements (in 
order) if they are also present in the hashtable. That's O(nlog(n)) (or 
O(n) if you think you have a good hash).

Dave