assertEquals(4, ndrBuffer.getIndex());
        assertEquals(System.identityHashCode(obj1), Encdec.dec_uint32le(buffer, 0));

        ndrBuffer.reset();
        ndrBuffer.enc_ndr_referent(obj2, 3);
        assertEquals(4, ndrBuffer.getIndex());
        assertEquals(System.identityHashCode(obj2), Encdec.dec_uint32le(buffer, 0));

        // Test ptr type (type 2) - uses internal referent map

    return new SubscriberExceptionContext(bus, event, target, method);
  }

  @Override
  public final int hashCode() {
    return (31 + method.hashCode()) * 31 + System.identityHashCode(target);
  }

  @Override
  public final boolean equals(@Nullable Object obj) {
    if (obj instanceof Subscriber) {
      Subscriber that = (Subscriber) obj;

    }

    @Override
    public void removeTransport(final SmbTransport trans) {
        if (log.isDebugEnabled()) {
            log.debug("Scheduling transport connection for removal " + trans + " (" + System.identityHashCode(trans) + ")");
        }
        this.toRemove.add((SmbTransportImpl) trans);
    }

    private void cleanup() {
        SmbTransportImpl trans;
        while ((trans = this.toRemove.poll()) != null) {

   */
  public static Equivalence<Object> equals() {
    return Equals.INSTANCE;
  }

  /**
   * Returns an equivalence that uses {@code ==} to compare values and {@link
   * System#identityHashCode(Object)} to compute the hash code. {@link Equivalence#equivalent}
   * returns {@code true} if {@code a == b}, including in the case that a and b are both null.
   *
   * @since 13.0
   * @since 4.0 (in Equivalences)

    }

    /**
     * Generate a unique resource ID
     */
    private String generateResourceId(AutoCloseable resource) {
        return String.format("%s-%d-%d", resource.getClass().getSimpleName(), System.identityHashCode(resource),
                resourceIdCounter.incrementAndGet());
    }

    /**
     * Start the cleanup task
     */
    private void startCleanupTask() {
        if (cleanupTask != null) {

    // WARMUP_MAX), but the tests assume no values get evicted. Even with a maximumSize of 100, one
    // of the values gets evicted. With weak keys, we use identity equality, which means using
    // System.identityHashCode, which means the assignment of keys to segments is nondeterministic,
    // so more than (maximumSize / #segments) keys could get assigned to the same segment, which
    // would cause one to be evicted.

        if (obj == null) {
            enc_ndr_long(0);
            return;
        }
        switch (type) {
        case 1: /* unique */
        case 3: /* ref */
            enc_ndr_long(System.identityHashCode(obj));
            return;
        case 2: /* ptr */
            enc_ndr_long(getDceReferent(obj));
        }
    }

    @Override
    public String toString() {

        if (obj == null) {
            enc_ndr_long(0);
            return;
        }
        switch (type) {
        case 1: /* unique */
        case 3: /* ref */
            enc_ndr_long(System.identityHashCode(obj));
            return;
        case 2: /* ptr */
            enc_ndr_long(getDceReferent(obj));
        }
    }

    @Override
    public String toString() {

    } catch (Exception e) { // sneaky checked exception
      // Default toString() behavior - see Object.toString()
      String objectToString =
          o.getClass().getName() + '@' + Integer.toHexString(System.identityHashCode(o));
      // Logger is created inline with fixed name to avoid forcing Proguard to create another class.
      Logger.getLogger("com.google.common.base.Strings")

    // WARMUP_MAX), but the tests assume no values get evicted. Even with a maximumSize of 100, one
    // of the values gets evicted. With weak keys, we use identity equality, which means using
    // System.identityHashCode, which means the assignment of keys to segments is nondeterministic,
    // so more than (maximumSize / #segments) keys could get assigned to the same segment, which
    // would cause one to be evicted.