postgresql/src/backend/nodes
Tom Lane 6e07709760 Implement SQL-compliant treatment of row comparisons for < <= > >= cases
(previously we only did = and <> correctly).  Also, allow row comparisons
with any operators that are in btree opclasses, not only those with these
specific names.  This gets rid of a whole lot of indefensible assumptions
about the behavior of particular operators based on their names ... though
it's still true that IN and NOT IN expand to "= ANY".  The patch adds a
RowCompareExpr expression node type, and makes some changes in the
representation of ANY/ALL/ROWCOMPARE SubLinks so that they can share code
with RowCompareExpr.

I have not yet done anything about making RowCompareExpr an indexable
operator, but will look at that soon.

initdb forced due to changes in stored rules.
2005-12-28 01:30:02 +00:00
..
Makefile Initial implementation of lossy-tuple-bitmap data structures. 2005-04-17 22:24:02 +00:00
README make sure the $Id tags are converted to $PostgreSQL as well ... 2003-11-29 22:41:33 +00:00
bitmapset.c Standard pgindent run for 8.1. 2005-10-15 02:49:52 +00:00
copyfuncs.c Implement SQL-compliant treatment of row comparisons for < <= > >= cases 2005-12-28 01:30:02 +00:00
equalfuncs.c Implement SQL-compliant treatment of row comparisons for < <= > >= cases 2005-12-28 01:30:02 +00:00
list.c Standard pgindent run for 8.1. 2005-10-15 02:49:52 +00:00
makefuncs.c Standard pgindent run for 8.1. 2005-10-15 02:49:52 +00:00
nodeFuncs.c Tag appropriate files for rc3 2004-12-31 22:04:05 +00:00
nodes.c Tag appropriate files for rc3 2004-12-31 22:04:05 +00:00
outfuncs.c Implement SQL-compliant treatment of row comparisons for < <= > >= cases 2005-12-28 01:30:02 +00:00
params.c Tag appropriate files for rc3 2004-12-31 22:04:05 +00:00
print.c Standard pgindent run for 8.1. 2005-10-15 02:49:52 +00:00
read.c Standard pgindent run for 8.1. 2005-10-15 02:49:52 +00:00
readfuncs.c Implement SQL-compliant treatment of row comparisons for < <= > >= cases 2005-12-28 01:30:02 +00:00
tidbitmap.c Standard pgindent run for 8.1. 2005-10-15 02:49:52 +00:00
value.c Some more missed copyright notices. Many of these look like they 2005-01-01 20:44:34 +00:00

README

*******************************************************************************
*                                                                             *
* EXPLANATION OF THE NODE STRUCTURES                                          *
*    - Andrew Yu (11/94)                                                      *
*                                                                             *
* Copyright (c) 1994, Regents of the University of California                 *
*                                                                             *
* $PostgreSQL: pgsql/src/backend/nodes/README,v 1.2 2003/11/29 22:39:45 pgsql Exp $
*                                                                             *
*******************************************************************************

INTRODUCTION

The current node structures are plain old C structures. "Inheritance" is
achieved by convention. No additional functions will be generated. Functions
that manipulate node structures reside in this directory.


FILES IN THIS DIRECTORY

    Node manipulation functions:
	copyfuncs.c	- copying a node
	equalfuncs.c	- comparing a node
	outfuncs.c	- convert a node to ascii representation
	readfuncs.c	- convert ascii representation back to a node
	makefuncs.c	- creator functions for primitive nodes

    Node definitions:
	nodes.h		- define node tags (NodeTag)
	pg_list.h	- generic list 
	primnodes.h	- primitive nodes
	parsenodes.h	- parse tree nodes
	plannodes.h	- plan tree nodes
	relation.h	- inner plan tree nodes
	execnodes.h	- executor nodes
	memnodes.h	- memory nodes


STEPS TO ADD A NODE

Suppose you wana define a node Foo:

1. add a tag (T_Foo) to the enum NodeTag in nodes.h (You may have to
   recompile the whole tree after doing this.)
2. add the structure definition to the appropriate ???nodes.h file. If you
   intend to inherit from, say a Plan node, put Plan as the first field of
   you definition.
3. if you intend to use copyObject, equal, nodeToString or stringToNode,
   add an appropriate function to copyfuncs.c, equalfuncs.c, outfuncs.c
   and readfuncs.c accordingly. (Except for frequently used nodes, don't
   bother writing a creator function in makefuncs.c)


HISTORICAL NOTE

Prior to the current simple C structure definitions, the Node structures 
uses a pseudo-inheritance system which automatically generates creator and
accessor functions. Since every node inherits from LispValue, the whole thing
is a mess. Here's a little anecdote:

    LispValue definition -- class used to support lisp structures
    in C.  This is here because we did not want to totally rewrite
    planner and executor code which depended on lisp structures when
    we ported postgres V1 from lisp to C. -cim 4/23/90