Lines Matching defs:lastPos
188 RandomAccessIter lastPos = first;
189 for(unsigned u = cache_offset; u < cache_end; lastPos = bin_cache[u], ++u) {
190 size_t count = bin_cache[u] - lastPos;
196 std::sort(lastPos, bin_cache[u]);
198 spread_sort_rec<RandomAccessIter, div_type, data_type>(lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes);
275 RandomAccessIter lastPos = first;
276 for(unsigned u = cache_offset; u < cache_end; lastPos = bin_cache[u], ++u) {
277 size_t count = bin_cache[u] - lastPos;
281 std::sort(lastPos, bin_cache[u], comp);
283 spread_sort_rec<RandomAccessIter, div_type, data_type, right_shift, compare>(lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes, shift, comp);
323 RandomAccessIter lastPos = first;
324 for(unsigned u = cache_offset; u < cache_end; lastPos = bin_cache[u], ++u) {
325 size_t count = bin_cache[u] - lastPos;
329 std::sort(lastPos, bin_cache[u]);
331 spread_sort_rec<RandomAccessIter, div_type, data_type, right_shift>(lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes, shift);
516 RandomAccessIter lastPos = first;
517 for(unsigned u = cache_offset; u < cache_end; lastPos = bin_cache[u], ++u) {
518 size_t count = bin_cache[u] - lastPos;
522 std::sort(lastPos, bin_cache[u]);
524 positive_float_sort_rec<RandomAccessIter, div_type, data_type>(lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes);
567 RandomAccessIter lastPos = first;
568 for(int ii = cache_end - 1; ii >= (int)cache_offset; lastPos = bin_cache[ii], --ii) {
569 size_t count = bin_cache[ii] - lastPos;
573 std::sort(lastPos, bin_cache[ii]);
575 negative_float_sort_rec<RandomAccessIter, div_type, data_type>(lastPos, bin_cache[ii], bin_cache, cache_end, bin_sizes);
618 RandomAccessIter lastPos = first;
619 for(int ii = cache_end - 1; ii >= (int)cache_offset; lastPos = bin_cache[ii], --ii) {
620 size_t count = bin_cache[ii] - lastPos;
624 std::sort(lastPos, bin_cache[ii]);
626 negative_float_sort_rec<RandomAccessIter, div_type, data_type, right_shift>(lastPos, bin_cache[ii], bin_cache, cache_end, bin_sizes, shift);
667 RandomAccessIter lastPos = first;
668 for(int ii = cache_end - 1; ii >= (int)cache_offset; lastPos = bin_cache[ii], --ii) {
669 size_t count = bin_cache[ii] - lastPos;
673 std::sort(lastPos, bin_cache[ii], comp);
675 negative_float_sort_rec<RandomAccessIter, div_type, data_type, right_shift, compare>(lastPos, bin_cache[ii], bin_cache, cache_end, bin_sizes, shift, comp);
739 RandomAccessIter lastPos = first;
740 for(int ii = cache_offset + first_positive - 1; ii >= (int)cache_offset ; lastPos = bin_cache[ii--]) {
741 size_t count = bin_cache[ii] - lastPos;
745 std::sort(lastPos, bin_cache[ii]);
748 negative_float_sort_rec<RandomAccessIter, div_type, data_type>(lastPos, bin_cache[ii], bin_cache, cache_end, bin_sizes);
751 for(unsigned u = cache_offset + first_positive; u < cache_end; lastPos = bin_cache[u], ++u) {
752 size_t count = bin_cache[u] - lastPos;
756 std::sort(lastPos, bin_cache[u]);
759 positive_float_sort_rec<RandomAccessIter, div_type, data_type>(lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes);
824 RandomAccessIter lastPos = first;
825 for(int ii = cache_offset + first_positive - 1; ii >= (int)cache_offset ; lastPos = bin_cache[ii--]) {
826 size_t count = bin_cache[ii] - lastPos;
830 std::sort(lastPos, bin_cache[ii]);
833 negative_float_sort_rec<RandomAccessIter, div_type, data_type, right_shift>(lastPos, bin_cache[ii], bin_cache, cache_end, bin_sizes, shift);
836 for(unsigned u = cache_offset + first_positive; u < cache_end; lastPos = bin_cache[u], ++u) {
837 size_t count = bin_cache[u] - lastPos;
841 std::sort(lastPos, bin_cache[u]);
844 spread_sort_rec<RandomAccessIter, div_type, data_type, right_shift>(lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes, shift);
908 RandomAccessIter lastPos = first;
909 for(int ii = cache_offset + first_positive - 1; ii >= (int)cache_offset ; lastPos = bin_cache[ii--]) {
910 size_t count = bin_cache[ii] - lastPos;
914 std::sort(lastPos, bin_cache[ii]);
917 negative_float_sort_rec<RandomAccessIter, div_type, data_type, right_shift>(lastPos, bin_cache[ii], bin_cache, cache_end, bin_sizes, shift, comp);
920 for(unsigned u = cache_offset + first_positive; u < cache_end; lastPos = bin_cache[u], ++u) {
921 size_t count = bin_cache[u] - lastPos;
925 std::sort(lastPos, bin_cache[u]);
928 spread_sort_rec<RandomAccessIter, div_type, data_type, right_shift>(lastPos, bin_cache[u], bin_cache, cache_end, bin_sizes, shift, comp);
1173 RandomAccessIter lastPos = bin_cache[cache_offset];
1175 for(unsigned u = cache_offset + 1; u < cache_offset + last_bin + 2; lastPos = bin_cache[u], ++u) {
1176 size_t count = bin_cache[u] - lastPos;
1182 std::sort(lastPos, bin_cache[u], offset_lessthan<data_type, unsignedchar_type>(char_offset + 1));
1184 string_sort_rec<RandomAccessIter, data_type, unsignedchar_type>(lastPos, bin_cache[u], char_offset + 1, bin_cache, cache_end, bin_sizes);
1263 RandomAccessIter lastPos = first;
1265 for(unsigned u = cache_offset; u <= cache_offset + last_bin; lastPos = bin_cache[u], ++u) {
1266 size_t count = bin_cache[u] - lastPos;
1272 std::sort(lastPos, bin_cache[u], offset_greaterthan<data_type, unsignedchar_type>(char_offset + 1));
1274 reverse_string_sort_rec<RandomAccessIter, data_type, unsignedchar_type>(lastPos, bin_cache[u], char_offset + 1, bin_cache, cache_end, bin_sizes);
1350 RandomAccessIter lastPos = bin_cache[cache_offset];
1352 for(unsigned u = cache_offset + 1; u < cache_offset + last_bin + 2; lastPos = bin_cache[u], ++u) {
1353 size_t count = bin_cache[u] - lastPos;
1359 std::sort(lastPos, bin_cache[u], offset_char_lessthan<data_type, get_char, get_length>(char_offset + 1));
1361 string_sort_rec<RandomAccessIter, data_type, unsignedchar_type, get_char, get_length>(lastPos, bin_cache[u], char_offset + 1, bin_cache, cache_end, bin_sizes, getchar, length);
1437 RandomAccessIter lastPos = bin_cache[cache_offset];
1439 for(unsigned u = cache_offset + 1; u < cache_offset + last_bin + 2; lastPos = bin_cache[u], ++u) {
1440 size_t count = bin_cache[u] - lastPos;
1446 std::sort(lastPos, bin_cache[u], comp);
1448 string_sort_rec<RandomAccessIter, data_type, unsignedchar_type, get_char, get_length, compare>(lastPos
1528 RandomAccessIter lastPos = first;
1530 for(unsigned u = cache_offset; u <= cache_offset + last_bin; lastPos = bin_cache[u], ++u) {
1531 size_t count = bin_cache[u] - lastPos;
1537 std::sort(lastPos, bin_cache[u], comp);
1539 reverse_string_sort_rec<RandomAccessIter, data_type, unsignedchar_type, get_char, get_length, compare>(lastPos
