What is the most efficient way of doing inplace set operations with STL?

i.e., if A and B are sets, I want

A = A union B

and A = A intersect B .etc.

I'm assuming that I can't pass A.begin() as the result iterator on the
set algorithms.

Thanks,

Nathan Dodge
ndodge@spacestar.net
---
[ comp.std.c++ is moderated.  To submit articles: Try just posting with your
                newsreader.  If that fails, use mailto:std-c++@ncar.ucar.edu
  comp.std.c++ FAQ: http://reality.sgi.com/austern/std-c++/faq.html
  Moderation policy: http://reality.sgi.com/austern/std-c++/policy.html
  Comments? mailto:std-c++-request@ncar.ucar.edu
]