-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
PrimitiveLongCollectionsTest.java
260 lines (224 loc) · 7.81 KB
/
PrimitiveLongCollectionsTest.java
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
/*
* Copyright (c) 2002-2018 "Neo Technology,"
* Network Engine for Objects in Lund AB [http://neotechnology.com]
*
* This file is part of Neo4j.
*
* Neo4j is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package org.neo4j.collection.primitive;
import org.eclipse.collections.api.iterator.LongIterator;
import org.eclipse.collections.api.set.primitive.LongSet;
import org.eclipse.collections.impl.set.mutable.primitive.LongHashSet;
import org.junit.Assert;
import org.junit.Test;
import java.util.Arrays;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.Set;
import java.util.concurrent.atomic.AtomicInteger;
import java.util.concurrent.atomic.AtomicLong;
import java.util.function.Supplier;
import org.neo4j.collection.primitive.PrimitiveLongCollections.PrimitiveLongBaseIterator;
import static java.util.Arrays.asList;
import static org.hamcrest.Matchers.containsInAnyOrder;
import static org.junit.Assert.assertArrayEquals;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertThat;
import static org.junit.Assert.assertTrue;
import static org.junit.Assert.fail;
public class PrimitiveLongCollectionsTest
{
@Test
public void arrayOfItemsAsIterator()
{
// GIVEN
long[] items = new long[] { 2, 5, 234 };
// WHEN
LongIterator iterator = PrimitiveLongCollections.iterator( items );
// THEN
assertItems( iterator, items );
}
@Test
public void filter()
{
// GIVEN
LongIterator items = PrimitiveLongCollections.iterator( 1, 2, 3 );
// WHEN
LongIterator filtered = PrimitiveLongCollections.filter( items, item -> item != 2 );
// THEN
assertItems( filtered, 1, 3 );
}
private static final class CountingPrimitiveLongIteratorResource implements LongIterator, AutoCloseable
{
private final LongIterator delegate;
private final AtomicInteger closeCounter;
private CountingPrimitiveLongIteratorResource( LongIterator delegate, AtomicInteger closeCounter )
{
this.delegate = delegate;
this.closeCounter = closeCounter;
}
@Override
public void close()
{
closeCounter.incrementAndGet();
}
@Override
public boolean hasNext()
{
return delegate.hasNext();
}
@Override
public long next()
{
return delegate.next();
}
}
@Test
public void singleWithDefaultMustAutoCloseIterator()
{
AtomicInteger counter = new AtomicInteger();
CountingPrimitiveLongIteratorResource itr = new CountingPrimitiveLongIteratorResource(
PrimitiveLongCollections.iterator( 13 ), counter );
assertEquals( PrimitiveLongCollections.single( itr, 2 ), 13 );
assertEquals( 1, counter.get() );
}
@Test
public void singleWithDefaultMustAutoCloseEmptyIterator()
{
AtomicInteger counter = new AtomicInteger();
CountingPrimitiveLongIteratorResource itr = new CountingPrimitiveLongIteratorResource(
PrimitiveLongCollections.emptyIterator(), counter );
assertEquals( PrimitiveLongCollections.single( itr, 2 ), 2 );
assertEquals( 1, counter.get() );
}
@Test
public void indexOf()
{
// GIVEN
Supplier<LongIterator> items = () -> PrimitiveLongCollections.iterator( 10, 20, 30 );
// THEN
assertEquals( -1, PrimitiveLongCollections.indexOf( items.get(), 55 ) );
assertEquals( 0, PrimitiveLongCollections.indexOf( items.get(), 10 ) );
assertEquals( 1, PrimitiveLongCollections.indexOf( items.get(), 20 ) );
assertEquals( 2, PrimitiveLongCollections.indexOf( items.get(), 30 ) );
}
@Test
public void count()
{
// GIVEN
LongIterator items = PrimitiveLongCollections.iterator( 1, 2, 3 );
// WHEN
int count = PrimitiveLongCollections.count( items );
// THEN
assertEquals( 3, count );
}
@Test
public void asArray()
{
// GIVEN
LongIterator items = PrimitiveLongCollections.iterator( 1, 2, 3 );
// WHEN
long[] array = PrimitiveLongCollections.asArray( items );
// THEN
assertTrue( Arrays.equals( new long[] { 1, 2, 3 }, array ) );
}
@Test
public void shouldDeduplicate()
{
// GIVEN
long[] array = new long[] {1L, 1L, 2L, 5L, 6L, 6L};
// WHEN
long[] deduped = PrimitiveLongCollections.deduplicate( array );
// THEN
assertArrayEquals( new long[] {1L, 2L, 5L, 6L}, deduped );
}
@Test
public void shouldNotContinueToCallNextOnHasNextFalse()
{
// GIVEN
AtomicLong count = new AtomicLong( 2 );
LongIterator iterator = new PrimitiveLongBaseIterator()
{
@Override
protected boolean fetchNext()
{
return count.decrementAndGet() >= 0 && next( count.get() );
}
};
// WHEN/THEN
assertTrue( iterator.hasNext() );
assertTrue( iterator.hasNext() );
Assert.assertEquals( 1L, iterator.next() );
assertTrue( iterator.hasNext() );
assertTrue( iterator.hasNext() );
Assert.assertEquals( 0L, iterator.next() );
assertFalse( iterator.hasNext() );
assertFalse( iterator.hasNext() );
assertEquals( -1L, count.get() );
}
@Test
public void convertJavaCollectionToSetOfPrimitives()
{
List<Long> longs = asList( 1L, 4L, 7L );
LongSet longSet = PrimitiveLongCollections.asSet( longs );
assertTrue( longSet.contains( 1L ) );
assertTrue( longSet.contains( 4L ) );
assertTrue( longSet.contains( 7L ) );
Assert.assertEquals( 3, longSet.size() );
}
@Test
public void convertPrimitiveSetToJavaSet()
{
LongSet longSet = LongHashSet.newSetWith( 1L, 3L, 5L );
Set<Long> longs = PrimitiveLongCollections.toSet( longSet );
assertThat( longs, containsInAnyOrder(1L, 3L, 5L) );
}
private void assertNoMoreItems( LongIterator iterator )
{
assertFalse( iterator + " should have no more items", iterator.hasNext() );
try
{
iterator.next();
fail( "Invoking next() on " + iterator +
" which has no items left should have thrown NoSuchElementException" );
}
catch ( NoSuchElementException e )
{ // Good
}
}
private void assertNextEquals( long expected, LongIterator iterator )
{
assertTrue( iterator + " should have had more items", iterator.hasNext() );
Assert.assertEquals( expected, iterator.next() );
}
private void assertItems( LongIterator iterator, long... expectedItems )
{
for ( long expectedItem : expectedItems )
{
assertNextEquals( expectedItem, iterator );
}
assertNoMoreItems( iterator );
}
private long[] reverse( long[] items )
{
long[] result = new long[items.length];
for ( int i = 0; i < items.length; i++ )
{
result[i] = items[items.length - i - 1];
}
return result;
}
}