Update comments for use of 'bool'.

diff --git a/lib/diffseq.h b/lib/diffseq.h
index 2bde469f76f3bb3e7ff2e7cf19574859ef4f0f1e..48847cdd0bf892e5eeaf78a28f9a6bfae0423124 100644 (file)
--- a/lib/diffseq.h
+++ b/lib/diffseq.h
@@ -54,7 +54,7 @@ static OFFSET too_expensive;  /* Edit scripts longer than this are too
 struct partition
 {
   OFFSET xmid, ymid;   /* Midpoints of this partition.  */
-  bool lo_minimal;     /* Nonzero if low half will be analyzed minimally.  */
+  bool lo_minimal;     /* True if low half will be analyzed minimally.  */
   bool hi_minimal;     /* Likewise for high half.  */
 };
 
@@ -66,7 +66,7 @@ struct partition
    When the two searches meet, we have found the midpoint of the shortest
    edit sequence.
 
-   If FIND_MINIMAL is nonzero, find the minimal edit script regardless
+   If FIND_MINIMAL is true, find the minimal edit script regardless
    of expense.  Otherwise, if the search is too expensive, use
    heuristics to stop the search and report a suboptimal answer.