diff options
| author | Marcus Müller <mmueller@gnuradio.org> | 2019-08-07 21:45:12 +0200 |
|---|---|---|
| committer | Marcus Müller <marcus@hostalia.de> | 2019-08-09 23:04:28 +0200 |
| commit | f7bbf2c1d8d780294f3e016aff239ca35eb6516e (patch) | |
| tree | e09ab6112e02b2215b2d59ac24d3d6ea2edac745 /gr-trellis/lib/quicksort_index.cc | |
| parent | 78431dc6941e3acc67c858277dfe4a0ed583643c (diff) | |
Tree: clang-format without the include sorting
Diffstat (limited to 'gr-trellis/lib/quicksort_index.cc')
| -rw-r--r-- | gr-trellis/lib/quicksort_index.cc | 76 |
1 files changed, 37 insertions, 39 deletions
diff --git a/gr-trellis/lib/quicksort_index.cc b/gr-trellis/lib/quicksort_index.cc index 2e7c21907a..aeccdb65ef 100644 --- a/gr-trellis/lib/quicksort_index.cc +++ b/gr-trellis/lib/quicksort_index.cc @@ -23,48 +23,46 @@ #include <gnuradio/trellis/quicksort_index.h> namespace gr { - namespace trellis { +namespace trellis { - template <class T> void - SWAP(T & a, T & b) - { - T temp = a; - a = b; - b = temp; - } +template <class T> +void SWAP(T& a, T& b) +{ + T temp = a; + a = b; + b = temp; +} - template <class T> void - quicksort_index (std::vector<T> & p, std::vector<int> & index, - int left, int right) - { - if(left < right) { - int i = left; - int j = right + 1; - T pivot = p[left]; - do { - do - i++; - while ((p[i] < pivot) && (i < right)); - do - j--; - while ((p[j] > pivot) && (j > left)); - if (i < j) { - SWAP <T> (p[i],p[j]); - SWAP <int> (index[i],index[j]); - } - } while (i < j); - SWAP <T> (p[left], p[j]); - SWAP <int> (index[left], index[j]); - quicksort_index <T> (p,index, left, j-1); - quicksort_index <T> (p,index, j+1, right); - } +template <class T> +void quicksort_index(std::vector<T>& p, std::vector<int>& index, int left, int right) +{ + if (left < right) { + int i = left; + int j = right + 1; + T pivot = p[left]; + do { + do + i++; + while ((p[i] < pivot) && (i < right)); + do + j--; + while ((p[j] > pivot) && (j > left)); + if (i < j) { + SWAP<T>(p[i], p[j]); + SWAP<int>(index[i], index[j]); + } + } while (i < j); + SWAP<T>(p[left], p[j]); + SWAP<int>(index[left], index[j]); + quicksort_index<T>(p, index, left, j - 1); + quicksort_index<T>(p, index, j + 1, right); } +} - // instantiate an <int> version of the quicksort_index - //template <int> void SWAP (int & a, int & b); - template void - quicksort_index<int>(std::vector<int> & p, std::vector<int> & index, - int left, int right); +// instantiate an <int> version of the quicksort_index +// template <int> void SWAP (int & a, int & b); +template void +quicksort_index<int>(std::vector<int>& p, std::vector<int>& index, int left, int right); - } /* namespace trellis */ +} /* namespace trellis */ } /* namespace gr */ |