Documentation

An efficient vector type, implemented as a radix tree. It has the following time complexities:

• Lookup: \( O(\log n) \)
• Update: \( O(\log n) \)
• Append: \( O(\log n) \)

The branching factor (base of log) is 32 therefore the time is close to constant in most cases. Note that in practice, lookup is faster than update, and update is faster than append.

Get the size of the RadixVec.

The empty RadixVec.

Lookup in a RadixVec by an index. This does not perform any bounds check.

Update a value in a RadixVec by an index. The value will be forced before installing. This does not perform any bounds check.

Append a value to a RadixVec. The value will be forced before installing. This does not perform any bounds check.