diff options
author | Bruce Momjian | 2018-01-03 04:30:12 +0000 |
---|---|---|
committer | Bruce Momjian | 2018-01-03 04:30:12 +0000 |
commit | 9d4649ca49416111aee2c84b7e4441a0b7aa2fac (patch) | |
tree | e2a7ca9692af92a1985e93cc8d9b93702b604e73 /src/backend/lib | |
parent | f9ccf92e16fc4d831d324c7f7ef347a0acdaef0a (diff) |
Update copyright for 2018
Backpatch-through: certain files through 9.3
Diffstat (limited to 'src/backend/lib')
-rw-r--r-- | src/backend/lib/binaryheap.c | 2 | ||||
-rw-r--r-- | src/backend/lib/bipartite_match.c | 2 | ||||
-rw-r--r-- | src/backend/lib/dshash.c | 2 | ||||
-rw-r--r-- | src/backend/lib/hyperloglog.c | 2 | ||||
-rw-r--r-- | src/backend/lib/ilist.c | 2 | ||||
-rw-r--r-- | src/backend/lib/knapsack.c | 2 | ||||
-rw-r--r-- | src/backend/lib/pairingheap.c | 2 | ||||
-rw-r--r-- | src/backend/lib/rbtree.c | 2 | ||||
-rw-r--r-- | src/backend/lib/stringinfo.c | 2 |
9 files changed, 9 insertions, 9 deletions
diff --git a/src/backend/lib/binaryheap.c b/src/backend/lib/binaryheap.c index ce4331ccdec..a8adf065a94 100644 --- a/src/backend/lib/binaryheap.c +++ b/src/backend/lib/binaryheap.c @@ -3,7 +3,7 @@ * binaryheap.c * A simple binary heap implementation * - * Portions Copyright (c) 2012-2017, PostgreSQL Global Development Group + * Portions Copyright (c) 2012-2018, PostgreSQL Global Development Group * * IDENTIFICATION * src/backend/lib/binaryheap.c diff --git a/src/backend/lib/bipartite_match.c b/src/backend/lib/bipartite_match.c index 4564a463d5b..5be5ed24f1c 100644 --- a/src/backend/lib/bipartite_match.c +++ b/src/backend/lib/bipartite_match.c @@ -7,7 +7,7 @@ * * http://en.wikipedia.org/w/index.php?title=Hopcroft%E2%80%93Karp_algorithm&oldid=593898016 * - * Copyright (c) 2015-2017, PostgreSQL Global Development Group + * Copyright (c) 2015-2018, PostgreSQL Global Development Group * * IDENTIFICATION * src/backend/lib/bipartite_match.c diff --git a/src/backend/lib/dshash.c b/src/backend/lib/dshash.c index dd875730670..b1973d4bfbc 100644 --- a/src/backend/lib/dshash.c +++ b/src/backend/lib/dshash.c @@ -20,7 +20,7 @@ * Future versions may support iterators and incremental resizing; for now * the implementation is minimalist. * - * Portions Copyright (c) 1996-2017, PostgreSQL Global Development Group + * Portions Copyright (c) 1996-2018, PostgreSQL Global Development Group * Portions Copyright (c) 1994, Regents of the University of California * * IDENTIFICATION diff --git a/src/backend/lib/hyperloglog.c b/src/backend/lib/hyperloglog.c index df7a67e7dca..3c50375a925 100644 --- a/src/backend/lib/hyperloglog.c +++ b/src/backend/lib/hyperloglog.c @@ -3,7 +3,7 @@ * hyperloglog.c * HyperLogLog cardinality estimator * - * Portions Copyright (c) 2014-2017, PostgreSQL Global Development Group + * Portions Copyright (c) 2014-2018, 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 diff --git a/src/backend/lib/ilist.c b/src/backend/lib/ilist.c index af8d656d3e4..58bee57c760 100644 --- a/src/backend/lib/ilist.c +++ b/src/backend/lib/ilist.c @@ -3,7 +3,7 @@ * ilist.c * support for integrated/inline doubly- and singly- linked lists * - * Portions Copyright (c) 1996-2017, PostgreSQL Global Development Group + * Portions Copyright (c) 1996-2018, PostgreSQL Global Development Group * Portions Copyright (c) 1994, Regents of the University of California * * diff --git a/src/backend/lib/knapsack.c b/src/backend/lib/knapsack.c index 490c0cc73c3..25ce4f23654 100644 --- a/src/backend/lib/knapsack.c +++ b/src/backend/lib/knapsack.c @@ -15,7 +15,7 @@ * allows approximate solutions in polynomial time (the general case of the * exact problem is NP-hard). * - * Copyright (c) 2017, PostgreSQL Global Development Group + * Copyright (c) 2017-2018, PostgreSQL Global Development Group * * IDENTIFICATION * src/backend/lib/knapsack.c diff --git a/src/backend/lib/pairingheap.c b/src/backend/lib/pairingheap.c index fd871408f35..89d0f62f8f9 100644 --- a/src/backend/lib/pairingheap.c +++ b/src/backend/lib/pairingheap.c @@ -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-2017, PostgreSQL Global Development Group + * Portions Copyright (c) 2012-2018, PostgreSQL Global Development Group * * IDENTIFICATION * src/backend/lib/pairingheap.c diff --git a/src/backend/lib/rbtree.c b/src/backend/lib/rbtree.c index 5362acc6ff9..a43d5938d59 100644 --- a/src/backend/lib/rbtree.c +++ b/src/backend/lib/rbtree.c @@ -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-2017, PostgreSQL Global Development Group + * Copyright (c) 2009-2018, PostgreSQL Global Development Group * * IDENTIFICATION * src/backend/lib/rbtree.c diff --git a/src/backend/lib/stringinfo.c b/src/backend/lib/stringinfo.c index cb2026c3b20..798a823ac9f 100644 --- a/src/backend/lib/stringinfo.c +++ b/src/backend/lib/stringinfo.c @@ -6,7 +6,7 @@ * It can be used to buffer either ordinary C strings (null-terminated text) * or arbitrary binary data. All storage is allocated with palloc(). * - * Portions Copyright (c) 1996-2017, PostgreSQL Global Development Group + * Portions Copyright (c) 1996-2018, PostgreSQL Global Development Group * Portions Copyright (c) 1994, Regents of the University of California * * src/backend/lib/stringinfo.c |