From f7bbf2c1d8d780294f3e016aff239ca35eb6516e Mon Sep 17 00:00:00 2001
From: Marcus Müller <mmueller@gnuradio.org>
Date: Wed, 7 Aug 2019 21:45:12 +0200
Subject: Tree: clang-format without the include sorting
---
gr-trellis/lib/quicksort_index.cc | 76 +++++++++++++++++++--------------------
1 file changed, 37 insertions(+), 39 deletions(-)
(limited to 'gr-trellis/lib/quicksort_index.cc')
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 */
--
cgit v1.2.3