org.dinky.shaded.paimon.mergetree.compact.CompactStrategy Maven / Gradle / Ivy
The newest version!
/*
* 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.dinky.shaded.paimon.mergetree.compact;
import org.dinky.shaded.paimon.compact.CompactUnit;
import org.dinky.shaded.paimon.mergetree.LevelSortedRun;
import java.util.List;
import java.util.Optional;
/** Compact strategy to decide which files to select for compaction. */
public interface CompactStrategy {
/**
* Pick compaction unit from runs.
*
*
* - compaction is runs-based, not file-based.
*
- level 0 is special, one run per file; all other levels are one run per level.
*
- compaction is sequential from small level to large level.
*
*/
Optional pick(int numLevels, List runs);
/** Pick a compaction unit consisting of all existing files. */
static Optional pickFullCompaction(int numLevels, List runs) {
int maxLevel = numLevels - 1;
if (runs.size() == 1 && runs.get(0).level() == maxLevel) {
// only 1 sorted run on the max level, nothing to compact
return Optional.empty();
} else {
return Optional.of(CompactUnit.fromLevelRuns(maxLevel, runs));
}
}
}