[LLVMdev] set_intersect and Visual C compiler

[Chris Lattner]

On Tue, 12 Oct 2004, Alkis Evlogimenos wrote:

> On Tuesday 12 October 2004 14:01, Chris Lattner wrote:
> > Okay, it's pretty simple.  Given two sets (e.g. std::set), it walks
> > through one of them.  For each element in the set it checks to see if the
> > other contains the element.  if not it removes it.
>
> This is a N log(M) algorithm. Why don't we use the set_intersection
> algorithm which runs in N+M time?

I would have no problem with that :)

-Chris

-- 
http://llvm.org/
http://nondot.org/sabre/