/** {@inheritDoc} */ public boolean contains( double entry ) { return TDoubleIntHashMap.this.contains( entry ); }
/** {@inheritDoc} */ public boolean containsAll( double[] array ) { for ( double element : array ) { if ( ! TDoubleIntHashMap.this.contains( element ) ) { return false; } } return true; }
/** {@inheritDoc} */ public boolean containsKey( double key ) { return contains( key ); }
/** {@inheritDoc} */ public boolean contains( double entry ) { return TDoubleIntHashMap.this.contains( entry ); }
/** {@inheritDoc} */ public boolean containsAll( double[] array ) { for ( double element : array ) { if ( ! TDoubleIntHashMap.this.contains( element ) ) { return false; } } return true; }
/** {@inheritDoc} */ @Override public boolean contains( double entry ) { return TDoubleIntHashMap.this.contains( entry ); }
/** {@inheritDoc} */ public boolean containsKey( double key ) { return contains( key ); }
/** {@inheritDoc} */ @Override public boolean containsKey( double key ) { return contains( key ); }
/** {@inheritDoc} */ public boolean containsKey( double key ) { return contains( key ); }
/** {@inheritDoc} */ @Override public boolean containsAll( double[] array ) { for ( double element : array ) { if ( ! TDoubleIntHashMap.this.contains( element ) ) { return false; } } return true; }
/** {@inheritDoc} */ public boolean containsAll( double[] array ) { for ( double element : array ) { if ( ! TDoubleIntHashMap.this.contains( element ) ) { return false; } } return true; }
/** {@inheritDoc} */ public boolean containsAll( double[] array ) { for ( double element : array ) { if ( ! TDoubleIntHashMap.this.contains( element ) ) { return false; } } return true; }
/** {@inheritDoc} */ public boolean contains( double entry ) { return TDoubleIntHashMap.this.contains( entry ); }
/** {@inheritDoc} */ public boolean containsKey( double key ) { return contains( key ); }
/** {@inheritDoc} */ public boolean contains( double entry ) { return TDoubleIntHashMap.this.contains( entry ); }