mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-22 23:50:19 +00:00
116cf92156
This fits nicer with FloatRect,FloatPoint,FloatSize and gives a much better visual clue about what type of metric is being used.
343 lines
9.3 KiB
C++
343 lines
9.3 KiB
C++
/*
|
|
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/Forward.h>
|
|
#include <LibGfx/Orientation.h>
|
|
#include <LibGfx/Point.h>
|
|
#include <LibGfx/Size.h>
|
|
#include <LibGfx/TextAlignment.h>
|
|
#include <LibIPC/Forward.h>
|
|
#include <stdlib.h>
|
|
|
|
namespace Gfx {
|
|
|
|
class IntRect {
|
|
public:
|
|
IntRect() {}
|
|
IntRect(int x, int y, int width, int height)
|
|
: m_location(x, y)
|
|
, m_size(width, height)
|
|
{
|
|
}
|
|
IntRect(const IntPoint& location, const IntSize& size)
|
|
: m_location(location)
|
|
, m_size(size)
|
|
{
|
|
}
|
|
|
|
bool is_null() const
|
|
{
|
|
return width() == 0 && height() == 0;
|
|
}
|
|
|
|
bool is_empty() const
|
|
{
|
|
return width() <= 0 || height() <= 0;
|
|
}
|
|
|
|
void move_by(int dx, int dy)
|
|
{
|
|
m_location.move_by(dx, dy);
|
|
}
|
|
|
|
void move_by(const IntPoint& delta)
|
|
{
|
|
m_location.move_by(delta);
|
|
}
|
|
|
|
IntPoint center() const
|
|
{
|
|
return { x() + width() / 2, y() + height() / 2 };
|
|
}
|
|
|
|
void set_location(const IntPoint& location)
|
|
{
|
|
m_location = location;
|
|
}
|
|
|
|
void set_size(const IntSize& size)
|
|
{
|
|
m_size = size;
|
|
}
|
|
|
|
void set_size(int width, int height)
|
|
{
|
|
m_size.set_width(width);
|
|
m_size.set_height(height);
|
|
}
|
|
|
|
void inflate(int w, int h)
|
|
{
|
|
set_x(x() - w / 2);
|
|
set_width(width() + w);
|
|
set_y(y() - h / 2);
|
|
set_height(height() + h);
|
|
}
|
|
|
|
void shrink(int w, int h)
|
|
{
|
|
set_x(x() + w / 2);
|
|
set_width(width() - w);
|
|
set_y(y() + h / 2);
|
|
set_height(height() - h);
|
|
}
|
|
|
|
IntRect shrunken(int w, int h) const
|
|
{
|
|
IntRect rect = *this;
|
|
rect.shrink(w, h);
|
|
return rect;
|
|
}
|
|
|
|
IntRect inflated(int w, int h) const
|
|
{
|
|
IntRect rect = *this;
|
|
rect.inflate(w, h);
|
|
return rect;
|
|
}
|
|
|
|
IntRect translated(int dx, int dy) const
|
|
{
|
|
IntRect rect = *this;
|
|
rect.move_by(dx, dy);
|
|
return rect;
|
|
}
|
|
|
|
IntRect translated(const IntPoint& delta) const
|
|
{
|
|
IntRect rect = *this;
|
|
rect.move_by(delta);
|
|
return rect;
|
|
}
|
|
|
|
bool contains_vertically(int y) const
|
|
{
|
|
return y >= top() && y <= bottom();
|
|
}
|
|
|
|
bool contains_horizontally(int x) const
|
|
{
|
|
return x >= left() && x <= right();
|
|
}
|
|
|
|
bool contains(int x, int y) const
|
|
{
|
|
return x >= m_location.x() && x <= right() && y >= m_location.y() && y <= bottom();
|
|
}
|
|
|
|
bool contains(const IntPoint& point) const
|
|
{
|
|
return contains(point.x(), point.y());
|
|
}
|
|
|
|
bool contains(const IntRect& other) const
|
|
{
|
|
return left() <= other.left()
|
|
&& right() >= other.right()
|
|
&& top() <= other.top()
|
|
&& bottom() >= other.bottom();
|
|
}
|
|
|
|
int primary_offset_for_orientation(Orientation orientation) const { return m_location.primary_offset_for_orientation(orientation); }
|
|
void set_primary_offset_for_orientation(Orientation orientation, int value) { m_location.set_primary_offset_for_orientation(orientation, value); }
|
|
int secondary_offset_for_orientation(Orientation orientation) const { return m_location.secondary_offset_for_orientation(orientation); }
|
|
void set_secondary_offset_for_orientation(Orientation orientation, int value) { m_location.set_secondary_offset_for_orientation(orientation, value); }
|
|
|
|
int primary_size_for_orientation(Orientation orientation) const { return m_size.primary_size_for_orientation(orientation); }
|
|
int secondary_size_for_orientation(Orientation orientation) const { return m_size.secondary_size_for_orientation(orientation); }
|
|
void set_primary_size_for_orientation(Orientation orientation, int value) { m_size.set_primary_size_for_orientation(orientation, value); }
|
|
void set_secondary_size_for_orientation(Orientation orientation, int value) { m_size.set_secondary_size_for_orientation(orientation, value); }
|
|
|
|
int first_edge_for_orientation(Orientation orientation) const
|
|
{
|
|
if (orientation == Orientation::Vertical)
|
|
return top();
|
|
return left();
|
|
}
|
|
|
|
int last_edge_for_orientation(Orientation orientation) const
|
|
{
|
|
if (orientation == Orientation::Vertical)
|
|
return bottom();
|
|
return right();
|
|
}
|
|
|
|
int left() const { return x(); }
|
|
int right() const { return x() + width() - 1; }
|
|
int top() const { return y(); }
|
|
int bottom() const { return y() + height() - 1; }
|
|
|
|
void set_left(int left)
|
|
{
|
|
set_x(left);
|
|
}
|
|
|
|
void set_top(int top)
|
|
{
|
|
set_y(top);
|
|
}
|
|
|
|
void set_right(int right)
|
|
{
|
|
set_width(right - x() + 1);
|
|
}
|
|
|
|
void set_bottom(int bottom)
|
|
{
|
|
set_height(bottom - y() + 1);
|
|
}
|
|
|
|
void set_right_without_resize(int new_right)
|
|
{
|
|
int delta = new_right - right();
|
|
move_by(delta, 0);
|
|
}
|
|
|
|
void set_bottom_without_resize(int new_bottom)
|
|
{
|
|
int delta = new_bottom - bottom();
|
|
move_by(0, delta);
|
|
}
|
|
|
|
bool intersects_vertically(const IntRect& other) const
|
|
{
|
|
return top() <= other.bottom()
|
|
&& other.top() <= bottom();
|
|
}
|
|
|
|
bool intersects_horizontally(const IntRect& other) const
|
|
{
|
|
return left() <= other.right()
|
|
&& other.left() <= right();
|
|
}
|
|
|
|
bool intersects(const IntRect& other) const
|
|
{
|
|
return left() <= other.right()
|
|
&& other.left() <= right()
|
|
&& top() <= other.bottom()
|
|
&& other.top() <= bottom();
|
|
}
|
|
|
|
int x() const { return location().x(); }
|
|
int y() const { return location().y(); }
|
|
int width() const { return m_size.width(); }
|
|
int height() const { return m_size.height(); }
|
|
|
|
void set_x(int x) { m_location.set_x(x); }
|
|
void set_y(int y) { m_location.set_y(y); }
|
|
void set_width(int width) { m_size.set_width(width); }
|
|
void set_height(int height) { m_size.set_height(height); }
|
|
|
|
IntPoint location() const { return m_location; }
|
|
IntSize size() const { return m_size; }
|
|
|
|
Vector<IntRect, 4> shatter(const IntRect& hammer) const;
|
|
|
|
bool operator==(const IntRect& other) const
|
|
{
|
|
return m_location == other.m_location
|
|
&& m_size == other.m_size;
|
|
}
|
|
|
|
bool operator!=(const IntRect& other) const
|
|
{
|
|
return !(*this == other);
|
|
}
|
|
|
|
void intersect(const IntRect&);
|
|
|
|
static IntRect from_two_points(const IntPoint& a, const IntPoint& b)
|
|
{
|
|
return { min(a.x(), b.x()), min(a.y(), b.y()), abs(a.x() - b.x()), abs(a.y() - b.y()) };
|
|
}
|
|
|
|
static IntRect intersection(const IntRect& a, const IntRect& b)
|
|
{
|
|
IntRect r(a);
|
|
r.intersect(b);
|
|
return r;
|
|
}
|
|
|
|
IntRect intersected(const IntRect& other) const
|
|
{
|
|
return intersection(*this, other);
|
|
}
|
|
|
|
IntRect united(const IntRect&) const;
|
|
|
|
IntPoint top_left() const { return { left(), top() }; }
|
|
IntPoint top_right() const { return { right(), top() }; }
|
|
IntPoint bottom_left() const { return { left(), bottom() }; }
|
|
IntPoint bottom_right() const { return { right(), bottom() }; }
|
|
|
|
void align_within(const IntRect&, TextAlignment);
|
|
|
|
void center_within(const IntRect& other)
|
|
{
|
|
center_horizontally_within(other);
|
|
center_vertically_within(other);
|
|
}
|
|
|
|
void center_horizontally_within(const IntRect& other)
|
|
{
|
|
set_x(other.center().x() - width() / 2);
|
|
}
|
|
|
|
void center_vertically_within(const IntRect& other)
|
|
{
|
|
set_y(other.center().y() - height() / 2);
|
|
}
|
|
|
|
String to_string() const;
|
|
|
|
private:
|
|
IntPoint m_location;
|
|
IntSize m_size;
|
|
};
|
|
|
|
inline void IntPoint::constrain(const IntRect& rect)
|
|
{
|
|
if (x() < rect.left())
|
|
set_x(rect.left());
|
|
else if (x() > rect.right())
|
|
set_x(rect.right());
|
|
if (y() < rect.top())
|
|
set_y(rect.top());
|
|
else if (y() > rect.bottom())
|
|
set_y(rect.bottom());
|
|
}
|
|
|
|
const LogStream& operator<<(const LogStream&, const IntRect&);
|
|
|
|
}
|
|
|
|
namespace IPC {
|
|
bool decode(Decoder&, Gfx::IntRect&);
|
|
bool encode(Encoder&, const Gfx::IntRect&);
|
|
}
|