anvil_db 0.2.2

an embedded key-value store
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
use std::collections::HashMap;
use std::error::Error;
use std::fmt::{Debug, Display, Formatter, Result as FmtResult};
use std::iter::zip;
use std::sync::mpsc::{Receiver, Sender};
use std::thread::sleep;
use std::time::Duration;

use crate::context::Context;
use crate::kv::{
    JoinedIter, MergedHomogenousIter, TombstonePair, TombstonePairLike, TryTombstoneScanner,
};
use crate::logging::{error, info};
use crate::mem_table::MemTableCompactorIterator;
use crate::sst::common::SstError;
use crate::sst::reader::{SstReader, SstScanner};
use crate::sst::writer::{NameGenerator, SstWriteSettings, SstWriter};
use crate::storage::blob_store::{BlobStore, BlobStoreError};
use crate::tablet::{CompactOrder, TabletSstStore, TaskCategory};

#[derive(Debug)]
pub(crate) enum CompactorError {
    // list of blob ids that could not be read
    FailedToObtainReader(Vec<String>),
    NothingToCompact,
    // an underlying error occurred with the blob store
    BlobStoreError(BlobStoreError),
    SstError(SstError),
    DeletionError,
}

impl Display for CompactorError {
    fn fmt(&self, f: &mut Formatter) -> FmtResult {
        match self {
            CompactorError::FailedToObtainReader(blob_ids) => {
                write!(f, "failed to obtain reader for blobs: {blob_ids:?}",)
            }
            CompactorError::NothingToCompact => {
                write!(f, "nothing to compact")
            }
            CompactorError::BlobStoreError(err) => {
                write!(f, "blob store error: {err}",)
            }
            CompactorError::SstError(err) => {
                write!(f, "sst error: {err}",)
            }
            CompactorError::DeletionError => {
                write!(f, "deletion error")
            }
        }
    }
}

impl Error for CompactorError {}

impl From<BlobStoreError> for CompactorError {
    fn from(err: BlobStoreError) -> Self {
        CompactorError::BlobStoreError(err)
    }
}

impl From<SstError> for CompactorError {
    fn from(err: SstError) -> Self {
        match err {
            SstError::EmptySst(_) => CompactorError::NothingToCompact,
            _ => CompactorError::SstError(err),
        }
    }
}

impl From<CompactorError> for String {
    fn from(err: CompactorError) -> Self {
        format!("CompactorError: {err:?}",)
    }
}

#[derive(Debug)]
pub(crate) enum CompactorMessage {
    /// The compactor should stop.
    Shutdown,
    /// Run a minor compaction.
    MinorCompact {
        iter: MemTableCompactorIterator,
        done_tx: Sender<Result<String, CompactorError>>,
    },
    // Run a major compaction.
    MajorCompaction {
        done_tx: Sender<Result<(), CompactorError>>,
    },
    // Deletes a set of blobs.
    GarbageCollect {
        blob_ids: Vec<String>,
        done_tx: Option<Sender<Result<(), CompactorError>>>,
    },
    // Garbage collects a single blob.
    DeleteBlob(String),
}

// NOTE: The fields in this struct are only read by the debug struct, which is
// not counted in dead code analysis.
#[derive(Debug)]
struct DebugOrder {
    #[allow(dead_code)]
    order_type: String,
    #[allow(dead_code)]
    minor_ssts: Option<Vec<String>>,
    #[allow(dead_code)]
    levels: Option<HashMap<usize, Vec<String>>>,
}

pub(crate) struct CompactorSettings {
    target_block_size: usize,
    target_keys_per_block: usize,
}

impl Default for CompactorSettings {
    fn default() -> Self {
        let target_block_size = 128 * 1024 * 1024;
        let target_keys_per_block = target_block_size / 32;
        Self {
            target_block_size,
            target_keys_per_block,
        }
    }
}

impl CompactorSettings {
    pub(crate) fn with_target_block_size(mut self, target_block_size: usize) -> Self {
        self.target_block_size = target_block_size;
        self.target_keys_per_block = target_block_size / 32;
        self
    }

    fn apply(&self, write_settings: SstWriteSettings) -> SstWriteSettings {
        write_settings
            .with_target_block_size(self.target_block_size)
            .with_target_keys_per_block(self.target_keys_per_block)
    }
}

/// Compactor encapsulates the state of the compactions.
/// The Compactor is a data structure that will actually perform
/// compactions for the embedded jupiter instance. For each
/// jupiter instance, the JupiterDb will start compactors on
/// start up. (Right now there is only one compactor being started,
/// but they may be booted up with more in the future.) These
/// compactors are passed a pointer to the manifest. The compactor
/// will ask the manifest to recommend a compaction. The manifest
/// will return  a list of SstMetadata. The compactor uses
/// this list to read in all of the SSTs represented and compact
/// them to a new file. If the compaction succeeds, then the
/// compactor call the finished compaction function of the manifest.
/// This function takes as an argument the SstMetadata that were
/// compacted, and the output SstMetadata.
/// If the finished compaction request is successful, then the
/// compactor loops. Otherwise, it cleans up all the new files it
/// wrote. A finished compaction call may not be successful if
/// another compactor has already compacted one of the input files.
/// In this case the compactors work was wasted.
///
/// TODO(t/1336): The compactor acts as a background thread processor.
/// It should probably be refactored with the following in mind:
///
/// 1. be multithreaded
/// 2. use an async job scheduling
pub(crate) struct Compactor<T: TabletSstStore> {
    /// a pointer to the manifest that is being compacted
    sst_store: T,
    settings: CompactorSettings,
    /// false if the compactor should stop running
    admin_rx: Receiver<CompactorMessage>,
    garbage_queue: Vec<String>,
    /// passed to new `SstReader` instances upon creation
    compactor_tx: Sender<CompactorMessage>,
    /// used to quickly generate blob names
    gen: NameGenerator,
}

impl<T: TabletSstStore> Compactor<T> {
    pub(crate) fn new(
        sst_store: T,
        settings: CompactorSettings,
        compactor_tx: Sender<CompactorMessage>,
        admin_rx: Receiver<CompactorMessage>,
        compactor_idx: usize,
    ) -> Self {
        let gen = NameGenerator::new(compactor_idx);
        Compactor {
            sst_store,
            settings,
            admin_rx,
            garbage_queue: Vec::new(),
            compactor_tx,
            gen,
        }
    }

    #[cfg(test)]
    pub(crate) fn one_off(sst_store: T) -> Self {
        use std::sync::mpsc::channel;

        let (compactor_tx, compactor_rx) = channel::<CompactorMessage>();
        Compactor::new(
            sst_store,
            CompactorSettings::default(),
            compactor_tx,
            compactor_rx,
            0,
        )
    }

    fn tombstone_iter<'a, Ctx: Context>(
        storage_wrapper: &'a Ctx,
        sst_readers: &[SstReader],
    ) -> Result<MergedHomogenousIter<SstScanner<'a, Ctx>>, CompactorError> {
        let results = sst_readers
            .iter()
            .map(|reader| {
                (
                    reader.blob_id_ref().to_string(),
                    reader.try_scan(storage_wrapper),
                )
            })
            .collect::<Vec<_>>();
        let mut failed_blob_ids = Vec::with_capacity(sst_readers.len());
        for (blob_id, result) in results.iter() {
            if result.is_err() {
                failed_blob_ids.push(blob_id.to_string());
            }
        }
        if !failed_blob_ids.is_empty() {
            return Err(CompactorError::FailedToObtainReader(failed_blob_ids));
        }

        let scanners = results.into_iter().filter_map(|(_, result)| result.ok());
        let iter = MergedHomogenousIter::new(scanners);
        Ok(iter)
    }

    fn fill_minor_order<Ctx: Context>(
        &mut self,
        ctx: &Ctx,
        minor_sst_readers: &[SstReader],
        l0_sst_readers: &[SstReader],
        write_settings: SstWriteSettings,
    ) -> Result<Vec<SstReader>, CompactorError> {
        let minor_iter = Compactor::<T>::tombstone_iter(ctx, minor_sst_readers)?;
        let l0_iter = Compactor::<T>::tombstone_iter(ctx, l0_sst_readers)?;
        let merged_iter: JoinedIter<SstError, _, _> = JoinedIter::new(minor_iter, l0_iter);
        let debug_data = DebugOrder {
            order_type: "minor".to_string(),
            minor_ssts: Some(
                minor_sst_readers
                    .iter()
                    .map(|r| r.blob_id_ref().to_string())
                    .collect::<Vec<_>>(),
            ),
            levels: Some(
                vec![(
                    0_usize,
                    l0_sst_readers
                        .iter()
                        .map(|r| r.blob_id_ref().to_string())
                        .collect::<Vec<_>>(),
                )]
                .into_iter()
                .collect::<HashMap<_, _>>(),
            ),
        };
        let debug_message = format!("{debug_data:?} ");
        self.compact(ctx, &debug_message, merged_iter, &write_settings)
    }

    fn fill_regular_order<Ctx: Context>(
        &mut self,
        ctx: &Ctx,
        lo_sst_readers: &[SstReader],
        hi_sst_readers: &[SstReader],
        target_level: usize,
        write_settings: SstWriteSettings,
    ) -> Result<Vec<SstReader>, CompactorError> {
        let lo_iter = Compactor::<T>::tombstone_iter(ctx, lo_sst_readers)?;
        let hi_iter = Compactor::<T>::tombstone_iter(ctx, hi_sst_readers)?;
        let merged_iter: JoinedIter<SstError, _, _> = JoinedIter::new(lo_iter, hi_iter);
        let debug_level_map = zip(
            [target_level - 1, target_level].iter(),
            [lo_sst_readers, hi_sst_readers].iter(),
        )
        .map(|(level, sst_readers)| {
            (
                *level,
                sst_readers
                    .iter()
                    .map(|r| r.blob_id_ref().to_string())
                    .collect::<Vec<_>>(),
            )
        })
        .collect::<HashMap<_, _>>();
        let debug_data = DebugOrder {
            order_type: "regular".to_string(),
            minor_ssts: None,
            levels: Some(debug_level_map),
        };
        let debug_message = format!("{debug_data:?}",);
        self.compact(ctx, &debug_message, merged_iter, &write_settings)
    }

    fn fill_major_order<Ctx: Context>(
        &mut self,
        ctx: &Ctx,
        minor_sst_readers: &[SstReader],
        level_sst_readers: &[Vec<SstReader>],
        write_settings: SstWriteSettings,
    ) -> Result<Vec<SstReader>, CompactorError> {
        let minor_iter = Compactor::<T>::tombstone_iter(ctx, minor_sst_readers)?;
        let level_iters = level_sst_readers
            .iter()
            .map(|level_sst_readers| Compactor::<T>::tombstone_iter(ctx, level_sst_readers))
            .collect::<Result<Vec<_>, _>>()?;
        let level_iter = MergedHomogenousIter::new(level_iters.into_iter());
        let merged_iter: JoinedIter<SstError, _, _> = JoinedIter::new(minor_iter, level_iter);
        let debug_level_map = level_sst_readers
            .iter()
            .enumerate()
            .filter(|(_, sst_readers)| !sst_readers.is_empty())
            .map(|(level, sst_readers)| {
                (
                    level,
                    sst_readers
                        .iter()
                        .map(|r| r.blob_id_ref().to_string())
                        .collect::<Vec<_>>(),
                )
            })
            .collect::<HashMap<_, _>>();
        let debug_data = DebugOrder {
            order_type: "major".to_string(),
            minor_ssts: Some(
                minor_sst_readers
                    .iter()
                    .map(|r| r.blob_id_ref().to_string())
                    .collect::<Vec<_>>(),
            ),
            levels: Some(debug_level_map),
        };
        let debug_message = format!("{debug_data:?}",);
        self.compact(ctx, &debug_message, merged_iter, &write_settings)
    }

    /// # Returns
    ///
    /// The new `SstReader` instances if successful.
    fn compact<Ctx: Context, E, I: Iterator<Item = Result<TombstonePair, E>>>(
        &mut self,
        ctx: &Ctx,
        debug_message: &str,
        pairs: I,
        settings: &SstWriteSettings,
    ) -> Result<Vec<SstReader>, CompactorError>
    where
        SstError: From<E>,
    {
        let blob_store = ctx.blob_store_ref();
        let writer = SstWriter::new(settings.clone());
        let (_, blob_ids) = writer.write_all(blob_store, pairs, &mut self.gen)?;
        let readers = blob_ids
            .iter()
            .map(|blob_id| SstReader::new(blob_store, blob_id, self.compactor_tx.clone()))
            .collect::<Result<Vec<_>, _>>()?;

        info!(
            ctx.logger(),
            "compacted to new blobs {blob_ids:?} from original order {debug_message}",
        );
        Ok(readers)
    }

    fn compact_result<Ctx: Context>(
        &mut self,
        ctx: &Ctx,
        order: &CompactOrder,
    ) -> Result<Vec<SstReader>, CompactorError> {
        match &order {
            CompactOrder::Minor {
                minor_sst_readers,
                l0_sst_readers,
                write_settings,
            } => self.fill_minor_order(
                ctx,
                minor_sst_readers,
                l0_sst_readers,
                self.settings.apply(write_settings.clone()),
            ),
            CompactOrder::Regular {
                lo_sst_readers,
                hi_sst_readers,
                target_level_no,
                write_settings,
            } => self.fill_regular_order(
                ctx,
                lo_sst_readers,
                hi_sst_readers,
                *target_level_no,
                self.settings.apply(write_settings.clone()),
            ),
            CompactOrder::Major {
                minor_sst_readers,
                level_sst_readers,
                write_settings,
                ..
            } => self.fill_major_order(
                ctx,
                minor_sst_readers,
                level_sst_readers,
                self.settings.apply(write_settings.clone()),
            ),
        }
    }

    pub(crate) fn run<Ctx: Context>(mut self, ctx: &Ctx) -> Result<(), CompactorError> {
        let short_time = Duration::from_millis(500);
        loop {
            sleep(short_time);
            if let Ok(message) = self.admin_rx.try_recv() {
                match message {
                    CompactorMessage::Shutdown => {
                        return Ok(());
                    }
                    CompactorMessage::MinorCompact { iter, done_tx } => {
                        // TODO(DNS): This unwrap is no longer safe.
                        done_tx.send(self.minor_compact(ctx, iter)).unwrap();
                    }
                    CompactorMessage::MajorCompaction { done_tx } => {
                        if let Some(order) =
                            self.sst_store.request_task(&TaskCategory::MajorCompaction)
                        {
                            match self.compact_result(ctx, &order) {
                                Ok(new_sst_readers) => {
                                    self.sst_store
                                        .handle_finished_task(&order, new_sst_readers.into_iter());
                                    done_tx.send(Ok(())).unwrap();
                                }
                                Err(err) => {
                                    done_tx.send(Err(err)).unwrap();
                                }
                            }
                        }
                    }
                    CompactorMessage::GarbageCollect { blob_ids, done_tx } => {
                        let result = self.inner_garbage_collect(ctx, &blob_ids);
                        if let Some(done_tx) = done_tx {
                            done_tx
                                .send(match result {
                                    Ok(_) => Ok(()),
                                    Err(err) => Err(err),
                                })
                                .unwrap();
                        }
                    }
                    CompactorMessage::DeleteBlob(blob_id) => {
                        let blob_ids = vec![blob_id];
                        _ = self.inner_garbage_collect(ctx, &blob_ids);
                    }
                }
                continue;
            }

            if let Some(order) = self.sst_store.request_task(&TaskCategory::Any) {
                if let Ok(new_sst_readers) = self.compact_result(ctx, &order) {
                    self.sst_store
                        .handle_finished_task(&order, new_sst_readers.into_iter());
                    continue;
                }
            }

            let _ = self.inner_garbage_collect(ctx, &[]);
        }
    }

    fn inner_garbage_collect<Ctx: Context>(
        &mut self,
        ctx: &Ctx,
        blob_ids: &[String],
    ) -> Result<(), CompactorError> {
        let old_gq = self.garbage_queue.clone().into_iter().map(|s| (true, s));
        let new_gq = blob_ids.iter().map(|s| (false, s.to_string()));
        self.garbage_queue = Vec::with_capacity(old_gq.len());
        let mut err_found = false;
        for (is_old, blob_id) in old_gq.chain(new_gq) {
            match ctx.blob_store_ref().delete(&blob_id) {
                Ok(_) => {
                    if is_old {
                        info!(ctx.logger(), "garbage collected old blob: {}", blob_id);
                    }
                }
                Err(_) => {
                    if !is_old {
                        err_found = true;
                    }
                    error!(
                        ctx.logger(),
                        "failed to garbage collect old blob, requeuing for later: {}", blob_id
                    );
                    self.garbage_queue.push(blob_id);
                }
            }
        }
        if err_found {
            return Err(CompactorError::DeletionError);
        }
        Ok(())
    }

    /// Create a new minor SST file from a given key-value list and send it to
    /// the SST store.
    ///
    /// NOTE: The key-value pairs must be lexically sorted by key from lowest to
    /// highest.
    ///
    /// # Arguments
    ///
    /// - iter: An iterator over the key-value pairs to be written to the SST
    ///
    /// # Returns
    ///
    /// The blob ID of the newly created SST file.
    pub(crate) fn minor_compact<Ctx: Context, L: TombstonePairLike, I: Iterator<Item = L>>(
        &mut self,
        ctx: &Ctx,
        iter: I,
    ) -> Result<String, CompactorError> {
        let blob_store = ctx.blob_store_ref();
        let writer = SstWriter::new(
            self.settings.apply(
                self.sst_store
                    .write_settings_ref()
                    .clone()
                    .keep_tombstones()
                    .set_writing_minor_sst(true),
            ),
        );
        let pairs = iter.map(|pair| Ok::<L, ()>(pair));
        let (n_pairs, mut blob_ids) = writer.write_all(blob_store, pairs, &mut self.gen)?;
        info!(
            ctx.logger(),
            "compacted {n_pairs} into new minor sst list {blob_ids:?}"
        );
        debug_assert_eq!(blob_ids.len(), 1);
        let blob_id = blob_ids.pop().unwrap();
        let reader = SstReader::new(ctx.blob_store_ref(), &blob_id, self.compactor_tx.clone())?;
        self.sst_store.add_minor_sst(reader);
        info!(
            ctx.logger(),
            "added minor sst {blob_id} to sst_store {:?}", self.sst_store
        );
        Ok(blob_id)
    }
}

#[cfg(test)]
mod test {
    use std::sync::mpsc::channel;

    use super::*;
    use crate::concurrent_skip_list::ConcurrentSkipList;
    use crate::context::SimpleContext;
    use crate::helpful_macros::unwrap;
    use crate::kv::TombstoneValue;
    use crate::logging::DefaultLogger;
    use crate::sst::block_cache::cache::LruBlockCache;
    use crate::sst::block_cache::BlockCache;
    use crate::storage::blob_store::InMemoryBlobStore;
    use crate::tablet::SmartTablet;

    fn md_data(lo: usize, hi: usize) -> Vec<(Vec<u8>, Vec<u8>)> {
        let mut ret = Vec::new();
        for k in lo..hi {
            let l = k as u64;
            let key = u64::to_be_bytes(l).to_vec();
            let value = u64::to_be_bytes((l * l) % 17).to_vec();
            ret.push((key, value));
        }
        ret
    }

    fn md_n_data(n: usize) -> Vec<(Vec<u8>, Vec<u8>)> {
        if n == 1 {
            return md_data(10, 40);
        }
        if n == 2 {
            return md_data(50, 100);
        }
        if n == 3 {
            return md_data(0, 110);
        }
        panic!()
    }

    type BlobId = String;

    fn write_minor_md<Ctx: Context>(
        ctx: &Ctx,
        vec: &[(Vec<u8>, Vec<u8>)],
        gen: &mut NameGenerator,
    ) -> Result<BlobId, String> {
        let blob_store = ctx.blob_store_ref();
        let sst_writer = SstWriter::new(SstWriteSettings::default().set_writing_minor_sst(true));
        let (_, blob_ids) = sst_writer.write_all(
            blob_store,
            vec.iter().map(|(key, value)| {
                Result::<TombstonePair, SstError>::Ok(TombstonePair::new(
                    key.clone(),
                    value.clone(),
                ))
            }),
            gen,
        )?;
        assert_eq!(blob_ids.len(), 1);
        Ok(blob_ids[0].clone())
    }

    fn check_written<E: Debug, I: Iterator<Item = Result<TombstonePair, E>>>(
        vec: &[(Vec<u8>, Vec<u8>)],
        pairs: I,
    ) -> Result<(), String> {
        for (idx, result) in pairs.enumerate() {
            if idx == vec.len() {
                assert!(result.is_err());
                break;
            }
            let pair = result.unwrap();
            assert_eq!(pair.key_ref(), &vec[idx].0);
            assert_eq!(pair.value_ref().as_ref().unwrap(), &vec[idx].1);
        }
        Ok(())
    }

    fn write_starting_sst_vec<Ctx: Context>(
        ctx: &Ctx,
        compactor_tx: Sender<CompactorMessage>,
        gen: &mut NameGenerator,
    ) -> Result<Vec<SstReader>, String> {
        let mut readers = Vec::with_capacity(3);

        let data = md_n_data(1);
        let path_1 = write_minor_md(ctx, &data, gen).unwrap();
        readers.push(SstReader::new(
            ctx.blob_store_ref(),
            &path_1,
            compactor_tx.clone(),
        )?);
        unwrap!(check_written(&data, unwrap!(readers[0].try_scan(ctx))));

        let data = md_n_data(2);
        let path_2 = unwrap!(write_minor_md(ctx, &data, gen));
        readers.push(SstReader::new(
            ctx.blob_store_ref(),
            &path_2,
            compactor_tx.clone(),
        )?);
        unwrap!(check_written(&data, unwrap!(readers[1].try_scan(ctx))));

        let data = md_n_data(3);
        let path_3 = unwrap!(write_minor_md(ctx, &data, gen));
        readers.push(SstReader::new(
            ctx.blob_store_ref(),
            &path_3,
            compactor_tx.clone(),
        )?);
        unwrap!(check_written(&data, unwrap!(readers[2].try_scan(ctx))));

        Ok(readers)
    }

    #[test]
    fn test_compactor_compact() {
        let blob_store = InMemoryBlobStore::new();
        let ctx = SimpleContext::from((
            blob_store,
            LruBlockCache::with_capacity(32),
            DefaultLogger::default(),
        ));
        let levels: Vec<String> = Vec::new();
        let (compactor_tx, compactor_rx) = channel::<CompactorMessage>();
        let sst_store = unwrap!(SmartTablet::new(
            ctx.blob_store_ref(),
            levels.into_iter(),
            compactor_tx.clone(),
        ));
        let mut compactor = Compactor::new(
            sst_store.clone(),
            CompactorSettings::default(),
            compactor_tx.clone(),
            compactor_rx,
            0,
        );

        let sst_readers = unwrap!(write_starting_sst_vec(
            &ctx,
            compactor_tx.clone(),
            &mut compactor.gen
        ));
        let pairs = sst_readers
            .iter()
            .map(|reader| unwrap!(reader.try_scan(&ctx)));
        let pairs = MergedHomogenousIter::new(pairs);
        let new_sst_readers = compactor
            .compact(&ctx, "'my blobs!'", pairs, &SstWriteSettings::default())
            .unwrap();

        let skip_list: ConcurrentSkipList<Vec<u8>, TombstoneValue> = ConcurrentSkipList::new();
        for in_data in (1..4).map(md_n_data).rev() {
            for (key, value) in in_data {
                skip_list.set(key, TombstoneValue::Value(value));
            }
        }
        let out_data = skip_list
            .iter()
            .map(|pair| {
                let key = pair.key_ref();
                let value = pair.value_ref();
                (key.clone(), (*value).clone().as_ref().unwrap().clone())
            })
            .collect::<Vec<_>>();

        let new_iters = new_sst_readers
            .iter()
            .map(|reader| unwrap!(reader.try_scan(&ctx)));
        let pairs = MergedHomogenousIter::new(new_iters);
        assert!(check_written(&out_data, pairs).is_ok())
    }
}