mirror of
https://github.com/postgres/postgres.git
synced 2026-04-15 22:10:45 -04:00
686d399f2b
round() is from C99. Use rint() instead. There are behavioral
differences between round() and rint(), but they should not matter to
the Bloom filter optimal_k() function. We already assume POSIX
behavior for rint(), so there is no question of rint() not using
"rounds towards nearest" as its rounding mode.
Cleanup from commit
|
||
|---|---|---|
| .. | ||
| binaryheap.c | ||
| bipartite_match.c | ||
| bloomfilter.c | ||
| dshash.c | ||
| hyperloglog.c | ||
| ilist.c | ||
| knapsack.c | ||
| Makefile | ||
| pairingheap.c | ||
| rbtree.c | ||
| README | ||
| stringinfo.c | ||
This directory contains a general purpose data structures, for use anywhere in the backend: binaryheap.c - a binary heap bloomfilter.c - probabilistic, space-efficient set membership testing 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.