---

chemelnucfin · pongad · commit 0f4c06f6aa6d · 2018-03-14T09:39:52.000+11:00
yaml --- r: 9225 b: refs/heads/spanner-gapic-migration c: 9958b84 h: refs/heads/master i: 9223: 4b8c938
diff --git a/[refs] b/[refs]
@@ -81,7 +81,7 @@ refs/tags/v0.35.0: c28951c5f4cc97a1be07900d19df6984115a4bd6
 refs/tags/v0.36.0: 6b75c61f73e6827b3ca379bd54f88f750290162f
 refs/tags/v0.37.0: db2e142f92601709fdd48db159776f905742e30f
 refs/heads/mrschmidt-sizefix: 627a3bfa30bb6f4f76af47b228c38b208dd921e0
-refs/heads/spanner-gapic-migration: bc07a352e1976d29ebe083c15cce6f227b4e0e50
+refs/heads/spanner-gapic-migration: 9958b845a1b5b09525770b261c3cb857e1c57f1b
 refs/tags/v0.38.0: c235ee4df5e1248e1769dae3f86a0d7ab7fd8301
 refs/tags/v0.39.0: ab231c9d22475242a43d6d9554aa4a3f736dab01
 refs/tags/v0.40.0: a1d5b05206cce7734365f1b910396a2c9d6605ec
diff --git a/branches/spanner-gapic-migration/google-cloud-firestore/src/main/java/com/google/cloud/firestore/collection/ArraySortedMap.java b/branches/spanner-gapic-migration/google-cloud-firestore/src/main/java/com/google/cloud/firestore/collection/ArraySortedMap.java
@@ -274,7 +274,7 @@ private static <T> T[] replaceInArray(T[] arr, int pos, T value) {
 
   /**
    * This does a linear scan which is simpler than a binary search. For a small collection size this
-   * still should be as fast a as binary search.
+   * still should be as fast as binary search.
    */
   private int findKeyOrInsertPosition(K key) {
     int newPos = 0;
@@ -286,7 +286,7 @@ private int findKeyOrInsertPosition(K key) {
 
   /**
    * This does a linear scan which is simpler than a binary search. For a small collection size this
-   * still should be as fast a as binary search.
+   * still should be as fast as binary search.
    */
   private int findKey(K key) {
     int i = 0;
