fixed comments
authorChristian Bauer <Christian.Bauer@uni-mainz.de>
Sat, 16 Jun 2001 20:23:26 +0000 (20:23 +0000)
committerChristian Bauer <Christian.Bauer@uni-mainz.de>
Sat, 16 Jun 2001 20:23:26 +0000 (20:23 +0000)
check/time_lw_H.cpp
ginac/inifcns.cpp
ginac/symmetry.cpp

index 1621a6e..fe64b3a 100644 (file)
@@ -32,13 +32,15 @@ static unsigned test(unsigned n)
                        hilbert.set(r,c,numeric(1,r+c+1));
        ex det = hilbert.determinant();
        
-       // The closed form of the determinant of n x n Hilbert matrices is:
-       //
-       //      n-1   /                      n-1                 \
-       //     ----- |                      -----                 |
-       //      | |  | pow(factorial(r),2)   | |    hilbert(r,c)  |
-       //      | |  |                       | |                  |   
-       //     r = 0  \                     c = 0                /
+       /*
+          The closed form of the determinant of n x n Hilbert matrices is:
+       
+            n-1   /                      n-1                 \
+           ----- |                      -----                 |
+            | |  | pow(factorial(r),2)   | |    hilbert(r,c)  |
+            | |  |                       | |                  |   
+           r = 0  \                     c = 0                /
+       */
        
        ex hilbdet = 1;
        for (unsigned r=0; r<n; ++r) {
index e57c9df..1fcba69 100644 (file)
@@ -507,8 +507,8 @@ ex lsolve(const ex &eqns, const ex &symbols)
        return sollist;
 }
 
-/** Force inclusion of functions from initcns_gamma and inifcns_zeta
- *  for static lib (so ginsh will see them). */
+/* Force inclusion of functions from inifcns_gamma and inifcns_zeta
+ * for static lib (so ginsh will see them). */
 unsigned force_include_tgamma = function_index_tgamma;
 unsigned force_include_zeta1 = function_index_zeta1;
 
index ab31838..a07fbe7 100644 (file)
@@ -24,9 +24,6 @@
 #include <functional>
 #include <algorithm>
 
-#define DO_GINAC_ASSERT
-#include "assertion.h"
-
 #include "symmetry.h"
 #include "lst.h"
 #include "numeric.h" // for factorial()
@@ -289,12 +286,15 @@ int canonicalize(exvector::iterator v, const symmetry &symm)
        first = symm.children.begin();
        switch (symm.type) {
                case symmetry::symmetric:
+                       // Sort the children in ascending order
                        shaker_sort(first, last, sy_is_less(v), sy_swap(v, something_changed));
                        break;
                case symmetry::antisymmetric:
+                       // Sort the children in ascending order, keeping track of the signum
                        sign *= permutation_sign(first, last, sy_is_less(v), sy_swap(v, something_changed));
                        break;
                case symmetry::cyclic:
+                       // Permute the smallest child to the front
                        cyclic_permutation(first, last, min_element(first, last, sy_is_less(v)), sy_swap(v, something_changed));
                        break;
                default: