Expand description
This file contains code to find sorted runs in a set if ranged items and along with the best way to merge these items to satisfy the desired run count.
Structs§
- File
Group - A group of files that are created by the same compaction task.
- Sorted
Run - A set of files with non-overlapping time ranges.
Constants§
- DEFAULT_
MAX_ 🔒OUTPUT_ SIZE - Default max compaction output file size when not specified.
Traits§
- Item
- Trait for items to merge.
- Ranged
- Trait for any items with specific range (both boundaries are inclusive).
Functions§
- find_
overlapping_ items - find_
sorted_ runs - Finds sorted runs in given items.
- merge_
seq_ files - Finds the optimal set of adjacent files to merge based on a scoring system.
- reduce_
runs - Finds a set of files with minimum penalty to merge that can reduce the total num of runs. The penalty of merging is defined as the size of all overlapping files between two runs.
- sort_
ranged_ 🔒items