| OLD | NEW |
| 1 // Copyright 2011 Google Inc. All Rights Reserved. | 1 // Copyright 2011 Google Inc. All Rights Reserved. |
| 2 // | 2 // |
| 3 // Use of this source code is governed by a BSD-style license | 3 // Use of this source code is governed by a BSD-style license |
| 4 // that can be found in the COPYING file in the root of the source | 4 // that can be found in the COPYING file in the root of the source |
| 5 // tree. An additional intellectual property rights grant can be found | 5 // tree. An additional intellectual property rights grant can be found |
| 6 // in the file PATENTS. All contributing project authors may | 6 // in the file PATENTS. All contributing project authors may |
| 7 // be found in the AUTHORS file in the root of the source tree. | 7 // be found in the AUTHORS file in the root of the source tree. |
| 8 // ----------------------------------------------------------------------------- | 8 // ----------------------------------------------------------------------------- |
| 9 // | 9 // |
| 10 // Author: Jyrki Alakuijala (jyrki@google.com) | 10 // Author: Jyrki Alakuijala (jyrki@google.com) |
| (...skipping 40 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 51 // huffman code tree. | 51 // huffman code tree. |
| 52 void VP8LCreateHuffmanTree(uint32_t* const histogram, int tree_depth_limit, | 52 void VP8LCreateHuffmanTree(uint32_t* const histogram, int tree_depth_limit, |
| 53 uint8_t* const buf_rle, HuffmanTree* const huff_tree, | 53 uint8_t* const buf_rle, HuffmanTree* const huff_tree, |
| 54 HuffmanTreeCode* const tree); | 54 HuffmanTreeCode* const tree); |
| 55 | 55 |
| 56 #ifdef __cplusplus | 56 #ifdef __cplusplus |
| 57 } | 57 } |
| 58 #endif | 58 #endif |
| 59 | 59 |
| 60 #endif // WEBP_UTILS_HUFFMAN_ENCODE_H_ | 60 #endif // WEBP_UTILS_HUFFMAN_ENCODE_H_ |
| OLD | NEW |