Changeset c4d065 in git for gfanlib/gfanlib_symmetry.cpp

Timestamp:

Nov 26, 2010, 4:37:58 PM (13 years ago)

Author:

Frank Seelisch <seelisch@…>

Branches:

(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', '0604212ebb110535022efecad887940825b97c3f')

Children:

92e2cd1822dc1be6a8ef69173615a30e5bd67d0e

Parents:

9e7d85ecc0703de24759963ee74edd60d4139c09

Message:

coding at Goettingen (cones&fans)

git-svn-id: file:///usr/local/Singular/svn/trunk@13677 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• gfanlib/gfanlib_symmetry.cpp (modified) (4 diffs)

gfanlib/gfanlib_symmetry.cpp

@@ -212 +212 @@
 }
 
+IntMatrix SymmetryGroup::getGenerators()const
+{
+  IntMatrix ret(0,this->sizeOfBaseSet());
+  for(ElementContainer::const_iterator i=elements.begin();i!=elements.end();i++)ret.appendRow(i->toIntVector());
+  return ret;
+}
+
 void SymmetryGroup::computeClosure(Permutation const &v) //does this work??
 {
@@ -220 +227 @@
   while(!newOnes.empty())
     {
-      static int i;
-      i++;
-
       Permutation v=*newOnes.begin();
       for(ElementContainer::const_iterator i=elements.begin();i!=elements.end();i++)
@@ -232 +236 @@
           }
           {
-            Permutation n=v.apply(*i);
+            Permutation n=v.apply(v);
             if(0==elements.count(n))
               newOnes.insert(n);
@@ -243 +247 @@
 
 
-/*
-
-void SymmetryGroup::computeClosure(IntegerVectorList const &l)
-{
-  //  for(IntegerVectorList::const_iterator i=l.begin();i!=l.end();i++)
-  //  computeClosure(*i);
-
-  bool growing=true;
-  while(growing)
-    {
-      growing=false;
-      for(ElementContainer::const_iterator i=elements.begin();i!=elements.end();i++)
-        {
-          for(IntegerVectorList::const_iterator j=l.begin();j!=l.end();j++)
-            {
-              {
-                IntegerVector n(compose(*i,*j));
-                growing|=(0==elements.count(n));
-                elements.insert(n);
-              }
-              {
-                IntegerVector n(compose(*i,*j));
-                growing|=(0==elements.count(n));
-                elements.insert(n);
-              }
-            }
-        }
-    }
-}
-*/
+void SymmetryGroup::computeClosure(IntMatrix const &l)
+{
+  for(int i=0;i<l.getHeight();i++)computeClosure(Permutation(l[i]));
+}
+
 
 /*