X-Git-Url: https://git.distorted.org.uk/~mdw/runlisp/blobdiff_plain/0b17bcece9c062d9cc010ff995d5fa0d02c0adbf..979d91ebb366310a71913d8023129c93ad2470fc:/lib.c

diff --git a/lib.c b/lib.c
index a73f0d0..4eadf70 100644
--- a/lib.c
+++ b/lib.c
@@ -377,7 +377,7 @@ void argv_prependl(struct argv *av, ...)
 /* Return nonzero if the AN-byte string A is strictly precedes the BN-byte
  * string B in a lexicographic ordering.
  *
- * All comparisons of keys is handled by this function.
+ * All comparison of keys is handled by this function.
  */
 static int str_lt(const char *a, size_t an, const char *b, size_t bn)
 {
@@ -515,7 +515,7 @@ void treap_insert(struct treap *t, const struct treap_path *p,
      *		  /   \			      /   \
      *		X       Y		    Y	    Z
      *
-     * On the other hand, if we ere planning to hook N as the right subtree
+     * On the other hand, if we were planning to hook N as the right subtree
      * of U, then we do the opposite rotation:
      *
      *		    |				|
@@ -735,7 +735,7 @@ static void check_subtree(struct treap_node *n, unsigned maxwt,
   if (khi) assert(STRCMP(n->k, <, khi));
 
   /* Check the left subtree.  Node weights must be bounded above by our own
-   * weight.  And everykey in the left subtree must be smaller than our
+   * weight.  And every key in the left subtree must be smaller than our
    * current key.  We propagate the lower bound.
    */
   if (n->left) check_subtree(n->left, n->wt, klo, n->k);