mirror of
https://github.com/postgres/postgres.git
synced 2026-04-08 02:35:51 -04:00
6f0738ddec
Introduce dshash_find_or_insert_extended, which is just like dshash_find_or_insert except that it takes a flags argument. Currently, the only supported flag is DSHASH_INSERT_NO_OOM, but I have chosen to use an integer rather than a boolean in case we end up with more flags in the future. Reviewed-by: Chao Li <li.evan.chao@gmail.com> Reviewed-by: Sami Imseih <samimseih@gmail.com> Discussion: http://postgr.es/m/CA+TgmoaJwUukUZGu7_yL74oMTQQz2=zqucMhF9+9xBmSC5us1w@mail.gmail.com |
||
|---|---|---|
| .. | ||
| bipartite_match.c | ||
| bloomfilter.c | ||
| dshash.c | ||
| hyperloglog.c | ||
| ilist.c | ||
| integerset.c | ||
| knapsack.c | ||
| Makefile | ||
| meson.build | ||
| pairingheap.c | ||
| rbtree.c | ||
| README | ||
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.