From f73f6b60f8b4ea0fb4894f4c08a9ab5eb3494953 Mon Sep 17 00:00:00 2001 From: Aleksander Alekseev Date: Wed, 25 Jun 2025 20:43:30 +0300 Subject: [PATCH v1] Correct src/backend/lib/README --- src/backend/lib/README | 4 ---- 1 file changed, 4 deletions(-) diff --git a/src/backend/lib/README b/src/backend/lib/README index f2fb591237d..c28cbe356f0 100644 --- a/src/backend/lib/README +++ b/src/backend/lib/README @@ -1,8 +1,6 @@ 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 @@ -21,8 +19,6 @@ 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 -- 2.49.0