Skip to content

Commit fa9153e

Browse files
afiskonCommitfest Bot
authored andcommitted
Correct src/backend/lib/README
1 parent 62a47ae commit fa9153e

File tree

1 file changed

+0
-4
lines changed

1 file changed

+0
-4
lines changed

src/backend/lib/README

Lines changed: 0 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,6 @@
11
This directory contains a general purpose data structures, for use anywhere
22
in the backend:
33

4-
binaryheap.c - a binary heap
5-
64
bipartite_match.c - Hopcroft-Karp maximum cardinality algorithm for bipartite graphs
75

86
bloomfilter.c - probabilistic, space-efficient set membership testing
@@ -21,8 +19,6 @@ pairingheap.c - a pairing heap
2119

2220
rbtree.c - a red-black tree
2321

24-
stringinfo.c - an extensible string type
25-
2622

2723
Aside from the inherent characteristics of the data structures, there are a
2824
few practical differences between the binary heap and the pairing heap. The

0 commit comments

Comments
 (0)