We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 7fb3c38 commit 94e2e15Copy full SHA for 94e2e15
src/backend/lib/README
@@ -1,8 +1,6 @@
1
This directory contains a general purpose data structures, for use anywhere
2
in the backend:
3
4
-binaryheap.c - a binary heap
5
-
6
bipartite_match.c - Hopcroft-Karp maximum cardinality algorithm for bipartite graphs
7
8
bloomfilter.c - probabilistic, space-efficient set membership testing
@@ -21,8 +19,6 @@ pairingheap.c - a pairing heap
21
19
22
20
rbtree.c - a red-black tree
23
24
-stringinfo.c - an extensible string type
25
26
27
Aside from the inherent characteristics of the data structures, there are a
28
few practical differences between the binary heap and the pairing heap. The
0 commit comments