forked from lmdbjava/lmdbjava
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCursorIteratorTest.java
More file actions
355 lines (317 loc) · 10.3 KB
/
Copy pathCursorIteratorTest.java
File metadata and controls
355 lines (317 loc) · 10.3 KB
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
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
/*-
* #%L
* LmdbJava
* %%
* Copyright (C) 2016 - 2018 The LmdbJava Open Source Project
* %%
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
* #L%
*/
package org.lmdbjava;
import com.google.common.primitives.UnsignedBytes;
import java.io.File;
import java.io.IOException;
import java.nio.ByteBuffer;
import java.util.ArrayList;
import static java.util.Arrays.asList;
import java.util.Comparator;
import java.util.Deque;
import java.util.LinkedList;
import java.util.List;
import java.util.NoSuchElementException;
import static org.hamcrest.CoreMatchers.is;
import static org.hamcrest.MatcherAssert.assertThat;
import static org.hamcrest.Matchers.hasSize;
import org.junit.After;
import org.junit.Before;
import org.junit.Rule;
import org.junit.Test;
import org.junit.rules.TemporaryFolder;
import static org.lmdbjava.CursorIterator.IteratorType.BACKWARD;
import static org.lmdbjava.CursorIterator.IteratorType.FORWARD;
import org.lmdbjava.CursorIterator.KeyVal;
import static org.lmdbjava.DbiFlags.MDB_CREATE;
import static org.lmdbjava.Env.open;
import static org.lmdbjava.EnvFlags.MDB_NOSUBDIR;
import static org.lmdbjava.KeyRange.all;
import static org.lmdbjava.KeyRange.allBackward;
import static org.lmdbjava.KeyRange.atLeast;
import static org.lmdbjava.KeyRange.atLeastBackward;
import static org.lmdbjava.KeyRange.atMost;
import static org.lmdbjava.KeyRange.atMostBackward;
import static org.lmdbjava.KeyRange.closed;
import static org.lmdbjava.KeyRange.closedBackward;
import static org.lmdbjava.KeyRange.closedOpen;
import static org.lmdbjava.KeyRange.closedOpenBackward;
import static org.lmdbjava.KeyRange.greaterThan;
import static org.lmdbjava.KeyRange.greaterThanBackward;
import static org.lmdbjava.KeyRange.lessThan;
import static org.lmdbjava.KeyRange.lessThanBackward;
import static org.lmdbjava.KeyRange.open;
import static org.lmdbjava.KeyRange.openBackward;
import static org.lmdbjava.KeyRange.openClosed;
import static org.lmdbjava.KeyRange.openClosedBackward;
import static org.lmdbjava.PutFlags.MDB_NOOVERWRITE;
import static org.lmdbjava.TestUtils.DB_1;
import static org.lmdbjava.TestUtils.bb;
/**
* Test {@link CursorIterator}.
*/
public final class CursorIteratorTest {
@Rule
public final TemporaryFolder tmp = new TemporaryFolder();
private Dbi<ByteBuffer> db;
private Env<ByteBuffer> env;
private Deque<Integer> list;
@After
public void after() {
env.close();
}
@Test
public void allBackwardTest() {
verify(allBackward(), 8, 6, 4, 2);
}
@Test
public void allTest() {
verify(all(), 2, 4, 6, 8);
}
@Test
public void atLeastBackwardTest() {
verify(atLeastBackward(bb(5)), 4, 2);
verify(atLeastBackward(bb(6)), 6, 4, 2);
verify(atLeastBackward(bb(9)), 8, 6, 4, 2);
}
@Test
public void atLeastTest() {
verify(atLeast(bb(5)), 6, 8);
verify(atLeast(bb(6)), 6, 8);
}
@Test
public void atMostBackwardTest() {
verify(atMostBackward(bb(5)), 8, 6);
verify(atMostBackward(bb(6)), 8, 6);
}
@Test
public void atMostTest() {
verify(atMost(bb(5)), 2, 4);
verify(atMost(bb(6)), 2, 4, 6);
}
@Test
public void backwardDeprecated() {
try (Txn<ByteBuffer> txn = env.txnRead();
CursorIterator<ByteBuffer> c = db.iterate(txn, BACKWARD)) {
for (final KeyVal<ByteBuffer> kv : c.iterable()) {
assertThat(kv.val().getInt(), is(list.pollLast()));
assertThat(kv.key().getInt(), is(list.pollLast()));
assertThat(c.hasNext(), is(list.peekFirst() != null));
}
}
}
@Test
public void backwardSeekDeprecated() {
final ByteBuffer key = bb(6);
list.pollLast();
list.pollLast();
try (Txn<ByteBuffer> txn = env.txnRead();
CursorIterator<ByteBuffer> c = db.iterate(txn, key, BACKWARD)) {
for (final KeyVal<ByteBuffer> kv : c.iterable()) {
assertThat(kv.val().getInt(), is(list.pollLast()));
assertThat(kv.key().getInt(), is(list.pollLast()));
}
}
}
@Before
public void before() throws IOException {
final File path = tmp.newFile();
env = open(path, 10, MDB_NOSUBDIR);
db = env.openDbi(DB_1, MDB_CREATE);
list = new LinkedList<>();
list.addAll(asList(2, 3, 4, 5, 6, 7, 8, 9));
try (Txn<ByteBuffer> txn = env.txnWrite()) {
final Cursor<ByteBuffer> c = db.openCursor(txn);
c.put(bb(2), bb(3), MDB_NOOVERWRITE);
c.put(bb(4), bb(5));
c.put(bb(6), bb(7));
c.put(bb(8), bb(9));
txn.commit();
}
}
@Test
public void closedBackwardTest() {
verify(closedBackward(bb(7), bb(3)), 6, 4);
verify(closedBackward(bb(6), bb(2)), 6, 4, 2);
verify(closedBackward(bb(9), bb(3)), 8, 6, 4);
}
@Test
public void closedOpenBackwardTest() {
verify(closedOpenBackward(bb(8), bb(3)), 8, 6, 4);
verify(closedOpenBackward(bb(7), bb(2)), 6, 4);
verify(closedOpenBackward(bb(9), bb(3)), 8, 6, 4);
}
@Test
public void closedOpenTest() {
verify(closedOpen(bb(3), bb(8)), 4, 6);
verify(closedOpen(bb(2), bb(6)), 2, 4);
}
@Test
public void closedTest() {
verify(closed(bb(3), bb(7)), 4, 6);
verify(closed(bb(2), bb(6)), 2, 4, 6);
verify(closed(bb(1), bb(7)), 2, 4, 6);
}
@Test
public void forwardDeprecated() {
try (Txn<ByteBuffer> txn = env.txnRead();
CursorIterator<ByteBuffer> c = db.iterate(txn, FORWARD)) {
for (final KeyVal<ByteBuffer> kv : c.iterable()) {
assertThat(kv.key().getInt(), is(list.pollFirst()));
assertThat(kv.val().getInt(), is(list.pollFirst()));
assertThat(c.hasNext(), is(list.peekFirst() != null));
}
}
}
@Test
public void forwardSeekDeprecated() {
final ByteBuffer key = bb(4);
list.pollFirst();
list.pollFirst();
try (Txn<ByteBuffer> txn = env.txnRead();
CursorIterator<ByteBuffer> c = db.iterate(txn, key, FORWARD)) {
for (final KeyVal<ByteBuffer> kv : c.iterable()) {
assertThat(kv.key().getInt(), is(list.pollFirst()));
assertThat(kv.val().getInt(), is(list.pollFirst()));
}
}
}
@Test
public void greaterThanBackwardTest() {
verify(greaterThanBackward(bb(6)), 4, 2);
verify(greaterThanBackward(bb(7)), 6, 4, 2);
verify(greaterThanBackward(bb(9)), 8, 6, 4, 2);
}
@Test
public void greaterThanTest() {
verify(greaterThan(bb(4)), 6, 8);
verify(greaterThan(bb(3)), 4, 6, 8);
}
@Test
public void iterate() {
try (Txn<ByteBuffer> txn = env.txnRead();
CursorIterator<ByteBuffer> c = db.iterate(txn)) {
for (final KeyVal<ByteBuffer> kv : c.iterable()) {
assertThat(kv.key().getInt(), is(list.pollFirst()));
assertThat(kv.val().getInt(), is(list.pollFirst()));
}
}
}
@Test
public void lessThanBackwardTest() {
verify(lessThanBackward(bb(5)), 8, 6);
verify(lessThanBackward(bb(2)), 8, 6, 4);
}
@Test
public void lessThanTest() {
verify(lessThan(bb(5)), 2, 4);
verify(lessThan(bb(8)), 2, 4, 6);
}
@Test(expected = NoSuchElementException.class)
public void nextThrowsNoSuchElementExceptionIfNoMoreElements() {
try (Txn<ByteBuffer> txn = env.txnRead();
CursorIterator<ByteBuffer> c = db.iterate(txn)) {
for (final KeyVal<ByteBuffer> kv : c.iterable()) {
assertThat(kv.key().getInt(), is(list.pollFirst()));
assertThat(kv.val().getInt(), is(list.pollFirst()));
}
assertThat(c.hasNext(), is(false));
c.next();
}
}
@Test
public void openBackwardTest() {
verify(openBackward(bb(7), bb(2)), 6, 4);
verify(openBackward(bb(8), bb(1)), 6, 4, 2);
verify(openBackward(bb(9), bb(4)), 8, 6);
}
@Test
public void openClosedBackwardTest() {
verify(openClosedBackward(bb(7), bb(2)), 6, 4, 2);
verify(openClosedBackward(bb(8), bb(4)), 6, 4);
verify(openClosedBackward(bb(9), bb(4)), 8, 6, 4);
}
@Test
public void openClosedBackwardTestWithGuava() {
final Comparator<byte[]> guava = UnsignedBytes.lexicographicalComparator();
final Comparator<ByteBuffer> comparator = (bb1, bb2) -> {
final byte[] array1 = new byte[bb1.remaining()];
final byte[] array2 = new byte[bb2.remaining()];
bb1.mark();
bb2.mark();
bb1.get(array1);
bb2.get(array2);
bb1.reset();
bb2.reset();
return guava.compare(array1, array2);
};
verify(openClosedBackward(bb(7), bb(2)), comparator, 6, 4, 2);
verify(openClosedBackward(bb(8), bb(4)), comparator, 6, 4);
}
@Test
public void openClosedTest() {
verify(openClosed(bb(3), bb(8)), 4, 6, 8);
verify(openClosed(bb(2), bb(6)), 4, 6);
}
@Test
public void openTest() {
verify(open(bb(3), bb(7)), 4, 6);
verify(open(bb(2), bb(8)), 4, 6);
}
@Test
public void removeOddElements() {
verify(all(), 2, 4, 6, 8);
int idx = -1;
try (Txn<ByteBuffer> txn = env.txnWrite()) {
try (CursorIterator<ByteBuffer> c = db.iterate(txn)) {
while (c.hasNext()) {
c.next();
idx++;
if (idx % 2 == 0) {
c.remove();
}
}
}
txn.commit();
}
verify(all(), 4, 8);
}
private void verify(final KeyRange<ByteBuffer> range, final int... expected) {
verify(range, null, expected);
}
private void verify(final KeyRange<ByteBuffer> range,
final Comparator<ByteBuffer> comparator,
final int... expected) {
final List<Integer> results = new ArrayList<>();
try (Txn<ByteBuffer> txn = env.txnRead();
CursorIterator<ByteBuffer> c = db.iterate(txn, range, comparator)) {
for (final KeyVal<ByteBuffer> kv : c.iterable()) {
final int key = kv.key().getInt();
final int val = kv.val().getInt();
results.add(key);
assertThat(val, is(key + 1));
}
}
assertThat(results, hasSize(expected.length));
for (int idx = 0; idx < results.size(); idx++) {
assertThat(results.get(idx), is(expected[idx]));
}
}
}