57     let first = match range.start_bound() {  in to_maple_range()
63     let last = match range.end_bound() {  in to_maple_range()
103     /// let tree = KBox::pin_init(MapleTree::<KBox<i32>>::new(), GFP_KERNEL)?;
105     /// let ten = KBox::new(10, GFP_KERNEL)?;
106     /// let twenty = KBox::new(20, GFP_KERNEL)?;
107     /// let the_answer = KBox::new(42, GFP_KERNEL)?;
142     /// let tree = KBox::pin_init(MapleTree::<KBox<i32>>::new(), GFP_KERNEL)?;
144     /// let ten = KBox::new(10, GFP_KERNEL)?;
145     /// let twenty = KBox::new(20, GFP_KERNEL)?;
146     /// let the_answer = KBox::new(42, GFP_KERNEL)?;
147     /// let hundred = KBox::new(100, GFP_KERNEL)?;
173         let Some((first, last)) = to_maple_range(range) else {  in insert_range()
180         let ptr = T::into_foreign(value);  in insert_range()
183         let res = to_result(unsafe {  in insert_range()
187         if let Err(err) = res {  in insert_range()
189             let value = unsafe { T::from_foreign(ptr) };  in insert_range()
191             let cause = if err == ENOMEM {  in insert_range()
211     /// let tree = KBox::pin_init(MapleTree::<KBox<i32>>::new(), GFP_KERNEL)?;
213     /// let ten = KBox::new(10, GFP_KERNEL)?;
214     /// let twenty = KBox::new(20, GFP_KERNEL)?;
229         let ret = unsafe { bindings::mtree_erase(self.tree.get(), index) };  in erase()
249         let lock_ptr = unsafe { &raw mut (*self.tree.get()).__bindgen_anon_1.ma_lock };  in ma_lock()
263         let mut ma_state = unsafe { MaState::new_raw(self.into_ref().get_ref(), 0, usize::MAX) };  in free_all_entries()
268             let ptr = ma_state.mas_find_raw(usize::MAX);  in free_all_entries()
329     /// let tree = KBox::pin_init(MapleTree::<KBox<i32>>::new(), GFP_KERNEL)?;
331     /// let ten = KBox::new(10, GFP_KERNEL)?;
332     /// let twenty = KBox::new(20, GFP_KERNEL)?;
336     /// let mut lock = tree.lock();
349     /// let tree = KBox::pin_init(MapleTree::<Arc<i32>>::new(), GFP_KERNEL)?;
351     /// let ten = Arc::new(10, GFP_KERNEL)?;
352     /// let twenty = Arc::new(20, GFP_KERNEL)?;
357     /// let value = tree.lock().load(100).map(Arc::from);
369         let ret = unsafe { bindings::mtree_load(self.0.tree.get(), index) };  in load()
384         let tree = pin_init!(MapleTree {  in new()
408     /// let tree = KBox::pin_init(MapleTreeAlloc::<KBox<i32>>::new(), GFP_KERNEL)?;
410     /// let ten = KBox::new(10, GFP_KERNEL)?;
411     /// let twenty = KBox::new(20, GFP_KERNEL)?;
412     /// let thirty = KBox::new(30, GFP_KERNEL)?;
413     /// let hundred = KBox::new(100, GFP_KERNEL)?;
416     /// let idx1 = tree.alloc_range(100, ten, ..1000, GFP_KERNEL)?;
417     /// let idx2 = tree.alloc_range(100, twenty, ..1000, GFP_KERNEL)?;
418     /// let idx3 = tree.alloc_range(100, thirty, ..1000, GFP_KERNEL)?;
441         let Some((min, max)) = to_maple_range(range) else {  in alloc_range()
448         let ptr = T::into_foreign(value);  in alloc_range()
449         let mut index = 0;  in alloc_range()
452         let res = to_result(unsafe {  in alloc_range()
464         if let Err(err) = res {  in alloc_range()
466             let value = unsafe { T::from_foreign(ptr) };  in alloc_range()
468             let cause = if err == ENOMEM {  in alloc_range()
546     /// let tree = KBox::pin_init(MapleTree::<Arc<i32>>::new(), GFP_KERNEL)?;
548     /// let ten = Arc::new(10, GFP_KERNEL)?;
549     /// let twenty = Arc::new(20, GFP_KERNEL)?;
553     /// let mut ma_lock = tree.lock();
554     /// let mut iter = ma_lock.ma_state(0, usize::MAX);
563         let ret = self.mas_find_raw(max);  in find()