pkg syscall (darwin-386), type IfData struct
pkg syscall (darwin-386), type IfData struct, Addrlen uint8
pkg syscall (darwin-386), type IfData struct, Baudrate uint32
pkg syscall (darwin-386), type IfData struct, Collisions uint32
pkg syscall (darwin-386), type IfData struct, Hdrlen uint8
pkg syscall (darwin-386), type IfData struct, Hwassist uint32
pkg syscall (darwin-386), type IfData struct, Ibytes uint32

pkg syscall (freebsd-riscv64), type IfData struct, Addrlen uint8 #53466
pkg syscall (freebsd-riscv64), type IfData struct, Baudrate uint64 #53466
pkg syscall (freebsd-riscv64), type IfData struct, Collisions uint64 #53466
pkg syscall (freebsd-riscv64), type IfData struct, Datalen uint8 #53466
pkg syscall (freebsd-riscv64), type IfData struct, Epoch int64 #53466

      SortedMap<K, V> map, Entry<? extends K, ? extends V> entry) {
    K key = checkNotNull(entry.getKey());
    V value = checkNotNull(entry.getValue());
    if (map.containsKey(key)) {
      // When a collision happens, the colliding entry is the first entry
      // of the tail map.
      Entry<K, V> previousEntry = map.tailMap(key).entrySet().iterator().next();
      throw new IllegalArgumentException(

			// No IPs seem to intersect, this means that bucket exists but has
			// different IP addresses perhaps from a different deployment.
			// bucket names are globally unique in federation at a given
			// path prefix, name collision is not allowed. We simply log
			// an error and continue.
			bucketsInConflict.Add(bucket)
		}
	}

	// Add/update buckets that are not registered with the DNS

        // probably intended. So no point in using an equal-but-different factory argument.
        // We check twice to avoid confusion caused by accidental hash collision.
        equalArgs.set(i, shouldBeEqualArg);
      }
    }
    return equalArgs;
  }

  private static boolean hashCodeInsensitiveToArgReference(

    assertSame(value, segment.get(key, hash));
    assertTrue(segment.containsKey(key, hash));
    assertTrue(segment.containsValue(value));
    assertFalse(segment.containsValue(nullValue));

    // hash collision
    DummyEntry<Object, Object> dummy = DummyEntry.create(new Object(), hash, entry);
    Object dummyValue = new Object();
    ValueReference<Object, Object> dummyValueRef = map.newValueReference(dummy, dummyValue, 1);

    assertSame(value, segment.get(key, hash));
    assertTrue(segment.containsKey(key, hash));
    assertTrue(segment.containsValue(value));
    assertFalse(segment.containsValue(nullValue));

    // hash collision
    DummyEntry<Object, Object> dummy = DummyEntry.create(new Object(), hash, entry);
    Object dummyValue = new Object();
    ValueReference<Object, Object> dummyValueRef = map.newValueReference(dummy, dummyValue, 1);

      int leftCode = identityHashCode(left);
      int rightCode = identityHashCode(right);
      if (leftCode != rightCode) {
        return leftCode < rightCode ? -1 : 1;
      }

      // identityHashCode collision (rare, but not as rare as you'd think)
      int result = getUid(left).compareTo(getUid(right));
      if (result == 0) {
        throw new AssertionError(); // extremely, extremely unlikely.
      }

        automatically for model weights now include either a `/histogram` or
        `/image` suffix in their tag names, in order to prevent tag name
        collisions across summary types.

*   When running on GPU (with cuDNN version 7.6.3 or
    later),`tf.nn.depthwise_conv2d` backprop to `filter` (and therefore also

      int leftCode = identityHashCode(left);
      int rightCode = identityHashCode(right);
      if (leftCode != rightCode) {
        return leftCode < rightCode ? -1 : 1;
      }

      // identityHashCode collision (rare, but not as rare as you'd think)
      int result = getUid(left).compareTo(getUid(right));
      if (result == 0) {
        throw new AssertionError(); // extremely, extremely unlikely.
      }