Lines Matching defs:reborrow
29725 let node = self.reborrow();
30021 clone_subtree(self.root.as_ref().unwrap().reborrow()) // unwrap succeeds because not empty
30034 let root_node = self.root.as_ref()?.reborrow();
30113 let range = Range { inner: self.range.reborrow() };
30258 let range = Range { inner: self.inner.reborrow() };
30331 let root_node = self.root.as_ref()?.reborrow();
30359 let root_node = self.root.as_ref()?.reborrow();
30388 let root_node = self.root.as_ref()?.reborrow();
30471 let root_node = self.root.as_ref()?.reborrow();
30839 Range { inner: root.reborrow().range_search(range) }
31470 edge.reborrow().next_kv().ok().map(Handle::into_kv)
31699 Range { inner: self.inner.reborrow() }
31849 let full_range = root.reborrow().full_range();
32016 /// Models a reborrow of some unique reference, when you know that the reborrow
32035 /// Capture a unique borrow, and immediately reborrow it. For the compiler,
32050 /// The reborrow must have ended, i.e., the reference returned by `new` and
32109 length_a = root_a.reborrow().calc_length();
32111 debug_assert_eq!(length_b, root_b.reborrow().calc_length());
32113 length_b = root_b.reborrow().calc_length();
32115 debug_assert_eq!(length_a, root_a.reborrow().calc_length());
33770 pub fn reborrow(&self) -> LeafRange<marker::Immut<'_>, K, V> {
33772 front: self.front.as_ref().map(|f| f.reborrow()),
33773 back: self.back.as_ref().map(|b| b.reborrow()),
34003 let k = unsafe { ptr::read(kv.reborrow().into_kv().0) };
34004 let v = unsafe { ptr::read(kv.reborrow().into_kv().1) };
34031 let k = unsafe { ptr::read(kv.reborrow().into_kv().0) };
34032 let v = unsafe { ptr::read(kv.reborrow().into_kv().1) };
35396 self.handle.reborrow().into_kv().0
35440 self.handle.reborrow().into_kv().1
35609 let root_node = root.reborrow();
35651 root.reborrow().dump_keys()
37432 let root_node = map.root.as_ref().unwrap().reborrow();
37758 let len = pos.reborrow().into_node().len();
38091 /// Therefore, we have to explicitly call `reborrow` on a more powerfull
38211 pub fn reborrow(&self) -> NodeRef<marker::Immut<'_>, K, V, Type> {
38684 pub fn reborrow(&self) -> Handle<NodeRef<marker::Immut<'_>, K, V, NodeType>, HandleType> {
38686 Handle { node: self.node.reborrow(), idx: self.idx, _marker: PhantomData }
39703 root1.reborrow().assert_back_pointers();
39704 root2.reborrow().assert_back_pointers();
39706 let leaf_edge_1a = root1.reborrow().first_leaf_edge().forget_node_type();
39707 let leaf_edge_1b = root1.reborrow().last_leaf_edge().forget_node_type();
39708 let top_edge_1 = root1.reborrow().first_edge();
39709 let top_edge_2 = root2.reborrow().first_edge();
39849 debug_assert!(self.reborrow().into_node().len() > MIN_LEN);
39856 debug_assert!(self.reborrow().into_node().len() > MIN_LEN);
41583 // it. We do not write to `self` nor reborrow to a mutable reference.