From a71016725a61073f437a9e725af564a6dc371a38 Mon Sep 17 00:00:00 2001 From: Mark Wooding Date: Wed, 26 May 2021 13:21:55 +0100 Subject: [PATCH] lib.c: Fix some minor commentary typos. --- lib.c | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) 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); -- 2.11.0