From: Christian Bauer <Christian.Bauer@uni-mainz.de>
Date: Sat, 16 Jun 2001 20:23:26 +0000 (+0000)
Subject: fixed comments
X-Git-Tag: release_0-9-1~33
X-Git-Url: https://ginac.de/ginac.git/tutorial/ginac.git?a=commitdiff_plain;h=bf28c9f0b06f349b3a655ee7c152d9ab77a900b7;p=ginac.git

fixed comments
---

diff --git a/check/time_lw_H.cpp b/check/time_lw_H.cpp
index 1621a6e1..fe64b3ab 100644
--- a/check/time_lw_H.cpp
+++ b/check/time_lw_H.cpp
@@ -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) {
diff --git a/ginac/inifcns.cpp b/ginac/inifcns.cpp
index e57c9dfb..1fcba692 100644
--- a/ginac/inifcns.cpp
+++ b/ginac/inifcns.cpp
@@ -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;
 
diff --git a/ginac/symmetry.cpp b/ginac/symmetry.cpp
index ab31838b..a07fbe7e 100644
--- a/ginac/symmetry.cpp
+++ b/ginac/symmetry.cpp
@@ -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: