Lines Matching full:algorithm

8 In its most simple form a [*Range Algorithm] (or range-based algorithm) is simply an iterator-based…
11 #include <boost/range/algorithm.hpp>
42 as a template parameter to the algorithm:
57 # it is very ['*safe*] because the algorithm can verify out-of-bounds conditions and handle tricky …
83 … is complex, calling `vec.end()` several times will be more expensive than using a range algorithm.
88 [include algorithm/copy.qbk]
89 [include algorithm/copy_backward.qbk]
90 [include algorithm/fill.qbk]
91 [include algorithm/fill_n.qbk]
92 [include algorithm/generate.qbk]
93 [include algorithm/inplace_merge.qbk]
94 [include algorithm/merge.qbk]
95 [include algorithm/nth_element.qbk]
96 [include algorithm/partial_sort.qbk]
97 [include algorithm/partition.qbk]
98 [include algorithm/random_shuffle.qbk]
99 [include algorithm/remove.qbk]
100 [include algorithm/remove_copy.qbk]
101 [include algorithm/remove_copy_if.qbk]
102 [include algorithm/remove_if.qbk]
103 [include algorithm/replace.qbk]
104 [include algorithm/replace_copy.qbk]
105 [include algorithm/replace_copy_if.qbk]
106 [include algorithm/replace_if.qbk]
107 [include algorithm/reverse.qbk]
108 [include algorithm/reverse_copy.qbk]
109 [include algorithm/rotate.qbk]
110 [include algorithm/rotate_copy.qbk]
111 [include algorithm/sort.qbk]
112 [include algorithm/stable_partition.qbk]
113 [include algorithm/stable_sort.qbk]
114 [include algorithm/swap_ranges.qbk]
115 [include algorithm/transform.qbk]
116 [include algorithm/unique.qbk]
117 [include algorithm/unique_copy.qbk]
121 [include algorithm/adjacent_find.qbk]
122 [include algorithm/binary_search.qbk]
123 [include algorithm/count.qbk]
124 [include algorithm/count_if.qbk]
125 [include algorithm/equal.qbk]
126 [include algorithm/equal_range.qbk]
127 [include algorithm/for_each.qbk]
128 [include algorithm/find.qbk]
129 [include algorithm/find_end.qbk]
130 [include algorithm/find_first_of.qbk]
131 [include algorithm/find_if.qbk]
132 [include algorithm/lexicographical_compare.qbk]
133 [include algorithm/lower_bound.qbk]
134 [include algorithm/max_element.qbk]
135 [include algorithm/min_element.qbk]
136 [include algorithm/mismatch.qbk]
137 [include algorithm/search.qbk]
138 [include algorithm/search_n.qbk]
139 [include algorithm/upper_bound.qbk]
143 [include algorithm/includes.qbk]
144 [include algorithm/set_union.qbk]
145 [include algorithm/set_intersection.qbk]
146 [include algorithm/set_difference.qbk]
147 [include algorithm/set_symmetric_difference.qbk]
151 [include algorithm/push_heap.qbk]
152 [include algorithm/pop_heap.qbk]
153 [include algorithm/make_heap.qbk]
154 [include algorithm/sort_heap.qbk]
158 [include algorithm/next_permutation.qbk]
159 [include algorithm/prev_permutation.qbk]