f2d70d32eb
SELECT schema1.func2(...). Aggregate names can be qualified at the syntactic level, but the qualification is ignored for the moment.
154 lines
4.6 KiB
C
154 lines
4.6 KiB
C
/*-------------------------------------------------------------------------
|
|
*
|
|
* pg_list.h
|
|
* POSTGRES generic list package
|
|
*
|
|
*
|
|
* Portions Copyright (c) 1996-2001, PostgreSQL Global Development Group
|
|
* Portions Copyright (c) 1994, Regents of the University of California
|
|
*
|
|
* $Id: pg_list.h,v 1.27 2002/04/09 20:35:55 tgl Exp $
|
|
*
|
|
*-------------------------------------------------------------------------
|
|
*/
|
|
#ifndef PG_LIST_H
|
|
#define PG_LIST_H
|
|
|
|
#include "nodes/nodes.h"
|
|
|
|
/* ----------------------------------------------------------------
|
|
* node definitions
|
|
* ----------------------------------------------------------------
|
|
*/
|
|
|
|
/*----------------------
|
|
* Value node
|
|
*
|
|
* The same Value struct is used for three node types: T_Integer,
|
|
* T_Float, and T_String. Integral values are actually represented
|
|
* by a machine integer, but both floats and strings are represented
|
|
* as strings. Using T_Float as the node type simply indicates that
|
|
* the contents of the string look like a valid numeric literal.
|
|
*
|
|
* (Before Postgres 7.0, we used a double to represent T_Float,
|
|
* but that creates loss-of-precision problems when the value is
|
|
* ultimately destined to be converted to NUMERIC. Since Value nodes
|
|
* are only used in the parsing process, not for runtime data, it's
|
|
* better to use the more general representation.)
|
|
*
|
|
* Note that an integer-looking string will get lexed as T_Float if
|
|
* the value is too large to fit in a 'long'.
|
|
*----------------------
|
|
*/
|
|
typedef struct Value
|
|
{
|
|
NodeTag type; /* tag appropriately (eg. T_String) */
|
|
union ValUnion
|
|
{
|
|
long ival; /* machine integer */
|
|
char *str; /* string */
|
|
} val;
|
|
} Value;
|
|
|
|
#define intVal(v) (((Value *)(v))->val.ival)
|
|
#define floatVal(v) atof(((Value *)(v))->val.str)
|
|
#define strVal(v) (((Value *)(v))->val.str)
|
|
|
|
|
|
/*----------------------
|
|
* List node
|
|
*----------------------
|
|
*/
|
|
typedef struct List
|
|
{
|
|
NodeTag type;
|
|
union
|
|
{
|
|
void *ptr_value;
|
|
int int_value;
|
|
} elem;
|
|
struct List *next;
|
|
} List;
|
|
|
|
#define NIL ((List *) NULL)
|
|
|
|
/* ----------------
|
|
* accessor macros
|
|
* ----------------
|
|
*/
|
|
|
|
/* anything that doesn't end in 'i' is assumed to be referring to the */
|
|
/* pointer version of the list (where it makes a difference) */
|
|
#define lfirst(l) ((l)->elem.ptr_value)
|
|
#define lnext(l) ((l)->next)
|
|
#define lsecond(l) lfirst(lnext(l))
|
|
|
|
#define lfirsti(l) ((l)->elem.int_value)
|
|
|
|
/*
|
|
* foreach -
|
|
* a convenience macro which loops through the list
|
|
*/
|
|
#define foreach(_elt_,_list_) \
|
|
for(_elt_=(_list_); _elt_!=NIL; _elt_=lnext(_elt_))
|
|
|
|
/*
|
|
* Convenience macros for building fixed-length lists
|
|
*/
|
|
#define makeList1(x1) lcons(x1, NIL)
|
|
#define makeList2(x1,x2) lcons(x1, makeList1(x2))
|
|
#define makeList3(x1,x2,x3) lcons(x1, makeList2(x2,x3))
|
|
#define makeList4(x1,x2,x3,x4) lcons(x1, makeList3(x2,x3,x4))
|
|
|
|
#define makeListi1(x1) lconsi(x1, NIL)
|
|
#define makeListi2(x1,x2) lconsi(x1, makeListi1(x2))
|
|
#define makeListi3(x1,x2,x3) lconsi(x1, makeListi2(x2,x3))
|
|
#define makeListi4(x1,x2,x3,x4) lconsi(x1, makeListi3(x2,x3,x4))
|
|
|
|
/*
|
|
* function prototypes in nodes/list.c
|
|
*/
|
|
extern int length(List *list);
|
|
extern void *llast(List *list);
|
|
extern int llasti(List *list);
|
|
extern List *nconc(List *list1, List *list2);
|
|
extern List *lcons(void *datum, List *list);
|
|
extern List *lconsi(int datum, List *list);
|
|
extern bool member(void *datum, List *list);
|
|
extern bool ptrMember(void *datum, List *list);
|
|
extern bool intMember(int datum, List *list);
|
|
extern Value *makeInteger(long i);
|
|
extern Value *makeFloat(char *numericStr);
|
|
extern Value *makeString(char *str);
|
|
extern Value *makeBitString(char *str);
|
|
extern List *lappend(List *list, void *datum);
|
|
extern List *lappendi(List *list, int datum);
|
|
extern List *lremove(void *elem, List *list);
|
|
extern List *LispRemove(void *elem, List *list);
|
|
extern List *lremovei(int elem, List *list);
|
|
extern List *ltruncate(int n, List *list);
|
|
|
|
extern void *nth(int n, List *l);
|
|
extern int nthi(int n, List *l);
|
|
extern void set_nth(List *l, int n, void *elem);
|
|
|
|
extern List *set_difference(List *list1, List *list2);
|
|
extern List *set_differencei(List *list1, List *list2);
|
|
extern List *lreverse(List *l);
|
|
extern List *set_union(List *list1, List *list2);
|
|
extern List *set_unioni(List *list1, List *list2);
|
|
|
|
extern bool equali(List *list1, List *list2);
|
|
extern bool sameseti(List *list1, List *list2);
|
|
extern bool nonoverlap_setsi(List *list1, List *list2);
|
|
extern bool is_subseti(List *list1, List *list2);
|
|
|
|
extern void freeList(List *list);
|
|
|
|
/* should be in nodes.h but needs List */
|
|
|
|
/* in copyfuncs.c */
|
|
extern List *listCopy(List *list);
|
|
|
|
#endif /* PG_LIST_H */
|