/** * Creates a new <code>TDoubleIntHashMap</code> instance containing * all of the entries in the map passed in. * * @param map a <tt>TDoubleIntMap</tt> that will be duplicated. */ public TDoubleIntHashMap( TDoubleIntMap map ) { super( map.size() ); if ( map instanceof TDoubleIntHashMap ) { TDoubleIntHashMap hashmap = ( TDoubleIntHashMap ) map; this._loadFactor = hashmap._loadFactor; this.no_entry_key = hashmap.no_entry_key; this.no_entry_value = hashmap.no_entry_value; //noinspection RedundantCast if ( this.no_entry_key != ( double ) 0 ) { Arrays.fill( _set, this.no_entry_key ); } //noinspection RedundantCast if ( this.no_entry_value != ( int ) 0 ) { Arrays.fill( _values, this.no_entry_value ); } setUp( (int) Math.ceil( DEFAULT_CAPACITY / _loadFactor ) ); } putAll( map ); }
/** * Creates a new <code>TDoubleIntHashMap</code> instance containing * all of the entries in the map passed in. * * @param map a <tt>TDoubleIntMap</tt> that will be duplicated. */ public TDoubleIntHashMap( TDoubleIntMap map ) { super( map.size() ); if ( map instanceof TDoubleIntHashMap ) { TDoubleIntHashMap hashmap = ( TDoubleIntHashMap ) map; this._loadFactor = hashmap._loadFactor; this.no_entry_key = hashmap.no_entry_key; this.no_entry_value = hashmap.no_entry_value; //noinspection RedundantCast if ( this.no_entry_key != ( double ) 0 ) { Arrays.fill( _set, this.no_entry_key ); } //noinspection RedundantCast if ( this.no_entry_value != ( int ) 0 ) { Arrays.fill( _values, this.no_entry_value ); } setUp( (int) Math.ceil( DEFAULT_CAPACITY / _loadFactor ) ); } putAll( map ); }
/** * Creates a new <code>TDoubleIntHashMap</code> instance containing * all of the entries in the map passed in. * * @param map a <tt>TDoubleIntMap</tt> that will be duplicated. */ public TDoubleIntHashMap( TDoubleIntMap map ) { super( map.size() ); if ( map instanceof TDoubleIntHashMap ) { TDoubleIntHashMap hashmap = ( TDoubleIntHashMap ) map; this._loadFactor = hashmap._loadFactor; this.no_entry_key = hashmap.no_entry_key; this.no_entry_value = hashmap.no_entry_value; //noinspection RedundantCast if ( this.no_entry_key != ( double ) 0 ) { Arrays.fill( _set, this.no_entry_key ); } //noinspection RedundantCast if ( this.no_entry_value != ( int ) 0 ) { Arrays.fill( _values, this.no_entry_value ); } setUp( (int) Math.ceil( DEFAULT_CAPACITY / _loadFactor ) ); } putAll( map ); }
/** * Creates a new <code>TDoubleIntHashMap</code> instance containing * all of the entries in the map passed in. * * @param map a <tt>TDoubleIntMap</tt> that will be duplicated. */ public TDoubleIntHashMap( TDoubleIntMap map ) { super( map.size() ); if ( map instanceof TDoubleIntHashMap ) { TDoubleIntHashMap hashmap = ( TDoubleIntHashMap ) map; this._loadFactor = hashmap._loadFactor; this.no_entry_key = hashmap.no_entry_key; this.no_entry_value = hashmap.no_entry_value; //noinspection RedundantCast if ( this.no_entry_key != ( double ) 0 ) { Arrays.fill( _set, this.no_entry_key ); } //noinspection RedundantCast if ( this.no_entry_value != ( int ) 0 ) { Arrays.fill( _values, this.no_entry_value ); } setUp( (int) Math.ceil( DEFAULT_CAPACITY / _loadFactor ) ); } putAll( map ); }
/** * Creates a new <code>TDoubleIntHashMap</code> instance containing * all of the entries in the map passed in. * * @param map a <tt>TDoubleIntMap</tt> that will be duplicated. */ public TDoubleIntHashMap( TDoubleIntMap map ) { super( map.size() ); if ( map instanceof TDoubleIntHashMap ) { TDoubleIntHashMap hashmap = ( TDoubleIntHashMap ) map; this._loadFactor = Math.abs( hashmap._loadFactor ); this.no_entry_key = hashmap.no_entry_key; this.no_entry_value = hashmap.no_entry_value; //noinspection RedundantCast if ( this.no_entry_key != ( double ) 0 ) { Arrays.fill( _set, this.no_entry_key ); } //noinspection RedundantCast if ( this.no_entry_value != ( int ) 0 ) { Arrays.fill( _values, this.no_entry_value ); } setUp( saturatedCast( fastCeil( DEFAULT_CAPACITY / (double) _loadFactor ) ) ); } putAll( map ); }