CPD Results
The following document contains the results of PMD's CPD 7.0.0.
Duplications
File | Line |
---|---|
nom/tam/util/FitsFile.java | 369 |
nom/tam/util/FitsOutputStream.java | 98 |
} @Override public void write(boolean[] b, int start, int length) throws IOException { getEncoder().write(b, start, length); } @Override public void write(Boolean[] buf, int offset, int size) throws IOException { getEncoder().write(buf, offset, size); } @Override public void write(char[] c, int start, int length) throws IOException { getEncoder().write(c, start, length); } @Override public void write(short[] s, int start, int length) throws IOException { getEncoder().write(s, start, length); } @Override public void write(int[] i, int start, int length) throws IOException { getEncoder().write(i, start, length); } @Override public void write(long[] l, int start, int length) throws IOException { getEncoder().write(l, start, length); } @Override public void write(float[] f, int start, int length) throws IOException { getEncoder().write(f, start, length); } @Override public void write(double[] d, int start, int length) throws IOException { getEncoder().write(d, start, length); } @Override public void write(String[] s, int start, int length) throws IOException { |
File | Line |
---|---|
nom/tam/util/FitsFile.java | 249 |
nom/tam/util/FitsInputStream.java | 169 |
return getDecoder().read(buf, offset, size); } @Override public int read(char[] c, int start, int length) throws IOException { return getDecoder().read(c, start, length); } @Override public int read(short[] s, int start, int length) throws IOException { return getDecoder().read(s, start, length); } @Override public int read(int[] i, int start, int length) throws IOException { return getDecoder().read(i, start, length); } @Override public int read(long[] l, int start, int length) throws IOException { return getDecoder().read(l, start, length); } @Override public int read(float[] f, int start, int length) throws IOException { return getDecoder().read(f, start, length); } @Override public int read(double[] d, int start, int length) throws IOException { return getDecoder().read(d, start, length); } @Deprecated |
File | Line |
---|---|
nom/tam/util/InputDecoder.java | 388 |
nom/tam/util/OutputEncoder.java | 256 |
private InputBuffer(int size) { data = new byte[size]; buffer = ByteBuffer.wrap(data); } /** * Sets the byte order of the binary data representation from which we are decoding data. * * @param order the new byte order * * @see #byteOrder() * @see ByteBuffer#order(ByteOrder) */ protected void setByteOrder(ByteOrder order) { buffer.order(order); } /** * Returns the current byte order of the binary data representation from which we are decoding. * * @return the byte order * * @see #setByteOrder(ByteOrder) * @see ByteBuffer#order() */ protected ByteOrder byteOrder() { return buffer.order(); } private boolean isViewingAs(Class<? extends Buffer> type) { if (view == null) { return false; } return type.isAssignableFrom(view.getClass()); } private void assertView(ElementType<?> type) { if (!isViewingAs(type.bufferClass())) { view = type.asTypedBuffer(buffer); } } private void rewind() { buffer.rewind(); view = null; } /** * Set the number of bytes we can buffer from the input for subsequent retrieval from this buffer. The get * methods of this class will be ensured not to fetch data from the input beyond the requested size. * * @param n the number of elements we can read and buffer from the input * @param size the number of bytes in each elements. */ protected void loadBytes(long n, int size) { |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/image/StandardImageTiler.java | 102 |
nom/tam/image/compression/CompressedImageTiler.java | 80 |
protected static boolean incrementPosition(int[] start, int[] current, int[] lengths, int[] steps) { for (int i = start.length - 2; i >= 0; i--) { if (current[i] - start[i] < lengths[i] - steps[i]) { current[i] += steps[i]; if (start.length - 1 - (i + 1) >= 0) { System.arraycopy(start, i + 1, current, i + 1, start.length - 1 - (i + 1)); } return true; } } return false; } |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 254 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/hcompress/HDecompress.java | 481 |
nom/tam/fits/compression/algorithm/hcompress/HDecompress.java | 518 |
hp = a.get(s00 + ny2); /* * diff = 8 * hx slope that would match h0 in neighboring zones */ diff = hp - hm; /* * monotonicity constraints on diff */ dmax = Math.max(Math.min(hp - h0, h0 - hm), 0) << 2; dmin = Math.min(Math.max(hp - h0, h0 - hm), 0) << 2; /* * if monotonicity would set slope = 0 then don't change hx. note dmax>=0, dmin<=0. */ if (dmin < dmax) { diff = Math.max(Math.min(diff, dmax), dmin); /* * Compute change in slope limited to range +/- smax. Careful with rounding negative numbers when * using shift for divide by 8. */ s = diff - (a.get(s10) << N03); |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/ImageHDU.java | 217 |
nom/tam/fits/RandomGroupsHDU.java | 357 |
} /** * Returns the name of the physical unit in which images are represented. * * @return the standard name of the physical unit in which the image is expressed, e.g. <code>"Jy beam^{-1}"</code>. */ @Override public String getBUnit() { return super.getBUnit(); } /** * Returns the integer value that signifies blank (missing or <code>null</code>) data in an integer image. * * @return the integer value used for identifying blank / missing data in integer images. * * @throws FitsException if the header does not specify a blanking value or if it is not appropriate for the type of * imge (that is not an integer type image) */ @Override public long getBlankValue() throws FitsException { if (getBitpix().getHeaderValue() < 0) { throw new FitsException("No integer blanking value in floating-point images."); } return super.getBlankValue(); } /** * Returns the floating-point increment between adjacent integer values in the image. Strictly speaking, only * integer-type images should define a quantization scaling, but there is no harm in having this value in * floating-point images also -- which may be interpreted as a hint for quantization, perhaps. * * @return the floating-point quantum that corresponds to the increment of 1 in the integer data representation. * * @see #getBZero() */ @Override public double getBScale() { return super.getBScale(); } /** * Returns the floating-point value that corresponds to an 0 integer value in the image. Strictly speaking, only * integer-type images should define a quantization offset, but there is no harm in having this value in * floating-point images also -- which may be interpreted as a hint for quantization, perhaps. * * @return the floating point value that correspond to the integer 0 in the image data. * * @see #getBScale() */ @Override public double getBZero() { return super.getBZero(); } |
File | Line |
---|---|
nom/tam/util/FitsEncoder.java | 146 |
nom/tam/util/FitsEncoder.java | 176 |
private void put(boolean[] b, int start, int length) throws IOException { if (length == 1) { write(byteForBoolean(b[start])); return; } byte[] ascii = new byte[length]; for (int i = 0; i < length; i++) { ascii[i] = byteForBoolean(b[start + i]); } write(ascii, 0, length); } /** * Puts a boolean array into the conversion buffer, but with no guarantee of flushing the conversion buffer to the * underlying output. The caller may put multiple data object into the conversion buffer before eventually calling * {@link OutputBuffer#flush()} to ensure that everything is written to the output. Note, the this call may flush * the contents of the conversion buffer to the output if it needs more conversion space than what is avaiable. * * @param b the Java array containing the values * @param start the offset in the array from where to start converting values. * @param length the number of values to convert to FITS representation * * @throws IOException if there was an IO error while trying to flush the conversion buffer to the stream before all * elements were converted. * * @see #byteForBoolean(Boolean) * @see #put(boolean[], int, int) * @see #write(Boolean[], int, int) */ private void put(Boolean[] b, int start, int length) throws IOException { |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/ImageData.java | 266 |
nom/tam/fits/UndefinedData.java | 132 |
c.add(HeaderCard.create(Standard.BITPIX, Bitpix.forPrimitiveType(base).getHeaderValue())); c.add(HeaderCard.create(Standard.NAXIS, dims.length)); for (int i = 1; i <= dims.length; i++) { c.add(HeaderCard.create(Standard.NAXISn.n(i), dims[dims.length - i])); } // Just in case! c.add(HeaderCard.create(Standard.PCOUNT, 0)); |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/util/FitsDecoder.java | 311 |
nom/tam/util/FitsDecoder.java | 344 |
protected synchronized int read(boolean[] b, int start, int length) throws EOFException, IOException { if (length == 0) { return 0; } byte[] ascii = new byte[length]; length = read(ascii, 0, length); if (length < 0) { throw new EOFException(); } for (int i = 0; i < length; i++) { b[start + i] = booleanFor(ascii[i]); |
File | Line |
---|---|
nom/tam/util/ColumnTable.java | 1394 |
nom/tam/util/ColumnTable.java | 1448 |
out.writeChar(data[index]); } @SuppressFBWarnings(value = "RR_NOT_CHECKED", justification = "not exposed and never needed locally") @Override int read(int from, int n, ArrayDataInput in) throws IOException { return in.read(data, from, n); } @Override void write(int from, int n, ArrayDataOutput out) throws IOException { out.write(data, from, n); } @Override |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/header/Stokes.java | 387 |
nom/tam/fits/header/Stokes.java | 561 |
public void fillTableHeader(Header header, int column, int coordinateIndex) throws IndexOutOfBoundsException, FitsException { if (column < 0) { throw new IndexOutOfBoundsException("Invalid Java column index " + column); } String dims = header.getStringValue(Standard.TDIMn.n(++column)); if (dims == null) { throw new FitsException("Missing TDIM" + column + " in header"); } StringTokenizer tokens = new StringTokenizer(dims, "(, )"); int n = tokens.countTokens(); |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/image/compression/hdu/CompressedCard.java | 115 |
nom/tam/image/compression/hdu/CompressedCard.java | 137 |
headerIterator.add(new HeaderCard(newKey, card.getValue(String.class, ""), card.getComment())); } @Override protected void restoreCard(HeaderCard card, Cursor<String, HeaderCard> headerIterator) throws HeaderCardException { String newKey = compressedHeaderKey().n(GenericKey.getN(card.getKey())).key(); headerIterator.add(new HeaderCard(newKey, card.getValue(String.class, ""), card.getComment())); |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/util/ColumnTable.java | 1345 |
nom/tam/util/ColumnTable.java | 1498 |
nom/tam/util/ColumnTable.java | 1547 |
nom/tam/util/ColumnTable.java | 1596 |
nom/tam/util/ColumnTable.java | 1645 |
out.writeBoolean(data[index]); } @Override int read(int from, int n, ArrayDataInput in) throws IOException { return in.read(data, from, n); } @Override void write(int from, int n, ArrayDataOutput out) throws IOException { out.write(data, from, n); } @Override |
File | Line |
---|---|
nom/tam/fits/AsciiTable.java | 701 |
nom/tam/fits/BinaryTable.java | 4050 |
c.add(HeaderCard.create(Standard.XTENSION, Standard.XTENSION_ASCIITABLE)); c.add(HeaderCard.create(Standard.BITPIX, Bitpix.BYTE.getHeaderValue())); c.add(HeaderCard.create(Standard.NAXIS, 2)); c.add(HeaderCard.create(Standard.NAXIS1, rowLen)); c.add(HeaderCard.create(Standard.NAXIS2, nRows)); |
File | Line |
---|---|
nom/tam/util/type/ByteType.java | 50 |
nom/tam/util/type/DoubleType.java | 54 |
nom/tam/util/type/FloatType.java | 53 |
nom/tam/util/type/IntType.java | 53 |
nom/tam/util/type/LongType.java | 53 |
nom/tam/util/type/ShortType.java | 51 |
byte[] temp = new byte[Math.min(COPY_BLOCK_SIZE, dataToAppend.remaining())]; while (dataToAppend.hasRemaining()) { int nrObBytes = Math.min(temp.length, dataToAppend.remaining()); dataToAppend.get(temp, 0, nrObBytes); buffer.put(temp, 0, nrObBytes); } } @Override public ByteBuffer asTypedBuffer(ByteBuffer buffer) { |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/gzip2/GZip2Compressor.java | 200 |
nom/tam/fits/compression/algorithm/gzip2/GZip2Compressor.java | 213 |
public byte[] shuffle(byte[] byteArray) { byte[] result = new byte[byteArray.length]; int resultIndex = 0; int[] offset = calculateOffsets(byteArray); for (int index = 0; index < byteArray.length; index += primitiveSize) { for (int primitiveIndex = 0; primitiveIndex < primitiveSize; primitiveIndex++) { result[resultIndex + offset[primitiveIndex]] = byteArray[index + primitiveIndex]; |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 251 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 251 |
6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/plio/PLIOCompress.java | 93 |
nom/tam/fits/compression/algorithm/plio/PLIOCompress.java | 124 |
public void decompress(ByteBuffer compressed, ShortBuffer buffer) { pixelData = buffer; decompress(compressed.asShortBuffer(), pixelData.limit()); } @Override protected int nextPixel() { return pixelData.get(); } @Override protected void put(int index, int pixel) { pixelData.put(index, (short) pixel); } } |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 251 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 251 |
6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, |
File | Line |
---|---|
nom/tam/util/ByteFormatter.java | 562 |
nom/tam/util/ByteFormatter.java | 633 |
while (ndig < ByteFormatter.NUMBER_BASE && pos >= dmax) { ndig++; dmax *= ByteFormatter.NUMBER_BASE; } if (val < 0) { ndig++; } // Truncate if necessary. if (ndig > len || ndig > buf.length - off) { truncationFiller(buf, off, len); return off + len; } // Now insert the actual characters we want -- backwards // We use a do{} while() to handle the caByteFormatterse of 0. off += ndig; int xoff = off - 1; |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/util/array/MultiArrayCopyFactory.java | 177 |
nom/tam/util/array/MultiArrayCopyFactory.java | 237 |
public void arraycopy(double[] src, int srcPos, byte[] dest, int destPos, int length) { for (int index = 0; index < length; index++) { dest[index + destPos] = (byte) Math.round(src[index + srcPos]); } } } private static final class DoubleToChar extends MultiArrayCopyFactory<double[], char[]> { |
File | Line |
---|---|
nom/tam/util/array/MultiArrayCopyFactory.java | 187 |
nom/tam/util/array/MultiArrayCopyFactory.java | 247 |
public void arraycopy(double[] src, int srcPos, char[] dest, int destPos, int length) { for (int index = 0; index < length; index++) { dest[index + destPos] = (char) Math.round(src[index + srcPos]); } } } private static final class DoubleToFloat extends MultiArrayCopyFactory<double[], float[]> { |
File | Line |
---|---|
nom/tam/util/array/MultiArrayCopyFactory.java | 227 |
nom/tam/util/array/MultiArrayCopyFactory.java | 287 |
public void arraycopy(double[] src, int srcPos, short[] dest, int destPos, int length) { for (int index = 0; index < length; index++) { dest[index + destPos] = (short) Math.round(src[index + srcPos]); } } } private static final class FloatToByte extends MultiArrayCopyFactory<float[], byte[]> { |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 251 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 251 |
6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, |
File | Line |
---|---|
nom/tam/fits/header/DateTime.java | 445 |
nom/tam/fits/header/WCS.java | 950 |
DateTime(String headerName, SOURCE status, HDU hdu, VALUE valueType, String comment) { key = new FitsKey(headerName == null ? name() : headerName, status, hdu, valueType, comment); FitsKey.registerStandard(this); } @Override public final FitsKey impl() { return key; } |
File | Line |
---|---|
nom/tam/image/compression/hdu/CompressedCard.java | 110 |
nom/tam/image/compression/hdu/CompressedCard.java | 132 |
MAP_GCOUNT(GCOUNT), MAP_NAXIS(NAXIS), MAP_NAXISn(NAXISn), MAP_PCOUNT(PCOUNT), MAP_ZFORMn(ZFORMn) { @Override protected void backupCard(HeaderCard card, Cursor<String, HeaderCard> headerIterator) throws HeaderCardException { String newKey = uncompressedHeaderKey().n(GenericKey.getN(card.getKey())).key(); headerIterator.add(new HeaderCard(newKey, card.getValue(String.class, ""), card.getComment())); |
File | Line |
---|---|
nom/tam/util/BufferedFileIO.java | 454 |
nom/tam/util/InputDecoder.java | 174 |
public synchronized void readFully(byte[] b, int off, int len) throws EOFException, IOException { while (len > 0) { int n = read(b, off, len); if (n < 0) { throw new EOFException(); } off += n; len -= n; } } /** * Same as {@link RandomAccessFile#readUTF()}. * * @return a string * * @throws IOException if there was an IO error while reading from the file. */ public final synchronized String readUTF() throws IOException { |
File | Line |
---|---|
nom/tam/util/ColumnTable.java | 1348 |
nom/tam/util/ColumnTable.java | 1398 |
nom/tam/util/ColumnTable.java | 1452 |
nom/tam/util/ColumnTable.java | 1501 |
nom/tam/util/ColumnTable.java | 1550 |
nom/tam/util/ColumnTable.java | 1599 |
nom/tam/util/ColumnTable.java | 1648 |
@Override int read(int from, int n, ArrayDataInput in) throws IOException { return in.read(data, from, n); } @Override void write(int from, int n, ArrayDataOutput out) throws IOException { out.write(data, from, n); } @Override |
File | Line |
---|---|
nom/tam/fits/HeaderCard.java | 364 |
nom/tam/fits/HeaderCard.java | 393 |
public HeaderCard(String key, ComplexValue value, String comment) throws HeaderCardException { this(); if (value == null) { set(key, null, comment, ComplexValue.class); return; } if (!value.isFinite()) { throw new HeaderCardException("Cannot represent " + value + " in FITS headers."); } set(key, value.toBoundedString(spaceForValue(key)), comment, ComplexValue.class); |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 251 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, |
File | Line |
---|---|
nom/tam/util/ArrayFuncs.java | 851 |
nom/tam/util/ArrayFuncs.java | 875 |
private static void decimalToInteger(Object from, Object to, Quantizer q) { if (from instanceof Object[]) { Object[] a = (Object[]) from; Object[] b = (Object[]) to; for (int i = 0; i < a.length; i++) { |
File | Line |
---|---|
nom/tam/util/array/MultiArrayCopyFactory.java | 217 |
nom/tam/util/array/MultiArrayCopyFactory.java | 277 |
public void arraycopy(double[] src, int srcPos, long[] dest, int destPos, int length) { for (int index = 0; index < length; index++) { dest[index + destPos] = Math.round(src[index + srcPos]); } } } private static final class DoubleToShort extends MultiArrayCopyFactory<double[], short[]> { |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/plio/PLIOCompress.java | 65 |
nom/tam/fits/compression/algorithm/plio/PLIOCompress.java | 93 |
nom/tam/fits/compression/algorithm/plio/PLIOCompress.java | 124 |
public void decompress(ByteBuffer compressed, ByteBuffer buffer) { pixelData = buffer; decompress(compressed.asShortBuffer(), pixelData.limit()); } @Override protected int nextPixel() { return pixelData.get(); } @Override protected void put(int index, int pixel) { pixelData.put(index, (byte) pixel); |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/fits/compression/provider/param/hcompress/HCompressScaleParameter.java | 58 |
nom/tam/fits/compression/provider/param/hcompress/HCompressSmoothParameter.java | 58 |
nom/tam/fits/compression/provider/param/rice/RiceBlockSizeParameter.java | 62 |
nom/tam/fits/compression/provider/param/rice/RiceBytePixParameter.java | 62 |
getOption().setScale(value.getValue(Double.class, 0.0)); } } @Override public void setValueInHeader(Header header) throws HeaderCardException { int zvalIndex = nextFreeZVal(header); header.addValue(Compression.ZNAMEn.n(zvalIndex), getName()); header.addValue(Compression.ZVALn.n(zvalIndex), getOption().getScale()); |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 251 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, |
File | Line |
---|---|
nom/tam/util/array/MultiArrayCopyFactory.java | 57 |
nom/tam/util/array/MultiArrayCopyFactory.java | 315 |
nom/tam/util/array/MultiArrayCopyFactory.java | 375 |
nom/tam/util/array/MultiArrayCopyFactory.java | 435 |
public void arraycopy(byte[] src, int srcPos, char[] dest, int destPos, int length) { for (int index = 0; index < length; index++) { dest[index + destPos] = (char) src[index + srcPos]; } } } private static final class ByteToDouble extends MultiArrayCopyFactory<byte[], double[]> { |
File | Line |
---|---|
nom/tam/util/array/MultiArrayCopyFactory.java | 117 |
nom/tam/util/array/MultiArrayCopyFactory.java | 305 |
nom/tam/util/array/MultiArrayCopyFactory.java | 365 |
nom/tam/util/array/MultiArrayCopyFactory.java | 425 |
public void arraycopy(char[] src, int srcPos, byte[] dest, int destPos, int length) { for (int index = 0; index < length; index++) { dest[index + destPos] = (byte) src[index + srcPos]; } } } private static final class CharToDouble extends MultiArrayCopyFactory<char[], double[]> { |
File | Line |
---|---|
nom/tam/util/array/MultiArrayCopyFactory.java | 167 |
nom/tam/util/array/MultiArrayCopyFactory.java | 355 |
nom/tam/util/array/MultiArrayCopyFactory.java | 415 |
public void arraycopy(char[] src, int srcPos, short[] dest, int destPos, int length) { for (int index = 0; index < length; index++) { dest[index + destPos] = (short) src[index + srcPos]; } } } private static final class DoubleToByte extends MultiArrayCopyFactory<double[], byte[]> { |
File | Line |
---|---|
nom/tam/fits/compress/BZip2CompressionProvider.java | 53 |
nom/tam/fits/compress/ZCompressionProvider.java | 57 |
return CompressionLibLoaderProtection.createBZip2Stream(in); } catch (IOException e) { throw e; } catch (Exception e) { throw new IOException(e); } } @Override public int priority() { return PRIORITY; } @Override public boolean provides(int mag1, int mag2) { return mag1 == 'B' && mag2 == 'Z'; |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/image/compression/tile/mask/NullPixelMaskPreserver.java | 134 |
nom/tam/image/compression/tile/mask/NullPixelMaskPreserver.java | 145 |
int nullValue = (int) getNullValue(); int size = getTileBuffer().getPixelSize(); for (int index = 0; index < size; index++) { if (nullValue == buffer.get(index)) { initializedMask(size).put(index, NULL_INDICATOR); } } } private void preserveNullLongs() { |
File | Line |
---|---|
nom/tam/image/compression/tile/mask/NullPixelMaskRestorer.java | 111 |
nom/tam/image/compression/tile/mask/NullPixelMaskRestorer.java | 121 |
DoubleBuffer buffer = (DoubleBuffer) getTileBuffer().getBuffer(); ByteBuffer nullMask = initializedMask(buffer.remaining()); for (int index = 0; index < nullMask.capacity(); index++) { if (nullMask.get(index) == NULL_INDICATOR) { buffer.put(index, Double.NaN); |
File | Line |
---|---|
nom/tam/fits/FitsUtil.java | 137 |
nom/tam/fits/FitsUtil.java | 146 |
boolean[] bool = (boolean[]) o; byte[] b = new byte[bool.length]; for (int i = 0; i < bool.length; i++) { b[i] = FitsEncoder.byteForBoolean(bool[i]); } return b; } if (o instanceof Boolean[]) { |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/hcompress/HDecompress.java | 800 |
nom/tam/fits/compression/algorithm/hcompress/HDecompress.java | 832 |
if ((value & BIT_THREE) != ZERO) { b.bitOr(s00 + 1, planeVal); } if ((value & BIT_FOUR) != ZERO) { b.bitOr(s00, planeVal); } // b.bitOr(s10+1, ((LONGLONG) ( a[k] & 1)) << bit; b.bitOr(s10 , // ((((LONGLONG)a[k])>>1) & 1) << bit; b.bitOr(s00+1, // ((((LONGLONG)a[k])>>2) & 1) << bit; b.bitOr(s00 // ,((((LONGLONG)a[k])>>3) & 1) << bit; s00 += 2; /* s10 += 2; */ } if (j < lny) { |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 251 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, |
File | Line |
---|---|
nom/tam/image/compression/tile/mask/NullPixelMaskPreserver.java | 134 |
nom/tam/image/compression/tile/mask/NullPixelMaskPreserver.java | 156 |
int nullValue = (int) getNullValue(); int size = getTileBuffer().getPixelSize(); for (int index = 0; index < size; index++) { if (nullValue == buffer.get(index)) { initializedMask(size).put(index, NULL_INDICATOR); } } } |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/hcompress/HCompress.java | 683 |
nom/tam/fits/compression/algorithm/hcompress/HCompress.java | 733 |
k = 0; /* k is index of b[i/2,j/2] */ for (i = 0; i < nx - 1; i += 2) { s00 = n * i; /* s00 is index of a[i,j] */ /* * tried using s00+n directly in the statements, but this had no effect on performance */ s10 = s00 + n; /* s10 is index of a[i+1,j] */ for (j = 0; j < ny - 1; j += 2) { b[k] = (byte) ((a.get(s10 + 1) & b0 // |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/image/compression/tile/mask/NullPixelMaskPreserver.java | 145 |
nom/tam/image/compression/tile/mask/NullPixelMaskPreserver.java | 156 |
long nullValue = getNullValue(); int size = getTileBuffer().getPixelSize(); for (int index = 0; index < size; index++) { if (nullValue == buffer.get(index)) { initializedMask(size).put(index, NULL_INDICATOR); } } } |
File | Line |
---|---|
nom/tam/util/array/MultiArrayCopyFactory.java | 67 |
nom/tam/util/array/MultiArrayCopyFactory.java | 127 |
nom/tam/util/array/MultiArrayCopyFactory.java | 257 |
nom/tam/util/array/MultiArrayCopyFactory.java | 325 |
nom/tam/util/array/MultiArrayCopyFactory.java | 385 |
nom/tam/util/array/MultiArrayCopyFactory.java | 445 |
public void arraycopy(byte[] src, int srcPos, double[] dest, int destPos, int length) { for (int index = 0; index < length; index++) { dest[index + destPos] = src[index + srcPos]; } } } private static final class ByteToFloat extends MultiArrayCopyFactory<byte[], float[]> { |
File | Line |
---|---|
nom/tam/util/array/MultiArrayCopyFactory.java | 77 |
nom/tam/util/array/MultiArrayCopyFactory.java | 137 |
nom/tam/util/array/MultiArrayCopyFactory.java | 335 |
nom/tam/util/array/MultiArrayCopyFactory.java | 395 |
nom/tam/util/array/MultiArrayCopyFactory.java | 455 |
public void arraycopy(byte[] src, int srcPos, float[] dest, int destPos, int length) { for (int index = 0; index < length; index++) { dest[index + destPos] = src[index + srcPos]; } } } private static final class ByteToInt extends MultiArrayCopyFactory<byte[], int[]> { |
File | Line |
---|---|
nom/tam/util/array/MultiArrayCopyFactory.java | 87 |
nom/tam/util/array/MultiArrayCopyFactory.java | 147 |
nom/tam/util/array/MultiArrayCopyFactory.java | 465 |
public void arraycopy(byte[] src, int srcPos, int[] dest, int destPos, int length) { for (int index = 0; index < length; index++) { dest[index + destPos] = src[index + srcPos]; } } } private static final class ByteToLong extends MultiArrayCopyFactory<byte[], long[]> { |
File | Line |
---|---|
nom/tam/util/array/MultiArrayCopyFactory.java | 97 |
nom/tam/util/array/MultiArrayCopyFactory.java | 157 |
nom/tam/util/array/MultiArrayCopyFactory.java | 345 |
public void arraycopy(byte[] src, int srcPos, long[] dest, int destPos, int length) { for (int index = 0; index < length; index++) { dest[index + destPos] = src[index + srcPos]; } } } private static final class ByteToShort extends MultiArrayCopyFactory<byte[], short[]> { |
File | Line |
---|---|
nom/tam/fits/HeaderCard.java | 1503 |
nom/tam/fits/HeaderCard.java | 1540 |
nom/tam/fits/HeaderCard.java | 1568 |
HeaderCard hc = new HeaderCard(key.key(), (Boolean) null, key.comment()); hc.standardKey = key; hc.setValue(value); return hc; } catch (HeaderCardException e) { throw new IllegalArgumentException(e.getMessage(), e); } } /** * <p> * Creates a new card with a standard or conventional keyword and a number value, with the default comment * associated with the keyword. Unlike {@link #HeaderCard(String, Number)}, this call does not throw a hard * {@link HeaderCardException} exception, since the keyword and comment should be valid by design. (A runtime * {@link IllegalArgumentException} may still be thrown in the event that the supplied conventional keywords itself * is ill-defined -- but this should not happen unless something was poorly coded in this library, on in an * extension of it). * </p> * <p> * If the value is not compatible with the convention of the keyword, a warning message is logged but no exception * is thrown (at this point). * </p> * * @param key The standard or conventional keyword with its associated default comment. * @param value the integer value associated to the keyword. * * @return A new header card with the speficied standard-style key and comment and the * specified value. * * @throws IllegalArgumentException if the standard key itself was ill-defined. * * @since 1.16 */ public static HeaderCard create(IFitsHeader key, Number value) throws IllegalArgumentException { |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 251 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, |
File | Line |
---|---|
nom/tam/util/array/MultiArrayCopyFactory.java | 97 |
nom/tam/util/array/MultiArrayCopyFactory.java | 157 |
nom/tam/util/array/MultiArrayCopyFactory.java | 345 |
nom/tam/util/array/MultiArrayCopyFactory.java | 475 |
public void arraycopy(byte[] src, int srcPos, long[] dest, int destPos, int length) { for (int index = 0; index < length; index++) { dest[index + destPos] = src[index + srcPos]; } } } private static final class ByteToShort extends MultiArrayCopyFactory<byte[], short[]> { |
File | Line |
---|---|
nom/tam/fits/TableHDU.java | 509 |
nom/tam/fits/TableHDU.java | 530 |
public void setColumnMeta(int index, IFitsHeader key, String value, String comment, boolean after) throws HeaderCardException { setCurrentColumn(index, after); myHeader.addLine(new HeaderCard(key.n(index + 1).key(), value, comment)); } /** * Specify column metadata for a given column in a way that allows all of the column metadata for a given column to * be organized together. * * @param index The 0-based index of the column * @param key The column key. I.e., the keyword will be key+(index+1) * @param value The value to be placed in the header. * @param comment The comment for the header * @param after Should the header card be after the current column metadata block * (<code>true</code>), or immediately before the TFORM card (<code>false</code>). * * @throws HeaderCardException if the header could not be updated * * @since 1.16 */ public void setColumnMeta(int index, IFitsHeader key, Number value, String comment, boolean after) |
File | Line |
---|---|
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 252 |
nom/tam/fits/compression/algorithm/rice/RiceCompressor.java | 255 |
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, |
File | Line |
---|---|
nom/tam/util/type/PrimitiveType.java | 46 |
nom/tam/util/type/PrimitiveTypeBase.java | 46 |
protected PrimitiveType(int size, boolean individualSize, Class<?> primitiveClass, Class<?> wrapperClass, Class<B> bufferClass, char type, int bitPix) { super(size, individualSize, primitiveClass, wrapperClass, bufferClass, type, bitPix); } } |