/** {@inheritDoc} */ public boolean containsAll( int[] array ) { for ( int element : array ) { if ( ! TIntIntHashMap.this.contains( element ) ) { return false; } } return true; }
/** {@inheritDoc} */ public boolean contains( int entry ) { return TIntIntHashMap.this.contains( entry ); }
/** {@inheritDoc} */ public boolean containsKey( int key ) { return contains( key ); }
if(index.contains(ngramidx)) assert(index.get(ngramidx) == n1gramidx); else
/** {@inheritDoc} */ @Override public boolean contains( int entry ) { return TIntIntHashMap.this.contains( entry ); }
/** {@inheritDoc} */ public boolean containsAll( int[] array ) { for ( int element : array ) { if ( ! TIntIntHashMap.this.contains( element ) ) { return false; } } return true; }
/** {@inheritDoc} */ public boolean contains( int entry ) { return TIntIntHashMap.this.contains( entry ); }
/** {@inheritDoc} */ public boolean containsAll( int[] array ) { for ( int element : array ) { if ( ! TIntIntHashMap.this.contains( element ) ) { return false; } } return true; }
/** {@inheritDoc} */ public boolean contains( int entry ) { return TIntIntHashMap.this.contains( entry ); }
/** {@inheritDoc} */ public boolean containsKey( int key ) { return contains( key ); }
/** {@inheritDoc} */ @Override public boolean containsKey( int key ) { return contains( key ); }
/** {@inheritDoc} */ @Override public boolean containsAll( int[] array ) { for ( int element : array ) { if ( ! TIntIntHashMap.this.contains( element ) ) { return false; } } return true; }
/** {@inheritDoc} */ public boolean containsAll( int[] array ) { for ( int element : array ) { if ( ! TIntIntHashMap.this.contains( element ) ) { return false; } } return true; }
@Override public boolean isUsed(int key) { return data.contains(key); }
/** √See {@link gnu.trove.map.hash.TIntIntHashMap#contains(int)} */ public boolean contains(int val) { return delegate.contains(val); }
/** {@inheritDoc} */ public boolean containsKey( int key ) { return contains( key ); }
/** √See {@link gnu.trove.map.hash.TIntIntHashMap#contains(int)} */ public boolean contains(int val) { return delegate.contains(val); }
/** {@inheritDoc} */ public boolean contains( int entry ) { return TIntIntHashMap.this.contains( entry ); }
/** {@inheritDoc} */ public boolean containsKey( int key ) { return contains( key ); }
@Override public boolean execute(final int rowIndex) { final Vector row = mat.row(rowIndex); for (final Entry ent : row.entries()) { if (actualCols.contains(ent.index)) { ret.put(seenrows, actualCols.get(ent.index), ent.value); } } seenrows++; return true; } });