check compaction converge for simple leveled

Signed-off-by: Alex Chi Z <iskyzh@gmail.com>

mini-lsm-starter/src/block/iterator.rs

@@ -64,7 +64,8 @@ impl BlockIterator {
     }
 
     /// Seek to the first key that >= `key`.
-    /// Note: You should assume the key-value pairs in the block are sorted when being added by callers.
+    /// Note: You should assume the key-value pairs in the block are sorted when being added by
+    /// callers.
     pub fn seek_to_key(&mut self, key: &[u8]) {
         unimplemented!()
     }

mini-lsm-starter/src/table/builder.rs

@@ -22,13 +22,15 @@ impl SsTableBuilder {
     }
 
     /// Adds a key-value pair to SSTable.
-    /// Note: You should split a new block when the current block is full.(`std::mem::replace` may be of help here)
+    /// Note: You should split a new block when the current block is full.(`std::mem::replace` may
+    /// be of help here)
     pub fn add(&mut self, key: &[u8], value: &[u8]) {
         unimplemented!()
     }
 
     /// Get the estimated size of the SSTable.
-    /// Since the data blocks contain much more data than meta blocks, just return the size of data blocks here.
+    /// Since the data blocks contain much more data than meta blocks, just return the size of data
+    /// blocks here.
     pub fn estimated_size(&self) -> usize {
         unimplemented!()
     }

mini-lsm-starter/src/table/iterator.rs

@@ -28,7 +28,8 @@ impl SsTableIterator {
     }
 
     /// Seek to the first key-value pair which >= `key`.
-    /// Note: You probably want to review the handout for detailed explanation when implementing this function.
+    /// Note: You probably want to review the handout for detailed explanation when implementing
+    /// this function.
     pub fn seek_to_key(&mut self, key: &[u8]) -> Result<()> {
         unimplemented!()
     }