Lines Matching refs:insert

96 /// In the example below, we first allocate a node, acquire a spinlock, then insert the node into
110 ///     guard.insert(node);
153 /// tree.insert(reservation.into_node(15, 150));
310     /// Tries to insert a new value into the tree.
322         Ok(self.insert(RBTreeNode::new(key, value, flags)?))
331     pub fn insert(&mut self, node: RBTreeNode<K, V>) -> Option<RBTreeNode<K, V>> {
335                 entry.insert(node);
356         // representing an empty subtree where we can insert our new node. We need to make sure
360         // we find an empty subtree, we can insert the new node using `rb_link_node`.
1195     /// call to [`RBTree::insert`].
1237     /// [`RBTree::insert`].
1305     /// The node that will become the parent of the new node if we insert one.
1318     fn insert(self, node: RBTreeNode<K, V>) -> &'a mut V {
1340     pub fn insert(self, value: V, reservation: RBTreeNodeReservation<K, V>) -> &'a mut V {
1341         self.raw.insert(reservation.into_node(self.key, value))