Restoring authorship annotation for <asaitgalin@yandex-team.ru>. Commit 1 of 2.

1 files changed, 23 insertions, 23 deletions

diff --git a/contrib/libs/brotli/dec/huffman.h b/contrib/libs/brotli/dec/huffman.h
index b9f0716c16..fa446f0175 100644
--- a/contrib/libs/brotli/dec/huffman.h
+++ b/contrib/libs/brotli/dec/huffman.h
@@ -1,7 +1,7 @@
 /* Copyright 2013 Google Inc. All Rights Reserved.
 
-   Distributed under MIT license.
-   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
+   Distributed under MIT license. 
+   See file LICENSE for detail or copy at https://opensource.org/licenses/MIT 
 */
 
 /* Utilities for building Huffman decoding tables. */
@@ -10,7 +10,7 @@
 #define BROTLI_DEC_HUFFMAN_H_
 
 #include "../common/platform.h"
-#include <brotli/types.h>
+#include <brotli/types.h> 
 
 #if defined(__cplusplus) || defined(c_plusplus)
 extern "C" {
@@ -18,18 +18,18 @@ extern "C" {
 
 #define BROTLI_HUFFMAN_MAX_CODE_LENGTH 15
 
-/* Maximum possible Huffman table size for an alphabet size of (index * 32),
+/* Maximum possible Huffman table size for an alphabet size of (index * 32), 
    max code length 15 and root table bits 8. */
-static const uint16_t kMaxHuffmanTableSize[] = {
-  256, 402, 436, 468, 500, 534, 566, 598, 630, 662, 694, 726, 758, 790, 822,
+static const uint16_t kMaxHuffmanTableSize[] = { 
+  256, 402, 436, 468, 500, 534, 566, 598, 630, 662, 694, 726, 758, 790, 822, 
   854, 886, 920, 952, 984, 1016, 1048, 1080, 1112, 1144, 1176, 1208, 1240, 1272,
   1304, 1336, 1368, 1400, 1432, 1464, 1496, 1528};
-/* BROTLI_NUM_BLOCK_LEN_SYMBOLS == 26 */
-#define BROTLI_HUFFMAN_MAX_SIZE_26 396
-/* BROTLI_MAX_BLOCK_TYPE_SYMBOLS == 258 */
-#define BROTLI_HUFFMAN_MAX_SIZE_258 632
-/* BROTLI_MAX_CONTEXT_MAP_SYMBOLS == 272 */
-#define BROTLI_HUFFMAN_MAX_SIZE_272 646
+/* BROTLI_NUM_BLOCK_LEN_SYMBOLS == 26 */ 
+#define BROTLI_HUFFMAN_MAX_SIZE_26 396 
+/* BROTLI_MAX_BLOCK_TYPE_SYMBOLS == 258 */ 
+#define BROTLI_HUFFMAN_MAX_SIZE_258 632 
+/* BROTLI_MAX_CONTEXT_MAP_SYMBOLS == 272 */ 
+#define BROTLI_HUFFMAN_MAX_SIZE_272 646 
 
 #define BROTLI_HUFFMAN_MAX_CODE_LENGTH_CODE_LENGTH 5
 
@@ -42,8 +42,8 @@ static const uint16_t kMaxHuffmanTableSize[] = {
 /* Do not create this struct directly - use the ConstructHuffmanCode
  * constructor below! */
 typedef struct {
-  uint8_t bits;    /* number of bits used for this symbol */
-  uint16_t value;  /* symbol value or table offset */
+  uint8_t bits;    /* number of bits used for this symbol */ 
+  uint16_t value;  /* symbol value or table offset */ 
 } HuffmanCode;
 
 static BROTLI_INLINE HuffmanCode ConstructHuffmanCode(const uint8_t bits,
@@ -94,20 +94,20 @@ static BROTLI_INLINE HuffmanCode ConstructHuffmanCode(const uint8_t bits,
 #endif /* BROTLI_HUFFMAN_CODE_FAST_LOAD */
 
 /* Builds Huffman lookup table assuming code lengths are in symbol order. */
-BROTLI_INTERNAL void BrotliBuildCodeLengthsHuffmanTable(HuffmanCode* root_table,
-    const uint8_t* const code_lengths, uint16_t* count);
+BROTLI_INTERNAL void BrotliBuildCodeLengthsHuffmanTable(HuffmanCode* root_table, 
+    const uint8_t* const code_lengths, uint16_t* count); 
 
 /* Builds Huffman lookup table assuming code lengths are in symbol order.
    Returns size of resulting table. */
-BROTLI_INTERNAL uint32_t BrotliBuildHuffmanTable(HuffmanCode* root_table,
-    int root_bits, const uint16_t* const symbol_lists, uint16_t* count_arg);
+BROTLI_INTERNAL uint32_t BrotliBuildHuffmanTable(HuffmanCode* root_table, 
+    int root_bits, const uint16_t* const symbol_lists, uint16_t* count_arg); 
 
 /* Builds a simple Huffman table. The |num_symbols| parameter is to be
    interpreted as follows: 0 means 1 symbol, 1 means 2 symbols,
    2 means 3 symbols, 3 means 4 symbols with lengths [2, 2, 2, 2],
    4 means 4 symbols with lengths [1, 2, 3, 3]. */
-BROTLI_INTERNAL uint32_t BrotliBuildSimpleHuffmanTable(HuffmanCode* table,
-    int root_bits, uint16_t* symbols, uint32_t num_symbols);
+BROTLI_INTERNAL uint32_t BrotliBuildSimpleHuffmanTable(HuffmanCode* table, 
+    int root_bits, uint16_t* symbols, uint32_t num_symbols); 
 
 /* Contains a collection of Huffman trees with the same alphabet size. */
 /* max_symbol is needed due to simple codes since log2(alphabet_size) could be
@@ -115,13 +115,13 @@ BROTLI_INTERNAL uint32_t BrotliBuildSimpleHuffmanTable(HuffmanCode* table,
 typedef struct {
   HuffmanCode** htrees;
   HuffmanCode* codes;
-  uint16_t alphabet_size;
+  uint16_t alphabet_size; 
   uint16_t max_symbol;
-  uint16_t num_htrees;
+  uint16_t num_htrees; 
 } HuffmanTreeGroup;
 
 #if defined(__cplusplus) || defined(c_plusplus)
-}  /* extern "C" */
+}  /* extern "C" */ 
 #endif
 
 #endif  /* BROTLI_DEC_HUFFMAN_H_ */