41 Out copy(In first, In last, Out dst) {  in copy()  argument
42 	while (first != last)  in copy()
55 Out copy_backward(In first, In last, Out dst) {  in copy_backward()  argument
56 	while (first != last)  in copy_backward()
57 		*--dst = *--last;  in copy_backward()
71 Out copy_if(In first, In last, Out dst, Op op) {  in copy_if()  argument
72 	while (first != last) {  in copy_if()
86 signed char *set_to(signed char *first, signed char *last, Value val) {  in set_to()  argument
87 	memset(first, (val & 0xFF), last - first);  in set_to()
88 	return last;  in set_to()
92 unsigned char *set_to(unsigned char *first, unsigned char *last, Value val) {  in set_to()  argument
93 	memset(first, (val & 0xFF), last - first);  in set_to()
94 	return last;  in set_to()
98 char *set_to(char *first, char *last, Value val) {  in set_to()  argument
99 	memset(first, (val & 0xFF), last - first);  in set_to()
100 	return last;  in set_to()
107 In set_to(In first, In last, Value val) {  in set_to()  argument
108 	while (first != last)  in set_to()
118 In find(In first, In last, const T &v) {  in find()  argument
119 	while (first != last) {  in find()
124 	return last;  in find()
132 In find_if(In first, In last, Pred p) {  in find_if()  argument
133 	while (first != last) {  in find_if()
138 	return last;  in find_if()
146 Op for_each(In first, In last, Op f) {  in for_each()  argument
147 	while (first != last) f(*first++);  in for_each()
152 unsigned int distance(T *first, T *last) {  in distance()  argument
153 	return last - first;  in distance()
157 unsigned int distance(T first, T last) {  in distance()  argument
159 	while (first != last) {  in distance()
167 T *sortChoosePivot(T *first, T *last) {  in sortChoosePivot()  argument
168 	return first + distance(first, last) / 2;  in sortChoosePivot()
172 T sortChoosePivot(T first, T last) {  in sortChoosePivot()  argument
173 	unsigned int n = distance(first, last);  in sortChoosePivot()
181 T sortPartition(T first, T last, T pivot, StrictWeakOrdering &comp) {  in sortPartition()  argument
182 	--last;  in sortPartition()
183 	SWAP(*pivot, *last);  in sortPartition()
186 	for (sorted = first; first != last; ++first) {  in sortPartition()
187 		if (!comp(*last, *first)) {  in sortPartition()
194 	SWAP(*last, *sorted);  in sortPartition()
203 void sort(T first, T last, StrictWeakOrdering comp) {  in sort()  argument
204 	if (first == last)  in sort()
207 	T pivot = sortChoosePivot(first, last);  in sort()
208 	pivot = sortPartition(first, last, pivot, comp);  in sort()
210 	sort<T, StrictWeakOrdering>(++pivot, last, comp);  in sort()
217 void sort(T *first, T *last) {  in sort()  argument
218 	sort(first, last, Common::Less<T>());  in sort()
222 void sort(T first, T last) {  in sort()  argument
223 	sort(first, last, Common::Less<typename T::ValueType>());  in sort()