mirror of
https://github.com/RGBCube/serenity
synced 2025-07-26 00:27:43 +00:00
LibGfx: Add a few convenience methods to DisjointRectSet
This commit is contained in:
parent
5b9d563b4b
commit
790eacfbd1
2 changed files with 220 additions and 9 deletions
|
@ -27,20 +27,119 @@
|
|||
#pragma once
|
||||
|
||||
#include <AK/Vector.h>
|
||||
#include <LibGfx/Point.h>
|
||||
#include <LibGfx/Rect.h>
|
||||
|
||||
namespace Gfx {
|
||||
|
||||
class DisjointRectSet {
|
||||
public:
|
||||
DisjointRectSet() {}
|
||||
~DisjointRectSet() {}
|
||||
DisjointRectSet(DisjointRectSet&& other)
|
||||
: m_rects(move(other.m_rects))
|
||||
DisjointRectSet(const DisjointRectSet&) = delete;
|
||||
DisjointRectSet& operator=(const DisjointRectSet&) = delete;
|
||||
|
||||
DisjointRectSet() { }
|
||||
~DisjointRectSet() { }
|
||||
|
||||
DisjointRectSet(const IntRect& rect)
|
||||
{
|
||||
m_rects.append(rect);
|
||||
}
|
||||
|
||||
void add(const IntRect&);
|
||||
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;
|
||||
}
|
||||
|
||||
bool is_empty() const { return m_rects.is_empty(); }
|
||||
size_t size() const { return m_rects.size(); }
|
||||
|
@ -48,8 +147,10 @@ public:
|
|||
void clear() { m_rects.clear(); }
|
||||
void clear_with_capacity() { m_rects.clear_with_capacity(); }
|
||||
const Vector<IntRect, 32>& rects() const { return m_rects; }
|
||||
Vector<IntRect, 32> take_rects() { return move(m_rects); }
|
||||
|
||||
private:
|
||||
bool add_no_shatter(const IntRect&);
|
||||
void shatter();
|
||||
|
||||
Vector<IntRect, 32> m_rects;
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue