|
| 1 | +/* |
| 2 | + * #%L |
| 3 | + * SciJava Common shared library for SciJava software. |
| 4 | + * %% |
| 5 | + * Copyright (C) 2009 - 2015 Board of Regents of the University of |
| 6 | + * Wisconsin-Madison, Broad Institute of MIT and Harvard, and Max Planck |
| 7 | + * Institute of Molecular Cell Biology and Genetics. |
| 8 | + * %% |
| 9 | + * Redistribution and use in source and binary forms, with or without |
| 10 | + * modification, are permitted provided that the following conditions are met: |
| 11 | + * |
| 12 | + * 1. Redistributions of source code must retain the above copyright notice, |
| 13 | + * this list of conditions and the following disclaimer. |
| 14 | + * 2. Redistributions in binary form must reproduce the above copyright notice, |
| 15 | + * this list of conditions and the following disclaimer in the documentation |
| 16 | + * and/or other materials provided with the distribution. |
| 17 | + * |
| 18 | + * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 19 | + * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 20 | + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 21 | + * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE |
| 22 | + * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 23 | + * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 24 | + * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 25 | + * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 26 | + * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 27 | + * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| 28 | + * POSSIBILITY OF SUCH DAMAGE. |
| 29 | + * #L% |
| 30 | + */ |
| 31 | + |
| 32 | +package org.scijava.io; |
| 33 | + |
| 34 | +import static org.junit.Assert.assertEquals; |
| 35 | +import static org.junit.Assert.assertSame; |
| 36 | + |
| 37 | +import org.junit.Test; |
| 38 | + |
| 39 | +/** |
| 40 | + * Tests {@link BytesLocation}. |
| 41 | + * |
| 42 | + * @author Curtis Rueden |
| 43 | + */ |
| 44 | +public class BytesLocationTest { |
| 45 | + |
| 46 | + /** Tests {@link BytesLocation#BytesLocation(byte[])}. */ |
| 47 | + @Test |
| 48 | + public void testBytes() { |
| 49 | + final byte[] digits = {3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5, 8, 9, 7, 9}; |
| 50 | + final BytesLocation loc = new BytesLocation(digits); |
| 51 | + assertSame(digits, loc.getByteBuffer().array()); |
| 52 | + assertEquals(0, loc.getByteBuffer().position()); |
| 53 | + assertEquals(digits.length, loc.getByteBuffer().remaining()); |
| 54 | + } |
| 55 | + |
| 56 | + /** Tests {@link BytesLocation#BytesLocation(byte[], int, int)}. */ |
| 57 | + @Test |
| 58 | + public void testBytesOffsetLength() { |
| 59 | + final byte[] digits = {3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5, 8, 9, 7, 9}; |
| 60 | + final int offset = 3, length = 5; |
| 61 | + final BytesLocation loc = new BytesLocation(digits, offset, length); |
| 62 | + assertSame(digits, loc.getByteBuffer().array()); |
| 63 | + assertEquals(offset, loc.getByteBuffer().position()); |
| 64 | + assertEquals(length, loc.getByteBuffer().remaining()); |
| 65 | + } |
| 66 | + |
| 67 | +} |
0 commit comments