123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150 |
- /*
- * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
- *
- * SPDX-License-Identifier: BSD-2-Clause
- */
- #pragma once
- #include <AK/Vector.h>
- #include <LibGfx/Point.h>
- #include <LibGfx/Rect.h>
- namespace Gfx {
- class DisjointRectSet {
- public:
- DisjointRectSet(const DisjointRectSet&) = delete;
- DisjointRectSet& operator=(const DisjointRectSet&) = delete;
- DisjointRectSet() { }
- ~DisjointRectSet() { }
- DisjointRectSet(const IntRect& rect)
- {
- m_rects.append(rect);
- }
- 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(); }
- 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); }
- 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);
- }
- private:
- bool add_no_shatter(const IntRect&);
- void shatter();
- Vector<IntRect, 32> m_rects;
- };
- }
|