scala-rrb-vector
scala-rrb-vector copied to clipboard
Implementation and benchmarking of Scala Vectors with relaxed radix balanced trees for more efficient concatenations
See line 735: ```initFromRoot(withComputedSizes(concat, 7), 7)``` which triggers an assertion error.
I admit the code for RRBVectorReverseIterator makes no sense to me, but I'm pretty sure it is incorrect. Consider the initialization: ``` val idx = endIndex - 1 focusOn(idx) lastIndexOfBlock...
This code at line 504: `if (1024 < thisVecLen && thatVecLen
cleanTopDrop compares sections of the cutIndex with the length of display nodes, for example: `if ((cutIndex >> 5) == display1.length - 2) { ` The problem is that the cutIndex...
For the record, there is a problem in how prependFrontNewBlock determines the insertion depth. The search for the insertion point starts with focusDepth. However, there can be trees for which...
Line 398: makeTransientSizes(display(displayLen).asInstanceOf[Array[Int]], 1) I believe the "1" should be "0".
I'm not sure if anyone cares about this code, but there appears to be an error at line 2866 of rrbvector. When this code determines that the node is balanced,...
Code to reproduce (I cloned the repo to have access to the private methods): ```scala val vec1 = RRBVector.range(0, 1025) val vec2 = RRBVector.range(0, 1025).map(x => -x) // to distinguish...
Hi! I am doing some benchmarking over various RRB vector implementations. I am trying to build an RRBVector that is very relaxed. For that, I am trying to build it...