Update to the newer and faster variant of the code

Author: eregon

src/main/java/org/truffleruby/core/rope/LazyIntRope.java

@@ -40,24 +40,20 @@ protected LazyIntRope(int value, Encoding encoding, int length) {
             9999999,
             99999999,
             999999999,
-            2147483647 };
+            Integer.MAX_VALUE };
 
+    // From https://github.com/lemire/Code-used-on-Daniel-Lemire-s-blog/blob/master/2021/05/28/digitcount.java
     private static int length(int value) {
-        if (CompilerDirectives.injectBranchProbability(CompilerDirectives.UNLIKELY_PROBABILITY, value == 0)) {
-            return 1;
-        }
-
         final int sign;
-
         if (CompilerDirectives.injectBranchProbability(CompilerDirectives.UNLIKELY_PROBABILITY, value < 0)) {
             sign = 1;
             value = -value;
         } else {
             sign = 0;
         }
 
-        final int bits = 31 - Integer.numberOfLeadingZeros(value);
-        int digits = ((77 * bits) >>> 8);
+        final int bits = 31 - Integer.numberOfLeadingZeros(value | 1);
+        int digits = ((9 * bits) >>> 5);
 
         if (value > LENGTH_TABLE[digits]) {
             digits += 1;