btree: spelling fix
authorBrad Hards <bradh@frogmouth.net>
Sun, 16 Jan 2011 06:19:12 +0000 (17:19 +1100)
committerRusty Russell <rusty@rustcorp.com.au>
Mon, 17 Jan 2011 05:58:53 +0000 (16:28 +1030)
ccan/btree/test/run-random-access.c

index ab9d33e54c0824379e5251bb009fe202dfffc43d..839cb28cb745a064743bde179adbf8006fa9b059 100644 (file)
@@ -290,7 +290,7 @@ static int test_insert(struct btree *btree, size_t key[], size_t count)
        if (!find(btree, key, k))
                return 0;
        
-       /* Make sure key's presense is consistent with our array. */
+       /* Make sure key's presence is consistent with our array. */
        found = btree_find_first(btree, &key[k], iter);
        if (key[k]) {
                if (!found || iter->item != &key[k])