refactor

src/abstract.rs

@@ -566,16 +566,6 @@ pub trait AbstractTree {
         seqno: SeqNo,
     ) -> (u32, u32);
 
-    /// Inserts a key-value pair.
-    fn raw_insert_with_lock<K: Into<UserKey>, V: Into<UserValue>>(
-        &self,
-        lock: &RwLockWriteGuard<'_, Memtable>,
-        key: K,
-        value: V,
-        seqno: SeqNo,
-        r#type: ValueType,
-    ) -> (u32, u32);
-
     /// Removes an item from the tree.
     ///
     /// Returns the added item's size and new size of the memtable.

src/blob_tree/mod.rs

@@ -596,27 +596,6 @@ impl AbstractTree for BlobTree {
         )
     }
 
-    fn raw_insert_with_lock<K: Into<UserKey>, V: Into<UserValue>>(
-        &self,
-        lock: &RwLockWriteGuard<'_, Memtable>,
-        key: K,
-        value: V,
-        seqno: SeqNo,
-        r#type: ValueType,
-    ) -> (u32, u32) {
-        use value::MaybeInlineValue;
-
-        // NOTE: Initially, we always write an inline value
-        // On memtable flush, depending on the values' sizes, they will be separated
-        // into inline or indirect values
-        let item = MaybeInlineValue::Inline(value.into());
-
-        let value = item.encode_into_vec();
-
-        let value = InternalValue::from_components(key, value, seqno, r#type);
-        lock.insert(value)
-    }
-
     fn insert<K: Into<UserKey>, V: Into<UserValue>>(
         &self,
         key: K,

src/tree/mod.rs

@@ -412,18 +412,6 @@ impl AbstractTree for Tree {
         self.append_entry(value)
     }
 
-    fn raw_insert_with_lock<K: Into<UserKey>, V: Into<UserValue>>(
-        &self,
-        lock: &RwLockWriteGuard<'_, Memtable>,
-        key: K,
-        value: V,
-        seqno: SeqNo,
-        r#type: ValueType,
-    ) -> (u32, u32) {
-        let value = InternalValue::from_components(key, value, seqno, r#type);
-        lock.insert(value)
-    }
-
     fn remove<K: Into<UserKey>>(&self, key: K, seqno: SeqNo) -> (u32, u32) {
         let value = InternalValue::new_tombstone(key, seqno);
         self.append_entry(value)