mirrors/Iris
1
0
Fork 0
mirror of https://github.com/VolmitSoftware/Iris.git synced 2026-04-07 08:16:31 +00:00
Code Issues Packages Projects Releases Wiki Activity

Cleanup SRC

Browse Source
This commit is contained in:
Daniel Mills
2021-07-14 02:34:13 -04:00
parent f29015426f
commit 6ca6fc6989
605 changed files with 53283 additions and 64305 deletions
Download Patch File Download Diff File Expand all files Collapse all files

148
src/main/java/com/volmit/iris/util/AtomicRollingSequence.java
View File

@@ -1,102 +1,86 @@
package com.volmit.iris.util;
public class AtomicRollingSequence extends AtomicAverage
{
private double median;
private double max;
private double min;
private boolean dirtyMedian;
private int dirtyExtremes;
private boolean precision;
public class AtomicRollingSequence extends AtomicAverage {
private double median;
private double max;
private double min;
private boolean dirtyMedian;
private int dirtyExtremes;
private boolean precision;
public AtomicRollingSequence(int size)
{
super(size);
median = 0;
min = 0;
max = 0;
setPrecision(false);
}
public AtomicRollingSequence(int size) {
super(size);
median = 0;
min = 0;
max = 0;
setPrecision(false);
}
public double addLast(int amt)
{
double f = 0;
public double addLast(int amt) {
double f = 0;
for(int i = 0; i < Math.min(values.length(), amt); i++)
{
f += values.get(i);
}
for (int i = 0; i < Math.min(values.length(), amt); i++) {
f += values.get(i);
}
return f;
}
return f;
}
public void setPrecision(boolean p)
{
this.precision = p;
}
public void setPrecision(boolean p) {
this.precision = p;
}
public boolean isPrecision()
{
return precision;
}
public boolean isPrecision() {
return precision;
}
public double getMin()
{
if(dirtyExtremes > (isPrecision() ? 0 : values.length()))
{
resetExtremes();
}
public double getMin() {
if (dirtyExtremes > (isPrecision() ? 0 : values.length())) {
resetExtremes();
}
return min;
}
return min;
}
public double getMax()
{
if(dirtyExtremes > (isPrecision() ? 0 : values.length()))
{
resetExtremes();
}
public double getMax() {
if (dirtyExtremes > (isPrecision() ? 0 : values.length())) {
resetExtremes();
}
return max;
}
return max;
}
public double getMedian()
{
if(dirtyMedian)
{
recalculateMedian();
}
public double getMedian() {
if (dirtyMedian) {
recalculateMedian();
}
return median;
}
return median;
}
private void recalculateMedian()
{
median = new KList<Double>().forceAdd(values).sort().middleValue();
dirtyMedian = false;
}
private void recalculateMedian() {
median = new KList<Double>().forceAdd(values).sort().middleValue();
dirtyMedian = false;
}
public void resetExtremes()
{
max = Integer.MIN_VALUE;
min = Integer.MAX_VALUE;
public void resetExtremes() {
max = Integer.MIN_VALUE;
min = Integer.MAX_VALUE;
for(int i = 0; i < values.length(); i++)
{
double v = values.get(i);
max = M.max(max, v);
min = M.min(min, v);
}
for (int i = 0; i < values.length(); i++) {
double v = values.get(i);
max = M.max(max, v);
min = M.min(min, v);
}
dirtyExtremes = 0;
}
dirtyExtremes = 0;
}
public void put(double i)
{
super.put(i);
dirtyMedian = true;
dirtyExtremes++;
max = M.max(max, i);
min = M.min(min, i);
}
public void put(double i) {
super.put(i);
dirtyMedian = true;
dirtyExtremes++;
max = M.max(max, i);
min = M.min(min, i);
}
}