public void testAddAllWithEmptyIterator() {
    List<String> alreadyThere = Lists.newArrayList("already", "there");

    boolean changed = Iterators.addAll(alreadyThere, Iterators.<String>emptyIterator());
    assertThat(alreadyThere).containsExactly("already", "there").inOrder();
    assertFalse(changed);
  }

  public void testAddAllToList() {
    List<String> alreadyThere = Lists.newArrayList("already", "there");

  public void testAddAllWithEmptyIterator() {
    List<String> alreadyThere = Lists.newArrayList("already", "there");

    boolean changed = Iterators.addAll(alreadyThere, Iterators.<String>emptyIterator());
    assertThat(alreadyThere).containsExactly("already", "there").inOrder();
    assertFalse(changed);
  }

  public void testAddAllToList() {
    List<String> alreadyThere = Lists.newArrayList("already", "there");

					var changed bool
					clearField := true
					for i, sz := range version.ObjectV2.PartActualSizes {
						if len(version.ObjectV2.PartIndices) > i {
							// 8<<20 is current 'compMinIndexSize', but we detach it in case it should change in the future.
							if sz <= 8<<20 && len(version.ObjectV2.PartIndices[i]) > 0 {
								changed = true
								version.ObjectV2.PartIndices[i] = nil

  }

  /** Remove each element in an iterable from a set. */
  static boolean removeAllImpl(Set<?> set, Iterator<?> iterator) {
    boolean changed = false;
    while (iterator.hasNext()) {
      changed |= set.remove(iterator.next());
    }
    return changed;
  }

  static boolean removeAllImpl(Set<?> set, Collection<?> collection) {
    checkNotNull(collection); // for GWT

                // Could implement transport recreation here in the future

            } catch (Exception e) {
                log.error("Failed to handle address change to: {}", newAddress, e);
            }
        });
    }

    /**
     * Check if multi-channel is enabled
     *
     * @return true if multi-channel is enabled

    - [Other notable changes](#other-notable-changes-14)
- [v1.3.0-alpha.3](#v130-alpha3)
  - [Downloads](#downloads-15)
  - [Changes since v1.3.0-alpha.2](#changes-since-v130-alpha2)
    - [Action Required](#action-required-4)
    - [Other notable changes](#other-notable-changes-15)
- [v1.3.0-alpha.2](#v130-alpha2)
  - [Downloads](#downloads-16)
  - [Changes since v1.3.0-alpha.1](#changes-since-v130-alpha1)

			alterSQL = append(alterSQL, sql)
		}
	}

	if len(alterSQL) != 3 {
		t.Fatalf("decimal changed error,expected: %+v,got: %+v.", expectedSql, alterSQL)
	}
	for i := range alterSQL {
		if alterSQL[i] != expectedSql[i] {
			t.Fatalf("decimal changed error,expected: %+v,got: %+v.", expectedSql, alterSQL)
		}
	}
}

func TestAutoMigrateDecimal(t *testing.T) {

     * be read without locking. Next fields of nodes are immutable (final). All list additions are
     * performed at the front of each bin. This makes it easy to check changes, and also fast to
     * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
     * works well for hash tables since the bin lists tend to be short. (The average length is less
     * than two.)
     *

    upgrading OkHttp. With this change it is now a regular Java class with
    enum-like constants. Application code that uses enum methods on cipher
    suites (`ordinal()`, `name()`, etc.) will break with this change.

 *  Fix: `CertificatePinner` now matches canonicalized hostnames. Previously
    this was case sensitive. This change should also make it easier to configure

		if !slices.Equal(result2, tt.a) {
			t.Errorf(`collect(FieldsSeq(%q)) = %v; want %v`, tt.s, result2, tt.a)
		}

		if string(b) != tt.s {
			t.Errorf("slice changed to %s; want %s", string(b), tt.s)
		}
		if len(tt.a) > 0 {
			if want := tt.a[len(tt.a)-1] + "z"; string(x) != want {
				t.Errorf("last appended result was %s; want %s", x, want)
			}
		}
	}
}