SM0 She11

Path: / / usr / include / pgsql / server / utils

Full Path (server): /usr/include/pgsql/server/utils

📄 acl.h [E] [D]
📄 array.h [E] [D]
📄 ascii.h [E] [D]
📄 attoptcache.h [E] [D]
📄 builtins.h [E] [D]
📄 bytea.h [E] [D]
📄 cash.h [E] [D]
📄 catcache.h [E] [D]
📄 combocid.h [E] [D]
📄 date.h [E] [D]
📄 datetime.h [E] [D]
📄 datum.h [E] [D]
📄 dynahash.h [E] [D]
📄 dynamic_loader.h [E] [D]
📄 elog.h [E] [D]
📄 errcodes.h [E] [D]
📄 fmgroids.h [E] [D]
📄 fmgrtab.h [E] [D]
📄 formatting.h [E] [D]
📄 geo_decls.h [E] [D]
📄 guc.h [E] [D]
📄 guc_tables.h [E] [D]
📄 help_config.h [E] [D]
📄 hsearch.h [E] [D]
📄 inet.h [E] [D]
📄 int8.h [E] [D]
📄 inval.h [E] [D]
📄 json.h [E] [D]
📄 logtape.h [E] [D]
📄 lsyscache.h [E] [D]
📄 memutils.h [E] [D]
📄 nabstime.h [E] [D]
📄 numeric.h [E] [D]
📄 palloc.h [E] [D]
📄 pg_crc.h [E] [D]
📄 pg_crc_tables.h [E] [D]
📄 pg_locale.h [E] [D]
📄 pg_lzcompress.h [E] [D]
📄 pg_rusage.h [E] [D]
📄 plancache.h [E] [D]
📄 portal.h [E] [D]
📄 probes.h [E] [D]
📄 ps_status.h [E] [D]
📄 rangetypes.h [E] [D]
📄 rbtree.h [E] [D]
📄 rel.h [E] [D]
📄 relcache.h [E] [D]
📄 relmapper.h [E] [D]
📄 reltrigger.h [E] [D]
📄 resowner.h [E] [D]
📄 selfuncs.h [E] [D]
📄 snapmgr.h [E] [D]
📄 snapshot.h [E] [D]
📄 sortsupport.h [E] [D]
📄 spccache.h [E] [D]
📄 syscache.h [E] [D]
📄 timestamp.h [E] [D]
📄 tqual.h [E] [D]
📄 tuplesort.h [E] [D]
📄 tuplestore.h [E] [D]
📄 typcache.h [E] [D]
📄 tzparser.h [E] [D]
📄 uuid.h [E] [D]
📄 varbit.h [E] [D]
📄 xml.h [E] [D]

Editing: rbtree.h

/*-------------------------------------------------------------------------
 *
 * rbtree.h
 *	  interface for PostgreSQL generic Red-Black binary tree package
 *
 * Copyright (c) 2009-2012, PostgreSQL Global Development Group
 *
 * IDENTIFICATION
 *		src/include/utils/rbtree.h
 *
 *-------------------------------------------------------------------------
 */
#ifndef RBTREE_H
#define RBTREE_H

/*
 * RBNode is intended to be used as the first field of a larger struct,
 * whose additional fields carry whatever payload data the caller needs
 * for a tree entry.  (The total size of that larger struct is passed to
 * rb_create.)	RBNode is declared here to support this usage, but
 * callers must treat it as an opaque struct.
 */
typedef struct RBNode
{
	char		iteratorState;	/* workspace for iterating through tree */
	char color;					/* node's current color, red or black */
	struct RBNode *left;		/* left child, or RBNIL if none */
	struct RBNode *right;		/* right child, or RBNIL if none */
	struct RBNode *parent;		/* parent, or NULL (not RBNIL!) if none */
} RBNode;

/* Opaque struct representing a whole tree */
typedef struct RBTree RBTree;

/* Available tree iteration orderings */
typedef enum RBOrderControl
{
	LeftRightWalk,				/* inorder: left child, node, right child */
	RightLeftWalk,				/* reverse inorder: right, node, left */
	DirectWalk,					/* preorder: node, left child, right child */
	InvertedWalk				/* postorder: left child, right child, node */
} RBOrderControl;

/* Support functions to be provided by caller */
typedef int (*rb_comparator) (const RBNode *a, const RBNode *b, void *arg);
typedef void (*rb_combiner) (RBNode *existing, const RBNode *newdata, void *arg);
typedef RBNode *(*rb_allocfunc) (void *arg);
typedef void (*rb_freefunc) (RBNode *x, void *arg);

extern RBTree *rb_create(Size node_size,
		  rb_comparator comparator,
		  rb_combiner combiner,
		  rb_allocfunc allocfunc,
		  rb_freefunc freefunc,
		  void *arg);

extern RBNode *rb_find(RBTree *rb, const RBNode *data);
extern RBNode *rb_leftmost(RBTree *rb);

extern RBNode *rb_insert(RBTree *rb, const RBNode *data, bool *isNew);
extern void rb_delete(RBTree *rb, RBNode *node);

extern void rb_begin_iterate(RBTree *rb, RBOrderControl ctrl);
extern RBNode *rb_iterate(RBTree *rb);

#endif   /* RBTREE_H */