当前位置: 动力学知识库 > 问答 > 编程问答 >

c++ - Categorization of STL algorithms?

问题描述:

I'm trying to become more familiar with STL algorithms, particularly I'm trying to divide them into categories, so far I have 'mutators' and 'inspectors':

Inspectors (do NOT produce side effect on the elements):

std::count_if();

std::includes();

std::find();

Mutators (do produce side effect on the elements):

std::transform();

std::sort();

std::replace();

std::for_each();

std::remove_if();

std::fill_n();

My Question:

1) Are the above categorisations correct? Have I missed any?

2) Are these the only two categories of STL algorithm?

分享给朋友:
您可能感兴趣的文章:
随机阅读: