diff options
| author | Neil Conway | 2004-04-25 18:23:57 +0000 |
|---|---|---|
| committer | Neil Conway | 2004-04-25 18:23:57 +0000 |
| commit | 1812d3b233e40d6e94e2105c3da4b1fca93c9385 (patch) | |
| tree | 8e121bc3cc1d8951e7c94f1c590296bae80765bd /src/include | |
| parent | a3015829ee0ec22917a5e1a6ee3432fa8ef3a811 (diff) | |
Remove the last traces of Joe Hellerstein's "xfunc" optimization. Patch
from Alvaro Herrera. Also, removed lispsort.c, since it is no longer
used.
Diffstat (limited to 'src/include')
| -rw-r--r-- | src/include/nodes/relation.h | 5 |
1 files changed, 1 insertions, 4 deletions
diff --git a/src/include/nodes/relation.h b/src/include/nodes/relation.h index 460679416f1..87d9f5964e2 100644 --- a/src/include/nodes/relation.h +++ b/src/include/nodes/relation.h @@ -7,7 +7,7 @@ * Portions Copyright (c) 1996-2003, PostgreSQL Global Development Group * Portions Copyright (c) 1994, Regents of the University of California * - * $PostgreSQL: pgsql/src/include/nodes/relation.h,v 1.93 2004/01/05 23:39:54 tgl Exp $ + * $PostgreSQL: pgsql/src/include/nodes/relation.h,v 1.94 2004/04/25 18:23:57 neilc Exp $ * *------------------------------------------------------------------------- */ @@ -99,8 +99,6 @@ typedef struct QualCost * (regardless of its ordering) * cheapest_unique_path - for caching cheapest path to produce unique * (no duplicates) output from relation - * pruneable - flag to let the planner know whether it can prune the - * pathlist of this RelOptInfo or not. * * If the relation is a base relation it will have these fields set: * @@ -193,7 +191,6 @@ typedef struct RelOptInfo struct Path *cheapest_startup_path; struct Path *cheapest_total_path; struct Path *cheapest_unique_path; - bool pruneable; /* information about a base rel (not set for join rels!) */ Index relid; |