@@ -2,7 +2,7 @@ package com.simsilica.mathd.util;
22
33import java.util.Random ;
44
5- class IntSpanSetTest {
5+ class IntRangeSetTest {
66
77 static class AddTest extends GroovyTestCase {
88
@@ -17,7 +17,7 @@ class IntSpanSetTest {
1717
1818 def test = [] as TreeSet ;
1919
20- IntSpanSet set = new IntSpanSet ();
20+ IntRangeSet set = new IntRangeSet ();
2121 for ( int i : values ) {
2222 boolean b1 = set. add(i);
2323 boolean b2 = test. add(i);
@@ -44,7 +44,7 @@ class IntSpanSetTest {
4444
4545 def test = [] as TreeSet ;
4646
47- IntSpanSet set = new IntSpanSet ();
47+ IntRangeSet set = new IntRangeSet ();
4848 for ( int i : values ) {
4949 boolean b1 = set. add(i);
5050 boolean b2 = test. add(i);
@@ -64,7 +64,7 @@ class IntSpanSetTest {
6464
6565 def test = [] as TreeSet ;
6666
67- IntSpanSet set = new IntSpanSet ();
67+ IntRangeSet set = new IntRangeSet ();
6868 for ( int i = 0 ; i < 50 ; i++ ) {
6969 boolean b1 = set. add(i);
7070 boolean b2 = test. add(i);
@@ -87,7 +87,7 @@ class IntSpanSetTest {
8787
8888 // Setup sets with 0-49 in them
8989 def test = [] as TreeSet ;
90- IntSpanSet set = new IntSpanSet ();
90+ IntRangeSet set = new IntRangeSet ();
9191 for ( int i = 0 ; i < 50 ; i++ ) {
9292 set. add(i);
9393 test. add(i);
@@ -122,7 +122,7 @@ class IntSpanSetTest {
122122
123123 // Setup sets with 0-49 in them
124124 def test = [] as TreeSet ;
125- IntSpanSet set = new IntSpanSet ();
125+ IntRangeSet set = new IntRangeSet ();
126126 for ( int i = 0 ; i < 50 ; i++ ) {
127127 set. add(i);
128128 test. add(i);
@@ -164,7 +164,7 @@ class IntSpanSetTest {
164164
165165 // Setup sets with 0-49 in them
166166 def test = [] as TreeSet ;
167- IntSpanSet set = new IntSpanSet ();
167+ IntRangeSet set = new IntRangeSet ();
168168 for ( int i = 0 ; i < 50 ; i++ ) {
169169 set. add(i);
170170 test. add(i);
@@ -206,7 +206,7 @@ class IntSpanSetTest {
206206
207207 // Setup sets with 0-49 in them
208208 def test = [] as TreeSet ;
209- IntSpanSet set = new IntSpanSet ();
209+ IntRangeSet set = new IntRangeSet ();
210210 for ( int i = 0 ; i < 50 ; i++ ) {
211211 set. add(i);
212212 test. add(i);
@@ -248,7 +248,7 @@ class IntSpanSetTest {
248248
249249 // Setup sets with 0-49 in them
250250 def test = [] as TreeSet ;
251- IntSpanSet set = new IntSpanSet ();
251+ IntRangeSet set = new IntRangeSet ();
252252 for ( int i = 0 ; i < 50 ; i++ ) {
253253 set. add(i);
254254 test. add(i);
@@ -293,7 +293,7 @@ class IntSpanSetTest {
293293
294294 // Setup sets with 0-49 in them
295295 def test = [] as TreeSet ;
296- IntSpanSet set = new IntSpanSet ();
296+ IntRangeSet set = new IntRangeSet ();
297297 for ( int i = 0 ; i < 50 ; i++ ) {
298298 set. add(i);
299299 test. add(i);
@@ -334,7 +334,7 @@ class IntSpanSetTest {
334334 static class RangeArrayTest extends GroovyTestCase {
335335 public void testPackedRandomAdd () {
336336
337- IntSpanSet set = new IntSpanSet ();
337+ IntRangeSet set = new IntRangeSet ();
338338
339339 Random rand = new Random (1 );
340340 for ( int i = 0 ; i < 50 ; i++ ) {
@@ -352,7 +352,7 @@ class IntSpanSetTest {
352352
353353 // Add some values to the end and remove some from the
354354 // beginning
355- IntSpanSet set = new IntSpanSet ();
355+ IntRangeSet set = new IntRangeSet ();
356356 for ( int i = 0 ; i < 10 ; i++ ) {
357357 set. add(i);
358358 }
0 commit comments