Please sign in to comment.
- Loading branch information...
Showing with 3 additions and 2 deletions.
|@@ -53,8 +53,9 @@ Since Scala's Vectors are immutable balanced 32-ary trees rather than binary|
|trees, all these operations (lookup, insert, remove, replace) take|
|`O(log32(n))` time instead of `O(log2(n))` time. Given the max size of a|
|machine integer on the JVM (`2^31`, or `2147483648`) that means it never takes|
|more than 6 steps to perform an operation on the Vector. So far, all this is|
|true and uncontroversial.|
|more than 6 steps to perform an operation on the Vector.|
|So far, all this is true and uncontroversial.|
|According to the [official Scala documentation], this makes those operations|
|take "effectively constant" time. It is that the widely repeated claim that is|