Commit 86a174bf authored by Robert Haas's avatar Robert Haas

Typo fix.

Etsuro Fujita
parent 1247ea28
...@@ -23,7 +23,7 @@ ...@@ -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 * 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 * 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 * of size BLCKSZ. Rather than assuming we know the exact amount of overhead
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment