@@ -100,6 +100,7 @@ fn bounds_error() -> Result<()> {
100100/// # Ok(()) }
101101/// ```
102102#[ derive( Clone ) ]
103+ #[ doc( alias( "keyspace" , "bucket" , "table" ) ) ]
103104pub struct Tree ( pub ( crate ) Arc < TreeInner > ) ;
104105
105106#[ allow( clippy:: module_name_repetitions) ]
@@ -150,6 +151,7 @@ impl Tree {
150151 /// assert_eq!(db.insert(&[1, 2, 3], vec![1]), Ok(Some(sled::IVec::from(&[0]))));
151152 /// # Ok(()) }
152153 /// ```
154+ #[ doc( alias( "set" ) ) ]
153155 pub fn insert < K , V > ( & self , key : K , value : V ) -> Result < Option < IVec > >
154156 where
155157 K : AsRef < [ u8 ] > ,
@@ -542,6 +544,7 @@ impl Tree {
542544 /// assert_eq!(db.remove(&[1]), Ok(None));
543545 /// # Ok(()) }
544546 /// ```
547+ #[ doc( alias( "delete" , "del" ) ) ]
545548 pub fn remove < K : AsRef < [ u8 ] > > ( & self , key : K ) -> Result < Option < IVec > > {
546549 let mut guard = pin ( ) ;
547550 let _cc = concurrency_control:: read ( ) ;
@@ -607,6 +610,7 @@ impl Tree {
607610 /// # Ok(()) }
608611 /// ```
609612 #[ allow( clippy:: needless_pass_by_value) ]
613+ #[ doc( alias( "cas" , "tas" , "test_and_set" , "test_and_swap" , "compare_and_set" ) ) ]
610614 pub fn compare_and_swap < K , OV , NV > (
611615 & self ,
612616 key : K ,
0 commit comments