mirror of
https://git.postgresql.org/git/postgresql.git
synced 2026-02-15 02:46:59 +08:00
17f188cf00
The README lists all the files available in the directory, along with short descriptions of each, but a few newly added ones were missing. While we're at it, reorder the list into alphabetical order. Author: Takeshi Ideriha Discussion: https://www.postgresql.org/message-id/4E72940DA2BF16479384A86D54D0988A56793487@G01JPEXMBKW04
34 lines
1.1 KiB
Plaintext
34 lines
1.1 KiB
Plaintext
This directory contains a general purpose data structures, for use anywhere
|
|
in the backend:
|
|
|
|
binaryheap.c - a binary heap
|
|
|
|
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
|
|
|
|
knapsack.c - knapsack problem solver
|
|
|
|
pairingheap.c - a pairing heap
|
|
|
|
rbtree.c - a red-black tree
|
|
|
|
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.
|