Lines Matching defs:values
92 * The values.
94 private short values[];
101 * @param values
102 * the values
106 JPEGHuffmanTable(short[] lengths, short[] values, boolean copy) {
111 this.values = values;
119 * @param values
120 * the array of shorts containing the values in order of
123 public JPEGHuffmanTable(short[] lengths, short[] values) {
127 if (values == null) {
128 throw new IllegalArgumentException("values array is null!");
133 if (values.length > 256) { // According to the spec
134 throw new IllegalArgumentException("values array is too long");
141 for (short value : values) {
143 throw new IllegalArgumentException("Values in values array must be non-negative.");
147 checkHuffmanTable(lengths, values);
150 this.values = new short[values.length];
152 System.arraycopy(values, 0, this.values, 0, values.length);
158 * @return the array of short values representing the length values in the
168 * Gets an array of values represented by increasing length of their codes.
170 * @return the array of values.
173 short newValues[] = new short[values.length];
174 System.arraycopy(values, 0, newValues, 0, values.length);
183 * @param values
184 * the values.
186 private static void checkHuffmanTable(short[] lengths, short[] values) {
199 if (values.length != numLeaves) {
201 "Invalid Huffman table provided, sum of lengths != values.");
220 for (short value : values) {