X-Git-Url: https://git.ozlabs.org/?p=ccan;a=blobdiff_plain;f=ccan%2Fbtree%2Ftest%2Frun-random-access.c;h=839cb28cb745a064743bde179adbf8006fa9b059;hp=ab9d33e54c0824379e5251bb009fe202dfffc43d;hb=838db0d7ea37fc2a21d03d159b55b042f8144cb3;hpb=8f7447e48f6405a083919f3d6b591eb7dfbc6a9f;ds=sidebyside

diff --git a/ccan/btree/test/run-random-access.c b/ccan/btree/test/run-random-access.c
index ab9d33e5..839cb28c 100644
--- a/ccan/btree/test/run-random-access.c
+++ b/ccan/btree/test/run-random-access.c
@@ -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])