1 files changed, 6 insertions, 52 deletions

diff --git a/log_db/src/memtable_secondary.rs b/log_db/src/memtable_secondary.rs
index 3f9863b..371cb84 100644
--- a/log_db/src/memtable_secondary.rs
+++ b/log_db/src/memtable_secondary.rs
@@ -1,12 +1,11 @@
 use super::*;
 use std::collections::BTreeMap;
-use std::collections::HashSet;
 
 pub struct SecondaryMemtable {
     /// Map of records indexed by key. The value is the set of primary key values of records
     /// that have the secondary key value. The actual `Record` objects are stored in the
     /// primary memtable, which acts as the shared heap.
-    records: BTreeMap<IndexableValue, HashSet<IndexableValue>>,
+    records: BTreeMap<IndexableValue, LogKeySet>,
 }
 
 impl SecondaryMemtable {
@@ -17,59 +16,14 @@ impl SecondaryMemtable {
     }
 
     pub fn set(&mut self, key: &IndexableValue, value: &IndexableValue) {
-        debug!(
-            "Inserting/updating record in secondary memtable with key {:?} = {:?}",
-            &key, &value,
-        );
-
-        match self.records.get_mut(key) {
-            Some(existing) => {
-                debug!(
-                    "Existing entry found with {} records in the set",
-                    &existing.len()
-                );
-                existing.insert(value.clone());
-            }
-            None => {
-                debug!("No existing entry found, creating one.");
-                let mut set = HashSet::with_capacity(1);
-                set.insert(value.clone());
-                self.records.insert(key.clone(), set);
-            }
-        }
+        unimplemented!();
     }
 
-    pub fn set_all(&mut self, key: &IndexableValue, values: &[IndexableValue]) {
-        debug!(
-            "Replacing set of records in secondary memtable with key {:?} ({} values)",
-            &key,
-            &values.len(),
-        );
-
-        let mut set = HashSet::with_capacity(values.len());
-        values.iter().for_each(|value| {
-            set.insert(value.clone());
-        });
-
-        self.records.insert(key.clone(), set);
+    pub fn set_all(&mut self, key: &IndexableValue, values: &LogKeySet) {
+        unimplemented!();
     }
 
-    pub fn find_all(
-        &mut self,
-        primary_memtable: &PrimaryMemtable,
-        key: &IndexableValue,
-    ) -> Vec<Record> {
-        match self.records.get(key) {
-            None => vec![],
-            Some(set) => set
-                .iter()
-                .map(|key| {
-                    primary_memtable
-                        .get_without_update(key)
-                        .expect("Record not found")
-                        .clone()
-                })
-                .collect(),
-        }
+    pub fn find_all(&self, key: &IndexableValue) -> &LogKeySet {
+        unimplemented!();
     }
 }