fix links

src/db/kv/btree_map.rs

@@ -4,9 +4,11 @@ use std::collections::BTreeMap;
 use std::convert::Infallible;
 use std::fmt::Debug;
 
-/// A simple in-memory key-value store backed by a `BTreeMap`.
+/// A simple in-memory key-value store backed by a [`BTreeMap`].
 ///
-/// It's intended to be not `Clone`, since [`Clone::clone`] will clone the entire [`BTreeMap`].
+/// [`BTreeMap`] could be faster than [`HashMap`](std::collections::HashMap) in small size.
+///
+/// It's intended to be not [`Clone`], since [`Clone::clone`] will clone the entire [`BTreeMap`].
 ///
 /// If you need to clone the entire database,
 /// you can use [`BTreeMapDb::inner`] to get the inner [`BTreeMap`],

src/db/kv/hash_map.rs

@@ -1,12 +1,12 @@
-//! KVDatabase in-memory implementation using a [`BTreeMap`].
+//! KVDatabase in-memory implementation using a [`HashMap`](std::collections::HashMap).
 use super::KVDatabase;
 use crate::HashMap;
 use std::convert::Infallible;
 use std::fmt::Debug;
 
-/// A simple in-memory key-value store backed by a `HashMap`.
+/// A simple in-memory key-value store backed by a [`HashMap`](std::collections::HashMap).
 ///
-/// It's intended to be not `Clone`, since [`Clone::clone`] will clone the entire [`HashMapDb`].
+/// It's intended to be not [`Clone`], since [`Clone::clone`] will clone the entire [`HashMapDb`].
 ///
 /// If you need to clone the entire database,
 /// you can use [`HashMapDb::inner`] to get the inner [`HashMapDb`],

src/db/kv/sled.rs

@@ -2,7 +2,7 @@
 //!
 //! Different from [`HashMapDb`](crate::db::HashMapDb) and [`BTreeMapDb`](crate::db::BTreeMapDb),
 //! [`SledDb`] is `Clone`, since [`sled::Tree`] is `Clone`.
-//! Same db is shared between different instances of `SledDb`.
+//! Same db is shared between different instances of [`SledDb`].
 //!
 //! ## Example
 //!
@@ -28,7 +28,7 @@
 use super::KVDatabase;
 use sled::Batch;
 
-/// A key-value store backed by `sled`.
+/// A key-value store backed by [`sled`].
 #[derive(Clone, Debug)]
 pub struct SledDb {
     db: sled::Tree,