postgresql/src/backend/lib
Alvaro Herrera 42f50cb8fa Fix overflow check in StringInfo; add missing casts
A few thinkos I introduced in fa2fa99552.  Also, amend a similarly
broken comment.

Report by Daniel Vérité.
Authors: Daniel Vérité, Álvaro Herrera
Discussion: https://postgr.es/m/1706e85e-60d2-494e-8a64-9af1e1b2186e@manitou-mail.org
2017-01-10 11:41:13 -03:00
..
binaryheap.c Update copyright via script for 2017 2017-01-03 13:48:53 -05:00
bipartite_match.c Update copyright via script for 2017 2017-01-03 13:48:53 -05:00
hyperloglog.c Update copyright via script for 2017 2017-01-03 13:48:53 -05:00
ilist.c Update copyright via script for 2017 2017-01-03 13:48:53 -05:00
Makefile Support GROUPING SETS, CUBE and ROLLUP. 2015-05-16 03:46:31 +02:00
pairingheap.c Update copyright via script for 2017 2017-01-03 13:48:53 -05:00
rbtree.c Update copyright via script for 2017 2017-01-03 13:48:53 -05:00
README Fix typos, update README. 2015-01-23 15:06:53 -05:00
stringinfo.c Fix overflow check in StringInfo; add missing casts 2017-01-10 11:41:13 -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.