postgresql/src/backend/lib/Makefile

#-------------------------------------------------------------------------
#
# Makefile--
#    Makefile for lib (miscellaneous stuff)
#
# IDENTIFICATION
#    src/backend/lib/Makefile
#
#-------------------------------------------------------------------------

subdir = src/backend/lib
top_builddir = ../../..
include $(top_builddir)/src/Makefile.global

OBJS = binaryheap.o bipartite_match.o bloomfilter.o dshash.o hyperloglog.o \
       ilist.o integerset.o knapsack.o pairingheap.o rbtree.o stringinfo.o

include $(top_srcdir)/src/backend/common.mk
Simplify make files, add full dependencies. 1996-10-27 10:55:05 +01:00			`#-------------------------------------------------------------------------`
			`#`
			`# Makefile--`
			`# Makefile for lib (miscellaneous stuff)`
			`#`
			`# IDENTIFICATION`
Remove cvs keywords from all files. 2010-09-20 22:08:53 +02:00			`# src/backend/lib/Makefile`
Simplify make files, add full dependencies. 1996-10-27 10:55:05 +01:00			`#`
			`#-------------------------------------------------------------------------`

Fix relative path references so that make knowns which dependencies refer to one another. Sort out builddir vs srcdir variable namings. Remove some now obsoleted make variables. 2000-08-31 18:12:35 +02:00			`subdir = src/backend/lib`
			`top_builddir = ../../..`
			`include $(top_builddir)/src/Makefile.global`
Simplify make files, add full dependencies. 1996-10-27 10:55:05 +01:00
Add Bloom filter implementation. A Bloom filter is a space-efficient, probabilistic data structure that can be used to test set membership. Callers will sometimes incur false positives, but never false negatives. The rate of false positives is a function of the total number of elements and the amount of memory available for the Bloom filter. Two classic applications of Bloom filters are cache filtering, and data synchronization testing. Any user of Bloom filters must accept the possibility of false positives as a cost worth paying for the benefit in space efficiency. This commit adds a test harness extension module, test_bloomfilter. It can be used to get a sense of how the Bloom filter implementation performs under varying conditions. This is infrastructure for the upcoming "heapallindexed" amcheck patch, which verifies the consistency of a heap relation against one of its indexes. Author: Peter Geoghegan Reviewed-By: Andrey Borodin, Michael Paquier, Thomas Munro, Andres Freund Discussion: https://postgr.es/m/CAH2-Wzm5VmG7cu1N-H=nnS57wZThoSDQU+F5dewx3o84M+jY=g@mail.gmail.com 2018-04-01 02:49:41 +02:00			`OBJS = binaryheap.o bipartite_match.o bloomfilter.o dshash.o hyperloglog.o \`
Add IntegerSet, to hold large sets of 64-bit ints efficiently. The set is implemented as a B-tree, with a compact representation at leaf items, using Simple-8b algorithm, so that clusters of nearby values use less memory. The IntegerSet isn't used for anything yet, aside from the test code, but we have two patches in the works that would benefit from this: A patch to allow GiST vacuum to delete empty pages, and a patch to reduce heap VACUUM's memory usage, by storing the list of dead TIDs more efficiently and lifting the 1 GB limit on its size. This includes a unit test module, in src/test/modules/test_integerset. It can be used to verify correctness, as a regression test, but if you run it manully, it can also print memory usage and execution time of some of the tests. Author: Heikki Linnakangas, Andrey Borodin Reviewed-by: Julien Rouhaud Discussion: https://www.postgresql.org/message-id/b5e82599-1966-5783-733c-1a947ddb729f@iki.fi 2019-03-22 12:21:19 +01:00			`ilist.o integerset.o knapsack.o pairingheap.o rbtree.o stringinfo.o`
Simplify make files, add full dependencies. 1996-10-27 10:55:05 +01:00
Refactor backend makefiles to remove lots of duplicate code 2008-02-19 11:30:09 +01:00			`include $(top_srcdir)/src/backend/common.mk`