io.datakernel.aggregation.AggregationChunk Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of datakernel-aggregation Show documentation

Log-structured merge-tree table with fields representing aggregate functions, designed for OLAP workload.

There is a newer version: 3.1.0

Show newest version

/*
 * Copyright (C) 2015 SoftIndex LLC.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package io.datakernel.aggregation;

import java.util.ArrayList;
import java.util.List;
import java.util.Objects;

import static io.datakernel.aggregation.AggregationPredicates.*;
import static java.util.Collections.unmodifiableList;

public class AggregationChunk {
	public static AggregationChunk create(long chunkId,
	                                      List fields,
	                                      PrimaryKey minPrimaryKey, PrimaryKey maxPrimaryKey,
	                                      int count) {
		return new AggregationChunk(chunkId, fields, minPrimaryKey, maxPrimaryKey, count);
	}

	private final long chunkId;
	private final List measures;
	private final PrimaryKey minPrimaryKey;
	private final PrimaryKey maxPrimaryKey;
	private final int count;

	private AggregationChunk(long chunkId,
	                         List measures,
	                         PrimaryKey minPrimaryKey, PrimaryKey maxPrimaryKey,
	                         int count) {
		this.chunkId = chunkId;
		this.measures = measures;
		this.minPrimaryKey = minPrimaryKey;
		this.maxPrimaryKey = maxPrimaryKey;
		this.count = count;
	}

	public long getChunkId() {
		return chunkId;
	}

	public List getMeasures() {
		return unmodifiableList(measures);
	}

	public PrimaryKey getMinPrimaryKey() {
		return minPrimaryKey;
	}

	public PrimaryKey getMaxPrimaryKey() {
		return maxPrimaryKey;
	}

	public int getCount() {
		return count;
	}

	@Override
	public boolean equals(Object o) {
		if (this == o) return true;
		if (o == null || getClass() != o.getClass()) return false;
		AggregationChunk chunk = (AggregationChunk) o;
		return chunkId == chunk.chunkId &&
				count == chunk.count &&
				Objects.equals(measures, chunk.measures) &&
				Objects.equals(minPrimaryKey, chunk.minPrimaryKey) &&
				Objects.equals(maxPrimaryKey, chunk.maxPrimaryKey);
	}

	@Override
	public int hashCode() {
		return Objects.hash(chunkId, measures, minPrimaryKey, maxPrimaryKey, count);
	}

	public AggregationPredicate toPredicate(List primaryKey) {
		List predicates = new ArrayList<>();
		for (int i = 0; i < primaryKey.size(); i++) {
			String key = primaryKey.get(i);
			Object from = minPrimaryKey.get(i);
			Object to = maxPrimaryKey.get(i);
			if (from.equals(to)) {
				predicates.add(eq(key, from));
			} else {
				predicates.add(between(key, (Comparable) from, (Comparable) to));
			}
		}
		return and(predicates);
	}

	@Override
	public String toString() {
		return "{" +
				"id=" + chunkId +
				", measures=" + measures +
				", minKey=" + minPrimaryKey +
				", maxKey=" + maxPrimaryKey +
				", count=" + count +
				'}';
	}
}