38 Out copy(In first, In last, Out dst) {  in copy()  argument
39 	while (first != last)  in copy()
52 Out copy_backward(In first, In last, Out dst) {  in copy_backward()  argument
53 	while (first != last)  in copy_backward()
54 		*--dst = *--last;  in copy_backward()
68 Out copy_if(In first, In last, Out dst, Op op) {  in copy_if()  argument
69 	while (first != last) {  in copy_if()
83 signed char *fill(signed char *first, signed char *last, Value val) {  in fill()  argument
84 	memset(first, (val & 0xFF), last - first);  in fill()
85 	return last;  in fill()
89 unsigned char *fill(unsigned char *first, unsigned char *last, Value val) {  in fill()  argument
90 	memset(first, (val & 0xFF), last - first);  in fill()
91 	return last;  in fill()
95 char *fill(char *first, char *last, Value val) {  in fill()  argument
96 	memset(first, (val & 0xFF), last - first);  in fill()
97 	return last;  in fill()
104 In fill(In first, In last, const Value &val) {  in fill()  argument
105 	while (first != last)  in fill()
115 In find(In first, In last, const T &v) {  in find()  argument
116 	while (first != last) {  in find()
121 	return last;  in find()
129 In find_if(In first, In last, Pred p) {  in find_if()  argument
130 	while (first != last) {  in find_if()
135 	return last;  in find_if()
143 Op for_each(In first, In last, Op f) {  in for_each()  argument
144 	while (first != last) f(*first++);  in for_each()
149 unsigned int distance(T *first, T *last) {  in distance()  argument
150 	return last - first;  in distance()
154 unsigned int distance(T first, T last) {  in distance()  argument
156 	while (first != last) {  in distance()
164 T *sortChoosePivot(T *first, T *last) {  in sortChoosePivot()  argument
165 	return first + distance(first, last) / 2;  in sortChoosePivot()
169 T sortChoosePivot(T first, T last) {  in sortChoosePivot()  argument
170 	unsigned int n = distance(first, last);  in sortChoosePivot()
178 T sortPartition(T first, T last, T pivot, StrictWeakOrdering &comp) {  in sortPartition()  argument
179 	--last;  in sortPartition()
180 	if (pivot != last)  in sortPartition()
181 		SWAP(*pivot, *last);  in sortPartition()
184 	for (sorted = first; first != last; ++first) {  in sortPartition()
185 		if (!comp(*last, *first)) {  in sortPartition()
192 	if (last != sorted)  in sortPartition()
193 		SWAP(*last, *sorted);  in sortPartition()
217 void sort(T first, T last, StrictWeakOrdering comp) {  in sort()  argument
218 	if (first == last)  in sort()
221 	T pivot = sortChoosePivot(first, last);  in sort()
222 	pivot = sortPartition(first, last, pivot, comp);  in sort()
224 	sort<T, StrictWeakOrdering>(++pivot, last, comp);  in sort()
231 void sort(T *first, T *last) {  in sort()  argument
232 	sort(first, last, Less<T>());  in sort()
236 void sort(T first, T last) {  in sort()  argument
237 	sort(first, last, Less<typename T::ValueType>());  in sort()