/* 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)
{
* / \ / \
* 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:
*
* | |
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);
size_t n;
/* It would be best if we could process literal text at high speed. To
- * this end,
+ * this end, we have a table, indexed by the low-order bits of F, to tell
+ * us which special characters we need to stop at. This way, we can use
+ * `strcspn' to skip over literal text and stop at the next character which
+ * needs special handling. Entries in this table with a null pointer
+ * correspond to impossible flag settings.
*/
static const char *const delimtab[] = {