timslite 0.1.7

High-performance mmap-backed time-series storage engine with queues and journal.
Documentation
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
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
//! Iterator tests: cross-segment, cross-block queries.
use std::fs;
use std::path::PathBuf;
use std::sync::atomic::{AtomicU64, Ordering};

static COUNTER: AtomicU64 = AtomicU64::new(0);

fn temp_dir() -> PathBuf {
    let d = std::env::temp_dir().join("timslite_integration");
    fs::create_dir_all(&d).unwrap();
    let id = COUNTER.fetch_add(1, Ordering::Relaxed);
    d.join(format!(
        "test_{:?}_{id}",
        std::time::SystemTime::now()
            .duration_since(std::time::UNIX_EPOCH)
            .unwrap()
            .as_nanos()
    ))
}

/// P0-I-1: Iterator cross-segment query
///
/// Write enough data to span multiple data segments.
/// Query across segment boundaries and verify all records are returned.
#[test]
fn t33_1_iterator_cross_segment() {
    use timslite::{Store, StoreConfig};

    let dir = temp_dir();
    let mut store = Store::open(&dir, StoreConfig::default()).unwrap();

    // Use small data segment size to force multiple segments
    store
        .create_dataset(
            "cross_seg",
            "data",
            256 * 1024, // 256KB data segment size
            4 * 1024 * 1024,
            6,
            0,
            0,
        )
        .unwrap();

    let ds = store.open_dataset("cross_seg", "data").unwrap();
    let arc = ds.clone();

    // Write enough data to span multiple segments
    // 256KB segment / 4KB per record = ~64 records per segment
    // Write 200 records to ensure at least 3 segments
    {
        let lock = arc.clone();
        for i in 0..200i64 {
            let data = vec![0xABu8; 4096]; // 4KB per record
            lock.write(i * 10 + 1, &data).unwrap();
        }
    }

    // Query across all segments
    {
        let lock = arc.clone();
        let entries = lock.query(1, 2001).unwrap();
        assert_eq!(entries.len(), 200, "should return all 200 records");

        // Verify ordering and data
        for (i, (ts, data)) in entries.iter().enumerate() {
            assert_eq!(*ts, i as i64 * 10 + 1);
            assert_eq!(data.len(), 4096);
            assert!(data.iter().all(|&b| b == 0xAB));
        }
    }

    // Query a range that spans segment boundary
    {
        let lock = arc.clone();
        // Query records 501..=1501 (inclusive, should span multiple segments)
        let entries = lock.query(501, 1501).unwrap();
        assert_eq!(
            entries.len(),
            101,
            "should return 101 records (inclusive range)"
        );

        for (ts, _) in &entries {
            assert!(*ts >= 501 && *ts <= 1501);
        }
    }

    store.close().unwrap();
}

/// P0-I-2: Iterator cross-block query
///
/// Write enough data to span multiple blocks within a segment.
/// Query across block boundaries.
#[test]
fn t33_2_iterator_cross_block() {
    use timslite::{Store, StoreConfig};

    let dir = temp_dir();
    let mut store = Store::open(&dir, StoreConfig::default()).unwrap();

    store
        .create_dataset(
            "cross_block",
            "data",
            64 * 1024 * 1024,
            4 * 1024 * 1024,
            6,
            0,
            0,
        )
        .unwrap();

    let ds = store.open_dataset("cross_block", "data").unwrap();
    let arc = ds.clone();

    // Write enough data to span multiple blocks
    // Block max size is 64KB, each record is 4KB
    // So ~16 records per block
    // Write 50 records to ensure at least 3 blocks
    {
        let lock = arc.clone();
        for i in 0..50i64 {
            let data = vec![0xCDu8; 4096]; // 4KB per record
            lock.write(i * 10 + 1, &data).unwrap();
        }
    }

    // Query all records
    {
        let lock = arc.clone();
        let entries = lock.query(1, 501).unwrap();
        assert_eq!(entries.len(), 50, "should return all 50 records");

        for (i, (ts, data)) in entries.iter().enumerate() {
            assert_eq!(*ts, i as i64 * 10 + 1);
            assert_eq!(data.len(), 4096);
            assert!(data.iter().all(|&b| b == 0xCD));
        }
    }

    // Query a range that spans block boundary
    {
        let lock = arc.clone();
        // Query records 101..=301 (inclusive, should span multiple blocks)
        let entries = lock.query(101, 301).unwrap();
        assert_eq!(
            entries.len(),
            21,
            "should return 21 records (inclusive range)"
        );

        for (ts, _) in &entries {
            assert!(*ts >= 101 && *ts <= 301);
        }
    }

    store.close().unwrap();
}

/// P0-I-3: Iterator with empty range
///
/// Query with start > end should return empty.
#[test]
fn t33_3_iterator_empty_range() {
    use timslite::{Store, StoreConfig};

    let dir = temp_dir();
    let mut store = Store::open(&dir, StoreConfig::default()).unwrap();

    store
        .create_dataset(
            "empty_range",
            "data",
            64 * 1024 * 1024,
            4 * 1024 * 1024,
            6,
            0,
            0,
        )
        .unwrap();

    let ds = store.open_dataset("empty_range", "data").unwrap();
    let arc = ds.clone();

    // Write some data
    {
        let lock = arc.clone();
        lock.write(100, b"data_100").unwrap();
        lock.write(200, b"data_200").unwrap();
        lock.write(300, b"data_300").unwrap();
    }

    // Query with start > end should return empty
    {
        let lock = arc.clone();
        let entries = lock.query(300, 100).unwrap();
        assert_eq!(entries.len(), 0, "start > end should return empty");
    }

    // Query with range that has no data
    {
        let lock = arc.clone();
        let entries = lock.query(500, 600).unwrap();
        assert_eq!(entries.len(), 0, "range with no data should return empty");
    }

    store.close().unwrap();
}

/// P0-I-4: Iterator with single record
///
/// Query that matches exactly one record.
#[test]
fn t33_4_iterator_single_record() {
    use timslite::{Store, StoreConfig};

    let dir = temp_dir();
    let mut store = Store::open(&dir, StoreConfig::default()).unwrap();

    store
        .create_dataset(
            "single_rec",
            "data",
            64 * 1024 * 1024,
            4 * 1024 * 1024,
            6,
            0,
            0,
        )
        .unwrap();

    let ds = store.open_dataset("single_rec", "data").unwrap();
    let arc = ds.clone();

    // Write one record
    {
        let lock = arc.clone();
        lock.write(100, b"only_record").unwrap();
    }

    // Query exact timestamp
    {
        let lock = arc.clone();
        let entries = lock.query(100, 100).unwrap();
        assert_eq!(entries.len(), 1);
        assert_eq!(entries[0].0, 100);
        assert_eq!(entries[0].1, b"only_record");
    }

    // Query range containing the record
    {
        let lock = arc.clone();
        let entries = lock.query(50, 150).unwrap();
        assert_eq!(entries.len(), 1);
        assert_eq!(entries[0].0, 100);
    }

    store.close().unwrap();
}

#[test]
fn query_iter_collect_take_stops_when_iterator_is_exhausted() {
    use timslite::{Store, StoreConfig};

    let dir = temp_dir();
    let mut store = Store::open(&dir, StoreConfig::default()).unwrap();
    store
        .create_dataset(
            "collect_take_short",
            "data",
            64 * 1024 * 1024,
            4 * 1024 * 1024,
            6,
            0,
            0,
        )
        .unwrap();

    let ds = store.open_dataset("collect_take_short", "data").unwrap();
    ds.write(1, b"one").unwrap();
    ds.write(2, b"two").unwrap();

    let records = ds.query_iter(1, 2).unwrap().collect_take(5).unwrap();
    assert_eq!(records, vec![(1, b"one".to_vec()), (2, b"two".to_vec())]);

    store.close().unwrap();
}

/// P1-I-5: Iterator with deleted records
///
/// Query should skip deleted records.
#[test]
fn t33_5_iterator_skip_deleted() {
    use timslite::{Store, StoreConfig};

    let dir = temp_dir();
    let mut store = Store::open(&dir, StoreConfig::default()).unwrap();

    store
        .create_dataset(
            "skip_deleted",
            "data",
            64 * 1024 * 1024,
            4 * 1024 * 1024,
            6,
            0,
            0,
        )
        .unwrap();

    let ds = store.open_dataset("skip_deleted", "data").unwrap();
    let arc = ds.clone();

    // Write records
    {
        let lock = arc.clone();
        lock.write(100, b"keep_100").unwrap();
        lock.write(200, b"delete_200").unwrap();
        lock.write(300, b"keep_300").unwrap();
        lock.write(400, b"delete_400").unwrap();
        lock.write(500, b"keep_500").unwrap();
    }

    // Delete some records
    {
        let lock = arc.clone();
        lock.delete(200).unwrap();
        lock.delete(400).unwrap();
    }

    // Query should skip deleted records
    {
        let lock = arc.clone();
        let entries = lock.query(100, 500).unwrap();
        assert_eq!(entries.len(), 3, "should return 3 non-deleted records");

        let timestamps: Vec<i64> = entries.iter().map(|(ts, _)| *ts).collect();
        assert_eq!(timestamps, vec![100, 300, 500]);
    }

    store.close().unwrap();
}

/// P1-I-6: Iterator with correction writes
///
/// Query should return corrected data, not original.
#[test]
fn t33_6_iterator_correction_writes() {
    use timslite::{Store, StoreConfig};

    let dir = temp_dir();
    let mut store = Store::open(&dir, StoreConfig::default()).unwrap();

    store
        .create_dataset(
            "correction",
            "data",
            64 * 1024 * 1024,
            4 * 1024 * 1024,
            6,
            0,
            0,
        )
        .unwrap();

    let ds = store.open_dataset("correction", "data").unwrap();
    let arc = ds.clone();

    // Write original data
    {
        let lock = arc.clone();
        lock.write(100, b"original_100").unwrap();
        lock.write(200, b"original_200").unwrap();
        lock.write(300, b"original_300").unwrap();
    }

    // Correction write
    {
        let lock = arc.clone();
        lock.write(200, b"corrected_200").unwrap();
    }

    // Query should return corrected data
    {
        let lock = arc.clone();
        let entries = lock.query(100, 300).unwrap();
        assert_eq!(entries.len(), 3);

        assert_eq!(entries[0].0, 100);
        assert_eq!(entries[0].1, b"original_100");

        assert_eq!(entries[1].0, 200);
        assert_eq!(entries[1].1, b"corrected_200");

        assert_eq!(entries[2].0, 300);
        assert_eq!(entries[2].1, b"original_300");
    }

    store.close().unwrap();
}

/// P1-I-7: Iterator across idle-closed segment
///
/// Write data, trigger idle-close, then query across the closed segment.
/// The query should transparently re-open the segment and return all data.
#[test]
fn t33_7_closed_segment_transparent_reopen() {
    use std::time::Duration;
    use timslite::{Store, StoreConfig};

    let dir = temp_dir();
    let config = StoreConfig::builder()
        .enable_background_thread(false)
        .idle_timeout(Duration::from_millis(50))
        .build();
    let mut store = Store::open(&dir, config).unwrap();

    store
        .create_dataset(
            "closed_seg",
            "data",
            64 * 1024 * 1024,
            4 * 1024 * 1024,
            6,
            0,
            0,
        )
        .unwrap();

    let ds = store.open_dataset("closed_seg", "data").unwrap();
    let arc = ds.clone();

    // Write records in the first batch
    {
        let lock = arc.clone();
        for i in 0..20i64 {
            lock.write(i * 10 + 1, &[0xAA; 256]).unwrap();
        }
    }

    // Drop arc to release the dataset reference before idle-close
    drop(arc);

    // Wait for idle timeout to expire, then trigger idle-close
    std::thread::sleep(Duration::from_millis(100));
    let _ = store.tick_background_tasks().unwrap();

    // Write more records (this will re-open the dataset and create new data)
    let arc = ds.clone();
    {
        let lock = arc.clone();
        for i in 20..40i64 {
            lock.write(i * 10 + 1, &[0xBB; 256]).unwrap();
        }
    }

    // Query across the entire range including the closed segment data
    {
        let lock = arc.clone();
        let entries = lock.query(1, 391).unwrap();
        assert_eq!(
            entries.len(),
            40,
            "should return all 40 records after idle-close reopen"
        );

        // Verify first batch (from closed segment)
        for (i, (ts, data)) in entries.iter().enumerate().take(20) {
            assert_eq!(*ts, i as i64 * 10 + 1);
            assert!(data.iter().all(|&b| b == 0xAA));
        }

        // Verify second batch (from new data)
        for (i, (ts, data)) in entries.iter().enumerate().take(40).skip(20) {
            assert_eq!(*ts, i as i64 * 10 + 1);
            assert!(data.iter().all(|&b| b == 0xBB));
        }
    }

    store.close().unwrap();
}

/// P1-I-8: Iterator with in-memory pending block data
///
/// Write data without flushing, then query immediately.
/// The query should include data from the in-memory pending block.
#[test]
fn t33_8_in_memory_pending_block_query() {
    use timslite::{Store, StoreConfig};

    let dir = temp_dir();
    let mut store = Store::open(&dir, StoreConfig::default()).unwrap();

    store
        .create_dataset(
            "pending_q",
            "data",
            64 * 1024 * 1024,
            4 * 1024 * 1024,
            6,
            0,
            0,
        )
        .unwrap();

    let ds = store.open_dataset("pending_q", "data").unwrap();
    let arc = ds.clone();

    // Write some data and flush it to disk
    {
        let lock = arc.clone();
        for i in 0..10i64 {
            lock.write(i * 10 + 1, &[0xCC; 128]).unwrap();
        }
        lock.flush().unwrap();
    }

    // Write more data WITHOUT flushing (stays in pending block)
    {
        let lock = arc.clone();
        for i in 10..20i64 {
            lock.write(i * 10 + 1, &[0xDD; 128]).unwrap();
        }
        // Intentionally NOT flushing
    }

    // Query should include both flushed and unflushed data
    {
        let lock = arc.clone();
        let entries = lock.query(1, 191).unwrap();
        assert_eq!(
            entries.len(),
            20,
            "query should include both flushed and pending data"
        );

        // Verify flushed records
        for (i, (ts, data)) in entries.iter().enumerate().take(10) {
            assert_eq!(*ts, i as i64 * 10 + 1);
            assert!(data.iter().all(|&b| b == 0xCC));
        }

        // Verify pending (unflushed) records
        for (i, (ts, data)) in entries.iter().enumerate().take(20).skip(10) {
            assert_eq!(*ts, i as i64 * 10 + 1);
            assert!(data.iter().all(|&b| b == 0xDD));
        }
    }

    // Query a range that only covers pending data
    {
        let lock = arc.clone();
        let entries = lock.query(101, 191).unwrap();
        assert_eq!(
            entries.len(),
            10,
            "query on pending-only range should return 10 records"
        );
        for (ts, data) in &entries {
            assert!(*ts >= 101 && *ts <= 191);
            assert!(data.iter().all(|&b| b == 0xDD));
        }
    }

    store.close().unwrap();
}

/// P1-I-9: Iterator after data modification
///
/// Query initial data, write more records, then query again.
/// The second query should include the newly written data.
#[test]
fn t33_9_query_after_data_modification() {
    use timslite::{Store, StoreConfig};

    let dir = temp_dir();
    let mut store = Store::open(&dir, StoreConfig::default()).unwrap();

    store
        .create_dataset(
            "mod_iter",
            "data",
            64 * 1024 * 1024,
            4 * 1024 * 1024,
            6,
            0,
            0,
        )
        .unwrap();

    let ds = store.open_dataset("mod_iter", "data").unwrap();
    let arc = ds.clone();

    // Write initial batch
    {
        let lock = arc.clone();
        for i in 0..10i64 {
            lock.write(i * 10 + 1, &[0x11; 64]).unwrap();
        }
    }

    // First query: should return 10 records
    {
        let lock = arc.clone();
        let entries = lock.query(1, 91).unwrap();
        assert_eq!(entries.len(), 10, "initial query should return 10 records");

        for (i, (ts, data)) in entries.iter().enumerate() {
            assert_eq!(*ts, i as i64 * 10 + 1);
            assert!(data.iter().all(|&b| b == 0x11));
        }
    }

    // Write a second batch with higher timestamps
    {
        let lock = arc.clone();
        for i in 10..20i64 {
            lock.write(i * 10 + 1, &[0x22; 64]).unwrap();
        }
    }

    // Second query over the full range: should return all 20 records
    {
        let lock = arc.clone();
        let entries = lock.query(1, 191).unwrap();
        assert_eq!(
            entries.len(),
            20,
            "second query should return all 20 records"
        );

        // Verify first batch
        for (i, (ts, data)) in entries.iter().enumerate().take(10) {
            assert_eq!(*ts, i as i64 * 10 + 1);
            assert!(data.iter().all(|&b| b == 0x11));
        }

        // Verify second batch
        for (i, (ts, data)) in entries.iter().enumerate().take(20).skip(10) {
            assert_eq!(*ts, i as i64 * 10 + 1);
            assert!(data.iter().all(|&b| b == 0x22));
        }
    }

    // Third query: only the new range should return 10 records
    {
        let lock = arc.clone();
        let entries = lock.query(101, 191).unwrap();
        assert_eq!(
            entries.len(),
            10,
            "query on new range should return 10 records"
        );
        for (ts, data) in &entries {
            assert!(*ts >= 101 && *ts <= 191);
            assert!(data.iter().all(|&b| b == 0x22));
        }
    }

    store.close().unwrap();
}

#[test]
fn public_query_iter_reads_current_index_entry_after_correction() {
    use timslite::{Store, StoreConfig};

    let dir = temp_dir();
    let config = StoreConfig::builder().enable_journal(false).build();
    let mut store = Store::open(&dir, config).unwrap();
    store
        .create_dataset("ds", "type", 64 * 1024 * 1024, 4 * 1024 * 1024, 6, 0, 0)
        .unwrap();
    let ds = store.open_dataset("ds", "type").unwrap();

    ds.write(1, b"one").unwrap();
    ds.write(2, b"old").unwrap();
    ds.write(3, b"three").unwrap();

    let mut iter = ds.query_iter(1, 3).unwrap();
    assert_eq!(iter.next().unwrap().unwrap(), (1, b"one".to_vec()));

    ds.write(2, b"corrected").unwrap();

    assert_eq!(iter.next().unwrap().unwrap(), (2, b"corrected".to_vec()));
    assert_eq!(iter.next().unwrap().unwrap(), (3, b"three".to_vec()));
    assert!(iter.next().is_none());

    store.close().unwrap();
}

#[test]
fn public_query_iter_skips_entry_deleted_after_iterator_creation() {
    use timslite::{Store, StoreConfig};

    let dir = temp_dir();
    let config = StoreConfig::builder().enable_journal(false).build();
    let mut store = Store::open(&dir, config).unwrap();
    store
        .create_dataset("ds", "type", 64 * 1024 * 1024, 4 * 1024 * 1024, 6, 0, 0)
        .unwrap();
    let ds = store.open_dataset("ds", "type").unwrap();

    ds.write(1, b"one").unwrap();
    ds.write(2, b"two").unwrap();
    ds.write(3, b"three").unwrap();

    let mut iter = ds.query_iter(1, 3).unwrap();
    assert_eq!(iter.next().unwrap().unwrap(), (1, b"one".to_vec()));

    ds.delete(2).unwrap();

    assert_eq!(iter.next().unwrap().unwrap(), (3, b"three".to_vec()));
    assert!(iter.next().is_none());

    store.close().unwrap();
}

#[test]
fn public_query_iter_reverse_skip_and_collect_take_chain() {
    use timslite::{Store, StoreConfig};

    let dir = temp_dir();
    let config = StoreConfig::builder().enable_journal(false).build();
    let mut store = Store::open(&dir, config).unwrap();
    store
        .create_dataset("ds", "type", 64 * 1024 * 1024, 4 * 1024 * 1024, 6, 1, 0)
        .unwrap();
    let ds = store.open_dataset("ds", "type").unwrap();

    ds.write(10, b"ten").unwrap();
    ds.write(20, b"twenty").unwrap();
    ds.write(30, b"thirty").unwrap();
    ds.write(40, b"forty").unwrap();
    ds.write(50, b"fifty").unwrap();
    ds.delete(40).unwrap();

    let rows = ds
        .query_iter(10, 50)
        .unwrap()
        .reverse()
        .skip(1)
        .collect_take(2)
        .unwrap();

    assert_eq!(
        rows,
        vec![(30, b"thirty".to_vec()), (20, b"twenty".to_vec()),]
    );

    store.close().unwrap();
}

#[test]
fn public_query_iter_skip_then_reverse_keeps_skip_on_low_side() {
    use timslite::{Store, StoreConfig};

    let dir = temp_dir();
    let config = StoreConfig::builder().enable_journal(false).build();
    let mut store = Store::open(&dir, config).unwrap();
    store
        .create_dataset("ds", "type", 64 * 1024 * 1024, 4 * 1024 * 1024, 6, 1, 0)
        .unwrap();
    let ds = store.open_dataset("ds", "type").unwrap();

    ds.write(10, b"ten").unwrap();
    ds.write(20, b"twenty").unwrap();
    ds.write(30, b"thirty").unwrap();
    ds.write(40, b"forty").unwrap();

    let rows = ds
        .query_iter(10, 40)
        .unwrap()
        .skip(1)
        .reverse()
        .collect_all()
        .unwrap();

    assert_eq!(
        rows,
        vec![
            (40, b"forty".to_vec()),
            (30, b"thirty".to_vec()),
            (20, b"twenty".to_vec()),
        ]
    );

    store.close().unwrap();
}

#[test]
fn public_query_iter_standard_skip_after_adapter_still_works() {
    use timslite::{Store, StoreConfig};

    let dir = temp_dir();
    let config = StoreConfig::builder().enable_journal(false).build();
    let mut store = Store::open(&dir, config).unwrap();
    store
        .create_dataset("ds", "type", 64 * 1024 * 1024, 4 * 1024 * 1024, 6, 0, 0)
        .unwrap();
    let ds = store.open_dataset("ds", "type").unwrap();

    ds.write(10, b"ten").unwrap();
    ds.write(20, b"twenty").unwrap();
    ds.write(30, b"thirty").unwrap();

    let timestamps = ds
        .query_iter(10, 30)
        .unwrap()
        .map(|row| row.map(|(timestamp, _)| timestamp))
        .skip(1)
        .collect::<Result<Vec<_>, _>>()
        .unwrap();

    assert_eq!(timestamps, vec![20, 30]);

    store.close().unwrap();
}