1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187
/* * @(#)ShortLookupTable.java 1.29 05/11/17 * * Copyright 2006 Sun Microsystems, Inc. All rights reserved. * SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. */ package java.awt.image; /** * This class defines a lookup table object. The output of a * lookup operation using an object of this class is interpreted * as an unsigned short quantity. The lookup table contains short * data arrays for one or more bands (or components) of an image, * and it contains an offset which will be subtracted from the * input values before indexing the arrays. This allows an array * smaller than the native data size to be provided for a * constrained input. If there is only one array in the lookup * table, it will be applied to all bands. * * @see ByteLookupTable * @see LookupOp * @version 10 Feb 1997 */ public class ShortLookupTable extends LookupTable { /** * Constants */ short data[][]; /** * Constructs a ShortLookupTable object from an array of short * arrays representing a lookup table for each * band. The offset will be subtracted from the input * values before indexing into the arrays. The number of * bands is the length of the data argument. The * data array for each band is stored as a reference. * @param offset the value subtracted from the input values * before indexing into the arrays * @param data an array of short arrays representing a lookup * table for each band */ public ShortLookupTable(int offset, short data[][]) { super(offset,data.length); numComponents = data.length; numEntries = data[0].length; this.data = new short[numComponents][]; // Allocate the array and copy the data reference for (int i=0; i < numComponents; i++) { this.data[i] = data[i]; } } /** * Constructs a ShortLookupTable object from an array * of shorts representing a lookup table for each * band. The offset will be subtracted from the input * values before indexing into the array. The * data array is stored as a reference. * @param offset the value subtracted from the input values * before indexing into the arrays * @param data an array of shorts */ public ShortLookupTable(int offset, short data[]) { super(offset,data.length); numComponents = 1; numEntries = data.length; this.data = new short[1][]; this.data[0] = data; } /** * Returns the lookup table data by reference. If this ShortLookupTable * was constructed using a single short array, the length of the returned * array is one. * @return ShortLookupTable data array. */ public final short[][] getTable(){ return data; } /** * Returns an array of samples of a pixel, translated with the lookup * table. The source and destination array can be the same array. * Array <code>dst</code> is returned. * * @param src the source array. * @param dst the destination array. This array must be at least as * long as <code>src</code>. If <code>dst</code> is * <code>null</code>, a new array will be allocated having the * same length as <code>src</code>. * @return the array <code>dst</code>, an <code>int</code> array of * samples. * @exception ArrayIndexOutOfBoundsException if <code>src</code> is * longer than <code>dst</code> or if for any element * <code>i</code> of <code>src</code>, * <code>(src[i]&0xffff)-offset</code> is either less than * zero or greater than or equal to the length of the * lookup table for any band. */ public int[] lookupPixel(int[] src, int[] dst){ if (dst == null) { // Need to alloc a new destination array dst = new int[src.length]; } if (numComponents == 1) { // Apply one LUT to all channels for (int i=0; i < src.length; i++) { int s = (src[i]&0xffff) - offset; if (s < 0) { throw new ArrayIndexOutOfBoundsException("src["+i+ "]-offset is "+ "less than zero"); } dst[i] = (int) data[0][s]; } } else { for (int i=0; i < src.length; i++) { int s = (src[i]&0xffff) - offset; if (s < 0) { throw new ArrayIndexOutOfBoundsException("src["+i+ "]-offset is "+ "less than zero"); } dst[i] = (int) data[i][s]; } } return dst; } /** * Returns an array of samples of a pixel, translated with the lookup * table. The source and destination array can be the same array. * Array <code>dst</code> is returned. * * @param src the source array. * @param dst the destination array. This array must be at least as * long as <code>src</code>. If <code>dst</code> is * <code>null</code>, a new array will be allocated having the * same length as <code>src</code>. * @return the array <code>dst</code>, an <code>int</code> array of * samples. * @exception ArrayIndexOutOfBoundsException if <code>src</code> is * longer than <code>dst</code> or if for any element * <code>i</code> of <code>src</code>, * <code>(src[i]&0xffff)-offset</code> is either less than * zero or greater than or equal to the length of the * lookup table for any band. */ public short[] lookupPixel(short[] src, short[] dst){ if (dst == null) { // Need to alloc a new destination array dst = new short[src.length]; } if (numComponents == 1) { // Apply one LUT to all channels for (int i=0; i < src.length; i++) { int s = (src[i]&0xffff) - offset; if (s < 0) { throw new ArrayIndexOutOfBoundsException("src["+i+ "]-offset is "+ "less than zero"); } dst[i] = data[0][s]; } } else { for (int i=0; i < src.length; i++) { int s = (src[i]&0xffff) - offset; if (s < 0) { throw new ArrayIndexOutOfBoundsException("src["+i+ "]-offset is "+ "less than zero"); } dst[i] = data[i][s]; } } return dst; } }