From 4e2ee8a14e89f2481ca39df3716b08ff2064cd53 Mon Sep 17 00:00:00 2001
From: Jiri Pittner <jiri@pittnerovi.com>
Date: Fri, 28 Oct 2022 19:59:33 +0200
Subject: [PATCH] implementation of NRVec::permuted moved to permutation.h

---
 permutation.h | 26 ++++++++++++++++++++++++++
 vec.cc        | 25 -------------------------
 2 files changed, 26 insertions(+), 25 deletions(-)

diff --git a/permutation.h b/permutation.h
index 52f76ad..326e755 100644
--- a/permutation.h
+++ b/permutation.h
@@ -240,5 +240,31 @@ template <typename T>
 extern std::ostream & operator<<(std::ostream &s, const Sn_characters<T> &c);
 
 
+template<typename T>
+const NRVec<T> NRVec<T>::permuted(const NRPerm<int> &p, const bool inverse) const
+{
+#ifdef DEBUG
+if(!p.is_valid()) laerror("invalid permutation of vector");
+#endif
+int n=p.size();
+if(n!=(*this).size()) laerror("incompatible permutation and vector");
+#ifdef CUDALA
+        if(this->getlocation() != cpu || p.getlocation() != cpu ) laerror("permutations can be done only in CPU memory");
+#endif
+NRVec<T> r(n);
+if(inverse) for(int i=1; i<=n; ++i) r[i-1] = v[p[i]-1];
+else for(int i=1; i<=n; ++i) r[p[i]-1] = v[i-1];
+return r;
+}
+
+template<typename T> 
+void NRVec<T>::permuteme(const NRPerm<int> &p, bool inverse)
+{
+NRVec<T> tmp=permuted(p,inverse);
+for(int i=0; i<size(); ++i) v[i] = tmp.v[i];
+}
+
+
+
 }//namespace
 #endif
diff --git a/vec.cc b/vec.cc
index 01d524e..127014e 100644
--- a/vec.cc
+++ b/vec.cc
@@ -823,31 +823,6 @@ NRVec<std::complex<double> > complexify(const NRVec<double> &rhs) {
 #endif
 	return r;
 }
-
-template<typename T>
-const NRVec<T> NRVec<T>::permuted(const NRPerm<int> &p, const bool inverse) const
-{
-#ifdef DEBUG
-if(!p.is_valid()) laerror("invalid permutation of vector");
-#endif
-int n=p.size();
-if(n!=(*this).size()) laerror("incompatible permutation and vector");
-#ifdef CUDALA
-        if(this->getlocation() != cpu || p.getlocation() != cpu ) laerror("permutations can be done only in CPU memory");
-#endif
-NRVec<T> r(n);
-if(inverse) for(int i=1; i<=n; ++i) r[i-1] = v[p[i]-1];
-else for(int i=1; i<=n; ++i) r[p[i]-1] = v[i-1];
-return r;
-}
-
-template<typename T> 
-void NRVec<T>::permuteme(const NRPerm<int> &p, bool inverse)
-{
-NRVec<T> tmp=permuted(p,inverse);
-for(int i=0; i<size(); ++i) v[i] = tmp.v[i];
-}
-
 template<typename T>
 void NRVec<T>::permuteme(const CyclePerm<int> &p)
 {