github/ValueScript
1
1
Fork 0
mirror of https://github.com/voltrevo/ValueScript.git synced 2026-01-10 14:08:09 -05:00
Code Issues Packages Projects Releases Wiki Activity

Split out index_path

Browse Source
This commit is contained in:
Andrew Morris
2023-08-17 11:25:19 +10:00
parent d5357040d2
commit 949c4ee91a
1 changed files with 15 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

33
radix_tree/src/radix_tree.rs
View File

@@ -221,6 +221,17 @@ impl<T: Clone, const N: usize> RadixTree<T, N> {
}
}
}
fn index_path(&self, mut i: usize) -> Vec<usize> {
let mut path = vec![0; self.depth()];
for p in path.iter_mut().rev() {
*p = i % N;
i /= N;
}
path
}
}
impl<T: Clone, const N: usize> Default for RadixTree<T, N> {
@@ -232,17 +243,10 @@ impl<T: Clone, const N: usize> Default for RadixTree<T, N> {
impl<T: Clone, const N: usize> Index<usize> for RadixTree<T, N> {
type Output = T;
fn index(&self, mut i: usize) -> &T {
let mut path = vec![0; self.depth()];
for p in path.iter_mut().rev() {
*p = i % N;
i /= N;
}
fn index(&self, i: usize) -> &T {
let mut tree = self;
for p in path {
for p in tree.index_path(i) {
match tree.data() {
RadixTreeData::Meta(meta) => {
tree = &meta[p];
@@ -258,17 +262,10 @@ impl<T: Clone, const N: usize> Index<usize> for RadixTree<T, N> {
}
impl<T: Clone, const N: usize> IndexMut<usize> for RadixTree<T, N> {
fn index_mut(&mut self, mut i: usize) -> &mut T {
let mut path = vec![0; self.depth()];
for p in path.iter_mut().rev() {
*p = i % N;
i /= N;
}
fn index_mut(&mut self, i: usize) -> &mut T {
let mut tree = self;
for p in path {
for p in tree.index_path(i) {
match tree.data_mut() {
RadixTreeData::Meta(meta) => {
tree = &mut meta[p];