1
0
mirror of https://github.com/postgres/postgres.git synced 2025-07-28 23:42:10 +03:00

Update copyright for 2021

Backpatch-through: 9.5
This commit is contained in:
Bruce Momjian
2021-01-02 13:06:25 -05:00
parent 4d3f03f422
commit ca3b37487b
1821 changed files with 1834 additions and 1834 deletions

View File

@ -3,7 +3,7 @@
* binaryheap.c
* A simple binary heap implementation
*
* Portions Copyright (c) 2012-2020, PostgreSQL Global Development Group
* Portions Copyright (c) 2012-2021, PostgreSQL Global Development Group
*
* IDENTIFICATION
* src/backend/lib/binaryheap.c

View File

@ -7,7 +7,7 @@
*
* https://en.wikipedia.org/w/index.php?title=Hopcroft%E2%80%93Karp_algorithm&oldid=593898016
*
* Copyright (c) 2015-2020, PostgreSQL Global Development Group
* Copyright (c) 2015-2021, PostgreSQL Global Development Group
*
* IDENTIFICATION
* src/backend/lib/bipartite_match.c

View File

@ -24,7 +24,7 @@
* caller many authoritative lookups, such as expensive probes of a much larger
* on-disk structure.
*
* Copyright (c) 2018-2020, PostgreSQL Global Development Group
* Copyright (c) 2018-2021, PostgreSQL Global Development Group
*
* IDENTIFICATION
* src/backend/lib/bloomfilter.c

View File

@ -20,7 +20,7 @@
* Future versions may support iterators and incremental resizing; for now
* the implementation is minimalist.
*
* Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
* Portions Copyright (c) 1996-2021, PostgreSQL Global Development Group
* Portions Copyright (c) 1994, Regents of the University of California
*
* IDENTIFICATION

View File

@ -3,7 +3,7 @@
* hyperloglog.c
* HyperLogLog cardinality estimator
*
* Portions Copyright (c) 2014-2020, PostgreSQL Global Development Group
* Portions Copyright (c) 2014-2021, PostgreSQL Global Development Group
*
* Based on Hideaki Ohno's C++ implementation. This is probably not ideally
* suited to estimating the cardinality of very large sets; in particular, we

View File

@ -3,7 +3,7 @@
* ilist.c
* support for integrated/inline doubly- and singly- linked lists
*
* Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
* Portions Copyright (c) 1996-2021, PostgreSQL Global Development Group
* Portions Copyright (c) 1994, Regents of the University of California
*
*

View File

@ -61,7 +61,7 @@
* (https://doi.org/10.1002/spe.948)
*
*
* Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
* Portions Copyright (c) 1996-2021, PostgreSQL Global Development Group
* Portions Copyright (c) 1994, Regents of the University of California
*
* IDENTIFICATION

View File

@ -15,7 +15,7 @@
* allows approximate solutions in polynomial time (the general case of the
* exact problem is NP-hard).
*
* Copyright (c) 2017-2020, PostgreSQL Global Development Group
* Copyright (c) 2017-2021, PostgreSQL Global Development Group
*
* IDENTIFICATION
* src/backend/lib/knapsack.c

View File

@ -14,7 +14,7 @@
* The pairing heap: a new form of self-adjusting heap.
* Algorithmica 1, 1 (January 1986), pages 111-129. DOI: 10.1007/BF01840439
*
* Portions Copyright (c) 2012-2020, PostgreSQL Global Development Group
* Portions Copyright (c) 2012-2021, PostgreSQL Global Development Group
*
* IDENTIFICATION
* src/backend/lib/pairingheap.c

View File

@ -17,7 +17,7 @@
* longest path from root to leaf is only about twice as long as the shortest,
* so lookups are guaranteed to run in O(lg n) time.
*
* Copyright (c) 2009-2020, PostgreSQL Global Development Group
* Copyright (c) 2009-2021, PostgreSQL Global Development Group
*
* IDENTIFICATION
* src/backend/lib/rbtree.c