Lines Matching defs:Immut
29953 node: NodeRef<marker::Immut<'a>, K, V, marker::LeafOrInternal>,
30231 inner: LeafRange<marker::Immut<'a>, K, V>,
33770 pub fn reborrow(&self) -> LeafRange<marker::Immut<'_>, K, V> {
33790 /// Unless `BorrowType` is `Immut`, do not use the handles to visit the same
33852 impl<'a, K: 'a, V: 'a> NodeRef<marker::Immut<'a>, K, V, marker::LeafOrInternal> {
33857 pub fn range_search<Q, R>(self, range: R) -> LeafRange<marker::Immut<'a>, K, V>
33868 pub fn full_range(self) -> LeafRange<marker::Immut<'a>, K, V> {
34057 impl<'a, K, V> Handle<NodeRef<marker::Immut<'a>, K, V, marker::Leaf>, marker::Edge> {
34189 impl<'a, K: 'a, V: 'a> NodeRef<marker::Immut<'a>, K, V, marker::LeafOrInternal> {
34195 F: FnMut(Position<marker::Immut<'a>, K, V>),
35684 impl<'a, K: 'a, V: 'a> NodeRef<marker::Immut<'a>, K, V, marker::LeafOrInternal> {
38062 /// - When this is `Immut<'a>`, the `NodeRef` acts roughly like `&'a Node`.
38089 /// Therefore, we define it only for the least powerful type `Immut<'a>`.
38090 /// - We cannot get implicit coercion from say `Mut<'a>` to `Immut<'a>`.
38121 impl<'a, K: 'a, V: 'a, Type> Copy for NodeRef<marker::Immut<'a>, K, V, Type> {}
38122 impl<'a, K: 'a, V: 'a, Type> Clone for NodeRef<marker::Immut<'a>, K, V, Type> {
38130 unsafe impl<'a, K: Sync + 'a, V: Sync + 'a, Type> Send for NodeRef<marker::Immut<'a>, K, V, Type> {}
38211 pub fn reborrow(&self) -> NodeRef<marker::Immut<'_>, K, V, Type> {
38290 impl<'a, K: 'a, V: 'a, Type> NodeRef<marker::Immut<'a>, K, V, Type> {
38294 // SAFETY: there can be no mutable references into this tree borrowed as `Immut`.
38684 pub fn reborrow(&self) -> Handle<NodeRef<marker::Immut<'_>, K, V, NodeType>, HandleType> {
38923 impl<'a, K: 'a, V: 'a, NodeType> Handle<NodeRef<marker::Immut<'a>, K, V, NodeType>, marker::KV> {
39540 pub struct Immut<'a>(PhantomData<&'a ()>);
39556 impl<'a> BorrowType for Immut<'a> {}
39635 impl<'a, K: 'a, V: 'a> NodeRef<marker::Immut<'a>, K, V, marker::LeafOrInternal> {