程序考试经验交流.pptVIP

Modification copy Copy range of elements copy_if Copy certain elements of range swap Exchange values of two objects swap_ranges Exchange values of two ranges transform Transform range replace Replace value in range replace_if Replace values in range generate Generate values for range with function remove Remove value from range remove_if Remove elements from range unique Remove consecutive duplicates in range reverse Reverse range rotate Rotate left the elements in range Partition Sorting is_partitioned Test whether range is partitioned partition Partition range in two stable_partition Partition range in two - stable ordering partition_point Get partition point sort Sort elements in range stable_sort Sort elements preserving order of equivalents partial_sort Partially sort elements in range is_sorted Check whether range is sorted nth_element Sort element in range Binary search Merge lower_bound Return iterator to lower bound upper_bound Return iterator to upper bound equal_range Get subrange of equal elements binary_search Test if value exists in sorted sequence merge Merge sorted ranges inplace_merge Merge consecutive sorted ranges includes Test whether sorted range includes another sorted range set_union Union of two sorted ranges set_intersection Intersection of two sorted ranges set_difference Difference of two sorted ranges set_symmetric_difference Symmetric difference of two sorted ranges Min/max Other min Return the smallest max Return the largest min_element Return smallest element in range max_element Return largest element in range next_permutation Transform range to next permutation prev_permutation Transform range to previous permutation Feel free to ask questions Bonus slide: lambda std::arrayint,7 foo {1,2,3,4,5,6,7}; std::partition(foo.begin(), foo.end(), [](int x){ return x % 2 == 1; }); auto comp = [](Person x, Person y){ return x.rank y.rank; }; std::setPerson, decltype(comp) sp(comp); * 1 两次stable partition 一次rotate * 程序