Update copyright dates

This commit is contained in:
Vinnie Falco committed 2017-02-07 15:20:25 -05:00
1 parent c7bfe7df4a
commit a6120cd8be
244 files changed
+290 -290

No files matched your search

+5 -5
View File
@@ -1,5 +1,5 @@
//
// Copyright (c) 2013-2016 Vinnie Falco (vinnie dot falco at gmail dot com)
// Copyright (c) 2013-2017 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -128,7 +128,7 @@ public:
{
doClear();
}
/** Returns the upper limit on the size of a compressed block.
This function makes a conservative estimate of the maximum number
@@ -171,7 +171,7 @@ public:
the input buffer becomes empty or the output buffer becomes full.
It may introduce some output latency (reading input without
producing any output) except when forced to flush.
In each call, one or both of these actions are performed:
@li Compress more input starting at `zs.next_in` and update
@@ -371,12 +371,12 @@ deflate_upper_bound(std::size_t bytes);
They are coded as constants here for a reason--if the #define's are
changed, then this function needs to be changed as well. The return
value for 15 and 8 only works for those exact settings.
For any setting other than those defaults for windowBits and memLevel,
the value returned is a conservative worst case for the maximum expansion
resulting from using fixed blocks instead of stored blocks, which deflate
can emit on compressed data for some combinations of the parameters.
This function could be more sophisticated to provide closer upper bounds for
every combination of windowBits and memLevel. But even the conservative
upper bound of about 14% expansion does not seem onerous for output buffer
+4 -4
View File
@@ -1,5 +1,5 @@
//
// Copyright (c) 2013-2016 Vinnie Falco (vinnie dot falco at gmail dot com)
// Copyright (c) 2013-2017 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -144,7 +144,7 @@ fill_8(FwdIt& it)
{
v_ += static_cast<value_type>(*it++) << n_;
n_ += 8;
}
}
template<class FwdIt>
inline
@@ -156,7 +156,7 @@ fill_16(FwdIt& it)
n_ += 8;
v_ += static_cast<value_type>(*it++) << n_;
n_ += 8;
}
}
template<class Unsigned>
inline
@@ -193,7 +193,7 @@ rewind(BidirIt& it)
auto len = n_ >> 3;
it = std::prev(it, len);
n_ &= 7;
v_ &= (1U << n_) - 1;
v_ &= (1U << n_) - 1;
}
} // detail
+4 -4
View File
@@ -1,5 +1,5 @@
//
// Copyright (c) 2013-2016 Vinnie Falco (vinnie dot falco at gmail dot com)
// Copyright (c) 2013-2017 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -112,7 +112,7 @@ protected:
// Number of literal bytes 0..255
static std::uint16_t constexpr literals = 256;
// Number of Literal or Length codes, including the END_BLOCK code
static std::uint16_t constexpr lCodes = literals + 1 + lengthCodes;
@@ -184,7 +184,7 @@ protected:
// Describes a single value and its code string.
struct ct_data
{
std::uint16_t fc; // frequency count or bit string
std::uint16_t fc; // frequency count or bit string
std::uint16_t dl; // parent node in tree or length of bit string
bool
@@ -648,7 +648,7 @@ protected:
static
unsigned
bi_reverse(unsigned code, int len);
template<class = void>
static
void
+2 -2
View File
@@ -1,5 +1,5 @@
//
// Copyright (c) 2013-2016 Vinnie Falco (vinnie dot falco at gmail dot com)
// Copyright (c) 2013-2017 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -762,7 +762,7 @@ inflate_table(
std::uint16_t offs[15+1]; // offsets in table for each length
// Length codes 257..285 base
static std::uint16_t constexpr lbase[31] = {
static std::uint16_t constexpr lbase[31] = {
3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0};
+1 -1
View File
@@ -1,5 +1,5 @@
//
// Copyright (c) 2013-2016 Vinnie Falco (vinnie dot falco at gmail dot com)
// Copyright (c) 2013-2017 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+1 -1
View File
@@ -1,5 +1,5 @@
//
// Copyright (c) 2013-2016 Vinnie Falco (vinnie dot falco at gmail dot com)
// Copyright (c) 2013-2017 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+1 -1
View File
@@ -1,5 +1,5 @@
//
// Copyright (c) 2013-2016 Vinnie Falco (vinnie dot falco at gmail dot com)
// Copyright (c) 2013-2017 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+1 -1
View File
@@ -1,5 +1,5 @@
//
// Copyright (c) 2013-2016 Vinnie Falco (vinnie dot falco at gmail dot com)
// Copyright (c) 2013-2017 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+1 -1
View File
@@ -1,5 +1,5 @@
//
// Copyright (c) 2013-2016 Vinnie Falco (vinnie dot falco at gmail dot com)
// Copyright (c) 2013-2017 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+2 -2
View File
@@ -1,5 +1,5 @@
//
// Copyright (c) 2013-2016 Vinnie Falco (vinnie dot falco at gmail dot com)
// Copyright (c) 2013-2017 Vinnie Falco (vinnie dot falco at gmail dot com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -149,7 +149,7 @@ enum class Strategy
filtered,
/** Huffman-only strategy.
This strategy only performs Huffman encoding, without doing
any string matching.
*/