Open
Description
Hey,
I saw you are indexing the Vector of the red black tree with isize instead of usize. I think you want to spare the aligned from using Box.
I think with your solution you can max have 2^63 values in your tree.
I want to show a solution, which spares the alignment but caused in 2^64 values .
But I don't know if it is maybe slower(?).
You can use a raw Pointer, which shows to your list[i] instead of storing the i. Then you can use the null_ptr information as a no existent entry (instead of -1).
T
Metadata
Metadata
Assignees
Labels
No labels