Description: Fix some spelling issues
Author: Andreas Tille <tille@debian.org>
Last-Update: Tue, 16 Oct 2018 10:51:06 +0200

--- a/src/ml2.c
+++ b/src/ml2.c
@@ -419,7 +419,7 @@ Node *internalnode(Tree *tr, char **chpp
 			
 			if (!strcmp(ident, idcomp)) {
 				if (usedtaxa[i]) {
-					fprintf(STDOUT, "\n\n\nUnable to proceed (multiple occurence of sequence '");
+					fprintf(STDOUT, "\n\n\nUnable to proceed (multiple occurrence of sequence '");
 					fprintf(STDOUT, "%s' in tree)\n\n\n", ident);
 #					if PARALLEL
 						PP_Finalize();
--- a/src/puzzle1.c
+++ b/src/puzzle1.c
@@ -3232,7 +3232,7 @@ void initeps(FILE *ofp)
 	/* PS definition of a centered print */
 	fprintf(ofp, "/centershow {\n");
 	fprintf(ofp, "   dup stringwidth pop %% get length of string\n");
-	fprintf(ofp, "   -2 div              %% devide length by -2\n");
+	fprintf(ofp, "   -2 div              %% divide length by -2\n");
 	fprintf(ofp, "   0 rmoveto           %% move half width to left\n");
 	fprintf(ofp, "   show\n");
 	fprintf(ofp, "} def\n");
@@ -4499,7 +4499,7 @@ fprintf(stderr, "TEST: %lu informative +
 				i+1, Rates[i], (1.0-fracinv)/(double) numcats);	
 	}
 	if (rhetmode == GAMMARATE || rhetmode == MIXEDRATE) {
-		fprintf(ofp, "\nCategories 1-%d approximate a continous ", numcats);
+		fprintf(ofp, "\nCategories 1-%d approximate a continuous ", numcats);
 		fprintf(ofp, "Gamma-distribution with expectation 1\n"); 
 		fprintf(ofp, "and variance ");
 		if (Geta == 1.0) fprintf(ofp, "infinity");
--- a/src/puzzle2.c
+++ b/src/puzzle2.c
@@ -100,7 +100,7 @@ void readid(FILE *infp,        /* in:  f
 			if (identif[t][j] != identif[i][j])
 				flag = FALSE;
 		if (flag) {
-			fprintf(STDOUT, "\n\n\nUnable to proceed (multiple occurence of sequence name '");
+			fprintf(STDOUT, "\n\n\nUnable to proceed (multiple occurrence of sequence name '");
 			fputid(STDOUT, t);
 			fprintf(STDOUT, "')\n\n\n");
 #			if PARALLEL
--- a/src/treesort.c
+++ b/src/treesort.c
@@ -549,7 +549,7 @@ treelistitemtype *addtree2list(char
 
 /**********/
 
-/* resort list of trees by number of occurences for output */
+/* resort list of trees by number of occurrences for output */
 void sortbynum(treelistitemtype *list, treelistitemtype **sortlist)
 {
 	treelistitemtype *tmpptr = NULL;
@@ -803,9 +803,9 @@ void fprintfsortedpstrees_old(FILE *outp
 				if (num == 1){
 					fprintf (output, "\n");
 					fprintf (output, "The following tree(s) occured in more than %.2f%% of the %d puzzling steps.\n", cutoff, itemsum);
-					fprintf (output, "The trees are orderd descending by the number of occurences.\n");
+					fprintf (output, "The trees are orderd descending by the number of occurrences.\n");
 					fprintf (output, "\n");
-					fprintf (output, "\n       occurences    ID  Phylip tree\n");
+					fprintf (output, "\n       occurrences    ID  Phylip tree\n");
 				}
 				fprintf (output, "%2d. %5d %6.2f%% %5d  ", num++, (*tmpptr).count, percent, (*tmpptr).id);
 			}