Lines Matching defs:values
153 private short[] values;
161 * is equal to the number of values with corresponding codes of
163 * @param values an array of shorts containing the values in
166 * <code>values</code> are null, the length of <code>lengths</code> is
167 * greater than 16, the length of <code>values</code> is greater than 256,
168 * if any value in <code>lengths</code> or <code>values</code> is less
171 public JPEGHuffmanTable(short[] lengths, short[] values) {
172 if (lengths == null || values == null ||
173 lengths.length == 0 || values.length == 0 ||
174 lengths.length > 16 || values.length > 256) {
175 throw new IllegalArgumentException("Illegal lengths or values");
182 for (int i = 0; i<values.length; i++) {
183 if (values[i] < 0) {
184 throw new IllegalArgumentException("values["+i+"] < 0");
188 this.values = Arrays.copyOf(values, values.length);
197 if (sumOfLengths != values.length) {
204 private JPEGHuffmanTable(short[] lengths, short[] values, boolean copy) {
207 this.values = Arrays.copyOf(values, values.length);
210 this.values = values;
215 * Returns an array of <code>short</code>s containing the number of values
219 * is equal to the number of values in the table of length <code>k</code>.
227 * Returns an array of <code>short</code>s containing the values arranged
229 * The interpretation of the array is dependent on the values returned
232 * @return a <code>short</code> array of values.
236 return Arrays.copyOf(values, values.length);
250 sb.append(ls).append("values:");
251 for (int i=0; i<values.length; i++) {
252 sb.append(" ").append(values[i]);