|
8 | 8 | * or in pg_config.h afterwards. Of course, if you edit pg_config.h, then your |
9 | 9 | * changes will be overwritten the next time you run configure. |
10 | 10 | * |
11 | | - * $Id: pg_config.h.in,v 1.33 2002/11/07 22:08:30 tgl Exp $ |
| 11 | + * $Id: pg_config.h.in,v 1.34 2002/11/10 00:38:21 momjian Exp $ |
12 | 12 | */ |
13 | 13 |
|
14 | 14 | #ifndefPG_CONFIG_H |
|
185 | 185 | */ |
186 | 186 | /* #define ALLOW_DANGEROUS_LO_FUNCTIONS */ |
187 | 187 |
|
188 | | -/* |
189 | | - * Use btree bulkload code: |
190 | | - * this code is moderately slow (~10% slower) compared to the regular |
191 | | - * btree (insertion) build code on sorted or well-clustered data. on |
192 | | - * random data, however, the insertion build code is unusable -- the |
193 | | - * difference on a 60MB heap is a factor of 15 because the random |
194 | | - * probes into the btree thrash the buffer pool. |
195 | | - * |
196 | | - * Great thanks to Paul M. Aoki (aoki@CS.Berkeley.EDU) |
197 | | - */ |
198 | | -#defineFASTBUILD/* access/nbtree/nbtsort.c */ |
199 | | - |
200 | 188 | /* |
201 | 189 | * MAXPGPATH: standard size of a pathname buffer in Postgres (hence, |
202 | 190 | * maximum usable pathname length is one less). |
|
277 | 265 | */ |
278 | 266 | /* #define COPY_PARSE_PLAN_TREES */ |
279 | 267 |
|
280 | | -/* Enable debugging print statements in the date/time support routines. */ |
281 | | -/* #define DATEDEBUG */ |
282 | | - |
283 | 268 | /* Enable debugging print statements for lock-related operations. */ |
284 | 269 | /* #define LOCK_DEBUG */ |
285 | 270 |
|
|