2020-01-18 08:38:21 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
|
|
|
|
*
|
2021-04-22 08:24:48 +00:00
|
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
2020-01-18 08:38:21 +00:00
|
|
|
*/
|
|
|
|
|
2019-02-19 13:49:23 +00:00
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include <AK/Vector.h>
|
2020-08-05 05:01:10 +00:00
|
|
|
#include <LibGfx/Point.h>
|
2020-02-06 11:04:00 +00:00
|
|
|
#include <LibGfx/Rect.h>
|
2019-02-19 13:49:23 +00:00
|
|
|
|
2020-02-06 10:56:38 +00:00
|
|
|
namespace Gfx {
|
|
|
|
|
2019-02-19 13:49:23 +00:00
|
|
|
class DisjointRectSet {
|
|
|
|
public:
|
2020-08-05 05:01:10 +00:00
|
|
|
DisjointRectSet(const DisjointRectSet&) = delete;
|
|
|
|
DisjointRectSet& operator=(const DisjointRectSet&) = delete;
|
|
|
|
|
|
|
|
DisjointRectSet() { }
|
|
|
|
~DisjointRectSet() { }
|
|
|
|
|
|
|
|
DisjointRectSet(const IntRect& rect)
|
2019-06-07 09:46:55 +00:00
|
|
|
{
|
2020-08-05 05:01:10 +00:00
|
|
|
m_rects.append(rect);
|
2019-06-07 09:46:55 +00:00
|
|
|
}
|
2019-02-19 13:49:23 +00:00
|
|
|
|
2020-08-05 05:01:10 +00:00
|
|
|
DisjointRectSet(DisjointRectSet&&) = default;
|
|
|
|
DisjointRectSet& operator=(DisjointRectSet&&) = default;
|
|
|
|
|
|
|
|
DisjointRectSet clone() const
|
|
|
|
{
|
|
|
|
DisjointRectSet rects;
|
|
|
|
rects.m_rects = m_rects;
|
|
|
|
return rects;
|
|
|
|
}
|
|
|
|
|
|
|
|
void move_by(int dx, int dy);
|
|
|
|
void move_by(const IntPoint& delta)
|
|
|
|
{
|
|
|
|
move_by(delta.x(), delta.y());
|
|
|
|
}
|
|
|
|
|
|
|
|
void add(const IntRect& rect)
|
|
|
|
{
|
|
|
|
if (add_no_shatter(rect) && m_rects.size() > 1)
|
|
|
|
shatter();
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename Container>
|
|
|
|
void add_many(const Container& rects)
|
|
|
|
{
|
|
|
|
bool added = false;
|
|
|
|
for (const auto& rect : rects) {
|
|
|
|
if (add_no_shatter(rect))
|
|
|
|
added = true;
|
|
|
|
}
|
|
|
|
if (added && m_rects.size() > 1)
|
|
|
|
shatter();
|
|
|
|
}
|
|
|
|
|
|
|
|
void add(const DisjointRectSet& rect_set)
|
|
|
|
{
|
|
|
|
if (this == &rect_set)
|
|
|
|
return;
|
|
|
|
if (m_rects.is_empty()) {
|
|
|
|
m_rects = rect_set.m_rects;
|
|
|
|
} else {
|
|
|
|
add_many(rect_set.rects());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
DisjointRectSet shatter(const IntRect&) const;
|
|
|
|
DisjointRectSet shatter(const DisjointRectSet& hammer) const;
|
|
|
|
|
|
|
|
bool contains(const IntRect&) const;
|
|
|
|
bool intersects(const IntRect&) const;
|
|
|
|
bool intersects(const DisjointRectSet&) const;
|
|
|
|
DisjointRectSet intersected(const IntRect&) const;
|
|
|
|
DisjointRectSet intersected(const DisjointRectSet&) const;
|
|
|
|
|
|
|
|
template<typename Function>
|
|
|
|
IterationDecision for_each_intersected(const IntRect& rect, Function f) const
|
|
|
|
{
|
|
|
|
if (is_empty() || rect.is_empty())
|
|
|
|
return IterationDecision::Continue;
|
|
|
|
for (auto& r : m_rects) {
|
|
|
|
auto intersected_rect = r.intersected(rect);
|
|
|
|
if (intersected_rect.is_empty())
|
|
|
|
continue;
|
|
|
|
IterationDecision decision = f(intersected_rect);
|
|
|
|
if (decision != IterationDecision::Continue)
|
|
|
|
return decision;
|
|
|
|
}
|
|
|
|
return IterationDecision::Continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename Function>
|
|
|
|
IterationDecision for_each_intersected(const DisjointRectSet& rects, Function f) const
|
|
|
|
{
|
|
|
|
if (is_empty() || rects.is_empty())
|
|
|
|
return IterationDecision::Continue;
|
|
|
|
if (this == &rects) {
|
|
|
|
for (auto& r : m_rects) {
|
|
|
|
IterationDecision decision = f(r);
|
|
|
|
if (decision != IterationDecision::Continue)
|
|
|
|
return decision;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
for (auto& r : m_rects) {
|
|
|
|
for (auto& r2 : rects.m_rects) {
|
|
|
|
auto intersected_rect = r.intersected(r2);
|
|
|
|
if (intersected_rect.is_empty())
|
|
|
|
continue;
|
|
|
|
IterationDecision decision = f(intersected_rect);
|
|
|
|
if (decision != IterationDecision::Continue)
|
|
|
|
return decision;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return IterationDecision::Continue;
|
|
|
|
}
|
2019-02-19 13:49:23 +00:00
|
|
|
|
2019-04-20 15:19:56 +00:00
|
|
|
bool is_empty() const { return m_rects.is_empty(); }
|
2020-02-25 13:49:47 +00:00
|
|
|
size_t size() const { return m_rects.size(); }
|
2019-04-20 15:19:56 +00:00
|
|
|
|
2019-02-19 13:49:23 +00:00
|
|
|
void clear() { m_rects.clear(); }
|
|
|
|
void clear_with_capacity() { m_rects.clear_with_capacity(); }
|
2020-06-10 08:57:59 +00:00
|
|
|
const Vector<IntRect, 32>& rects() const { return m_rects; }
|
2020-08-05 05:01:10 +00:00
|
|
|
Vector<IntRect, 32> take_rects() { return move(m_rects); }
|
2019-02-19 13:49:23 +00:00
|
|
|
|
2021-06-30 01:51:26 +00:00
|
|
|
void translate_by(int dx, int dy)
|
|
|
|
{
|
|
|
|
for (auto& rect : m_rects)
|
|
|
|
rect.translate_by(dx, dy);
|
|
|
|
}
|
|
|
|
void translate_by(Gfx::IntPoint const& delta)
|
|
|
|
{
|
|
|
|
for (auto& rect : m_rects)
|
|
|
|
rect.translate_by(delta);
|
|
|
|
}
|
|
|
|
|
2019-02-19 13:49:23 +00:00
|
|
|
private:
|
2020-08-05 05:01:10 +00:00
|
|
|
bool add_no_shatter(const IntRect&);
|
2019-02-19 13:49:23 +00:00
|
|
|
void shatter();
|
|
|
|
|
2020-06-10 08:57:59 +00:00
|
|
|
Vector<IntRect, 32> m_rects;
|
2019-02-19 13:49:23 +00:00
|
|
|
};
|
2020-02-06 10:56:38 +00:00
|
|
|
|
|
|
|
}
|