summaryrefslogtreecommitdiffstats
path: root/src/junit/com/jogamp/common/util/TestFloatStack01.java
diff options
context:
space:
mode:
Diffstat (limited to 'src/junit/com/jogamp/common/util/TestFloatStack01.java')
-rw-r--r--src/junit/com/jogamp/common/util/TestFloatStack01.java266
1 files changed, 266 insertions, 0 deletions
diff --git a/src/junit/com/jogamp/common/util/TestFloatStack01.java b/src/junit/com/jogamp/common/util/TestFloatStack01.java
new file mode 100644
index 0000000..0a2b077
--- /dev/null
+++ b/src/junit/com/jogamp/common/util/TestFloatStack01.java
@@ -0,0 +1,266 @@
+/**
+ * Copyright 2010 JogAmp Community. All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without modification, are
+ * permitted provided that the following conditions are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright notice, this list of
+ * conditions and the following disclaimer.
+ *
+ * 2. Redistributions in binary form must reproduce the above copyright notice, this list
+ * of conditions and the following disclaimer in the documentation and/or other materials
+ * provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY JogAmp Community ``AS IS'' AND ANY EXPRESS OR IMPLIED
+ * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+ * FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JogAmp Community OR
+ * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+ * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * The views and conclusions contained in the software and documentation are those of the
+ * authors and should not be interpreted as representing official policies, either expressed
+ * or implied, of JogAmp Community.
+ */
+
+package com.jogamp.common.util;
+
+import java.io.IOException;
+import java.nio./*value2*/FloatBuffer/*value2*/;
+import java.util.Arrays;
+
+import org.junit.Assert;
+import org.junit.Test;
+
+import com.jogamp.junit.util.JunitTracer;
+
+public class /*testname*/TestFloatStack01/*testname*/ extends JunitTracer {
+
+ static final boolean equals(/*value*/float/*value*/[] b, int bOffset,
+ /*value*/float/*value*/[] stack, int stackOffset, int length) {
+ for(int i=0; i<length; i++) {
+ if( b[bOffset+i] != stack[stackOffset+i]) {
+ return false;
+ }
+ }
+ return true;
+ }
+
+
+ @Test
+ public void test01PrimitiveArray() {
+ final int compNum = 3;
+ /*value*/float/*value*/[] e0 =
+ new /*value*/float/*value*/[] { 0, 1, 2 };
+ /*value*/float/*value*/[] e1 =
+ new /*value*/float/*value*/[] { 3, 4, 5 };
+
+ final int initialSizeElem = 32;
+ final int growSizeElem = 2;
+ final int totalSizeElem = initialSizeElem+2*growSizeElem;
+
+ final int initialSizeComp = initialSizeElem*compNum;
+ final int growSizeComp = growSizeElem*compNum;
+ final int totalSizeComp = totalSizeElem*compNum;
+
+ final /*name*/FloatStack/*name*/ fs0 =
+ new /*name*/FloatStack/*name*/(initialSizeComp, growSizeComp);
+
+ //
+ // PUT
+ //
+
+ for(int i=0; i<totalSizeElem; i++) {
+ if(i < initialSizeElem) {
+ Assert.assertTrue("Error "+fs0, fs0.remaining() == (initialSizeElem-i)*compNum);
+ } else {
+ int j = ( i - initialSizeElem ) % growSizeElem ;
+ Assert.assertTrue("Error "+fs0, fs0.remaining() == j*compNum);
+ }
+ Assert.assertTrue("Error "+fs0, fs0.position() == i*compNum);
+
+ // String s;
+ if( 0 == i % 2) {
+ // s = Arrays.toString(e0);
+ fs0.putOnTop(e0, 0, compNum);
+ } else {
+ // s = Arrays.toString(e1);
+ fs0.putOnTop(e1, 0, compNum);
+ }
+ // System.err.println("#"+i+"/"+totalSizeElem+": "+fs0+" <- "+s);
+ }
+ // System.err.println("X: "+fs0);
+ Assert.assertTrue("Error "+fs0, fs0.remaining() == 0);
+ Assert.assertTrue("Error "+fs0, fs0.position() == totalSizeComp);
+
+ fs0.setGrowSize(0);
+ {
+ Exception expectedException = null;
+ try {
+ fs0.putOnTop(e1, 0, compNum);
+ } catch (Exception e) {
+ expectedException = e;
+ }
+ if(null == expectedException || !(expectedException instanceof IndexOutOfBoundsException) ) {
+ Assert.assertTrue("Error "+fs0+", exception "+expectedException, false);
+ }
+ }
+
+ //
+ // GET
+ //
+
+ for(int i=0; i<totalSizeElem; i++) {
+ Assert.assertTrue("Error "+fs0, fs0.remaining() == i*compNum);
+ Assert.assertTrue("Error "+fs0, fs0.position() == (totalSizeElem-i)*compNum);
+
+ final /*value*/float/*value*/[] buf =
+ new /*value*/float/*value*/[compNum];
+ fs0.getFromTop(buf, 0, compNum);
+ if( 0 == i % 2) {
+ Assert.assertTrue("Error "+fs0+", #"+i+": "+Arrays.toString(e1)+" != "+Arrays.toString(buf), Arrays.equals(e1, buf));
+ } else {
+ Assert.assertTrue("Error "+fs0+", #"+i+": "+Arrays.toString(e0)+" != "+Arrays.toString(buf), Arrays.equals(e0, buf));
+ }
+ }
+ Assert.assertTrue("Error "+fs0, fs0.remaining() == totalSizeComp);
+ Assert.assertTrue("Error "+fs0, fs0.position() == 0);
+
+ {
+ final /*value*/float/*value*/[] buf =
+ new /*value*/float/*value*/[compNum];
+ Exception expectedException = null;
+ try {
+ fs0.getFromTop(buf, 0, compNum);
+ } catch (Exception e) {
+ expectedException = e;
+ }
+ if(null == expectedException || !(expectedException instanceof IndexOutOfBoundsException) ) {
+ Assert.assertTrue("Error "+fs0+", exception "+expectedException, false);
+ }
+ }
+ }
+
+ @Test
+ public void test02FloatBuffer() {
+ final int compNum = 3;
+ /*value2*/FloatBuffer/*value2*/ fb0 =
+ /*value2*/FloatBuffer/*value2*/.allocate(3*compNum);
+
+ /*value*/float/*value*/[] e0 =
+ new /*value*/float/*value*/[] { 0, 1, 2 };
+ /*value*/float/*value*/[] e1 =
+ new /*value*/float/*value*/[] { 3, 4, 5 };
+ /*value*/float/*value*/[] e2 =
+ new /*value*/float/*value*/[] { 6, 7, 8 }; // not put on stack!
+ fb0.put(e0);
+ fb0.put(e1);
+ fb0.put(e2);
+ fb0.position(0);
+
+ final int initialSizeElem = 32;
+ final int growSizeElem = 2;
+ final int totalSizeElem = initialSizeElem+2*growSizeElem;
+
+ final int initialSizeComp = initialSizeElem*compNum;
+ final int growSizeComp = growSizeElem*compNum;
+ final int totalSizeComp = totalSizeElem*compNum;
+
+ final /*name*/FloatStack/*name*/ fs0 =
+ new /*name*/FloatStack/*name*/(initialSizeComp, growSizeComp);
+
+ //
+ // PUT
+ //
+
+ for(int i=0; i<totalSizeElem; i++) {
+ if( 0 == i ) {
+ Assert.assertTrue("Error "+fs0+", "+fb0, fb0.position() == 0);
+ } else if( 0 == i % 2) {
+ Assert.assertTrue("Error "+fs0+", "+fb0, fb0.position() == 2*compNum);
+ fb0.position(0);
+ } else {
+ Assert.assertTrue("Error "+fs0+", "+fb0, fb0.position() == compNum);
+ }
+ if(i < initialSizeElem) {
+ Assert.assertTrue("Error "+fs0, fs0.remaining() == (initialSizeElem-i)*compNum);
+ } else {
+ int j = ( i - initialSizeElem ) % growSizeElem ;
+ Assert.assertTrue("Error "+fs0, fs0.remaining() == j*compNum);
+ }
+ Assert.assertTrue("Error "+fs0, fs0.position() == i*compNum);
+
+ final int fb0Pos0 = fb0.position();
+ fs0.putOnTop(fb0, compNum);
+ Assert.assertTrue("Error "+fs0+", "+fb0, fb0.position() == fb0Pos0 + compNum);
+ }
+ Assert.assertTrue("Error "+fs0, fs0.remaining() == 0);
+ Assert.assertTrue("Error "+fs0, fs0.position() == totalSizeComp);
+
+ fs0.setGrowSize(0);
+ {
+ fb0.position(0);
+ Exception expectedException = null;
+ try {
+ fs0.putOnTop(fb0, compNum);
+ } catch (Exception e) {
+ expectedException = e;
+ }
+ if(null == expectedException || !(expectedException instanceof IndexOutOfBoundsException) ) {
+ Assert.assertTrue("Error "+fs0+", exception "+expectedException, false);
+ }
+ fb0.position(0);
+ }
+
+ //
+ // GET
+ //
+
+ for(int i=0; i<totalSizeElem; i++) {
+ Assert.assertTrue("Error "+fs0, fs0.remaining() == i*compNum);
+ Assert.assertTrue("Error "+fs0, fs0.position() == (totalSizeElem-i)*compNum);
+
+ final /*value*/float/*value*/[] backing =
+ new /*value*/float/*value*/[compNum];
+ /*value2*/FloatBuffer/*value2*/ buf =
+ /*value2*/FloatBuffer/*value2*/.wrap(backing);
+
+ fs0.getFromTop(buf, compNum);
+ if( 0 == i % 2) {
+ Assert.assertTrue("Error "+fs0+", #"+i+": "+Arrays.toString(e1)+" != "+Arrays.toString(backing), Arrays.equals(e1, backing));
+ } else {
+ Assert.assertTrue("Error "+fs0+", #"+i+": "+Arrays.toString(e0)+" != "+Arrays.toString(backing), Arrays.equals(e0, backing));
+ }
+ Assert.assertTrue("Error "+fs0+", "+buf, buf.position() == compNum);
+ buf.position(0);
+ }
+ Assert.assertTrue("Error "+fs0, fs0.remaining() == totalSizeComp);
+ Assert.assertTrue("Error "+fs0, fs0.position() == 0);
+
+ {
+ final /*value*/float/*value*/[] backing =
+ new /*value*/float/*value*/[compNum];
+ /*value2*/FloatBuffer/*value2*/ buf
+ = /*value2*/FloatBuffer/*value2*/.wrap(backing);
+ Exception expectedException = null;
+ try {
+ fs0.getFromTop(buf, compNum);
+ } catch (Exception e) {
+ expectedException = e;
+ }
+ if(null == expectedException || !(expectedException instanceof IndexOutOfBoundsException) ) {
+ Assert.assertTrue("Error "+fs0+", exception "+expectedException, false);
+ }
+ }
+
+ }
+
+ public static void main(String args[]) throws IOException {
+ String tstname = /*testname*/TestFloatStack01/*testname*/.class.getName();
+ org.junit.runner.JUnitCore.main(tstname);
+ }
+
+}
generated by cgit v1.2.3 (git 2.39.1) at 2024-11-30 00:51:23 +0000