adc_group.h

Go to the documentation of this file.

/*
 * Copyright 2025 MusicScience37 (Kenta Kabashima)
 *
 * 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.
 */
#pragma once
 
#include <queue>
#include <utility>
#include <vector>
 
#include "num_collect/base/concepts/real_scalar.h"
#include "num_collect/opt/impl/adc_rectangle.h"
#include "num_collect/util/assert.h"
 
namespace num_collect::opt::impl {

template <base::concepts::real_scalar Value, typename TernaryVector>
class adc_group {
public:
    using value_type = Value;

    using rectangle_type = adc_rectangle<value_type, TernaryVector>;

    explicit adc_group(value_type dist) : dist_(dist) {}

    void push(rectangle_type rect) { rects_.push(std::move(rect)); }

    [[nodiscard]] auto min_rect() const -> const rectangle_type& {
        NUM_COLLECT_DEBUG_ASSERT(!rects_.empty());
        return rects_.top();
    }

    [[nodiscard]] auto empty() const -> bool { return rects_.empty(); }

    [[nodiscard]] auto pop() -> rectangle_type {
        NUM_COLLECT_DEBUG_ASSERT(!rects_.empty());
        auto rect = std::move(rects_.top());
        rects_.pop();
        return rect;
    }

    [[nodiscard]] auto is_dividable() const -> bool {
        if (rects_.empty()) {
            return false;
        }
        const auto& rect = rects_.top();
        return !rect.vertex().is_full();
    }

    [[nodiscard]] auto dist() const -> const value_type& { return dist_; }
 
private:
    struct greater {
        [[nodiscard]] auto operator()(const rectangle_type& left,
            const rectangle_type& right) const -> bool {
            return left.ave_value() > right.ave_value();
        }
    };

    using queue_type = std::priority_queue<rectangle_type,
        std::vector<rectangle_type>, greater>;

    queue_type rects_{};

    value_type dist_;
};
 
}  // namespace num_collect::opt::impl