Etsuro Fujita
pull/6/head
Robert Haas 12 years ago
parent 1247ea28cb
commit 86a174bff0
  1. 2
      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

Loading…
Cancel
Save