aboutsummaryrefslogtreecommitdiffhomepage
path: root/ruby/ext
diff options
context:
space:
mode:
authorGravatar Joshua Haberman <jhaberman@gmail.com>2016-02-11 17:17:48 -0800
committerGravatar Joshua Haberman <jhaberman@gmail.com>2016-02-11 17:17:48 -0800
commit3ee2e20539294c0baff879d5c5164540c8749a2b (patch)
tree107f6ae86fc18a1a11b6230383d1b7c8007db37c /ruby/ext
parentcaf1fb7197ee94c07108fc7cfbca07432b185a28 (diff)
parent86325d7c95af4c82f7531b21c6d845fad8a4a2bb (diff)
Merge pull request #1144 from dongjoon-hyun/remove_redundant_the
Remove redundant `the`.
Diffstat (limited to 'ruby/ext')
-rw-r--r--ruby/ext/google/protobuf_c/upb.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/ruby/ext/google/protobuf_c/upb.c b/ruby/ext/google/protobuf_c/upb.c
index 048a163a..9e6aa674 100644
--- a/ruby/ext/google/protobuf_c/upb.c
+++ b/ruby/ext/google/protobuf_c/upb.c
@@ -8537,7 +8537,7 @@ bool upb_pbdecoder_setmaxnesting(upb_pbdecoder *d, size_t max) {
** to perfectly match the output of reference encoders that always use the
** optimal amount of space for each length.
**
-** (2) requires guessing the the size upfront, and if multiple lengths are
+** (2) requires guessing the size upfront, and if multiple lengths are
** guessed wrong the minimum required number of memmove() operations may
** be complicated to compute correctly. Implemented properly, it may have
** a useful amortized or average cost, but more investigation is required