mirror of
https://github.com/postgres/postgres.git
synced 2026-01-27 21:43:08 +03:00
94e2e150ec
binaryheap.c and stringinfo.c have been moved to src/common/ by respectively5af0263afdand26aaf97b68, and the README patched here still mentioned these two files as available in src/backend/lib/. Author: Aleksander Alekseev <aleksander@timescale.com> Discussion: https://postgr.es/m/CAJ7c6TPg-=tC+fzq0tGTtmL7r79-aWeCmpwAyQiGu0N+sKGj8Q@mail.gmail.com
32 lines
1.1 KiB
Plaintext
32 lines
1.1 KiB
Plaintext
This directory contains a general purpose data structures, for use anywhere
|
|
in the backend:
|
|
|
|
bipartite_match.c - Hopcroft-Karp maximum cardinality algorithm for bipartite graphs
|
|
|
|
bloomfilter.c - probabilistic, space-efficient set membership testing
|
|
|
|
dshash.c - concurrent hash tables backed by dynamic shared memory areas
|
|
|
|
hyperloglog.c - a streaming cardinality estimator
|
|
|
|
ilist.c - single and double-linked lists
|
|
|
|
integerset.c - a data structure for holding large set of integers
|
|
|
|
knapsack.c - knapsack problem solver
|
|
|
|
pairingheap.c - a pairing heap
|
|
|
|
rbtree.c - a red-black tree
|
|
|
|
|
|
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.
|