postgresql/src/backend/lib
Alvaro Herrera e9e44a0953 Revert "Permit dump/reload of not-too-large >1GB tuples"
This reverts commit 4e01ecae98.
Per Tom Lane, changing the definition of StringInfoData amounts to an
ABI break, which is unacceptable in back branches.
2016-12-06 12:46:03 -03:00
..
binaryheap.c Update copyright for 2016 2016-01-02 13:33:40 -05:00
bipartite_match.c Update copyright for 2016 2016-01-02 13:33:40 -05:00
hyperloglog.c Remove mergeHyperLogLog. 2016-04-27 10:55:32 -04:00
ilist.c Update copyright for 2016 2016-01-02 13:33:40 -05:00
Makefile Support GROUPING SETS, CUBE and ROLLUP. 2015-05-16 03:46:31 +02:00
pairingheap.c Update copyright for 2016 2016-01-02 13:33:40 -05:00
rbtree.c Update copyright for 2016 2016-01-02 13:33:40 -05:00
README Fix typos, update README. 2015-01-23 15:06:53 -05:00
stringinfo.c Revert "Permit dump/reload of not-too-large >1GB tuples" 2016-12-06 12:46:03 -03:00

This directory contains a general purpose data structures, for use anywhere
in the backend:

binaryheap.c - a binary heap

hyperloglog.c - a streaming cardinality estimator

pairingheap.c - a pairing heap

rbtree.c - a red-black tree

ilist.c - single and double-linked lists.

stringinfo.c - an extensible string type


Aside from the inherent characteristics of the data structures, there are a
few practical differences between the binary heap and the pairing heap. The
binary heap is fully allocated at creation, and cannot be expanded beyond the
allocated size. The pairing heap on the other hand has no inherent maximum
size, but the caller needs to allocate each element being stored in the heap,
while the binary heap works with plain Datums or pointers.

The linked-lists in ilist.c can be embedded directly into other structs, as
opposed to the List interface in nodes/pg_list.h.