Lines Matching refs:value
289 value: V, in try_create_and_insert()
292 Ok(self.insert(RBTreeNode::new(key, value, flags)?)) in try_create_and_insert()
394 Ordering::Equal => return Some(unsafe { &(*this).value }), in get()
918 let v = unsafe { addr_of_mut!((*this).value) }; in to_key_value_raw()
1027 Some(unsafe { (addr_of_mut!((*cur).key), addr_of_mut!((*cur).value)) }) in next()
1061 pub fn into_node(self, key: K, value: V) -> RBTreeNode<K, V> { in into_node()
1066 value, in into_node()
1085 pub fn new(key: K, value: V, flags: Flags) -> Result<RBTreeNode<K, V>> { in new()
1086 Ok(RBTreeNodeReservation::new(flags)?.into_node(key, value)) in new()
1093 (node.key, node.value) in to_key_value()
1181 unsafe { &mut (*node).value } in insert()
1187 pub fn insert(self, value: V, reservation: RBTreeNodeReservation<K, V>) -> &'a mut V { in insert()
1188 self.raw.insert(reservation.into_node(self.key, value)) in insert()
1208 unsafe { &(*container_of!(self.node_links, Node<K, V>, links)).value } in get()
1216 unsafe { &mut (*(container_of!(self.node_links, Node<K, V>, links))).value } in get_mut()
1226 unsafe { &mut (*(container_of!(self.node_links, Node<K, V>, links))).value } in into_mut()
1248 node.value in remove()
1279 value: V, field