public TIntObjectIterator getIterator() { return idxListSelection_.iterator(); }
/** * Return the total number of selected index. */ public int getNbSelectedItem() { int r = 0; final TIntObjectIterator it = idxListSelection_.iterator(); for (int i = idxListSelection_.size(); i-- > 0;) { it.advance(); r += ((CtuluListSelection) it.value()).getNbSelectedIndex(); } return r; }
public double[] getValueForVariable(final int _idxVariable) { final double[] r = new double[nbPt_]; final TIntObjectIterator it = result_.iterator(); for (int i = result_.size(); i-- > 0;) { it.advance(); r[it.key()] = ((double[]) it.value())[_idxVariable]; } return r; }
public Set sepsetPotentials() { THashSet set = new THashSet(); TIntObjectIterator it = sepsets.iterator(); while (it.hasNext()) { it.advance(); Factor ptl = ((Sepset) it.value()).ptl; set.add(ptl); } return set; }
public Set sepsetPotentials() { THashSet set = new THashSet(); TIntObjectIterator it = sepsets.iterator(); while (it.hasNext()) { it.advance(); Factor ptl = ((Sepset) it.value()).ptl; set.add(ptl); } return set; }
public Set sepsetPotentials() { THashSet set = new THashSet(); TIntObjectIterator it = sepsets.iterator(); while (it.hasNext()) { it.advance(); Factor ptl = ((Sepset) it.value()).ptl; set.add(ptl); } return set; }
public boolean isEmpty() { if (idxListSelection_.isEmpty()) { return true; } final TIntObjectIterator it = idxListSelection_.iterator(); for (int i = idxListSelection_.size(); i-- > 0;) { it.advance(); if (!(((CtuluListSelection) it.value()).isEmpty())) { return false; } } return true; }
public boolean isNaN() { int n = cpfs.length; for (int i = 0; i < n; i++) if (cpfs[i].isNaN()) return true; // And the sepset potentials TIntObjectIterator it = sepsets.iterator(); while (it.hasNext()) { it.advance(); Factor ptl = ((Sepset) it.value()).ptl; if (ptl.isNaN()) return true; } return false; }
public boolean isNaN() { int n = cpfs.length; for (int i = 0; i < n; i++) if (cpfs[i].isNaN()) return true; // And the sepset potentials TIntObjectIterator it = sepsets.iterator(); while (it.hasNext()) { it.advance(); Factor ptl = ((Sepset) it.value()).ptl; if (ptl.isNaN()) return true; } return false; }
public boolean isNaN() { int n = cpfs.length; for (int i = 0; i < n; i++) if (cpfs[i].isNaN()) return true; // And the sepset potentials TIntObjectIterator it = sepsets.iterator(); while (it.hasNext()) { it.advance(); Factor ptl = ((Sepset) it.value()).ptl; if (ptl.isNaN()) return true; } return false; }
void clearCPFs() { for (int i = 0; i < cpfs.length; i++) { cpfs[i] = new TableFactor ((VarSet) lookupVertex (i)); } TIntObjectIterator it = sepsets.iterator(); while (it.hasNext()) { it.advance(); Sepset sepset = (Sepset) it.value(); sepset.ptl = newSepsetPtl (sepset.set); } }
/** Normalizes all potentials in the tree, both node and sepset. */ public void normalizeAll() { int n = cpfs.length; for (int i = 0; i < n; i++) { if (cpfs[i] != null) { cpfs[i].normalize(); } } TIntObjectIterator it = sepsets.iterator(); while (it.hasNext()) { it.advance(); Factor ptl = ((Sepset) it.value()).ptl; ptl.normalize(); } }
/** Normalizes all potentials in the tree, both node and sepset. */ public void normalizeAll() { int n = cpfs.length; for (int i = 0; i < n; i++) { if (cpfs[i] != null) { cpfs[i].normalize(); } } TIntObjectIterator it = sepsets.iterator(); while (it.hasNext()) { it.advance(); Factor ptl = ((Sepset) it.value()).ptl; ptl.normalize(); } }
/** Normalizes all potentials in the tree, both node and sepset. */ public void normalizeAll() { int n = cpfs.length; for (int i = 0; i < n; i++) { if (cpfs[i] != null) { cpfs[i].normalize(); } } TIntObjectIterator it = sepsets.iterator(); while (it.hasNext()) { it.advance(); Factor ptl = ((Sepset) it.value()).ptl; ptl.normalize(); } }
void clearCPFs() { for (int i = 0; i < cpfs.length; i++) { cpfs[i] = new TableFactor ((VarSet) lookupVertex (i)); } TIntObjectIterator it = sepsets.iterator(); while (it.hasNext()) { it.advance(); Sepset sepset = (Sepset) it.value(); sepset.ptl = newSepsetPtl (sepset.set); } }
/** * Constructor * * @param map */ public TIntObjectHashMap(TIntObjectHashMap<V> map) { this(new gnu.trove.map.hash.TIntObjectHashMap<>()); TIntObjectIterator<V> iterator = map.iterator(); while (iterator.hasNext()) { iterator.advance(); delegate.put(iterator.key(), iterator.value()); } }
void clearCPFs() { for (int i = 0; i < cpfs.length; i++) { cpfs[i] = new TableFactor ((VarSet) lookupVertex (i)); } TIntObjectIterator it = sepsets.iterator(); while (it.hasNext()) { it.advance(); Sepset sepset = (Sepset) it.value(); sepset.ptl = newSepsetPtl (sepset.set); } }
/** * Constructor * * @param map */ public TIntObjectHashMap(TIntObjectHashMap<V> map) { this(new gnu.trove.map.hash.TIntObjectHashMap<>()); TIntObjectIterator<V> iterator = map.iterator(); while (iterator.hasNext()) { iterator.advance(); delegate.put(iterator.key(), iterator.value()); } }
public InterpolationResultsHolder getCopy() { final TIntObjectHashMap retMap = new TIntObjectHashMap(result_); final TIntObjectIterator it = result_.iterator(); for (int i = result_.size(); i-- > 0;) { it.advance(); retMap.put(it.key(), CtuluLibArray.copy((double[]) it.value())); } final InterpolationResultsHolder ret = new InterpolationResultsHolder(variable_, nbPt_); ret.result_ = retMap; return ret; }
public boolean setSelection(final EbliListeSelectionMulti _m) { clear(); if (_m == null) { return true; } final TIntObjectIterator it = _m.idxListSelection_.iterator(); for (int i = _m.idxListSelection_.size(); i-- > 0;) { it.advance(); final CtuluListSelection newS = new CtuluListSelection((CtuluListSelection) it.value()); if (!newS.isEmpty()) { idxListSelection_.put(it.key(), newS); } } return true; }