Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* 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.trino.operator.aggregation.minmaxn;
import io.trino.operator.aggregation.minmaxn.MinMaxNStateFactory.GroupedMinMaxNState;
import io.trino.operator.aggregation.minmaxn.MinMaxNStateFactory.SingleMinMaxNState;
import io.trino.spi.function.AccumulatorState;
import io.trino.spi.function.AccumulatorStateFactory;
import io.trino.spi.function.Convention;
import io.trino.spi.function.OperatorDependency;
import io.trino.spi.function.OperatorType;
import io.trino.spi.function.TypeParameter;
import io.trino.spi.type.Type;
import java.lang.invoke.MethodHandle;
import java.util.function.LongFunction;
import static io.trino.spi.StandardErrorCode.INVALID_FUNCTION_ARGUMENT;
import static io.trino.spi.function.InvocationConvention.InvocationArgumentConvention.FLAT;
import static io.trino.spi.function.InvocationConvention.InvocationArgumentConvention.VALUE_BLOCK_POSITION_NOT_NULL;
import static io.trino.spi.function.InvocationConvention.InvocationReturnConvention.BLOCK_BUILDER;
import static io.trino.spi.function.InvocationConvention.InvocationReturnConvention.FAIL_ON_NULL;
import static io.trino.spi.function.InvocationConvention.InvocationReturnConvention.FLAT_RETURN;
import static io.trino.util.Failures.checkCondition;
import static java.lang.Math.toIntExact;
public class MaxNStateFactory
implements AccumulatorStateFactory
{
private static final long MAX_NUMBER_OF_VALUES = 10_000;
private final LongFunction heapFactory;
public MaxNStateFactory(
@OperatorDependency(
operator = OperatorType.READ_VALUE,
argumentTypes = "T",
convention = @Convention(arguments = FLAT, result = BLOCK_BUILDER))
MethodHandle readFlat,
@OperatorDependency(
operator = OperatorType.READ_VALUE,
argumentTypes = "T",
convention = @Convention(arguments = VALUE_BLOCK_POSITION_NOT_NULL, result = FLAT_RETURN))
MethodHandle writeFlat,
@OperatorDependency(
operator = OperatorType.COMPARISON_UNORDERED_FIRST,
argumentTypes = {"T", "T"},
convention = @Convention(arguments = {FLAT, FLAT}, result = FAIL_ON_NULL))
MethodHandle compareFlatFlat,
@OperatorDependency(
operator = OperatorType.COMPARISON_UNORDERED_FIRST,
argumentTypes = {"T", "T"},
convention = @Convention(arguments = {FLAT, VALUE_BLOCK_POSITION_NOT_NULL}, result = FAIL_ON_NULL))
MethodHandle compareFlatBlock,
@TypeParameter("T") Type elementType)
{
heapFactory = n -> {
checkCondition(n > 0, INVALID_FUNCTION_ARGUMENT, "second argument of max_n must be positive");
checkCondition(
n <= MAX_NUMBER_OF_VALUES,
INVALID_FUNCTION_ARGUMENT,
"second argument of max_n must be less than or equal to %s; found %s",
MAX_NUMBER_OF_VALUES,
n);
return new TypedHeap(false, readFlat, writeFlat, compareFlatFlat, compareFlatBlock, elementType, toIntExact(n));
};
}
@Override
public MaxNState createSingleState()
{
return new SingleMaxNState(heapFactory);
}
@Override
public MaxNState createGroupedState()
{
return new GroupedMaxNState(heapFactory);
}
private static class GroupedMaxNState
extends GroupedMinMaxNState
implements MaxNState
{
public GroupedMaxNState(LongFunction heapFactory)
{
super(heapFactory);
}
}
private static class SingleMaxNState
extends SingleMinMaxNState
implements MaxNState
{
public SingleMaxNState(LongFunction heapFactory)
{
super(heapFactory);
}
public SingleMaxNState(SingleMaxNState state)
{
super(state);
}
@Override
public AccumulatorState copy()
{
return new SingleMaxNState(this);
}
}
}