find_first_of: A performance pitfall among the STL algorithms

Jim Xochellis

Rate me:

4.93/5 (36 votes)

18 Jun 2007CPOL18 min read

113.2K

247

This article is discussing the performance problems found in the most notable find_first_of implementations and suggests useful improvements and workarounds.

Revisions

Compare	Revision	Minor	Date	Status	Editor
	1 - publicly available	No	18-Jun-07 11:08	Available	Genevieve Sovereign

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Written By

Jim Xochellis

Software Developer

Greece

I live in Greece with my wife and our two daughters. I am a professional software developer since 1999, using mostly C/C++ in my work.

My main expertise are: C/C++, STL, software optimization, generic programming and debugging. I am also very experienced in client–server programming, communications, concurrent programming, software security and cryptography. Finally, in my early professional years, I have worked a lot on cross-platform programming (Mac+Win).

I am familiar with the MFC, wxWidgets and Cplat GUI frameworks and the Python, Java, Pascal, Fortran, Prolog and Rexx programming languages.

find_first_of: A performance pitfall among the STL algorithms

Revisions

License

Comments and Discussions