third_party/protobuf: Update to HEAD (83d681ee2c)

third_party/protobuf/java/core/src/test/java/com/google/protobuf/LiteEqualsAndHashTest.java

 // Protocol Buffers - Google's data interchange format
 // Copyright 2008 Google Inc.  All rights reserved.
 // https://developers.google.com/protocol-buffers/
 //
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 // notice, this list of conditions and the following disclaimer.
@@ skipping 37 matching lines @@
   public void testEquals() throws Exception {
     // Since the generated equals and hashCode methods for lite messages are a
     // mostly complete subset of those for regular messages, we can mostly assume
     // that the generated methods are already thoroughly tested by the regular tests.
 
     // This test mostly just verifies is that a proto with
     // optimize_for = LITE_RUNTIME and java_generates_equals_and_hash_compiles
     // correctly when linked only against the lite library.
 
     // We do however do some basic testing to make sure that equals is actually
-    // overriden to test for value equality rather than simple object equality.
+    // overridden to test for value equality rather than simple object equality.
 
     // Check that two identical objs are equal.
     Foo foo1a = Foo.newBuilder()
         .setValue(1)
         .addBar(Bar.newBuilder().setName("foo1"))
         .build();
     Foo foo1b = Foo.newBuilder()
         .setValue(1)
         .addBar(Bar.newBuilder().setName("foo1"))
         .build();
@@ skipping 47 matching lines @@
   private void assertEqualsAndHashCodeAreFalse(Object o1, Object o2) {
     assertFalse(o1.equals(o2));
     assertFalse(o1.hashCode() == o2.hashCode());
   }
 
   public void testRecursiveHashcode() {
     // This tests that we don't infinite loop.
     TestRecursiveOneof.getDefaultInstance().hashCode();
   }
 }