File Manager

Hackfut Security File Manager

Current Path: /opt/alt/postgresql11/usr/include/pgsql/server/utils

opt / alt / postgresql11 / usr / include / pgsql / server / utils /

📁 ..
📄 acl.h(12.79 KB)
📄 array.h(10.61 KB)
📄 ascii.h(579 B)
📄 attoptcache.h(725 B)
📄 builtins.h(47.77 KB)
📄 bytea.h(1.58 KB)
📄 cash.h(2.07 KB)
📄 catcache.h(7.51 KB)
📄 combocid.h(698 B)
📄 date.h(7.73 KB)
📄 datetime.h(9.92 KB)
📄 datum.h(1.48 KB)
📄 dynahash.h(498 B)
📄 dynamic_loader.h(648 B)
📄 elog.h(12.56 KB)
📄 errcodes.h(19.61 KB)
📄 fmgroids.h(61.09 KB)
📄 fmgrtab.h(1.15 KB)
📄 formatting.h(1.41 KB)
📄 geo_decls.h(15.86 KB)
📄 guc.h(13.19 KB)
📄 guc_tables.h(7.15 KB)
📄 help_config.h(432 B)
📄 hsearch.h(5.51 KB)
📄 inet.h(2.66 KB)
📄 int8.h(4.03 KB)
📄 inval.h(1.81 KB)
📄 json.h(916 B)
📄 logtape.h(1.5 KB)
📄 lsyscache.h(6.51 KB)
📄 memutils.h(5.2 KB)
📄 nabstime.h(5.79 KB)
📄 numeric.h(1.88 KB)
📄 palloc.h(3.92 KB)
📄 pg_crc.h(4.36 KB)
📄 pg_crc_tables.h(19.73 KB)
📄 pg_locale.h(2.59 KB)
📄 pg_lzcompress.h(2.97 KB)
📄 pg_rusage.h(847 B)
📄 plancache.h(8.02 KB)
📄 portal.h(9.22 KB)
📄 probes.h(37.93 KB)
📄 ps_status.h(668 B)
📄 rangetypes.h(7.4 KB)
📄 rbtree.h(2.26 KB)
📄 rel.h(12.27 KB)
📄 relcache.h(3.17 KB)
📄 relmapper.h(1.68 KB)
📄 reltrigger.h(1.95 KB)
📄 resowner.h(5.07 KB)
📄 selfuncs.h(7.5 KB)
📄 snapmgr.h(1.59 KB)
📄 snapshot.h(2.59 KB)
📄 sortsupport.h(5.3 KB)
📄 spccache.h(556 B)
📄 syscache.h(5.51 KB)
📄 timestamp.h(9.5 KB)
📄 tqual.h(3.5 KB)
📄 tuplesort.h(4.62 KB)
📄 tuplestore.h(3.14 KB)
📄 typcache.h(4.26 KB)
📄 tzparser.h(1.13 KB)
📄 uuid.h(861 B)
📄 varbit.h(4.27 KB)
📄 xml.h(3.89 KB)

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 */

Hackfut Security File Manager

Editing: rbtree.h

Upload File

Create Folder