From ba5adcd5e640de1f8e0f2137dc51a3c645562bf3 Mon Sep 17 00:00:00 2001
From: Jiri Pittner <jiri@pittnerovi.com>
Date: Sun, 16 Nov 2025 14:56:29 +0100
Subject: [PATCH] rename conjugate_by to conjugated_by

---
 permutation.cc | 8 ++++----
 permutation.h  | 6 +++---
 2 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/permutation.cc b/permutation.cc
index 1179708..d6456f5 100644
--- a/permutation.cc
+++ b/permutation.cc
@@ -189,7 +189,7 @@ return r;
 
 
 template <typename T>
-NRPerm<T> NRPerm<T>::conjugate_by(const NRPerm<T> &q, bool inverse) const
+NRPerm<T> NRPerm<T>::conjugated_by(const NRPerm<T> &q, bool inverse) const
 {
 #ifdef DEBUG
         if(!this->is_valid() || !q.is_valid()) laerror("multiplication of invalid permutation");
@@ -224,7 +224,7 @@ return r;
 
 
 template <typename T>
-CyclePerm<T> CyclePerm<T>::conjugate_by(const CyclePerm<T> &q) const
+CyclePerm<T> CyclePerm<T>::conjugated_by(const CyclePerm<T> &q) const
 {
 #ifdef DEBUG
         if(!this->is_valid() || !q.is_valid()) laerror("multiplication of invalid permutation");
@@ -780,10 +780,10 @@ return res;
 }
 
 template <typename T, typename R>
-PermutationAlgebra<T,R> PermutationAlgebra<T,R>::conjugate_by(const NRPerm<T> &q, bool reverse) const
+PermutationAlgebra<T,R> PermutationAlgebra<T,R>::conjugated_by(const NRPerm<T> &q, bool reverse) const
 {
 PermutationAlgebra<T,R> res(this->size());
-for(int i=0; i<this->size(); ++i) {res[i].perm = (*this)[i].perm.conjugate_by(q,reverse); res[i].weight=(*this)[i].weight;}
+for(int i=0; i<this->size(); ++i) {res[i].perm = (*this)[i].perm.conjugated_by(q,reverse); res[i].weight=(*this)[i].weight;}
 return res;
 }
 
diff --git a/permutation.h b/permutation.h
index 2fa93df..01a44ac 100644
--- a/permutation.h
+++ b/permutation.h
@@ -73,7 +73,7 @@ public:
 	NRPerm operator*(const CyclePerm<T> &r) const;
 	template<typename R> PermutationAlgebra<T,R> operator*(const  PermutationAlgebra<T,R> &pa) const;
 	NRPerm multiply(const NRPerm<T> &q, bool inverse) const; //multiplication but optionally q inversed
-	NRPerm conjugate_by(const NRPerm &q, bool reverse=false) const; //q^-1 p q or q p q^-1
+	NRPerm conjugated_by(const NRPerm &q, bool reverse=false) const; //q^-1 p q or q p q^-1
 	NRPerm commutator(const NRPerm &q, bool inverse=false) const;  //p^-1 q^-1 p q or q^-1 p^-1 q p
 	int parity() const; //returns +/- 1
 	void randomize(void); //uniformly random by Fisher-Yates shuffle
@@ -199,7 +199,7 @@ public:
         PermutationAlgebra operator*(const NRPerm<T> &rhs) const;  //applied to all terms
 	PermutationAlgebra cutleft(int n) const; //applied to all terms
 	PermutationAlgebra cutright(int n) const; //applied to all terms
-	PermutationAlgebra conjugate_by(const NRPerm<T> &q, bool reverse=false) const; //q^-1 p q or q p q^-1 , applied to all terms
+	PermutationAlgebra conjugated_by(const NRPerm<T> &q, bool reverse=false) const; //q^-1 p q or q p q^-1 , applied to all terms
         PermutationAlgebra commutator(const NRPerm<T> &q, bool inverse=false) const; //applied to all terms
 	PermutationAlgebra operator&(const PermutationAlgebra &rhs) const; //each term with each
 	PermutationAlgebra operator|(const PermutationAlgebra &rhs) const; //each term with each
@@ -237,7 +237,7 @@ public:
 	void readfrom(const std::string &line);
 	CyclePerm operator*(const CyclePerm &q) const; //q is rhs and applied first, this applied second
 	NRPerm<T> operator*(const NRPerm<T> &r) const;
-	CyclePerm conjugate_by(const CyclePerm &q) const; //q^-1 p q
+	CyclePerm conjugated_by(const CyclePerm &q) const; //q^-1 p q
 	PERM_RANK_TYPE order() const; //lcm of cycle lengths
 	bool operator==(const CyclePerm &rhs) const {return NRPerm<T>(*this) == NRPerm<T>(rhs);}; //cycle representation is not unique, cannot inherit operator== from NRVec
 	void simplify(bool keep1=false); //remove cycles of size 0 or 1