org.apache.datasketches.theta.HeapCompactUnorderedSketch Maven / Gradle / Ivy
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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 org.apache.datasketches.theta;
import static org.apache.datasketches.Util.checkSeedHashes;
import static org.apache.datasketches.Util.computeSeedHash;
import static org.apache.datasketches.theta.PreambleUtil.extractCurCount;
import static org.apache.datasketches.theta.PreambleUtil.extractPreLongs;
import static org.apache.datasketches.theta.PreambleUtil.extractSeedHash;
import static org.apache.datasketches.theta.PreambleUtil.extractThetaLong;
import org.apache.datasketches.memory.Memory;
/**
* An on-heap, compact, read-only sketch.
*
* @author Lee Rhodes
*/
final class HeapCompactUnorderedSketch extends HeapCompactSketch {
/**
* Constructs this sketch from correct, valid components.
* @param cache in compact form
* @param empty The correct Empty.
* @param seedHash The correct
* Seed Hash.
* @param curCount correct value
* @param thetaLong The correct
* thetaLong.
*/
HeapCompactUnorderedSketch(final long[] cache, final boolean empty, final short seedHash,
final int curCount, final long thetaLong) {
super(cache, empty, seedHash, curCount, thetaLong);
}
/**
* Heapifies the given source Memory with seed
* @param srcMem See Memory
* @param seed See Update Hash Seed.
* @return a CompactSketch
*/
static CompactSketch heapifyInstance(final Memory srcMem, final long seed) {
final short memSeedHash = (short) extractSeedHash(srcMem);
final short computedSeedHash = computeSeedHash(seed);
checkSeedHashes(memSeedHash, computedSeedHash);
final int preLongs = extractPreLongs(srcMem); //must be > 1
final boolean empty = PreambleUtil.isEmpty(srcMem); //checks for cap <= 8
int curCount = 0;
long thetaLong = Long.MAX_VALUE;
long[] cache = new long[0];
curCount = extractCurCount(srcMem);
cache = new long[curCount];
if (preLongs == 2) {
srcMem.getLongArray(16, cache, 0, curCount);
} else { //preLongs == 3
srcMem.getLongArray(24, cache, 0, curCount);
thetaLong = extractThetaLong(srcMem);
}
return new HeapCompactUnorderedSketch(cache, empty, memSeedHash, curCount, thetaLong);
}
/**
* Constructs this sketch from correct, valid arguments.
* @param cache in compact form
* @param empty The correct Empty.
* @param seedHash The correct
* Seed Hash.
* @param curCount correct value
* @param thetaLong The correct
* thetaLong.
* @return a CompactSketch
*/
static CompactSketch compact(final long[] cache, final boolean empty,
final short seedHash, final int curCount, final long thetaLong) {
return new HeapCompactUnorderedSketch(cache, empty, seedHash, curCount, thetaLong);
}
//Sketch interface
@Override
public byte[] toByteArray() {
return toByteArray(false);
}
//restricted methods
@Override
public boolean isOrdered() {
return false;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy