diff --git a/src/db/mem_table.rs b/src/db/mem_table.rs
index 9bc002cc10fae2d69fbf6c4418c9cffbddfb5872..56566ce53a72225323ef3cf32f48773c25891143 100644
--- a/src/db/mem_table.rs
+++ b/src/db/mem_table.rs
@@ -1,5 +1,5 @@
 use std::rc::Rc;
-use crate::traits::comparator_trait::ComparatorTrait;
+use crate::traits::comparator_trait::Comparator;
 use crate::traits::DataIterator;
 use crate::util::comparator::InternalKeyComparator;
 use crate::util::slice::Slice;
@@ -12,14 +12,14 @@ pub enum ValueType {
 }
 
 /// 内存表
-pub struct MemTable<Cmp: ComparatorTrait> {
+pub struct MemTable<Cmp: Comparator> {
     cmp: Rc<Cmp>,
 }
 
 /// 临时, 查找键
 struct LookupKey {}
 
-impl <Cmp: ComparatorTrait> MemTable<Cmp> {
+impl <Cmp: Comparator> MemTable<Cmp> {
 
     /// 创建内存表
     ///
diff --git a/src/db/skip_list.rs b/src/db/skip_list.rs
index 144c0b60f26f215d4c7065a134c631bdf964f433..01331f22de72120f0ce50c5255778640c6a2bc2b 100644
--- a/src/db/skip_list.rs
+++ b/src/db/skip_list.rs
@@ -1,6 +1,6 @@
 use std::rc::Rc;
 
-use crate::traits::comparator_trait::ComparatorTrait;
+use crate::traits::comparator_trait::Comparator;
 use crate::util::Arena;
 use crate::util::comparator::BytewiseComparatorImpl;
 use crate::util::Result;
@@ -11,12 +11,12 @@ struct Node<T> {
     value: T,
 }
 
-pub struct SkipList<T, It: ComparatorTrait> {
+pub struct SkipList<T, It: Comparator> {
     node: Option<Node<T>>,
     comp: Rc<It>,
 }
 
-impl<T, It: ComparatorTrait> SkipList<T, It> {
+impl<T, It: Comparator> SkipList<T, It> {
 
     pub fn create(comparator: Rc<It>, _arena: Rc<Arena>) -> Self {
         Self {
diff --git a/src/traits/comparator_trait.rs b/src/traits/comparator_trait.rs
index 608e223e4ae02f8773f8ce2227b635d4bf37437e..a7a74c1d637fb4626079b3af33d3caf5420b24a0 100644
--- a/src/traits/comparator_trait.rs
+++ b/src/traits/comparator_trait.rs
@@ -2,7 +2,7 @@ use std::cmp::Ordering;
 use crate::util::slice::Slice;
 
 /// 比较器
-pub trait ComparatorTrait {
+pub trait Comparator {
 
     ///  Slice 的大小比较, 按字典逐字节序进行比较
     ///
diff --git a/src/util/comparator.rs b/src/util/comparator.rs
index d28c48dca3864796d4c14fd939460dbdf01a597e..1f9bbf77accc7577cc3c41ef1bedd8a70ccb8828 100644
--- a/src/util/comparator.rs
+++ b/src/util/comparator.rs
@@ -1,6 +1,6 @@
 
 use std::cmp::{min, Ordering};
-use crate::traits::comparator_trait::{ComparatorTrait};
+use crate::traits::comparator_trait::{Comparator};
 use crate::util::slice::Slice;
 
 pub struct BytewiseComparatorImpl {}
@@ -15,7 +15,7 @@ impl Default for BytewiseComparatorImpl {
     }
 }
 
-impl ComparatorTrait for BytewiseComparatorImpl {
+impl Comparator for BytewiseComparatorImpl {
 
     fn compare(&self, a: &Slice, b: &Slice) -> Option<Ordering> {
         a.partial_cmp(b)
@@ -91,29 +91,43 @@ impl ComparatorTrait for BytewiseComparatorImpl {
 
 /// InternalKeyComparator
 pub struct InternalKeyComparator {
-    // user_comparator_: ComparatorTrait
+    user_comparator_: dyn Comparator
 }
 
-// /// InternalKeyComparator 比较器: 用来比较内部键（Internal Key）。
-// /// 内部键值是为了方便处理，将原普通键、序列号和值类型组成的新键。
-// impl ComparatorTrait for InternalKeyComparator {
-//     fn new(c: ComparatorTrait) -> InternalKeyComparator {
-//         todo!()
-//     }
-//
-//     fn compare(&self, _a: &Slice, _b: &Slice) -> Option<Ordering> {
-//         todo!()
-//     }
-//
-//     fn get_name(&self) -> String {
-//         String::from("leveldb.InternalKeyComparator")
-//     }
-//
-//     fn find_shortest_separator(&self, _start: &String, _limit: &Slice) -> String {
-//         todo!()
-//     }
-//
-//     fn find_short_successor(&self, _key: &String) -> String {
-//         todo!()
-//     }
-// }
+impl InternalKeyComparator {
+    fn new(c: Box<dyn Comparator>) -> Box<InternalKeyComparator> {
+        todo!()
+    }
+
+    fn user_comparator() -> Box<dyn Comparator> {
+        todo!()
+    }
+
+    // fn compare(a: InternalKey, b: InternalKey) -> u32 {
+    //     todo!()
+    // }
+}
+
+/// InternalKeyComparator 比较器: 用来比较内部键（Internal Key）。
+/// 内部键值是为了方便处理，将原普通键、序列号和值类型组成的新键。
+impl Comparator for InternalKeyComparator {
+    // fn new(c: Box<ComparatorTrait>) -> InternalKeyComparator {
+    //     todo!()
+    // }
+
+    fn compare(&self, _a: &Slice, _b: &Slice) -> Option<Ordering> {
+        todo!()
+    }
+
+    fn get_name(&self) -> String {
+        String::from("leveldb.InternalKeyComparator")
+    }
+
+    fn find_shortest_separator(&self, _start: &String, _limit: &Slice) -> String {
+        todo!()
+    }
+
+    fn find_short_successor(&self, _key: &String) -> String {
+        todo!()
+    }
+}
diff --git a/src/util/comparator_test.rs b/src/util/comparator_test.rs
index 8d5ec27e64d93426b5588042be40bd37be857112..12d570ff8b9c35af03b40cab938e4c525b7be84d 100644
--- a/src/util/comparator_test.rs
+++ b/src/util/comparator_test.rs
@@ -2,7 +2,7 @@
 mod test {
     use std::cmp::Ordering;
     use std::io::Write;
-    use crate::traits::comparator_trait::ComparatorTrait;
+    use crate::traits::comparator_trait::Comparator;
     use crate::util::comparator::{BytewiseComparatorImpl, InternalKeyComparator};
     use crate::util::slice::Slice;
 
diff --git a/src/util/options.rs b/src/util/options.rs
index 3c2aad7f598fc058a3fe2a32c991feaaeeeedbcd..3c3060b00ede6d89566870f81201a7b755c3fd31 100644
--- a/src/util/options.rs
+++ b/src/util/options.rs
@@ -1,5 +1,5 @@
 use crate::db::db::Snapshot;
-use crate::traits::comparator_trait::ComparatorTrait;
+use crate::traits::comparator_trait::Comparator;
 use crate::util::comparator::BytewiseComparatorImpl;
 
 pub enum CompressionType {
@@ -22,7 +22,7 @@ pub struct Options {
     /// REQUIRES: The client must ensure that the comparator supplied
     /// here has the same name and orders keys *exactly* the same as the
     /// comparator provided to previous open calls on the same DB.
-    pub cmp: Box<dyn ComparatorTrait>,
+    pub cmp: Box<dyn Comparator>,
     /// If true, the database will be created if it is missing.
     pub create_if_missing: bool,
     /// If true, an error is raised if the database already exists.