From 2bb7c278c2f7ff897f7738f72534565edde81c06 Mon Sep 17 00:00:00 2001 From: Per Lundberg Date: Mon, 6 May 2019 09:41:57 +0300 Subject: [PATCH] Fix typo --- java/core/src/main/java/com/google/protobuf/RopeByteString.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/java/core/src/main/java/com/google/protobuf/RopeByteString.java b/java/core/src/main/java/com/google/protobuf/RopeByteString.java index f294df3df3..e031839573 100644 --- a/java/core/src/main/java/com/google/protobuf/RopeByteString.java +++ b/java/core/src/main/java/com/google/protobuf/RopeByteString.java @@ -60,7 +60,7 @@ import java.util.NoSuchElementException; *

Fundamentally the Rope algorithm represents the collection of pieces as a binary tree. BAP95 * uses a Fibonacci bound relating depth to a minimum sequence length, sequences that are too short * relative to their depth cause a tree rebalance. More precisely, a tree of depth d is "balanced" - * in the terminology of BAP95 if its length is at least F(d+2), where F(n) is the n-the Fibonacci + * in the terminology of BAP95 if its length is at least F(d+2), where F(n) is the n-th Fibonacci * number. Thus for depths 0, 1, 2, 3, 4, 5,... we have minimum lengths 1, 2, 3, 5, 8, 13,... * * @author carlanton@google.com (Carl Haverl)