@Override public void calcMinMax() { if (mValues == null || mValues.isEmpty()) return; mYMax = -Float.MAX_VALUE; mYMin = Float.MAX_VALUE; mXMax = -Float.MAX_VALUE; mXMin = Float.MAX_VALUE; for (T e : mValues) { calcMinMax(e); } }
@Override public boolean removeEntry(T e) { if (e == null) return false; if (mValues == null) return false; // remove the entry boolean removed = mValues.remove(e); if (removed) { calcMinMax(); } return removed; }
/** * Creates a new DataSet object with the given values (entries) it represents. Also, a * label that describes the DataSet can be specified. The label can also be * used to retrieve the DataSet from a ChartData object. * * @param values * @param label */ public DataSet(List<T> values, String label) { super(label); this.mValues = values; if (mValues == null) mValues = new ArrayList<T>(); calcMinMax(); }
@Override public boolean addEntry(T e) { if (e == null) return false; List<T> values = getValues(); if (values == null) { values = new ArrayList<T>(); } calcMinMax(e); // add the entry return values.add(e); }
@Override public void addEntryOrdered(T e) { if (e == null) return; if (mValues == null) { mValues = new ArrayList<T>(); } calcMinMax(e); if (mValues.size() > 0 && mValues.get(mValues.size() - 1).getX() > e.getX()) { int closestIndex = getEntryIndex(e.getX(), e.getY(), Rounding.UP); mValues.add(closestIndex, e); } else { mValues.add(e); } }
@Override public void calcMinMax() { if (mValues == null || mValues.isEmpty()) return; mYMax = -Float.MAX_VALUE; mYMin = Float.MAX_VALUE; mXMax = -Float.MAX_VALUE; mXMin = Float.MAX_VALUE; for (T e : mValues) { calcMinMax(e); } }
@Override public void calcMinMax() { if (mValues == null || mValues.isEmpty()) return; mYMax = -Float.MAX_VALUE; mYMin = Float.MAX_VALUE; mXMax = -Float.MAX_VALUE; mXMin = Float.MAX_VALUE; for (T e : mValues) { calcMinMax(e); } }
@Override public void calcMinMax() { if (mValues == null || mValues.isEmpty()) return; mYMax = -Float.MAX_VALUE; mYMin = Float.MAX_VALUE; mXMax = -Float.MAX_VALUE; mXMin = Float.MAX_VALUE; for (T e : mValues) { calcMinMax(e); } }
@Override public boolean removeEntry(T e) { if (e == null) return false; if (mValues == null) return false; // remove the entry boolean removed = mValues.remove(e); if (removed) { calcMinMax(); } return removed; }
/** * Creates a new DataSet object with the given values (entries) it represents. Also, a * label that describes the DataSet can be specified. The label can also be * used to retrieve the DataSet from a ChartData object. * * @param values * @param label */ public DataSet(List<T> values, String label) { super(label); this.mValues = values; if (mValues == null) mValues = new ArrayList<T>(); calcMinMax(); }
@Override public boolean removeEntry(T e) { if (e == null) return false; if (mValues == null) return false; // remove the entry boolean removed = mValues.remove(e); if (removed) { calcMinMax(); } return removed; }
@Override public void calcMinMax() { if (mValues == null || mValues.isEmpty()) { return; } mYMax = -Float.MAX_VALUE; mYMin = Float.MAX_VALUE; mXMax = -Float.MAX_VALUE; mXMin = Float.MAX_VALUE; for (T e : mValues) { calcMinMax(e); } }
@Override public boolean removeEntry(T e) { if (e == null) return false; if (mValues == null) return false; // remove the entry boolean removed = mValues.remove(e); if (removed) { calcMinMax(); } return removed; }
@Override public boolean removeEntry(T e) { if (e == null) { return false; } if (mValues == null) { return false; } // remove the entry boolean removed = mValues.remove(e); if (removed) { calcMinMax(); } return removed; }
@Override public boolean addEntry(T e) { if (e == null) return false; List<T> values = getValues(); if (values == null) { values = new ArrayList<T>(); } calcMinMax(e); // add the entry return values.add(e); }
@Override public boolean addEntry(T e) { if (e == null) return false; List<T> values = getValues(); if (values == null) { values = new ArrayList<T>(); } calcMinMax(e); // add the entry return values.add(e); }
@Override public boolean addEntry(T e) { if (e == null) { return false; } List<T> values = getValues(); if (values == null) { values = new ArrayList<T>(); } calcMinMax(e); // add the entry return values.add(e); }
@Override public boolean addEntry(T e) { if (e == null) return false; List<T> values = getValues(); if (values == null) { values = new ArrayList<T>(); } calcMinMax(e); // add the entry return values.add(e); }
@Override public void addEntryOrdered(T e) { if (e == null) return; if (mValues == null) { mValues = new ArrayList<T>(); } calcMinMax(e); if (mValues.size() > 0 && mValues.get(mValues.size() - 1).getX() > e.getX()) { int closestIndex = getEntryIndex(e.getX(), e.getY(), Rounding.UP); mValues.add(closestIndex, e); } else { mValues.add(e); } }
@Override public void addEntryOrdered(T e) { if (e == null) return; if (mValues == null) { mValues = new ArrayList<T>(); } calcMinMax(e); if (mValues.size() > 0 && mValues.get(mValues.size() - 1).getX() > e.getX()) { int closestIndex = getEntryIndex(e.getX(), e.getY(), Rounding.UP); mValues.add(closestIndex, e); } else { mValues.add(e); } }