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
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
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);
}
}
|
