This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug libstdc++/66418] Optimize set_intersection when one list is much smaller and the other has random access
- From: "glisse at gcc dot gnu.org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Thu, 04 Jun 2015 20:57:45 +0000
- Subject: [Bug libstdc++/66418] Optimize set_intersection when one list is much smaller and the other has random access
- Auto-submitted: auto-generated
- References: <bug-66418-4 at http dot gcc dot gnu dot org/bugzilla/>
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=66418
--- Comment #1 from Marc Glisse <glisse at gcc dot gnu.org> ---
Two relevant links to optimize set_intersection (they consider the intersection
of k sets, but the case k=2 is still interesting)
http://erikdemaine.org/papers/SODA2000/
http://erikdemaine.org/papers/ALENEX2001/
(I am sure there are many others)