Add new API Vector::insert and Vector::remove #96
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR adds
insert
andremove
APIs toVector
.closes: #95
Implementation
Previously, a Node could hold up to
1 << bits
child Nodes. By extending the range of child Nodes to(i << bits) / 2..=1 << bits
, we achieve fasterinsert
andremove
operations. This also makes it easier to implementVector::{push_front, drop_first}
(#17).Regressions
Due to the uncertainty in the number of child elements in a Node, index calculations in methods like
get
have become more complex. As a result,Vector::get
is approximately 3.5 times slower in benchmarks. Additionally, many white-box tests related to the Node structure have been rewritten.