core/src/main/java/gnu/trove/TIntObjectHashMap.java [460:497]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      int index = _otherMap.index(key);
      return index >= 0 && eq(value, _otherMap.get(key));
    }

    /**
     * Compare two objects for equality.
     */
    private static boolean eq(Object o1, Object o2) {
      return Objects.equals(o1, o2);
    }
  }

  /**
   * removes the mapping at <tt>index</tt> from the map.
   *
   * @param index an <code>int</code> value
   */
  @Override
  protected void removeAt(int index) {
    _values[index] = (V)TObjectHash.REMOVED;
    super.removeAt(index);  // clear key, set; adjust size
  }

  /**
   * Returns the values of the map.
   *
   * @return a value <code>array</code>
   */
  public Object[] getValues() {
    Object[] vals = new Object[size()];
    V[] values = _values;

    for (int i = values.length, j = 0; i-- > 0; ) {
      if (isFull(values, i)) {
        vals[j++] = unwrapNull(values[i]);
      }
    }
    return vals;
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



core/src/main/java/gnu/trove/TLongObjectHashMap.java [454:491]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
      int index = _otherMap.index(key);
      return index >= 0 && eq(value, _otherMap.get(key));
    }

    /**
     * Compare two objects for equality.
     */
    private static boolean eq(Object o1, Object o2) {
      return Objects.equals(o1, o2);
    }
  }

  /**
   * removes the mapping at <tt>index</tt> from the map.
   *
   * @param index an <code>int</code> value
   */
  @Override
  protected void removeAt(int index) {
    _values[index] = (V)TObjectHash.REMOVED;
    super.removeAt(index);  // clear key, set; adjust size
  }

  /**
   * Returns the values of the map.
   *
   * @return a value <code>array</code>
   */
  public Object[] getValues() {
    Object[] vals = new Object[size()];
    V[] values = _values;

    for (int i = values.length, j = 0; i-- > 0; ) {
      if (isFull(values, i)) {
        vals[j++] = unwrapNull(values[i]);
      }
    }
    return vals;
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -