mirror of
https://github.com/postgres/postgres.git
synced 2026-01-13 12:22:55 +03:00
4a8c5d0375
scans, using in-memory tuple ID bitmaps as the intermediary. The planner frontend (path creation and cost estimation) is not there yet, so none of this code can be executed. I have tested it using some hacked planner code that is far too ugly to see the light of day, however. Committing now so that the bulk of the infrastructure changes go in before the tree drifts under me.
26 lines
857 B
C
26 lines
857 B
C
/*-------------------------------------------------------------------------
|
|
*
|
|
* nodeBitmapAnd.h
|
|
*
|
|
*
|
|
*
|
|
* Portions Copyright (c) 1996-2005, PostgreSQL Global Development Group
|
|
* Portions Copyright (c) 1994, Regents of the University of California
|
|
*
|
|
* $PostgreSQL: pgsql/src/include/executor/nodeBitmapAnd.h,v 1.1 2005/04/19 22:35:17 tgl Exp $
|
|
*
|
|
*-------------------------------------------------------------------------
|
|
*/
|
|
#ifndef NODEBITMAPAND_H
|
|
#define NODEBITMAPAND_H
|
|
|
|
#include "nodes/execnodes.h"
|
|
|
|
extern int ExecCountSlotsBitmapAnd(BitmapAnd *node);
|
|
extern BitmapAndState *ExecInitBitmapAnd(BitmapAnd *node, EState *estate);
|
|
extern Node *MultiExecBitmapAnd(BitmapAndState *node);
|
|
extern void ExecEndBitmapAnd(BitmapAndState *node);
|
|
extern void ExecReScanBitmapAnd(BitmapAndState *node, ExprContext *exprCtxt);
|
|
|
|
#endif /* NODEBITMAPAND_H */
|