X-Git-Url: https://www.chiark.greenend.org.uk/ucgi/~mdw/git/runlisp/blobdiff_plain/13cc23c5d624a4a61a5b378a998fc62ac293a5a7..3b27cf53da4dd3258fdc47b74633ae928428c879:/lib.h?ds=sidebyside

diff --git a/lib.h b/lib.h
index 0e285a4..cba8965 100644
--- a/lib.h
+++ b/lib.h
@@ -400,8 +400,8 @@ struct treap_node {
 /* We can't allocate nodes ourselves, because only the caller knows how.
  * Instead, insertion is split into two operations: `treap_probe' looks to
  * see whether a matching node is already in the treap, and returns it if so;
- * otherwise, it flls in this `treap_path' structure, which is passed back to
- * `treap_insert' to help it add the fresh node into the treap.  (See the
+ * otherwise, it fills in this `treap_path' structure, which is passed back
+ * to `treap_insert' to help it add the fresh node into the treap.  (See the
  * commentary in `treap_probe' and `treap_insert' for the details.)
  */
 #define TREAP_PATHMAX 64