public void insert(double key,double value,double pmiss){
  TableEntry e, ne;
  TableEntry[] table=m_Table;
  int hash=hashCode(key);
  int index=(hash & 0x7FFFFFFF) % table.length;
  for (e=table[index]; e != null; e=e.next) {
    if ((e.hash == hash) && (Math.abs(e.key - key) < EPSILON)) {
      return;
    }
  }
  ne=new TableEntry(hash,key,value,pmiss,table[index]);
  table[index]=ne;
  m_Count++;
  if (m_Count >= m_Threshold) {
    rehash();
  }
}

public void insert ( double key , double value , double pmiss ) { TableEntry e , ne ; TableEntry [ ] table = m_Table ; int hash = hashCode ( key ) ; int index = ( hash & 0x7FFFFFFF ) % table . length ; for ( e = table [ index ] ; e != null ; e = e . next ) { if ( ( e . hash == hash ) && ( Math . abs ( e . key - key ) < EPSILON ) ) { return ; } } ne = new TableEntry ( hash , key , value , pmiss , table [ index ] ) ; table [ index ] = ne ; m_Count ++ ; if ( m_Count >= m_Threshold ) { rehash ( ) ; } }
inserts a new entry in the hashtable using the specified key . if the key already exist in the hashtable , do nothing .
