Module run

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

• MergeItems 🔒
• SortedRun 🔒
  A set of files with non-overlapping time ranges.

Traits

• Item 🔒
  Trait for items to merge.
• Ranged 🔒
  Trait for any items with specific range.

Functions

• find_sorted_runs 🔒
  Finds sorted runs in given items.
• merge_all_runs 🔒
• reduce_runs 🔒
  Reduces the num of runs to given target and returns items to merge. The time complexity of this function is C_{k}_{runs.len()} where k=runs.len()-target+1.
• sort_ranged_items 🔒