133     pub fn insert<C: Comparator<K>>(  in insert()  function
140         self.cursor_mut(forest, comp).insert(key, value)  in insert()
394     fn insert(  in insert()  function
426                     *root = self.path.insert(key, value, pool)?.into();  in try_insert()
616     pub fn insert(&mut self, key: K, value: V) -> Option<V> {  in insert()  function
617         self.raw.insert(self.root, self.pool, key, value, self.comp)  in insert()
915         assert_eq!(m.insert(50, 5.0, f, &()), None);  in inserting()
916         assert_eq!(m.insert(50, 5.5, f, &()), Some(5.0));  in inserting()
917         assert_eq!(m.insert(20, 2.0, f, &()), None);  in inserting()
918         assert_eq!(m.insert(80, 8.0, f, &()), None);  in inserting()
919         assert_eq!(m.insert(40, 4.0, f, &()), None);  in inserting()
920         assert_eq!(m.insert(60, 6.0, f, &()), None);  in inserting()
921         assert_eq!(m.insert(90, 9.0, f, &()), None);  in inserting()
922         assert_eq!(m.insert(200, 20.0, f, &()), None);  in inserting()
1023                 m.insert(n * 10, n as f32 * 1.1, f, &());  in split_level0_leaf()
1030         m.insert(5, 4.2, f, &());  in split_level0_leaf()
1046         m.insert(80, 4.2, f, &());  in split_level0_leaf()
1052         m.insert(35, 4.2, f, &());  in split_level0_leaf()
1058         m.insert(45, 4.2, f, &());  in split_level0_leaf()
1085                     m.insert(row * 100 + col * 10, row as f32 + col as f32 * 0.1, f, &());  in split_level1_leaf()
1092                     m.insert(row * 100 + col * 10, row as f32 + col as f32 * 0.1, f, &());  in split_level1_leaf()
1117         m.insert(0, 4.2, f, &());  in split_level1_leaf()
1124         m.insert(135, 4.2, f, &());  in split_level1_leaf()
1131         m.insert(145, 4.2, f, &());  in split_level1_leaf()
1138         m.insert(175, 4.2, f, &());  in split_level1_leaf()
1145         m.insert(435, 4.2, f, &());  in split_level1_leaf()
1152         m.insert(445, 4.2, f, &());  in split_level1_leaf()
1159         m.insert(535, 4.2, f, &());  in split_level1_leaf()
1166         m.insert(545, 4.2, f, &());  in split_level1_leaf()
1173         m.insert(835, 4.2, f, &());  in split_level1_leaf()
1180         m.insert(845, 4.2, f, &());  in split_level1_leaf()
1187         m.insert(805, 4.2, f, &());  in split_level1_leaf()
1201             m.insert(n * 10, n as f32, f, &());  in two_leaf()
1220         assert_eq!(m.insert(55, 5.5, f, &()), None);  in remove_level1()
1228         assert_eq!(m.insert(15, 1.5, f, &()), None);  in remove_level1()
1244         assert_eq!(m.insert(90, 9.0, f, &()), None);  in remove_level1()
1245         assert_eq!(m.insert(100, 10.0, f, &()), None);  in remove_level1()
1297             m.insert(n * 10, n as f32, f, &());  in level3_sparse()
1342             assert_eq!(m.insert(x, n as f32, f, &()), None);  in insert_many()
1371             m.insert(i, i as f32, f, &());  in immutable_cursor()
1450             m.insert(i, i as f32, &mut f, &());  in into_iter()
1476             m.insert(i, i as f32, &mut f, &());  in range()
1527                 m.insert(i, i as f32, &mut f, &());  in range()
1550             m.insert(i, i as f32, &mut f, &());  in range_next_back()