()
| 106 | |
| 107 | #[test] |
| 108 | fn keys() { |
| 109 | let mut tree = Tree::default(); |
| 110 | for v in 0..10 { |
| 111 | tree.insert(v, v); |
| 112 | } |
| 113 | assert_eq!(tree.keys(), vec![&0, &1, &2, &3, &4, &5, &6, &7, &8, &9]); |
| 114 | |
| 115 | // 倒序加入 |
| 116 | let mut tree = Tree::default(); |
| 117 | for v in (0..10).rev() { |
| 118 | tree.insert(v, v); |
| 119 | } |
| 120 | assert_eq!(tree.keys(), vec![&0, &1, &2, &3, &4, &5, &6, &7, &8, &9]); |
| 121 | } |
| 122 | |
| 123 | #[test] |
| 124 | fn drop_clear() { |