public double getMax(Graph graph) {
if (nodeIndexStore == null || edgeIndexStore == null) {
// TODO: Manual calculation
return Double.POSITIVE_INFINITY;
}
double nodeMax = nodeIndexStore.getIndex(graph).getMaxTimestamp();
double edgeMax = edgeIndexStore.getIndex(graph).getMaxTimestamp();
if (Double.isInfinite(nodeMax)) {
return edgeMax;
}
if (Double.isInfinite(edgeMax)) {
return nodeMax;
}
return Math.max(nodeMax, edgeMax);
}
public double getMin(Graph graph) {
if (nodeIndexStore == null || edgeIndexStore == null) {
// TODO: Manual calculation
return Double.NEGATIVE_INFINITY;
}
double nodeMin = nodeIndexStore.getIndex(graph).getMinTimestamp();
double edgeMin = edgeIndexStore.getIndex(graph).getMinTimestamp();
if (Double.isInfinite(nodeMin)) {
return edgeMin;
}
if (Double.isInfinite(edgeMin)) {
return nodeMin;
}
return Math.min(nodeMin, edgeMin);
}
