memgraph/include/utils/iterator/count.hpp

#pragma once

#include "utils/total_ordering.hpp"

// Represents number of to be returned elements from iterator. Where acutal
// number is probably somwhere in [min,max].
class Count : public TotalOrdering<Count>
{

public:
    Count(size_t exact) : min(exact), max(exact) {}

    Count(size_t min, size_t max) : min(min), max(max) {}

    Count &min_zero()
    {
        min = 0;
        return *this;
    }

    size_t avg() const { return ((max - min) >> 1) + min; }

    friend constexpr bool operator<(const Count &lhs, const Count &rhs)
    {
        return lhs.avg() < rhs.avg();
    }

    friend constexpr bool operator==(const Count &lhs, const Count &rhs)
    {
        return lhs.avg() == rhs.avg();
    }

    size_t min;
    size_t max;
};