Reference: Effective STL
by Scott Meyers, Addison-Wesley, 2001. p. 147.
Friday, December 4, 2009
STL Algorithms
These STL algorithms require that their input be sorted: binary_search, upper_bound, set_union, set_difference, merge, includes, lower_bound, equal_range, set_interaction, set_symmetric_difference, and inplace_merge.
Reference: Effective STL by Scott Meyers, Addison-Wesley, 2001. p. 147.
Reference: Effective STL
by Scott Meyers, Addison-Wesley, 2001. p. 147.
Subscribe to:
Post Comments (Atom)
Posts
No comments:
Post a Comment