other commercial damages or losses), even if such Contributor
      has been advised of the possibility of such damages.

   9. Accepting Warranty or Additional Liability. While redistributing
      the Work or Derivative Works thereof, You may choose to offer,
      and charge a fee for, acceptance of support, warranty, indemnity,
      or other liability obligations and/or rights consistent with this

     */
    public void setLastmod(final String lastmod) {
        this.lastmod = lastmod;
    }

    /**
     * Checks if this SitemapFile is equal to another object.
     * @param obj the object to compare with
     * @return true if the objects are equal, false otherwise
     */
    @Override
    public boolean equals(final Object obj) {
        if (this == obj) {

constraints.DecimalMin.message = {item} moet groter zijn dan {value}.
constraints.Digits.message = {item} moet een getal zijn. (Verwacht: <getal>.<getal>)
constraints.Future.message = {item} moet een toekomstige waarde zijn.
constraints.Max.message = {item} moet kleiner of gelijk zijn aan {value}.
constraints.Min.message = {item} moet groter of gelijk zijn aan {value}.
constraints.NotNull.message = {item} is niet ingevuld.

    @SuppressWarnings("CanIgnoreReturnValueSuggester")
    Builder<K, V> combine(ImmutableSortedMap.Builder<K, V> other) {
      ensureCapacity(size + other.size);
      System.arraycopy(other.keys, 0, this.keys, this.size, other.size);
      System.arraycopy(other.values, 0, this.values, this.size, other.size);
      size += other.size;
      return this;
    }

    /**
     * Returns a newly-created immutable sorted map.
     *

   * Returns true if the edges in this graph are directed. Directed edges connect a {@link
   * EndpointPair#source() source node} to a {@link EndpointPair#target() target node}, while
   * undirected edges connect a pair of nodes to each other.
   */
  boolean isDirected();

  /**
   * Returns true if this graph allows self-loops (edges that connect a node to itself). Attempting
   * to add a self-loop to a graph that does not allow them will throw an {@link

            TestServerMessageBlock2 other = new TestServerMessageBlock2(mockConfig);
            testMessage.setMid(12345L);
            other.setMid(12345L);

            assertTrue(testMessage.equals(other));
        }

        @Test
        @DisplayName("Should not be equal when MIDs differ")
        void testNotEqualsDifferentMid() {
            TestServerMessageBlock2 other = new TestServerMessageBlock2(mockConfig);

            when(mockReferral.getNode()).thenReturn("\\otherserver\\share\\path");
            DfsReferralDataImpl other =
                    DfsReferralDataImpl.fromReferral(mockReferral, "\\\\otherserver\\share\\path", System.currentTimeMillis() + 10000, 20);

            assertNotEquals(data1, other);
        }

        @Test
        @DisplayName("Should not be equal with different share")

 * limitations under the License.
 */

package com.google.common.collect.testing;

import com.google.common.annotations.GwtIncompatible;
import java.util.Set;

/**
 * Reserializes the sets created by another test set generator.
 *
 * <p>TODO: make CollectionTestSuiteBuilder test reserialized collections
 *
 * @author Jesse Wilson
 */
@GwtIncompatible

 *
 * @author Chris Nokleberg
 * @since 1.0
 */
@J2ktIncompatible
@GwtIncompatible
public final class CountingOutputStream extends FilterOutputStream {

  private long count;

  /**
   * Wraps another output stream, counting the number of bytes written.
   *
   * @param out the output stream to be wrapped
   */
  public CountingOutputStream(OutputStream out) {
    super(checkNotNull(out));
  }

    // faster (and that's debatable), but definitely more memory-hungry. We're
    // choosing to turn .precomputed() into a no-op in GWT, because it doesn't
    // seem to be a worthwhile tradeoff in a browser.
    return matcher;
  }

  static String formatCompact4Digits(double value) {
    return toPrecision(value, 4);
  }

  @JsMethod(name = "Number.prototype.toPrecision.call", namespace = JsPackage.GLOBAL)