FREE Subscription to Dr. Dobb’s Digest: Same Great Content, New Digital Edition
Site Archive (Complete)
ABOUT US | CONTACT | ADVERTISE | SUBSCRIBE | SOURCE CODE | NEWSLETTERS | RESOURCES | BLOGS | PODCASTS | GO PARALLEL
C++
Email
 Print
Reprint

add to:
Del.icio.us
Digg
Google
Furl 		Slashdot
Y! MyWeb
Blink
October 01, 2004

Ranges: Concepts and Implementations

(Page 6 of 6)

October, 2004: Ranges: Concepts and Implementations

Table 1: Range algorithms currently provided by the STLSoft implementation of RangeLib.

Algorithm STL equivalent Notional Iterable Indirect
r_accumulate() std::accumulate() Yes Yes Yes
r_copy() std::copy() Yes Yes Yes
r_count() std::count() Yes Yes Yes
r_count_if() std::count() Yes Yes Yes
r_distance() std::distance() Yes Yes Yes
r_equals() std::equals() Yes Yes -
r_exists() - Yes Yes Yes
r_exist_if() - Yes Yes Yes
r_fill() std::fill() - Yes -
r_fill_n() std::fill_n() - Yes -
r_find() std::find() Yes Yes -
r_find_if() std::find_if() Yes Yes -
r_for_each() std::for_each() Yes Yes Yes
r_generate() std::generate() - Yes -
r_max_element() std::max_element() Yes Yes Yes
r_min_element() std::min_element() Yes Yes Yes
r_replace() std::replace() - Yes Yes
r_replace_if() std::replace_if() - Yes Yes

Previous Page | 1 | 2 | 3 | 4 | 5 | 6
TOP 5 ARTICLES
No Top Articles.



MICROSITES
FEATURED TOPIC

ADDITIONAL TOPICS

INFO-LINK



 




| All Feeds
© 2009 TechWeb, Privacy Policy, Terms of Service, United Business Media LLC
Comments about the web site: webmaster@ddj.com