maokaihe/mini_lsm
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

docs: s/tutorial/course

Browse Source 
Signed-off-by: Alex Chi Z <iskyzh@gmail.com>
This commit is contained in:
Alex Chi Z
2025-01-19 19:28:04 -05:00
parent 7f4b204064
commit 38c7ef6f2f
32 changed files with 67 additions and 67 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
mini-lsm-book/src/week1-02-merge-iterator.md
View File

@@ -47,7 +47,7 @@ pub struct MemtableIterator {
Okay, here is the problem: we want to express that the lifetime of the iterator is the same as the `map` in the structure. How can we do that?
This is the first and most tricky Rust language thing that you will ever meet in this tutorial -- self-referential structure. If it is possible to write something like:
This is the first and most tricky Rust language thing that you will ever meet in this course -- self-referential structure. If it is possible to write something like:
```rust,no_run
pub struct MemtableIterator { // <- with lifetime 'this
@@ -123,7 +123,7 @@ In this task, you will need to modify:
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:
We use the `LsmIterator` structure to represent the internal LSM iterators. You will need to modify this structure multiple times throughout the course when more iterators are added into the system. For now, because we only have multiple memtables, it should be defined as:
```rust,no_run
type LsmIteratorInner = MergeIterator<MemTableIterator>;
@@ -163,6 +163,6 @@ We do not provide reference answers to the questions, and feel free to discuss a
## Bonus Tasks
* **Foreground Iterator.** In this tutorial we assumed that all operations are short, so that we can hold reference to mem-table in the iterator. If an iterator is held by users for a long time, the whole mem-table (which might be 256MB) will stay in the memory even if it has been flushed to disk. To solve this, we can provide a `ForegroundIterator` / `LongIterator` to our user. The iterator will periodically create new underlying storage iterator so as to allow garbage collection of the resources.
* **Foreground Iterator.** In this course we assumed that all operations are short, so that we can hold reference to mem-table in the iterator. If an iterator is held by users for a long time, the whole mem-table (which might be 256MB) will stay in the memory even if it has been flushed to disk. To solve this, we can provide a `ForegroundIterator` / `LongIterator` to our user. The iterator will periodically create new underlying storage iterator so as to allow garbage collection of the resources.
{{#include copyright.md}}