John Naylor 8a1b31e6e5 Use bump context for TID bitmaps stored by vacuum ... Vacuum does not pfree individual entries, and only frees the entire storage space when finished with it. This allows using a bump context, eliminating the chunk header in each leaf allocation. Most leaf allocations will be 16 to 32 bytes, so that's a significant savings. TidStoreCreateLocal gets a boolean parameter to indicate that the created store is insert-only. This requires a separate tree context for iteration, since we free the iteration state after iteration completes. Discussion: https://postgr.es/m/CANWCAZac%3DpBePg3rhX8nXkUuaLoiAJJLtmnCfZsPEAS4EtJ%3Dkg%40mail.gmail.com Discussion: https://postgr.es/m/CANWCAZZQFfxvzO8yZHFWtQV+Z2gAMv1ku16Vu7KWmb5kZQyd1w@mail.gmail.com		2024-04-08 14:39:49 +07:00
..
binaryheap.h	Add functions to binaryheap for efficient key removal and update.	2024-04-03 10:44:21 +09:00
bipartite_match.h	Update copyright for 2024	2024-01-03 20:49:05 -05:00
bloomfilter.h	Update copyright for 2024	2024-01-03 20:49:05 -05:00
dshash.h	Fix comments for the dshash_parameters struct.	2024-02-27 09:44:59 -06:00
hyperloglog.h	Update copyright for 2024	2024-01-03 20:49:05 -05:00
ilist.h	Update copyright for 2024	2024-01-03 20:49:05 -05:00
integerset.h	Update copyright for 2024	2024-01-03 20:49:05 -05:00
knapsack.h	Update copyright for 2024	2024-01-03 20:49:05 -05:00
pairingheap.h	Use the pairing heap instead of a flat array for LSN replay waiters	2024-04-03 18:15:41 +03:00
qunique.h	Update copyright for 2024	2024-01-03 20:49:05 -05:00
radixtree.h	Use bump context for TID bitmaps stored by vacuum	2024-04-08 14:39:49 +07:00
rbtree.h	Update copyright for 2024	2024-01-03 20:49:05 -05:00
simplehash.h	simplehash: Free collisions array in SH_STAT	2024-04-07 19:08:41 -07:00
sort_template.h	Introduce overflow-safe integer comparison functions.	2024-02-16 13:37:02 -06:00
stringinfo.h	Add destroyStringInfo function for cleaning up StringInfos	2024-03-16 23:18:28 +01:00