fix: typos in comments

Author: tueda

check/check.rb

@@ -1001,7 +1001,7 @@ def test_enabled?(name)
       return false
     end
 
-    # check --execlude NAME
+    # check --exclude NAME
     if !@exclude_patterns.empty?
       @exclude_patterns.each do |pat|
         if name =~ pat

check/examples.frm

@@ -1648,7 +1648,7 @@ EOF
       x*w(1) + x^2*w(2) + x^3*ww(3) + x^4*www(1) + x^5*www(2) + x^6*www(3)
     ")
 *--#] Dictionaries_6 : 
-*--#[ DiracAlgebla_1 :
+*--#[ DiracAlgebra_1 :
 *
 *   Symmetric trace of a gamma5 and 12 regular matrices
 *
@@ -1664,8 +1664,8 @@ tracen,1;
 	assert stdout =~ /Generated terms =      51975$/
 	assert stdout =~ /Terms in output =      51975$/
 	assert bytesize("F") == 459582 * wordsize
-*--#] DiracAlgebla_1 : 
-*--#[ DiracAlgebla_2 :
+*--#] DiracAlgebra_1 : 
+*--#[ DiracAlgebra_2 :
 *
 *   Regular trace of a gamma5 and 12 regular matrices
 *
@@ -1677,7 +1677,7 @@ trace4,1;
 	assert @stdout =~ /Generated terms =       1053$/
 	assert @stdout =~ /Terms in output =       1029$/
 	assert bytesize("F") == 10142 * wordsize
-*--#] DiracAlgebla_2 : 
+*--#] DiracAlgebra_2 : 
 *--#[ NotesMetric_1 :
 Indices m1,m2,m3,n1,n2,n3,i1,i2,i3;
 Cfunction eta(symmetric),e(antisymmetric);

doc/manual/gamma.tex

@@ -239,7 +239,7 @@ \chapter{Dirac algebra}
 trace, with all matrices with a different index, can be generated with 
 the use of the 'distrib\_' function:
 % THIS EXAMPLE IS PART OF THE TESTSUITE. CHANGES HERE SHOULD BE APPLIED THERE AS
-% WELL! (DiracAlgebla_1)
+% WELL! (DiracAlgebra_1)
 \begin{verbatim}
     *
     *   Symmetric trace of a gamma5 and 12 regular matrices
@@ -260,7 +260,7 @@ \chapter{Dirac algebra}
 This rather symmetric result is in contrast to the 4-dimensional result 
 which is much shorter, but it is very unsymmetric:
 % THIS EXAMPLE IS PART OF THE TESTSUITE. CHANGES HERE SHOULD BE APPLIED THERE AS
-% WELL! (DiracAlgebla_2)
+% WELL! (DiracAlgebra_2)
 \begin{verbatim}
     *
     *   Regular trace of a gamma5 and 12 regular matrices

sources/declare.h

@@ -333,11 +333,11 @@ TP=T+1;while(TP<TT){if(*TP==AR.PolyFun){TP[2]|=(DIRTYFLAG|MUSTCLEANPRF);}TP+=TP[
 
 #ifdef WITHFLOAT
 /*
-	The following macro's are needed to avoid prblems with the compilers
+	The following macro's are needed to avoid problems with the compilers
 	and gmp.h. For the C++ files we need the Form include files to be inside
 	and extern C {} environment, but then the structs.h needs gmp.h to
 	recognise the mpf_t datatype. This causes no end of problems.
-	Hence we collect the sensitve objects as (void *) and cast them to
+	Hence we collect the sensitive objects as (void *) and cast them to
 	something usable with the macro's below. This way the gmp.h file
 	needs to be included only in a very limited number of .c files.
 */

sources/diawrap.cc

@@ -412,7 +412,7 @@ void ProcessDiagram(EGraph *eg, void *ti)
 		}
 	}
 //
-//	Topology counter. We have exagerated a bit with the eye on the far future.
+//	Topology counter. We have exaggerated a bit with the eye on the far future.
 //
 	if ( info->numtopo-1 < MAXPOSITIVE ) {
 		*fill++ = TOPO; *fill++ = FUNHEAD+2; FILLFUN(fill)
@@ -681,7 +681,7 @@ Bool ProcessTopology(EGraph *eg, void *ti)
 		}
 	}
 //
-//	Topology counter. We have exagerated a bit with the eye on the far future.
+//	Topology counter. We have exaggerated a bit with the eye on the far future.
 //
 	if ( info->numtopo < MAXPOSITIVE ) {
 		*fill++ = TOPO; *fill++ = FUNHEAD+2; FILLFUN(fill)

sources/extcmd.c

@@ -625,7 +625,7 @@ static  FORM_INLINE char *addStr(char *to, char *from)
 
 
 /*Try to write (atomically) short buffer (of length count) to fd.
-  timeout is a timeout in millisecs. Returns number of writen bytes or -1:*/
+  timeout is a timeout in millisecs. Returns number of written bytes or -1:*/
 static FORM_INLINE ssize_t writeSome(int fd, char *buf, size_t count, int timeout)
 {
 	ssize_t res = 0;
@@ -636,7 +636,7 @@ static FORM_INLINE ssize_t writeSome(int fd, char *buf, size_t count, int timeou
 
 	/*Add O_NONBLOCK:*/
 	fcntl(fd,F_SETFL, flags | O_NONBLOCK);
-	/* important -- in order to avoid blocking of short rceiver buffer*/
+	/* important -- in order to avoid blocking of short receiver buffer*/
 
 	do{
 		FD_ZERO(&wfds);
@@ -674,7 +674,7 @@ static FORM_INLINE ssize_t writeSome(int fd, char *buf, size_t count, int timeou
 
 /*Try to read short buffer (of length not more than count)
   from fd. timeout is a timeout in millisecs. Returns number 
-  of writen bytes or -1: */
+  of written bytes or -1: */
 static FORM_INLINE ssize_t readSome(int fd, char *buf, size_t count, int timeout)
 {
 	ssize_t res = 0;
@@ -1223,13 +1223,13 @@ static FORM_INLINE void *createExternalChannel(
 	int gpid = 0;
 	ECINFOSTRUCT *psetInfo;
 #ifdef WITHMPI
-	char statusbuf[2]={'\0','\0'};/*'\0' if run_cmd retuns ok, '!' othervise.*/
+	char statusbuf[2]={'\0','\0'};/*'\0' if run_cmd retuns ok, '!' otherwise.*/
 #endif
 	extHandlerInit(h);
 
 	h->pid=0;
 
-	if( cmd==NULL ){/*Instead of strting a new command, use preset channel:*/
+	if( cmd==NULL ){/*Instead of starting a new command, use preset channel:*/
 		psetInfo=(ECINFOSTRUCT *)shellname;
 		shellname=NULL;
 		h->killSignal=0;

sources/float.c

@@ -2277,7 +2277,7 @@ int ExpandEuler(WORD *term, WORD level)
 	5: Restart to see whether there are more Euler functions.
 	The compiler should check that there is no conflict between
 	the evaluate command and a potential polyfun or polyratfun.
-	Yet, when reading in expressions there can be a conclict.
+	Yet, when reading in expressions there can be a conflict.
 	Hence the Normalize routine should check as well.
 
 	par == MZV: MZV
@@ -2544,7 +2544,7 @@ int GetE(PHEAD mpf_t E)
  		#] GetE : 
  		#[ GetEMconst :
 
-	Gets the Euler-Mascarponi constant. (em_ in Form notation)
+	Gets the Euler-Mascheroni constant. (em_ in Form notation)
 
 
 int GetEMconst(PHEAD mpf_t EMconst)

sources/function.c

@@ -973,7 +973,7 @@ FullOK:				if ( AN.SignCheck && AN.ExpectedSign ) goto NoGamma;
 				else goto NoGamma;
 			}
 			else if ( *m < MINSPEC && *m >= (AM.OffsetVector+WILDOFFSET)
-			&& *t < MINSPEC ) {			/* Wildcard vecor */
+			&& *t < MINSPEC ) {			/* Wildcard vector */
 				if ( !CheckWild(BHEAD *m-WILDOFFSET,VECTOVEC,*t,&newvalue) ) {
 					AddWild(BHEAD *m-WILDOFFSET,VECTOVEC,newvalue);
 					j = 1;

sources/gentopo.cc

@@ -239,7 +239,7 @@ T_MNode::T_MNode(int vid, int vdeg, Bool vext, int vclss)
     id     = vid;    // id of the node
     deg    = vdeg;   // degree of the node
     freelg = vdeg;   // number of free legs
-    clss   = vclss;  // class to which the node belogns
+    clss   = vclss;  // class to which the node belongs
     ext    = vext;   // external node or not
 }
 

sources/grcc.cc

@@ -21,19 +21,19 @@ extern "C" {
 // optimization : best combination depends on process by process
 #define SIMPSEL
 
-// optimization : lower and upper bound of deg of taget node of connection.
+// optimization : lower and upper bound of deg of target node of connection.
 #define MINMAXLEG
 
 // optimization : optimization with respect to 'extonly' particles
 #define OPTEXTONLY
 
-// check uniqe interaction by name or by code
+// check unique interaction by name or by code
 #define UNIQINTR
 
 // possible extensions of the program
 // #define ORBITS
 
-// reverse direction of an adge of agraph when anti-particle flows on it.
+// reverse direction of an edge of agraph when anti-particle flows on it.
 // In this case the direction of edges will be diffrent
 // from ones of original mgraph.
 // #define EDGEPORDER
@@ -65,8 +65,8 @@ static OptDef optDef[] = {
  {"NoExtSelf",  "Exclude graphs with 2-pt subgraphs at ext. particles",  False, 0},
  {"NoAdj2PtV",  "Exclude graphs with an edge connecting 2-pt vertices",  False, 0},
  {"Block",      "Exclude graphs with more than one block",               False, 0},
- {"SymmInitial","Symmetrize initial particls",                           False, 0},
- {"SymmFinal",  "Symmetrize final particls",                             False, 0},
+ {"SymmInitial","Symmetrize initial particles",                          False, 0},
+ {"SymmFinal",  "Symmetrize final particles",                            False, 0},
 };
 
 static int nOptDef = sizeof(optDef)/sizeof(OptDef);
@@ -162,7 +162,7 @@ void Options::setDefaultValue(void)
 {
     int j;
 
-    // defualt values
+    // default values
     for (j = 0; j < GRCC_OPT_Size; j++) {
         values[j] = optDef[j].defaultv;
     }
@@ -1578,7 +1578,7 @@ Interaction::Interaction(Model *modl, int iid, const char *nam, int icd, int *cp
     mdl    = modl;         // the model
     id     = iid;          // id of this interaction
     icode  = icd;          // id of this interaction
-    csum   = csm;          // the total oders of coupling constants
+    csum   = csm;          // the total orders of coupling constants
     nlegs  = nlgs;         // the size of plist[]
     loop   = lp;           // the number of loops
 
@@ -3150,7 +3150,7 @@ void Process::prProcess(void)
 void Process::mkSProcess(void)
 {
     //  Construct sprocesses
-    //  Each sprocess is a set of nodes whose degree and oder of 
+    //  Each sprocess is a set of nodes whose degree and order of 
     //  coupling constants are determined.
     //  Only the total coupling constants are considered here even if
     //  two or more coupling constants are defined in the model
@@ -3611,7 +3611,7 @@ MNode::MNode(int vid, int vclss, NCInput *mgi)
     //   vclss  : class of the node
 
     id      = vid;           // id of the node
-    clss    = vclss;         // class to which the node belogns
+    clss    = vclss;         // class to which the node belongs
     deg     = mgi->cldeg;    // degree of the node
     freelg  = mgi->cldeg;    // number of free legs
     extloop = mgi->cltyp;    // external node or not
@@ -3634,7 +3634,7 @@ MNode::MNode(int vid, int vdeg, int vextlp, int vclss, int cmin, int cmax)
     id      = vid;       // id of the node
     deg     = vdeg;      // degree of the node
     freelg  = vdeg;      // number of free legs
-    clss    = vclss;     // class to which the node belogns
+    clss    = vclss;     // class to which the node belongs
     extloop = vextlp;    // external node or not
     cmindeg = cmin;      // min(deg of connectable vertex)
     cmaxdeg = cmax;      // max(deg of connectable vertex)
@@ -4275,8 +4275,8 @@ void MGraph::bisearchME(int nd, int pd, int ned, MCOpi *mopi, MCBlock *mblk, int
 
     *next  = 0;     // # external below 'nd' inclusive
     *nart  = 0;     // # articulation points 'nd' inclusive
-    nart1  = 0;     // # articlulation points below 'nd'.
-    nart2  = 0;     // # 'nd' is articlulation point then 1 
+    nart1  = 0;     // # articulation points below 'nd'.
+    nart2  = 0;     // # 'nd' is articulation point then 1 
     ndart  = 0;     // # the number of blocks attached to 'nd'
 
     newv = (bidef[nd] < 0);
@@ -4376,7 +4376,7 @@ void MGraph::bisearchME(int nd, int pd, int ned, MCOpi *mopi, MCBlock *mblk, int
 
             mconn->pushEdge(nd, td);
 
-            // visit childe
+            // visit child
             bisearchME(td, nd, adjMat[td][nd], &mopi1, &mblk1, &next1, &nart1);
 
             // articulation point of bridge
@@ -4395,7 +4395,7 @@ void MGraph::bisearchME(int nd, int pd, int ned, MCOpi *mopi, MCBlock *mblk, int
                     // block
                     ndart++;
                     mconn->addArtic(nd, 1);
-                    // dicad nparts from nodes below td
+                    // discard nparts from nodes below td
                     mblk1.nartps = 2; 
                     mconn->addBlock(&mblk1, blkt);
                     mblk1.init();
@@ -4897,7 +4897,7 @@ void MGraph::newGraph(MNodeClass *cl)
                                 c1PI++;
                             }
 
-                            // # no tadpolses
+                            // # no tadpoles
                             if (!tadpole) {
                                 cNoTadpole++;
                             }
@@ -6743,7 +6743,7 @@ void EGraph::biinitE(void)
 //--------------------------------------------------------------
 void EGraph::bisearchE(int nd, int *extlst, int *intlst, int *opiext, int *opiloop)
 {
-    // Searchs in the spanning tree below 'nd'.
+    // Search in the spanning tree below 'nd'.
     // Arguments:
     //   nd      : input  : node to be visited
     //   extlst  : output : set of external lines in the current 1PI comp.
@@ -7552,7 +7552,7 @@ Assign::~Assign(void)
 //---------------------------------------------------------------
 void Assign::prCand(const char *msg)
 {
-    //  Print candidte table
+    //  Print candidate table
     int    n, e, ne;
     AEdge *ed;
 
@@ -7840,7 +7840,7 @@ Bool Assign::assignVertex(int v)
     astack->checkPoint(sav);
     saveCouple(savc0);
 
-    // assign to all vertices with only one candicate
+    // assign to all vertices with only one candidate
     done = False;
     for (n = 0; n < nNodes; n++) {
 
@@ -8016,7 +8016,7 @@ Bool Assign::allAssigned(void)
 #ifdef CHECK
     checkAG("allAssigned");
 #endif
-    // fill imformation to resulting Egraph
+    // fill information to resulting Egraph
     fillEGraph(nAGraphs, nsym, esym, nsym1);
 
 #ifdef OPTEXTONLY
@@ -8064,7 +8064,7 @@ Bool Assign::fromMGraph(void)
         nodes[j] = new ANode(mgraph->nodes[j]->deg);
     }
 
-    // initializaion of edge table
+    // initialization of edge table
     nETotal = 0;
 
     // List of all particles
@@ -8913,7 +8913,7 @@ Bool Assign::updateCandNode(int v)
         return False;
     }
 
-    // list of possible particles on the leges of the vertex.
+    // list of possible particles on the edges of the vertex.
     // pdass = (set of assigned particles)
     // puass = (list of particles of edges with two of more candidates)
 
@@ -9273,8 +9273,8 @@ int Assign::cmpPermGraph(int *p, MNodeClass *cl)
 //--------------------------------------------------------------
 int Assign::cmpNodes(int nd0, int nd1, MNodeClass *cn)
 {
-    //  Comarison of two nodes 'nd0' and 'nd1'
-    //    Ordering is lexcographical (class, connection configuration)
+    //  Comparison of two nodes 'nd0' and 'nd1'
+    //    Ordering is lexicographical (class, connection configuration)
     //
 
     int cmp;
@@ -9886,7 +9886,7 @@ static void   prilist(int n, const int *a, const char *msg)
 //------------------------------------------------------------
 static int nextPerm(int nelem, int nclass, int *cl, int *r, int *q, int *p, int count)
 {
-    // Sequatial generation of all permutations.
+    // Sequential generation of all permutations.
 
     int  j, k, n, e, t;
     Bool b;