32 /// // Insert three elements.
96 /// In the example below, we first allocate a node, acquire a spinlock, then insert the node into
107 ///     // Insert node while holding the lock. It is guaranteed to succeed with no allocation
110 ///     guard.insert(node);
123 /// // Insert three elements.
151 /// // Insert a new node into the tree, reusing the previous allocation. This is guaranteed to
153 /// tree.insert(reservation.into_node(15, 150));
280     /// Tries to insert a new value into the tree.
292         Ok(self.insert(RBTreeNode::new(key, value, flags)?))  in try_create_and_insert()
301     pub fn insert(&mut self, node: RBTreeNode<K, V>) -> Option<RBTreeNode<K, V>> {  in insert()  function
305                 entry.insert(node);  in insert()
326         // representing an empty subtree where we can insert our new node. We need to make sure  in raw_entry()
330         // we find an empty subtree, we can insert the new node using `rb_link_node`.  in raw_entry()
523 /// // Insert three elements.
562 /// // Insert three elements.
593 /// // Insert five elements.
625 /// // Insert three elements.
652 /// // Insert three elements.
691 /// // Insert three elements.
1042     /// call to [`RBTree::insert`].
1084     /// [`RBTree::insert`].
1152     /// The node that will become the parent of the new node if we insert one.
1165     fn insert(self, node: RBTreeNode<K, V>) -> &'a mut V {  in insert()  method
1187     pub fn insert(self, value: V, reservation: RBTreeNodeReservation<K, V>) -> &'a mut V {  in insert()  method
1188         self.raw.insert(reservation.into_node(self.key, value))  in insert()