ekv 1.0.0

Key-value database for embedded systems, for raw NOR flash, using an LSM-Tree
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
use core::cmp::Ordering;
use core::ops::Bound;

use embassy_sync::blocking_mutex::raw::RawMutex;
use heapless::Vec;

use crate::config::{FILE_COUNT, MAX_KEY_SIZE, RECORD_HEADER_SIZE};
use crate::errors::{no_eof, CursorError, Error};
use crate::file::{DehydratedFileReader, FileID, FileSearcher, SeekDirection};
use crate::flash::Flash;
use crate::page::ReadError as PageReadError;
use crate::record::{Inner, RecordHeader};
use crate::Database;

/// Cursor for a range read.
///
/// Returned by [`ReadTransaction::read_all()`](crate::ReadTransaction::read_all) and [`ReadTransaction::read_range()`](crate::ReadTransaction::read_range).
pub struct Cursor<'a, F: Flash + 'a, M: RawMutex + 'a> {
    db: &'a Database<F, M>,
    upper_bound: Bound<&'a [u8]>,
    readers: [Option<DehydratedFileReader>; FILE_COUNT],
}

impl<'a, F: Flash + 'a, M: RawMutex + 'a> Cursor<'a, F, M> {
    pub(crate) async fn new(
        db: &'a Database<F, M>,
        lower_bound: Bound<&[u8]>,
        upper_bound: Bound<&'a [u8]>,
    ) -> Result<Self, Error<F::Error>> {
        let inner = &mut *db.inner.lock().await;
        inner.files.remount_if_dirty(&mut inner.readers[0]).await?;

        // Open and seek each file to the first key matching lower_bound.
        let mut readers: Vec<Option<DehydratedFileReader>, FILE_COUNT> = Vec::new();
        for i in 0..FILE_COUNT {
            let file_id = i as FileID;
            let r = match lower_bound {
                Bound::Excluded(k) | Bound::Included(k) => {
                    let included = matches!(lower_bound, Bound::Included(_));
                    inner.search_lower_bound_file(file_id, k, included).await?
                }
                Bound::Unbounded => Some(inner.files.read(&mut inner.readers[0], file_id).dehydrate()),
            };
            let _ = readers.push(r);
        }
        let Ok(readers) = readers.into_array() else {
            unreachable!()
        };

        Ok(Self {
            db,
            upper_bound,
            readers,
        })
    }

    /// Get the next key/value entry.
    ///
    /// If the cursor has not reached the end, the next entry in lexicographically ascending order is read into the start of the `key` and `value` buffers.
    /// The respective lengths are returned: `Ok(Some((key_len, value_len)))`.
    ///
    /// If the cursor has reached the end of the iteration, `Ok(None)` is returned.
    pub async fn next(
        &mut self,
        key: &mut [u8],
        value: &mut [u8],
    ) -> Result<Option<(usize, usize)>, CursorError<F::Error>> {
        let inner = &mut *self.db.inner.lock().await;
        let m = &mut inner.files;

        let mut key_buf = [0u8; MAX_KEY_SIZE];
        let mut header = [0; RECORD_HEADER_SIZE];

        // loop to retry if found record is deleted.
        loop {
            let mut is_lowest = [false; FILE_COUNT];
            let mut lowest_key: Vec<u8, MAX_KEY_SIZE> = Vec::new();
            let mut found = false;

            for i in 0..FILE_COUNT {
                if let Some(r) = &self.readers[i] {
                    let mut r = m.read_rehydrated(&mut inner.readers[0], r).await?;

                    // read header
                    match r.read(m, &mut header).await {
                        Ok(()) => {}
                        Err(PageReadError::Eof) => {
                            // reached EOF, remove this file.
                            self.readers[i] = None;
                            continue;
                        }
                        Err(e) => return Err(no_eof(e).into()),
                    };
                    let header = RecordHeader::decode(header)?;

                    // Read key
                    let got_key = &mut key_buf[..header.key_len];
                    r.read(m, got_key).await.map_err(no_eof)?;

                    let finished = match self.upper_bound {
                        Bound::Included(key) => key < got_key,
                        Bound::Excluded(key) => key <= got_key,
                        Bound::Unbounded => false,
                    };
                    if finished {
                        // reached the upper bound, remove this file.
                        self.readers[i] = None;
                        continue;
                    }

                    let ordering = match found {
                        false => Ordering::Less,
                        true => got_key[..].cmp(&lowest_key[..]),
                    };
                    found = true;
                    match ordering {
                        Ordering::Less => {
                            lowest_key = unwrap!(Vec::from_slice(got_key));
                            is_lowest.fill(false);
                            is_lowest[i] = true;
                        }
                        Ordering::Equal => {
                            is_lowest[i] = true;
                        }
                        Ordering::Greater => {}
                    }
                }
            }

            if !found {
                return Ok(None);
            }

            // Advance all files matching the lowest key.
            // read the value from the highest file id (newer file).
            // if key is deleted, do another loop.
            let mut is_highest_file = true;
            let mut result = None;
            for i in (0..FILE_COUNT).rev() {
                if !is_lowest[i] {
                    continue;
                }
                let r = self.readers[i].as_ref().unwrap();
                let mut r = m.read_rehydrated(&mut inner.readers[0], r).await?;

                // read header
                match r.read(m, &mut header).await {
                    Ok(()) => {}
                    Err(PageReadError::Eof) => {
                        // reached EOF, remove this file.
                        self.readers[i] = None;
                        continue;
                    }
                    Err(e) => return Err(no_eof(e).into()),
                };
                let header = RecordHeader::decode(header)?;

                // Skip key
                r.skip(m, header.key_len).await.map_err(no_eof)?;

                if is_highest_file && !header.is_delete {
                    // read value
                    if header.key_len > key.len() {
                        return Err(CursorError::KeyBufferTooSmall);
                    }
                    if header.value_len > value.len() {
                        return Err(CursorError::ValueBufferTooSmall);
                    }
                    key[..header.key_len].copy_from_slice(&lowest_key);
                    r.read(m, &mut value[..header.value_len]).await.map_err(no_eof)?;
                    result = Some((header.key_len, header.value_len))
                } else {
                    // skip value
                    r.skip(m, header.value_len).await.map_err(no_eof)?;
                }

                self.readers[i] = Some(r.dehydrate());
                is_highest_file = false;
            }

            // if key was not deleted, return it.
            if result.is_some() {
                return Ok(result);
            }
        }
    }
}

impl<F: Flash> Inner<F> {
    async fn search_lower_bound_file(
        &mut self,
        file_id: FileID,
        bound_key: &[u8],
        bound_included: bool,
    ) -> Result<Option<DehydratedFileReader>, Error<F::Error>> {
        let r = self.files.read(&mut self.readers[0], file_id);
        let m = &mut self.files;
        let mut s = FileSearcher::new(r);

        let mut key_buf = [0u8; MAX_KEY_SIZE];
        let mut header = [0; RECORD_HEADER_SIZE];

        // Binary search
        let mut ok = s.start(m).await?;
        while ok {
            let dehydrated = s.reader().dehydrate();

            match s.reader().read(m, &mut header).await {
                Ok(()) => {}
                Err(PageReadError::Eof) => return Ok(None), // not found
                Err(e) => return Err(no_eof(e)),
            };
            let header = RecordHeader::decode(header)?;

            // Read key
            let got_key = &mut key_buf[..header.key_len];
            s.reader().read(m, got_key).await.map_err(no_eof)?;

            // Found?
            let dir = match got_key[..].cmp(bound_key) {
                Ordering::Equal => {
                    // if equal is allowed, return it.
                    if bound_included {
                        return Ok(Some(dehydrated));
                    }
                    // otherwise return the next key.
                    s.reader().skip(m, header.value_len).await.map_err(no_eof)?;
                    return Ok(Some(s.reader().dehydrate()));
                }
                Ordering::Less => SeekDirection::Right,
                Ordering::Greater => SeekDirection::Left,
            };

            // Not found, do a binary search step.
            ok = s.seek(m, dir).await?;
        }

        let r = s.reader();

        // Linear search
        loop {
            let dehydrated = r.dehydrate();

            match r.read(m, &mut header).await {
                Ok(()) => {}
                Err(PageReadError::Eof) => return Ok(None), // not found
                Err(e) => return Err(no_eof(e)),
            };
            let header = RecordHeader::decode(header)?;

            // Read key
            let got_key = &mut key_buf[..header.key_len];
            r.read(m, got_key).await.map_err(no_eof)?;

            // Found?
            match got_key[..].cmp(bound_key) {
                Ordering::Equal => {
                    // if equal is allowed, return it.
                    if bound_included {
                        return Ok(Some(dehydrated));
                    }
                    // otherwise return the next key.
                    s.reader().skip(m, header.value_len).await.map_err(no_eof)?;
                    return Ok(Some(s.reader().dehydrate()));
                }
                Ordering::Less => {}                              // keep going
                Ordering::Greater => return Ok(Some(dehydrated)), // done
            }

            r.skip(m, header.value_len).await.map_err(no_eof)?;
        }
    }
}

#[cfg(test)]
mod tests {
    use std::ops::Bound;
    use std::ops::Bound::*;

    use embassy_sync::blocking_mutex::raw::NoopRawMutex;

    use super::*;
    use crate::config::MAX_VALUE_SIZE;
    use crate::flash::MemFlash;
    use crate::Config;

    async fn check_cursor(mut cursor: Cursor<'_, impl Flash, NoopRawMutex>, entries: &[(&[u8], &[u8])]) {
        let mut kbuf = [0; MAX_KEY_SIZE];
        let mut vbuf = [0; MAX_VALUE_SIZE];

        let mut got = std::vec::Vec::new();
        while let Some((klen, vlen)) = cursor.next(&mut kbuf, &mut vbuf).await.unwrap() {
            got.push((kbuf[..klen].to_vec(), vbuf[..vlen].to_vec()));
        }

        let ok = entries.iter().copied().eq(got.iter().map(|(k, v)| (&k[..], &v[..])));
        if !ok {
            eprintln!("expected:");
            for (k, v) in entries {
                eprintln!("  '{}': '{}'", String::from_utf8_lossy(k), String::from_utf8_lossy(v))
            }
            eprintln!("got:");
            for (k, v) in &got {
                eprintln!("  '{}': '{}'", String::from_utf8_lossy(k), String::from_utf8_lossy(v))
            }
            panic!("check_cursor failed")
        }
    }

    async fn check_read_all(db: &Database<impl Flash, NoopRawMutex>, entries: &[(&[u8], &[u8])]) {
        let rtx = db.read_transaction().await;
        let cursor = rtx.read_all().await.unwrap();
        check_cursor(cursor, entries).await
    }

    async fn check_read_range(
        db: &Database<impl Flash, NoopRawMutex>,
        lower: Bound<&[u8]>,
        upper: Bound<&[u8]>,
        entries: &[(&[u8], &[u8])],
    ) {
        let rtx = db.read_transaction().await;
        let cursor = rtx.read_range((lower, upper)).await.unwrap();
        check_cursor(cursor, entries).await
    }

    #[test_log::test(tokio::test)]
    async fn test_empty() {
        let mut f = MemFlash::new();
        let db = Database::new(&mut f, Config::default());
        db.format().await.unwrap();

        let rows: &[(&[u8], &[u8])] = &[];
        check_read_all(&db, rows).await;
    }

    #[test_log::test(tokio::test)]
    async fn test() {
        let mut f = MemFlash::new();
        let db = Database::new(&mut f, Config::default());
        db.format().await.unwrap();

        let mut wtx = db.write_transaction().await;
        wtx.write(b"bar", b"4321").await.unwrap();
        wtx.write(b"foo", b"1234").await.unwrap();
        wtx.commit().await.unwrap();

        let mut wtx = db.write_transaction().await;
        wtx.write(b"bar", b"8765").await.unwrap();
        wtx.write(b"baz", b"4242").await.unwrap();
        wtx.write(b"foo", b"5678").await.unwrap();
        wtx.commit().await.unwrap();

        let mut wtx = db.write_transaction().await;
        wtx.write(b"lol", b"9999").await.unwrap();
        wtx.commit().await.unwrap();

        let rows: &[(&[u8], &[u8])] = &[
            (b"bar", b"8765"),
            (b"baz", b"4242"),
            (b"foo", b"5678"),
            (b"lol", b"9999"),
        ];
        check_read_all(&db, rows).await;
    }

    #[test_log::test(tokio::test)]
    async fn test_delete() {
        let mut f = MemFlash::new();
        let db = Database::new(&mut f, Config::default());
        db.format().await.unwrap();

        let mut wtx = db.write_transaction().await;
        wtx.write(b"bar", b"4321").await.unwrap();
        wtx.write(b"foo", b"1234").await.unwrap();
        wtx.commit().await.unwrap();

        let mut wtx = db.write_transaction().await;
        wtx.delete(b"bar").await.unwrap();
        wtx.commit().await.unwrap();

        let rows: &[(&[u8], &[u8])] = &[(b"foo", b"1234")];
        check_read_all(&db, rows).await;
    }

    #[test_log::test(tokio::test)]
    async fn test_delete_empty() {
        let mut f = MemFlash::new();
        let db = Database::new(&mut f, Config::default());
        db.format().await.unwrap();

        let mut wtx = db.write_transaction().await;
        wtx.write(b"bar", b"4321").await.unwrap();
        wtx.write(b"foo", b"1234").await.unwrap();
        wtx.commit().await.unwrap();

        let mut wtx = db.write_transaction().await;
        wtx.delete(b"bar").await.unwrap();
        wtx.commit().await.unwrap();

        let mut wtx = db.write_transaction().await;
        wtx.delete(b"foo").await.unwrap();
        wtx.commit().await.unwrap();

        let rows: &[(&[u8], &[u8])] = &[];
        check_read_all(&db, rows).await;
    }

    #[test_log::test(tokio::test)]
    async fn test_range() {
        let mut f = MemFlash::new();
        let db = Database::new(&mut f, Config::default());
        db.format().await.unwrap();

        let mut wtx = db.write_transaction().await;
        wtx.write(b"aa", b"a").await.unwrap();
        wtx.write(b"bb", b"b").await.unwrap();
        wtx.write(b"cc", b"c").await.unwrap();
        wtx.write(b"dd", b"d").await.unwrap();
        wtx.write(b"ee", b"e").await.unwrap();
        wtx.write(b"ff", b"f").await.unwrap();
        wtx.commit().await.unwrap();

        let rows: &[(&[u8], &[u8])] = &[
            (b"aa", b"a"),
            (b"bb", b"b"),
            (b"cc", b"c"),
            (b"dd", b"d"),
            (b"ee", b"e"),
            (b"ff", b"f"),
        ];
        check_read_range(&db, Unbounded, Unbounded, rows).await;
        check_read_range(&db, Unbounded, Included(b"ff"), rows).await;
        check_read_range(&db, Unbounded, Included(b"zz"), rows).await;
        check_read_range(&db, Unbounded, Excluded(b"zz"), rows).await;

        check_read_range(&db, Included(b"aa"), Unbounded, rows).await;
        check_read_range(&db, Included(b"aa"), Included(b"ff"), rows).await;
        check_read_range(&db, Included(b"aa"), Included(b"zz"), rows).await;
        check_read_range(&db, Included(b"aa"), Excluded(b"zz"), rows).await;

        check_read_range(&db, Included(b"0"), Unbounded, rows).await;
        check_read_range(&db, Included(b"0"), Included(b"ff"), rows).await;
        check_read_range(&db, Included(b"0"), Included(b"zz"), rows).await;
        check_read_range(&db, Included(b"0"), Excluded(b"zz"), rows).await;

        check_read_range(&db, Excluded(b"0"), Unbounded, rows).await;
        check_read_range(&db, Excluded(b"0"), Included(b"ff"), rows).await;
        check_read_range(&db, Excluded(b"0"), Included(b"zz"), rows).await;
        check_read_range(&db, Excluded(b"0"), Excluded(b"zz"), rows).await;

        // match a few keys.
        let rows: &[(&[u8], &[u8])] = &[(b"cc", b"c"), (b"dd", b"d"), (b"ee", b"e")];
        check_read_range(&db, Included(b"cc"), Included(b"ee"), rows).await;
        check_read_range(&db, Included(b"c0"), Included(b"ee"), rows).await;
        check_read_range(&db, Excluded(b"c0"), Included(b"ee"), rows).await;
        check_read_range(&db, Excluded(b"bb"), Included(b"ee"), rows).await;

        check_read_range(&db, Included(b"cc"), Included(b"ef"), rows).await;
        check_read_range(&db, Included(b"c0"), Included(b"ef"), rows).await;
        check_read_range(&db, Excluded(b"c0"), Included(b"ef"), rows).await;
        check_read_range(&db, Excluded(b"bb"), Included(b"ef"), rows).await;

        check_read_range(&db, Included(b"cc"), Excluded(b"ef"), rows).await;
        check_read_range(&db, Included(b"c0"), Excluded(b"ef"), rows).await;
        check_read_range(&db, Excluded(b"c0"), Excluded(b"ef"), rows).await;
        check_read_range(&db, Excluded(b"bb"), Excluded(b"ef"), rows).await;

        check_read_range(&db, Included(b"cc"), Excluded(b"ff"), rows).await;
        check_read_range(&db, Included(b"c0"), Excluded(b"ff"), rows).await;
        check_read_range(&db, Excluded(b"c0"), Excluded(b"ff"), rows).await;
        check_read_range(&db, Excluded(b"bb"), Excluded(b"ff"), rows).await;

        // empty to the left
        check_read_range(&db, Unbounded, Included(b"0"), &[]).await;
        check_read_range(&db, Unbounded, Excluded(b"0"), &[]).await;
        check_read_range(&db, Unbounded, Excluded(b"aa"), &[]).await;

        // empty to the right
        check_read_range(&db, Included(b"z"), Unbounded, &[]).await;
        check_read_range(&db, Excluded(b"z"), Unbounded, &[]).await;
        check_read_range(&db, Excluded(b"ff"), Unbounded, &[]).await;

        // empty in the middle
        check_read_range(&db, Excluded(b"aa"), Excluded(b"bb"), &[]).await;
        check_read_range(&db, Included(b"ax"), Excluded(b"bb"), &[]).await;
        check_read_range(&db, Excluded(b"aa"), Included(b"ba"), &[]).await;
        check_read_range(&db, Included(b"ax"), Included(b"ba"), &[]).await;
    }

    #[test_log::test(tokio::test)]
    async fn test_range_mulifile() {
        let mut f = MemFlash::new();
        let db = Database::new(&mut f, Config::default());
        db.format().await.unwrap();

        // write the thing in multiple transactions, so the keys are spread across files.
        let mut wtx = db.write_transaction().await;
        wtx.write(b"aa", b"a").await.unwrap();
        wtx.write(b"bb", b"b").await.unwrap();
        wtx.write(b"bbbad", b"bad").await.unwrap();
        wtx.write(b"cc", b"wrong").await.unwrap();
        wtx.write(b"dd", b"wrong").await.unwrap();
        wtx.write(b"ff", b"f").await.unwrap();
        wtx.write(b"ffbad", b"bad").await.unwrap();
        wtx.write(b"zzbad", b"bad").await.unwrap();
        wtx.commit().await.unwrap();

        let mut wtx = db.write_transaction().await;
        wtx.write(b"aa", b"a").await.unwrap();
        wtx.write(b"bb", b"b").await.unwrap();
        wtx.delete(b"bbbad").await.unwrap();
        wtx.write(b"cc", b"c").await.unwrap();
        wtx.write(b"dd", b"d").await.unwrap();
        wtx.write(b"ee", b"e").await.unwrap();
        wtx.delete(b"ffbad").await.unwrap();
        wtx.delete(b"zzbad").await.unwrap();
        wtx.delete(b"zzzzznotexisting").await.unwrap();
        wtx.commit().await.unwrap();

        let rows: &[(&[u8], &[u8])] = &[
            (b"aa", b"a"),
            (b"bb", b"b"),
            (b"cc", b"c"),
            (b"dd", b"d"),
            (b"ee", b"e"),
            (b"ff", b"f"),
        ];
        check_read_range(&db, Unbounded, Unbounded, rows).await;
        check_read_range(&db, Unbounded, Included(b"ff"), rows).await;
        check_read_range(&db, Unbounded, Included(b"zz"), rows).await;
        check_read_range(&db, Unbounded, Excluded(b"zz"), rows).await;

        check_read_range(&db, Included(b"aa"), Unbounded, rows).await;
        check_read_range(&db, Included(b"aa"), Included(b"ff"), rows).await;
        check_read_range(&db, Included(b"aa"), Included(b"zz"), rows).await;
        check_read_range(&db, Included(b"aa"), Excluded(b"zz"), rows).await;

        check_read_range(&db, Included(b"0"), Unbounded, rows).await;
        check_read_range(&db, Included(b"0"), Included(b"ff"), rows).await;
        check_read_range(&db, Included(b"0"), Included(b"zz"), rows).await;
        check_read_range(&db, Included(b"0"), Excluded(b"zz"), rows).await;

        check_read_range(&db, Excluded(b"0"), Unbounded, rows).await;
        check_read_range(&db, Excluded(b"0"), Included(b"ff"), rows).await;
        check_read_range(&db, Excluded(b"0"), Included(b"zz"), rows).await;
        check_read_range(&db, Excluded(b"0"), Excluded(b"zz"), rows).await;

        // match a few keys.
        let rows: &[(&[u8], &[u8])] = &[(b"cc", b"c"), (b"dd", b"d"), (b"ee", b"e")];
        check_read_range(&db, Included(b"cc"), Included(b"ee"), rows).await;
        check_read_range(&db, Included(b"c0"), Included(b"ee"), rows).await;
        check_read_range(&db, Excluded(b"c0"), Included(b"ee"), rows).await;
        check_read_range(&db, Excluded(b"bb"), Included(b"ee"), rows).await;

        check_read_range(&db, Included(b"cc"), Included(b"ef"), rows).await;
        check_read_range(&db, Included(b"c0"), Included(b"ef"), rows).await;
        check_read_range(&db, Excluded(b"c0"), Included(b"ef"), rows).await;
        check_read_range(&db, Excluded(b"bb"), Included(b"ef"), rows).await;

        check_read_range(&db, Included(b"cc"), Excluded(b"ef"), rows).await;
        check_read_range(&db, Included(b"c0"), Excluded(b"ef"), rows).await;
        check_read_range(&db, Excluded(b"c0"), Excluded(b"ef"), rows).await;
        check_read_range(&db, Excluded(b"bb"), Excluded(b"ef"), rows).await;

        check_read_range(&db, Included(b"cc"), Excluded(b"ff"), rows).await;
        check_read_range(&db, Included(b"c0"), Excluded(b"ff"), rows).await;
        check_read_range(&db, Excluded(b"c0"), Excluded(b"ff"), rows).await;
        check_read_range(&db, Excluded(b"bb"), Excluded(b"ff"), rows).await;

        // empty to the left
        check_read_range(&db, Unbounded, Included(b"0"), &[]).await;
        check_read_range(&db, Unbounded, Excluded(b"0"), &[]).await;
        check_read_range(&db, Unbounded, Excluded(b"aa"), &[]).await;

        // empty to the right
        check_read_range(&db, Included(b"z"), Unbounded, &[]).await;
        check_read_range(&db, Excluded(b"z"), Unbounded, &[]).await;
        check_read_range(&db, Excluded(b"ff"), Unbounded, &[]).await;

        // empty in the middle
        check_read_range(&db, Excluded(b"aa"), Excluded(b"bb"), &[]).await;
        check_read_range(&db, Included(b"ax"), Excluded(b"bb"), &[]).await;
        check_read_range(&db, Excluded(b"aa"), Included(b"ba"), &[]).await;
        check_read_range(&db, Included(b"ax"), Included(b"ba"), &[]).await;
    }
}