25     tree: RBTree<usize, Descriptor<T>>,
29     size: usize,
30     free_oneway_space: usize,
35         size: usize,  in from_array()  argument
99     pub(crate) fn total_size(&self) -> usize {  in total_size()  argument
103     pub(crate) fn free_oneway_space(&self) -> usize {  in free_oneway_space()  argument
107     pub(crate) fn count_buffers(&self) -> usize {  in count_buffers()  argument
142     fn find_best_match(&mut self, size: usize) -> Option<&mut Descriptor<T>> {  in find_best_match()
151         debug_id: usize,  in reserve_new()  argument
152         size: usize,  in reserve_new()  argument
156     ) -> Result<(usize, bool)> {  in reserve_new()  argument
209     pub(crate) fn reservation_abort(&mut self, offset: usize) -> Result<FreedRange> {  in reservation_abort()
258             0 => usize::MAX,  in reservation_abort()
264             0 => usize::MAX,  in reservation_abort()
309     pub(crate) fn reservation_commit(&mut self, offset: usize, data: &mut Option<T>) -> Result {  in reservation_commit()  argument
328     pub(crate) fn reserve_existing(&mut self, offset: usize) -> Result<(usize, usize, Option<T>)> {  in reserve_existing()  argument
361     pub(crate) fn take_for_each<F: Fn(usize, usize, usize, Option<T>)>(&mut self, callback: F) {  in take_for_each()  argument
401     size: usize,
402     offset: usize,
407     fn new(offset: usize, size: usize) -> Self {  in new()  argument
426 type FreeKey = (usize, usize);
431     tree_node_res: RBTreeNodeReservation<usize, Descriptor<T>>,
452         RBTreeNode<usize, Descriptor<T>>,  in initialize()  argument
468     tree: KVec<RBTreeNodeReservation<usize, Descriptor<T>>>,
473     pub(crate) fn try_new(len: usize) -> Result<Self> {  in try_new()