From 86a174bff0730791c5c262d646d4fe28c2485be1 Mon Sep 17 00:00:00 2001 From: Robert Haas Date: Wed, 18 Sep 2013 08:57:44 -0400 Subject: [PATCH] Typo fix. Etsuro Fujita --- src/backend/access/spgist/spgtextproc.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/backend/access/spgist/spgtextproc.c b/src/backend/access/spgist/spgtextproc.c index e430d9c1ace..f1379e0b1f4 100644 --- a/src/backend/access/spgist/spgtextproc.c +++ b/src/backend/access/spgist/spgtextproc.c @@ -23,7 +23,7 @@ /* - * In the worst case, a inner tuple in a text radix tree could have as many + * In the worst case, an inner tuple in a text radix tree could have as many * as 256 nodes (one for each possible byte value). Each node can take 16 * bytes on MAXALIGN=8 machines. The inner tuple must fit on an index page * of size BLCKSZ. Rather than assuming we know the exact amount of overhead