Changeset 7765:22ace0c88075

Timestamp:

11/18/07 23:13:16 (6 years ago)

Author:

Robert L Miller <rlm@…>

Branch:

default

Message:

cleanup

File:

• sage/coding/binary_code.pyx (modified) (8 diffs)

sage/coding/binary_code.pyx

@@ -1854 +1854 @@
         cdef int *self_col_degs = self.col_degs, *self_col_lvls = self.col_lvls, *self_col_ents = self.col_ents
         while not self.is_discrete(k) and m < alpha_length:
-            print "m:", m
-            print "alpha:", ','.join(['w'+str(alpha[i]^flag) if alpha[i]&flag else 'c'+str(alpha[i]) for i from 0 <= i < alpha_length])
-            print self
+#            print "m:", m
+#            print "alpha:", ','.join(['w'+str(alpha[i]^flag) if alpha[i]&flag else 'c'+str(alpha[i]) for i from 0 <= i < alpha_length])
+#            print self
             invariant += 1
             j = 0
@@ -1900 +1900 @@
                     else: j = i
             else:
-                print 'col'
+#                print 'col'
                 while j < self.nwords:
-                    print 'j', j
-                    print self
+#                    print 'j', j
+#                    print self
                     i = j; s = 0
                     invariant += 64
                     while True:
-                        print 'i', i
+#                        print 'i', i
                         self_wd_degs[i-j] = self.wd_degree(CG, self_wd_ents[i], alpha[m], k, ham_wts)
-                        print 'deg', self_wd_degs[i-j]
+#                        print 'deg', self_wd_degs[i-j]
                         if s == 0 and self_wd_degs[i-j] != self_wd_degs[0]: s = 1
                         i += 1
@@ -2413 +2413 @@
         state = 1
         while state != -1:
-            if True:#badass > 39:
+            if False:#badass > 39:
                 print '-----'
                 print badass
@@ -2443 +2443 @@
                 print 'hzf__h_zeta', hzf__h_zeta
                 print 'qzb', qzb
-            if True:
+            if False:
                 print "state:", state
                 print '-----'
@@ -2474 +2474 @@
 
                 alpha[0] = nu.split_vertex(v[k-1], k)
-                print nu
+#                print nu
                 Lambda[k] = nu.refine(k, alpha, 1, C, ham_wts) # store the invariant to Lambda[k]
                 # only if this is the first time moving down the search tree:
@@ -2574 +2574 @@
 
                 nu.get_permutation(zeta, word_gamma, col_gamma, ham_wts)
-                print "gamma:", [word_gamma[i] for i from 0 <= i < nwords], [col_gamma[i] for i from 0 <= i < ncols]
+#                print "gamma:", [word_gamma[i] for i from 0 <= i < nwords], [col_gamma[i] for i from 0 <= i < ncols]
                 # if C^gamma == C, the permutation is an automorphism, goto 10
                 if C.is_automorphism(col_gamma, word_gamma):
@@ -2599 +2599 @@
                 # if C(nu) == C(rho), get the automorphism and goto 10
                 rho.get_permutation(nu, word_gamma, col_gamma, ham_wts)
-                print "gamma:", [word_gamma[i] for i from 0 <= i < nwords], [col_gamma[i] for i from 0 <= i < ncols]
+#                print "gamma:", [word_gamma[i] for i from 0 <= i < nwords], [col_gamma[i] for i from 0 <= i < ncols]
                 state = 10
 
@@ -2873 +2873 @@
 
         # end big while loop
-#        rho.find_basis(ham_wts)
-#        for i from 0 <= i < ncols:
-#            self.labeling[rho.col_ents[i]] = i
-#        for i from 0 <= i < nrows:
-#            self.labeling[i+ncols] = rho.basis_locations[i]
-
-
-
-
-
+        rho.find_basis(ham_wts)
+        for i from 0 <= i < ncols:
+            self.labeling[rho.col_ents[i]] = i
+        for i from 0 <= i < nrows:
+            self.labeling[i+ncols] = rho.basis_locations[i]
+
+
+
+
+