Lines Matching refs:result
164 int[][] result = new int[8][template.length];
165 for (int mask = 0; mask < result.length; mask++) {
166 int[] maskModules = result[mask];
186 return result;
192 int[] result = new int[getNumRawDataModules(version) / 8 * 8];
202 if (getModule(isFunction, x, y) == 0 && i < result.length) {
203 result[i] = y * size + x;
209 assert i == result.length;
210 return result;
245 int[] result = new int[numAlign];
246 result[0] = 6;
247 for (int i = result.length - 1, pos = size - 7; i >= 1; i--, pos -= step)
248 result[i] = pos;
249 return result;
256 // The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table.
260 int result = (16 * ver + 128) * ver + 64;
263 result -= (25 * numAlign - 10) * numAlign - 55;
265 result -= 36;
267 return result;