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

    /**
     * Compare two ints for equality.
     */
    private static boolean eq(int v1, int v2) {
      return v1 == v2;
    }
  }

  /**
   * 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] = 0;
    super.removeAt(index);  // clear key, state; adjust size
  }

  /**
   * Returns the values of the map.
   *
   * @return a <code>Collection</code> value
   */
  public int[] getValues() {
    int[] vals = new int[size()];
    int[] v = _values;
    byte[] states = _states;

    if (states != null) {
      for (int i = states.length, j = 0; i-- > 0; ) {
        if (states[i] == FULL) {
          vals[j++] = v[i];
        }
      }
    }
    return vals;
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



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

    /**
     * Compare two ints for equality.
     */
    private static boolean eq(int v1, int v2) {
      return v1 == v2;
    }
  }

  /**
   * 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] = 0;
    super.removeAt(index);  // clear key, state; adjust size
  }

  /**
   * Returns the values of the map.
   *
   * @return a <code>Collection</code> value
   */
  public int[] getValues() {
    int[] vals = new int[size()];
    int[] v = _values;
    byte[] states = _states;

    if (states != null) {
      for (int i = states.length, j = 0; i-- > 0; ) {
        if (states[i] == FULL) {
          vals[j++] = v[i];
        }
      }
    }
    return vals;
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -