Typo fix.

Etsuro Fujita
This commit is contained in:
Robert Haas 2013-09-18 08:57:44 -04:00
parent 1247ea28cb
commit 86a174bff0

View File

@ -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