/dports/science/cdk/cdk-cdk-2.3/tool/group/src/test/java/org/openscience/cdk/group/ |
H A D | PermutationGroupTest.java | 80 PermutationGroup group = new PermutationGroup(size); in sizeConstructor() 88 PermutationGroup group = new PermutationGroup(base); in baseConstructor() 108 PermutationGroup sym = PermutationGroup.makeSymN(size); in makeSymNTest() 116 PermutationGroup group = new PermutationGroup(size); in getSizeTest() 123 PermutationGroup sym = PermutationGroup.makeSymN(size); in orderTest() 164 PermutationGroup group = PermutationGroup.makeSymN(size); in testTransversal() 190 PermutationGroup group = PermutationGroup.makeSymN(size); in applyTest() 211 PermutationGroup group = PermutationGroup.makeSymN(size); in apply_FinishEarlyTest() 230 PermutationGroup group = PermutationGroup.makeSymN(size); in allTest() 256 PermutationGroup group = new PermutationGroup(size); [all …]
|
H A D | AbstractDiscretePartitionRefinerTest.java | 122 private void setup(MockRefiner refiner, PermutationGroup group, Graph g) { in setup() 129 PermutationGroup group = new PermutationGroup(n); in setupTest() 141 PermutationGroup group = new PermutationGroup(n); in firstIsIdentityTest() 153 PermutationGroup group = new PermutationGroup(n); in getAutomorphismPartitionTest() 178 PermutationGroup group = new PermutationGroup(n); in getFirstHalfMatrixStringTest() 192 PermutationGroup group = new PermutationGroup(n); in getGroupTest() 203 PermutationGroup group = new PermutationGroup(n); in getBestTest() 217 PermutationGroup group = new PermutationGroup(n); in getFirstTest() 231 PermutationGroup group = new PermutationGroup(n); in isCanonical_TrueTest() 243 PermutationGroup group = new PermutationGroup(n); in isCanonical_FalseTest() [all …]
|
/dports/math/polymake/polymake-4.5/external/permlib/include/permlib/ |
H A D | permlib_api.h | 70 …boost::shared_ptr<PermutationGroup> group(new PermutationGroup(schreierSims.construct(begin, end))… in construct() 78 …boost::shared_ptr<PermutationGroup> group(new PermutationGroup(schreierSims.construct(beginGen, en… in construct() 88 boost::shared_ptr<PermutationGroup> setStabilizer(const PermutationGroup& group, InputIterator begi… in setStabilizer() 90 return boost::shared_ptr<PermutationGroup>(new PermutationGroup(group)); in setStabilizer() 92 PermutationGroup copy(group); in setStabilizer() 103 boost::shared_ptr<PermutationGroup> stabilizer(new PermutationGroup(copy.n)); in setStabilizer() 115 PermutationGroup copy(group); in setImage() 154 PermutationGroup copy(group); 165 boost::shared_ptr<PermutationGroup> stabilizer(new PermutationGroup(copy.n)); 216 inline bool isNotLexMinSet(PermutationGroup& group, in isNotLexMinSet() [all …]
|
H A D | abstract_bsgs.h | 56 typedef BSGS<typename TRANS::PERMtype, TRANS> PermutationGroup; typedef 62 AbstractBSGS(const boost::shared_ptr<PermutationGroup>& bsgs_, bool computeSupport = true); 74 const boost::shared_ptr<PermutationGroup> bsgs() const { return m_bsgs; } in bsgs() 84 const boost::shared_ptr<PermutationGroup> m_bsgs; 90 AbstractBSGS<TRANS>::AbstractBSGS(const boost::shared_ptr<PermutationGroup>& bsgs_, bool computeSup… in AbstractBSGS() 126 PermutationGroup copy(*m_bsgs); in setStabilizer() 137 boost::shared_ptr<PermutationGroup> stabilizer(new PermutationGroup(copy.n)); in setStabilizer() 217 PermutationGroup conjugatedBSGS(*m_bsgs); in isLexMinSet() 226 OrbitLexMinSearch<PermutationGroup> orbLexMin(conjugatedBSGS, true); in isLexMinSet()
|
/dports/math/permlib/PermLib-0.2.9/include/permlib/ |
H A D | permlib_api.h | 70 …boost::shared_ptr<PermutationGroup> group(new PermutationGroup(schreierSims.construct(begin, end))… in construct() 78 …boost::shared_ptr<PermutationGroup> group(new PermutationGroup(schreierSims.construct(beginGen, en… in construct() 88 boost::shared_ptr<PermutationGroup> setStabilizer(const PermutationGroup& group, InputIterator begi… in setStabilizer() 90 return boost::shared_ptr<PermutationGroup>(new PermutationGroup(group)); in setStabilizer() 92 PermutationGroup copy(group); in setStabilizer() 103 boost::shared_ptr<PermutationGroup> stabilizer(new PermutationGroup(copy.n)); in setStabilizer() 115 PermutationGroup copy(group); in setImage() 154 PermutationGroup copy(group); 165 boost::shared_ptr<PermutationGroup> stabilizer(new PermutationGroup(copy.n)); 216 inline bool isNotLexMinSet(PermutationGroup& group, in isNotLexMinSet() [all …]
|
H A D | abstract_bsgs.h | 56 typedef BSGS<typename TRANS::PERMtype, TRANS> PermutationGroup; typedef 62 AbstractBSGS(const boost::shared_ptr<PermutationGroup>& bsgs_, bool computeSupport = true); 74 const boost::shared_ptr<PermutationGroup> bsgs() const { return m_bsgs; } in bsgs() 84 const boost::shared_ptr<PermutationGroup> m_bsgs; 90 AbstractBSGS<TRANS>::AbstractBSGS(const boost::shared_ptr<PermutationGroup>& bsgs_, bool computeSup… in AbstractBSGS() 126 PermutationGroup copy(*m_bsgs); in setStabilizer() 137 boost::shared_ptr<PermutationGroup> stabilizer(new PermutationGroup(copy.n)); in setStabilizer() 217 PermutationGroup conjugatedBSGS(*m_bsgs); in isLexMinSet() 226 OrbitLexMinSearch<PermutationGroup> orbLexMin(conjugatedBSGS, true); in isLexMinSet()
|
/dports/math/py-sympy/sympy-1.9/sympy/combinatorics/tests/ |
H A D | test_perm_groups.py | 19 G = PermutationGroup([a]) 23 G = PermutationGroup([a, b]) 26 G = PermutationGroup([a]) 93 G = PermutationGroup(gens) 321 assert PermutationGroup(g, g).is_subgroup(PermutationGroup(g)) 480 G = PermutationGroup( 813 assert PermutationGroup() == PermutationGroup(Permutation()) 1009 G = PermutationGroup( 1014 G = PermutationGroup( 1023 G = PermutationGroup( [all …]
|
/dports/math/py-Diofant/Diofant-0.13.0/diofant/tests/combinatorics/ |
H A D | test_perm_groups.py | 22 G = PermutationGroup([a]) 26 G = PermutationGroup([a, b]) 29 G = PermutationGroup([a]) 48 G = PermutationGroup([a, b]) 96 G = PermutationGroup(gens) 109 G = PermutationGroup(gens) 206 G = PermutationGroup([a]) 248 G = PermutationGroup([a]) 255 assert PermutationGroup( 299 assert PermutationGroup(g, g).is_subgroup(PermutationGroup(g)) [all …]
|
/dports/math/polymake/polymake-4.5/bundled/sympol/external/sympol/sympol/ |
H A D | symmetrycomputation.cpp | 41 … const Polyhedron & data, const PermutationGroup & permGroup, FacesUpToSymmetryList & rays) in SymmetryComputation() 47 bool SymmetryComputation::equivalentFaces(const PermutationGroup & permGroup, const Face & f1, cons… in equivalentFaces() 51 bool SymmetryComputation::equivalentFaces(const PermutationGroup & permGroup, const Face & f1, cons… in equivalentFaces() 76 PermutationGroup myGroup(permGroup); in equivalentFaces() 84 classic::SetImageSearch<PermutationGroup,TRANSVERSAL> backtrackSearch(myGroup, 0); in equivalentFaces() 96 PermutationGroup SymmetryComputation::stabilizer(const PermutationGroup & permGroup, const Face & f… in stabilizer() 104 PermutationGroup myGroup(permGroup); in stabilizer() 115 classic::SetStabilizerSearch<PermutationGroup,TRANSVERSAL> backtrackSearch(myGroup, 0); in stabilizer() 118 PermutationGroup stab(f.size()); in stabilizer()
|
H A D | symmetrycomputation.h | 48 const PermutationGroup & permGroup, FacesUpToSymmetryList & rays); 56 virtual double probe(const Polyhedron & data, const PermutationGroup & permGroup, in probe() 69 static PermutationGroup stabilizer(const PermutationGroup & permGroup, const Face & f); 71 …bool equivalentFaces(const PermutationGroup & permGroup, const Face & f1, const Face & f2, const F… 72 … bool equivalentFaces(const PermutationGroup & permGroup, const Face & f1, const Face & f2) const; 77 const PermutationGroup & m_permGroup;
|
H A D | recursionstrategy.h | 44 const PermutationGroup & permGroup, FacesUpToSymmetryList& rays); 46 const PermutationGroup & permGroup, FacesUpToSymmetryList& rays); 51 const PermutationGroup & permGroup, FacesUpToSymmetryList& rays) = 0; 65 const Polyhedron& data, const PermutationGroup & permGroup, FacesUpToSymmetryList& rays) { 83 const PermutationGroup & permGroup, FacesUpToSymmetryList& rays) 94 const PermutationGroup & permGroup, FacesUpToSymmetryList& rays) 114 const PermutationGroup & permGroup, FacesUpToSymmetryList& rays) 131 const PermutationGroup & permGroup, FacesUpToSymmetryList& rays)
|
/dports/math/sympol/SymPol-0.1.9/sympol/ |
H A D | symmetrycomputation.cpp | 40 … const Polyhedron & data, const PermutationGroup & permGroup, FacesUpToSymmetryList & rays) in SymmetryComputation() 46 bool SymmetryComputation::equivalentFaces(const PermutationGroup & permGroup, const Face & f1, cons… in equivalentFaces() 50 bool SymmetryComputation::equivalentFaces(const PermutationGroup & permGroup, const Face & f1, cons… in equivalentFaces() 75 PermutationGroup myGroup(permGroup); in equivalentFaces() 83 classic::SetImageSearch<PermutationGroup,TRANSVERSAL> backtrackSearch(myGroup, 0); in equivalentFaces() 95 PermutationGroup SymmetryComputation::stabilizer(const PermutationGroup & permGroup, const Face & f… in stabilizer() 103 PermutationGroup myGroup(permGroup); in stabilizer() 114 classic::SetStabilizerSearch<PermutationGroup,TRANSVERSAL> backtrackSearch(myGroup, 0); in stabilizer() 117 PermutationGroup stab(f.size()); in stabilizer()
|
H A D | symmetrycomputation.h | 48 const PermutationGroup & permGroup, FacesUpToSymmetryList & rays); 56 virtual double probe(const Polyhedron & data, const PermutationGroup & permGroup, in probe() 69 static PermutationGroup stabilizer(const PermutationGroup & permGroup, const Face & f); 71 …bool equivalentFaces(const PermutationGroup & permGroup, const Face & f1, const Face & f2, const F… 72 … bool equivalentFaces(const PermutationGroup & permGroup, const Face & f1, const Face & f2) const; 77 const PermutationGroup & m_permGroup;
|
H A D | recursionstrategy.h | 44 const PermutationGroup & permGroup, FacesUpToSymmetryList& rays); 46 const PermutationGroup & permGroup, FacesUpToSymmetryList& rays); 51 const PermutationGroup & permGroup, FacesUpToSymmetryList& rays) = 0; 65 const Polyhedron& data, const PermutationGroup & permGroup, FacesUpToSymmetryList& rays) { in symmetryComputationFactory() 83 const PermutationGroup & permGroup, FacesUpToSymmetryList& rays) in devise() 94 const PermutationGroup & permGroup, FacesUpToSymmetryList& rays) in devise() 114 const PermutationGroup & permGroup, FacesUpToSymmetryList& rays) in devise() 131 const PermutationGroup & permGroup, FacesUpToSymmetryList& rays) in devise()
|
/dports/math/py-Diofant/Diofant-0.13.0/diofant/combinatorics/ |
H A D | named_groups.py | 2 from .perm_groups import PermutationGroup 89 return PermutationGroup([Permutation([0])]) 106 G = PermutationGroup([_af_new(a) for a in gens], dups=False) 153 G = PermutationGroup([gen]) 202 return PermutationGroup([Permutation([1, 0])]) 204 return PermutationGroup([Permutation([1, 0, 3, 2]), 213 G = PermutationGroup([gen1, gen2]) 263 G = PermutationGroup([Permutation([0])]) 265 G = PermutationGroup([Permutation([1, 0])]) 273 G = PermutationGroup([gen1, gen2]) [all …]
|
H A D | testutil.py | 33 from .perm_groups import PermutationGroup 73 return _naive_list_centralizer(self, PermutationGroup(other), af) 75 return _naive_list_centralizer(self, PermutationGroup([other]), af) 101 from .perm_groups import PermutationGroup 105 candidate = PermutationGroup(strong_gens_distr[i]) 167 from .perm_groups import PermutationGroup 181 naive_closure = PermutationGroup(list(conjugates)) 215 from .perm_groups import PermutationGroup 233 S = PermutationGroup(sgens) 234 D = PermutationGroup([Permutation(x) for x in dgens])
|
/dports/math/py-sympy/sympy-1.9/sympy/combinatorics/ |
H A D | named_groups.py | 2 from sympy.combinatorics.perm_groups import PermutationGroup 95 return PermutationGroup([Permutation([0])]) 112 G = PermutationGroup([_af_new(a) for a in gens], dups=False) 163 G = PermutationGroup([gen]) 216 return PermutationGroup([Permutation([1, 0])]) 218 return PermutationGroup([Permutation([1, 0, 3, 2]), 227 G = PermutationGroup([gen1, gen2]) 281 G = PermutationGroup([Permutation([0])]) 283 G = PermutationGroup([Permutation([1, 0])]) 291 G = PermutationGroup([gen1, gen2]) [all …]
|
H A D | homomorphisms.py | 4 from sympy.combinatorics.perm_groups import PermutationGroup 42 if isinstance(self.codomain, PermutationGroup): 50 if isinstance(self.codomain, PermutationGroup): 126 if isinstance(G, PermutationGroup): 127 K = PermutationGroup(G.identity) 136 if isinstance(G, PermutationGroup): 137 K = PermutationGroup(gens) 259 P = PermutationGroup(self.image().identity) 264 P = PermutationGroup(gens) 268 P = PermutationGroup(gens) [all …]
|
H A D | testutil.py | 37 from sympy.combinatorics.perm_groups import PermutationGroup 79 return _naive_list_centralizer(self, PermutationGroup(other), af) 81 return _naive_list_centralizer(self, PermutationGroup([other]), af) 112 from sympy.combinatorics.perm_groups import PermutationGroup 116 candidate = PermutationGroup(strong_gens_distr[i]) 162 from sympy.combinatorics.perm_groups import PermutationGroup 198 naive_closure = PermutationGroup(list(conjugates)) 241 from sympy.combinatorics.perm_groups import PermutationGroup 259 S = PermutationGroup(sgens) 260 D = PermutationGroup([Permutation(x) for x in dgens])
|
/dports/science/cdk/cdk-cdk-2.3/tool/group/src/main/java/org/openscience/cdk/group/ |
H A D | AtomContainerDiscretePartitionRefinerImpl.java | 87 public PermutationGroup getAutomorphismGroup(IAtomContainer atomContainer) { in getAutomorphismGroup() 102 …public PermutationGroup getAutomorphismGroup(IAtomContainer atomContainer, PermutationGroup group)… in getAutomorphismGroup() 115 …public PermutationGroup getAutomorphismGroup(IAtomContainer atomContainer, Partition initialPartit… in getAutomorphismGroup() 162 PermutationGroup group = new PermutationGroup(new Permutation(size)); in setup() 166 private void setup(IAtomContainer atomContainer, PermutationGroup group) { in setup()
|
H A D | AtomContainerDiscretePartitionRefiner.java | 114 public PermutationGroup getAutomorphismGroup(IAtomContainer atomContainer); in getAutomorphismGroup() 125 …public PermutationGroup getAutomorphismGroup(IAtomContainer atomContainer, PermutationGroup group); in getAutomorphismGroup() 134 …public PermutationGroup getAutomorphismGroup(IAtomContainer atomContainer, Partition initialPartit… in getAutomorphismGroup()
|
H A D | PermutationGroup.java | 75 public class PermutationGroup { class 119 public PermutationGroup(int size) { in PermutationGroup() method in PermutationGroup 128 public PermutationGroup(Permutation base) { in PermutationGroup() method in PermutationGroup 145 public PermutationGroup(int size, List<Permutation> generators) { in PermutationGroup() method in PermutationGroup 159 public static PermutationGroup makeSymN(int size) { in makeSymN() 181 return new PermutationGroup(size, generators); in makeSymN() 247 public List<Permutation> transversal(final PermutationGroup subgroup) { in transversal() 332 PermutationGroup h = new PermutationGroup(newBase); in changeBase()
|
/dports/math/fricas/fricas-1.3.7/src/input/ |
H A D | gpresent.input | 97 -- conversions to PermutationGroup 99 testcase "PermutationGroup conversions cyclic group" 103 c5c := toPermutationIfCan(c5b) :: PermutationGroup(Integer) 106 c5e := toPermutationIfCan(c5d)::PermutationGroup(Integer) 111 testcase "PermutationGroup conversions dihedral group" 115 d3c := toPermutationIfCan(d3b) :: PermutationGroup(Integer) 119 d3e := toPermutationIfCan(d3d)::PermutationGroup(Integer) 131 s4e := toPermutationIfCan(s4d)::PermutationGroup(Integer) 133 )::PermutationGroup(Integer) 143 a5d := toPermutationIfCan(a5c)::PermutationGroup(Integer) [all …]
|
/dports/math/polymake/polymake-4.5/external/permlib/test/ |
H A D | test-api.cpp | 50 const PermutationGroup group = construct<PERMUTATION,TRANSVERSAL>(info_trivial); in BOOST_AUTO_TEST_CASE() 59 const PermutationGroup group = construct<PERMUTATION,TRANSVERSAL>(info_1997); in BOOST_AUTO_TEST_CASE() 66 boost::shared_ptr<PermutationGroup> stab1 = setStabilizer(group, Delta, Delta+DeltaSize); in BOOST_AUTO_TEST_CASE() 96 const PermutationGroup group = construct<PERMUTATION,TRANSVERSAL>(info_1997); in BOOST_AUTO_TEST_CASE() 111 boost::shared_ptr<PermutationGroup> stab1 = setStabilizer(group, v.begin(), v.end()); in BOOST_AUTO_TEST_CASE() 137 const PermutationGroup group = construct<PERMUTATION,TRANSVERSAL>(info_1997); in BOOST_AUTO_TEST_CASE() 143 boost::shared_ptr<PermutationGroup> stab = vectorStabilizer(group, v.begin(), v.end()); in BOOST_AUTO_TEST_CASE() 151 const PermutationGroup group = construct<PERMUTATION,TRANSVERSAL>(info_1997); in BOOST_AUTO_TEST_CASE()
|
/dports/math/permlib/PermLib-0.2.9/test/ |
H A D | test-api.cpp | 50 const PermutationGroup group = construct<PERMUTATION,TRANSVERSAL>(info_trivial); in BOOST_AUTO_TEST_CASE() 59 const PermutationGroup group = construct<PERMUTATION,TRANSVERSAL>(info_1997); in BOOST_AUTO_TEST_CASE() 66 boost::shared_ptr<PermutationGroup> stab1 = setStabilizer(group, Delta, Delta+DeltaSize); in BOOST_AUTO_TEST_CASE() 96 const PermutationGroup group = construct<PERMUTATION,TRANSVERSAL>(info_1997); in BOOST_AUTO_TEST_CASE() 111 boost::shared_ptr<PermutationGroup> stab1 = setStabilizer(group, v.begin(), v.end()); in BOOST_AUTO_TEST_CASE() 137 const PermutationGroup group = construct<PERMUTATION,TRANSVERSAL>(info_1997); in BOOST_AUTO_TEST_CASE() 143 boost::shared_ptr<PermutationGroup> stab = vectorStabilizer(group, v.begin(), v.end()); in BOOST_AUTO_TEST_CASE() 151 const PermutationGroup group = construct<PERMUTATION,TRANSVERSAL>(info_1997); in BOOST_AUTO_TEST_CASE()
|