diff --git a/mini-lsm-book/src/week1-02-merge-iterator.md b/mini-lsm-book/src/week1-02-merge-iterator.md index d10bb6a9..df689651 100644 --- a/mini-lsm-book/src/week1-02-merge-iterator.md +++ b/mini-lsm-book/src/week1-02-merge-iterator.md @@ -103,7 +103,7 @@ Starting this section, we will use `Key` to represent LSM key types and disti In this task, you will need to modify: ``` -src/iterators/lsm_iterator.rs +src/lsm_iterator.rs ``` We use the `LsmIterator` structure to represent the internal LSM iterators. You will need to modify this structure multiple times throughout the tutorial when more iterators are added into the system. For now, because we only have multiple memtables, it should be defined as: @@ -123,7 +123,7 @@ Then, we want to provide extra safety on the iterator to avoid users from misusi In this task, you will need to modify: ``` -src/iterators/lsm_storage.rs +src/lsm_storage.rs ``` We are finally there -- with all iterators you have implemented, you can finally implement the `scan` interface of the LSM engine. You can simply construct an LSM iterator with the memtable iterators (remember to put the latest memtable at the front of the merge iterator), and your storage engine will be able to handle the scan request.