1 /*
2 * This file is part of Waarp Project (named also Waarp or GG).
3 *
4 * Copyright (c) 2019, Waarp SAS, and individual contributors by the @author
5 * tags. See the COPYRIGHT.txt in the distribution for a full listing of
6 * individual contributors.
7 *
8 * All Waarp Project is free software: you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or (at your
11 * option) any later version.
12 *
13 * Waarp is distributed in the hope that it will be useful, but WITHOUT ANY
14 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
15 * A PARTICULAR PURPOSE. See the GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License along with
18 * Waarp . If not, see <http://www.gnu.org/licenses/>.
19 */
20
21 /*
22 * Licensed under the Apache License, Version 2.0 (the "License");
23 * you may not use this file except in compliance with the License.
24 * You may obtain a copy of the License at
25 *
26 * http://www.apache.org/licenses/LICENSE-2.0
27 *
28 * Unless required by applicable law or agreed to in writing, software
29 * distributed under the License is distributed on an "AS IS" BASIS,
30 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
31 * See the License for the specific language governing permissions and
32 * limitations under the License.
33 */
34 package org.waarp.compress.zstdsafe;
35
36 import java.util.Arrays;
37
38 class HuffmanCompressionTableWorkspace {
39 public final NodeTable nodeTable =
40 new NodeTable((2 * Huffman.MAX_SYMBOL_COUNT - 1));
41 // number of nodes in binary tree with MAX_SYMBOL_COUNT leaves
42
43 public final short[] entriesPerRank = new short[Huffman.MAX_TABLE_LOG + 1];
44 public final short[] valuesPerRank = new short[Huffman.MAX_TABLE_LOG + 1];
45
46 // for setMaxHeight
47 public final int[] rankLast = new int[Huffman.MAX_TABLE_LOG + 2];
48
49 public void reset() {
50 Arrays.fill(entriesPerRank, (short) 0);
51 Arrays.fill(valuesPerRank, (short) 0);
52 }
53 }