code comments: spell

Junio C Hamano · Junio C Hamano · commit 82f9d58a397e · 2005-12-29T01:32:56.000-08:00
Signed-off-by: Junio C Hamano &lt;junkio@cox.net&gt;
diff --git a/date.c b/date.c
@@ -326,7 +326,7 @@ static int match_digit(const char *date, struct tm *tm, int *offset, int *tm_gmt
 
 	/*
 	 * NOTE! We will give precedence to day-of-month over month or
-	 * year numebers in the 1-12 range. So 05 is always "mday 5",
+	 * year numbers in the 1-12 range. So 05 is always "mday 5",
 	 * unless we already have a mday..
 	 *
 	 * IOW, 01 Apr 05 parses as "April 1st, 2005".
diff --git a/diff-index.c b/diff-index.c
@@ -116,7 +116,7 @@ static int diff_cache(struct cache_entry **ac, int entries, const char **pathspe
 			/* We come here with ce pointing at stage 1
 			 * (original tree) and ac[1] pointing at stage
 			 * 3 (unmerged).  show-modified with
-			 * report-mising set to false does not say the
+			 * report-missing set to false does not say the
 			 * file is deleted but reports true if work
 			 * tree does not have it, in which case we
 			 * fall through to report the unmerged state.
diff --git a/diff.c b/diff.c
@@ -787,7 +787,7 @@ int diff_setup_done(struct diff_options *options)
 			 * so it is safe for us to do this here.  Also
 			 * it does not smudge active_cache or active_nr
 			 * when it fails, so we do not have to worry about
-			 * cleaning it up oufselves either.
+			 * cleaning it up ourselves either.
 			 */
 			read_cache();
 	}
diff --git a/epoch.c b/epoch.c
@@ -190,7 +190,7 @@ static void free_mass_counter(struct mass_counter *counter)
  * enqueued, enqueuing the commit in a list of pending commits, in latest
  * commit date first order.
  *
- * The algorithm then preceeds to visit each commit in the pending queue.
+ * The algorithm then proceeds to visit each commit in the pending queue.
  * Upon each visit, the pending mass is added to the mass already seen for that
  * commit and then divided into N equal portions, where N is the number of
  * parents of the commit being visited. The divided portions are then injected
diff --git a/ident.c b/ident.c
@@ -140,7 +140,7 @@ static int copy(char *buf, int size, int offset, const char *src)
 
 	/*
 	 * Copy the rest to the buffer, but avoid the special
-	 * characters '\n' '<' and '>' that act as delimeters on
+	 * characters '\n' '<' and '>' that act as delimiters on
 	 * a identification line
 	 */
 	for (i = 0; i < len; i++) {
diff --git a/ls-files.c b/ls-files.c
@@ -169,7 +169,7 @@ static int excluded_1(const char *pathname,
 			}
 			else {
 				/* match with FNM_PATHNAME:
-				 * exclude has base (baselen long) inplicitly
+				 * exclude has base (baselen long) implicitly
 				 * in front of it.
 				 */
 				int baselen = x->baselen;
diff --git a/pack-objects.c b/pack-objects.c
@@ -119,7 +119,7 @@ static unsigned long write_one(struct sha1file *f,
 		return offset;
 	e->offset = offset;
 	offset += write_object(f, e);
-	/* if we are delitified, write out its base object. */
+	/* if we are deltified, write out its base object. */
 	if (e->delta)
 		offset = write_one(f, e->delta, offset);
 	return offset;

Original file line number	Diff line number	Diff line change
`@@ -326,7 +326,7 @@ static int match_digit(const char date, struct tm tm, int offset, int tm_gmt`
`326`	`326`
`327`	`327`	`/*`
`328`	`328`	`* NOTE! We will give precedence to day-of-month over month or`
`329`		`- * year numebers in the 1-12 range. So 05 is always "mday 5",`
	`329`	`+ * year numbers in the 1-12 range. So 05 is always "mday 5",`
`330`	`330`	`* unless we already have a mday..`
`331`	`331`	`*`
`332`	`332`	`* IOW, 01 Apr 05 parses as "April 1st, 2005".`
Original file line number	Diff line number	Diff line change
`@@ -787,7 +787,7 @@ int diff_setup_done(struct diff_options *options)`
`787`	`787`	`* so it is safe for us to do this here. Also`
`788`	`788`	`* it does not smudge active_cache or active_nr`
`789`	`789`	`* when it fails, so we do not have to worry about`
`790`		`- * cleaning it up oufselves either.`
	`790`	`+ * cleaning it up ourselves either.`
`791`	`791`	`*/`
`792`	`792`	`read_cache();`
`793`	`793`	`}`
Original file line number	Diff line number	Diff line change
`@@ -190,7 +190,7 @@ static void free_mass_counter(struct mass_counter *counter)`
`190`	`190`	`* enqueued, enqueuing the commit in a list of pending commits, in latest`
`191`	`191`	`* commit date first order.`
`192`	`192`	`*`
`193`		`- * The algorithm then preceeds to visit each commit in the pending queue.`
	`193`	`+ * The algorithm then proceeds to visit each commit in the pending queue.`
`194`	`194`	`* Upon each visit, the pending mass is added to the mass already seen for that`
`195`	`195`	`* commit and then divided into N equal portions, where N is the number of`
`196`	`196`	`* parents of the commit being visited. The divided portions are then injected`
Original file line number	Diff line number	Diff line change
`@@ -169,7 +169,7 @@ static int excluded_1(const char *pathname,`
`169`	`169`	`}`
`170`	`170`	`else {`
`171`	`171`	`/* match with FNM_PATHNAME:`
`172`		`- * exclude has base (baselen long) inplicitly`
	`172`	`+ * exclude has base (baselen long) implicitly`
`173`	`173`	`* in front of it.`
`174`	`174`	`*/`
`175`	`175`	`int baselen = x->baselen;`