/** * Creates a new <code>TDoubleHashSet</code> instance containing the * elements of <tt>array</tt>. * * @param array an array of <code>double</code> primitives * @param strategy used to compute hash codes and to compare keys. */ public TDoubleHashSet(double[] array, TDoubleHashingStrategy strategy) { this(array.length, strategy); addAll(array); }
/** * Creates a new <code>TDoubleHashSet</code> instance containing the * elements of <tt>array</tt>. * * @param array an array of <code>double</code> primitives */ public TDoubleHashSet(double[] array) { this(array.length); addAll(array); }
/** * Compare les X de cette evolution avec <code>_toCompare</code>. Si les x sont diffrents renvoie false et stocke * dans <code>_commonX</code> l'union des valeurs des x. * * @param _toCompare l'evolution a comparer * @param _commonX la liste a remplir avec l'union des x des 2 evolutions si differentes * @return true si identique */ public boolean isEvolutionWithSameX(final EvolutionReguliere _toCompare, final TDoubleHashSet _commonX) { if (_toCompare == null) { return false; } if (t_.equals(_toCompare.t_)) { return true; } if (_commonX != null) { _commonX.ensureCapacity(t_.size() + _toCompare.t_.size()); _commonX.addAll(t_.toNativeArray()); _commonX.addAll(_toCompare.t_.toNativeArray()); } return false; }