intervals.hpp

浏览该文件的文档.

/*
 * @Description: 区间列表类 头文件及其实现
 * @Version:
 * @Autor: dreamy-xay
 * @date: 2023-12-03
 * @LastEditors: dreamy-xay
 * @LastEditTime: 2024-03-03
 */
#ifndef COMMON_INTERVALS_HPP
#define COMMON_INTERVALS_HPP
 
#include <opencv2/core.hpp>
 
#include "common/base/interval.hpp"
#include "common/base/list.hpp"
#include "common/enum.h"
#include "common/macro.h"
#include "common/type.h"
 
namespace cm {
 
class Intervals : public List<Interval> {
   public:
    using List<Interval>::List;
 
    Intervals() = default;
    Intervals(const Intervals& intervals) = default;
    Intervals(const std::vector<cv::Range>& ranges);
    ~Intervals() = default;
 
    Intervals& FilterInvalidIntervals(int min_interval_len = 1);
    Intervals& MergeIntervals(int max_interval_distance = 0);
};
 
inline Intervals::Intervals(const std::vector<cv::Range>& ranges) {
    for (auto& range : ranges)
        this->emplace_back(range.start, range.end);
}
 
inline Intervals& Intervals::FilterInvalidIntervals(int min_interval_len) {
    *this = std::move(this->Filter([=](const Interval& interval) {
        return interval.IsValid(min_interval_len);
    }));  // 更新区间列表
 
    return *this;
}
 
inline Intervals& Intervals::MergeIntervals(int max_interval_distance) {
    const Interval* intervals = this->data();  // 当前类的区间列表
 
    int num_intervals = this->size();  // 获取区间的数量
 
    // 如果区间的数量小于等于1则返回
    if (num_intervals <= 1)
        return *this;
 
    // 按区间的左边界从小到大排序，如果左边界相等则按右边界从小到大排序
    this->Sort();
 
    Intervals new_intervals;  // 新区间列表
 
    int start_of_interval = intervals[0].start;  // 区间起始值
    int end_of_interval = intervals[0].end;      // 区间结束值
    // 遍历所有区间
    for (int i = 1; i < num_intervals; ++i)
        if (intervals[i].start <= end_of_interval + max_interval_distance && intervals[i].end > end_of_interval)  // 如果区间满足合并需求
            end_of_interval = intervals[i].end;                                                                   // 合并区间
        else if (intervals[i].start > end_of_interval + max_interval_distance) {                                  // 没有需要合并的区间了
            new_intervals.emplace_back(start_of_interval, end_of_interval);                                       // 添加合并的区间
 
            start_of_interval = intervals[i].start;  // 当前区间作为起始区间，更新区间起始和结束值
            end_of_interval = intervals[i].end;
        }
    new_intervals.emplace_back(start_of_interval, end_of_interval);  // 添加最后一个区间
 
    *this = std::move(new_intervals);  // 更新区间列表
 
    return *this;
}
 
}  // namespace cm
 
#endif