mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-21 15:10:19 +00:00
8a07131229
We actually include what we use where we use it. This change aims to improve the speed of incremental builds.
256 lines
7.1 KiB
C++
256 lines
7.1 KiB
C++
/*
|
|
* Copyright (c) 2020, Andreas Kling <andreas@ladybird.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/Optional.h>
|
|
#include <AK/Vector.h>
|
|
#include <LibGfx/Forward.h>
|
|
#include <LibGfx/Line.h>
|
|
#include <LibGfx/Point.h>
|
|
#include <LibGfx/Rect.h>
|
|
|
|
namespace Gfx {
|
|
|
|
class DeprecatedPath;
|
|
|
|
class DeprecatedPathSegment {
|
|
public:
|
|
enum Command : u8 {
|
|
MoveTo,
|
|
LineTo,
|
|
QuadraticBezierCurveTo,
|
|
CubicBezierCurveTo,
|
|
};
|
|
|
|
ALWAYS_INLINE Command command() const { return m_command; }
|
|
ALWAYS_INLINE FloatPoint point() const { return m_points.last(); }
|
|
ALWAYS_INLINE FloatPoint through() const
|
|
{
|
|
VERIFY(m_command == Command::QuadraticBezierCurveTo);
|
|
return m_points[0];
|
|
}
|
|
ALWAYS_INLINE FloatPoint through_0() const
|
|
{
|
|
VERIFY(m_command == Command::CubicBezierCurveTo);
|
|
return m_points[0];
|
|
}
|
|
ALWAYS_INLINE FloatPoint through_1() const
|
|
{
|
|
VERIFY(m_command == Command::CubicBezierCurveTo);
|
|
return m_points[1];
|
|
}
|
|
ALWAYS_INLINE ReadonlySpan<FloatPoint> points() const { return m_points; }
|
|
|
|
static constexpr int points_per_command(Command command)
|
|
{
|
|
switch (command) {
|
|
case Command::MoveTo:
|
|
case Command::LineTo:
|
|
return 1; // Single point.
|
|
case Command::QuadraticBezierCurveTo:
|
|
return 2; // Control point + point.
|
|
case Command::CubicBezierCurveTo:
|
|
return 3; // Two control points + point.
|
|
}
|
|
VERIFY_NOT_REACHED();
|
|
}
|
|
|
|
DeprecatedPathSegment(Command command, ReadonlySpan<FloatPoint> points)
|
|
: m_command(command)
|
|
, m_points(points) {};
|
|
|
|
private:
|
|
Command m_command;
|
|
ReadonlySpan<FloatPoint> m_points;
|
|
};
|
|
|
|
class PathSegmentIterator {
|
|
public:
|
|
int operator<=>(PathSegmentIterator other) const
|
|
{
|
|
if (m_command_index > other.m_command_index)
|
|
return 1;
|
|
if (m_command_index < other.m_command_index)
|
|
return -1;
|
|
return 0;
|
|
}
|
|
bool operator==(PathSegmentIterator other) const { return m_command_index == other.m_command_index; }
|
|
bool operator!=(PathSegmentIterator other) const { return m_command_index != other.m_command_index; }
|
|
|
|
PathSegmentIterator operator++()
|
|
{
|
|
if (m_command_index < m_commands.size())
|
|
m_point_index += DeprecatedPathSegment::points_per_command(m_commands[m_command_index++]);
|
|
return *this;
|
|
}
|
|
PathSegmentIterator operator++(int)
|
|
{
|
|
PathSegmentIterator old(*this);
|
|
++*this;
|
|
return old;
|
|
}
|
|
|
|
PathSegmentIterator operator--()
|
|
{
|
|
if (m_command_index > 0)
|
|
m_point_index -= DeprecatedPathSegment::points_per_command(m_commands[--m_command_index]);
|
|
return *this;
|
|
}
|
|
PathSegmentIterator operator--(int)
|
|
{
|
|
PathSegmentIterator old(*this);
|
|
--*this;
|
|
return old;
|
|
}
|
|
|
|
DeprecatedPathSegment operator*() const
|
|
{
|
|
auto command = m_commands[m_command_index];
|
|
return DeprecatedPathSegment { command, m_points.span().slice(m_point_index, DeprecatedPathSegment::points_per_command(command)) };
|
|
}
|
|
|
|
PathSegmentIterator& operator=(PathSegmentIterator const& other)
|
|
{
|
|
m_point_index = other.m_point_index;
|
|
m_command_index = other.m_command_index;
|
|
return *this;
|
|
}
|
|
PathSegmentIterator(PathSegmentIterator const&) = default;
|
|
|
|
friend DeprecatedPath;
|
|
|
|
private:
|
|
PathSegmentIterator(Vector<FloatPoint> const& points, Vector<DeprecatedPathSegment::Command> const& commands, size_t point_index = 0, size_t command_index = 0)
|
|
: m_points(points)
|
|
, m_commands(commands)
|
|
, m_point_index(point_index)
|
|
, m_command_index(command_index)
|
|
{
|
|
}
|
|
|
|
// Note: Store reference to vectors from Gfx::DeprecatedPath so appending segments does not invalidate iterators.
|
|
Vector<FloatPoint> const& m_points;
|
|
Vector<DeprecatedPathSegment::Command> const& m_commands;
|
|
size_t m_point_index { 0 };
|
|
size_t m_command_index { 0 };
|
|
};
|
|
|
|
class DeprecatedPath {
|
|
public:
|
|
DeprecatedPath() = default;
|
|
|
|
void move_to(FloatPoint point)
|
|
{
|
|
append_segment<DeprecatedPathSegment::MoveTo>(point);
|
|
}
|
|
|
|
void line_to(FloatPoint point)
|
|
{
|
|
append_segment<DeprecatedPathSegment::LineTo>(point);
|
|
invalidate_split_lines();
|
|
}
|
|
|
|
void quadratic_bezier_curve_to(FloatPoint through, FloatPoint point)
|
|
{
|
|
append_segment<DeprecatedPathSegment::QuadraticBezierCurveTo>(through, point);
|
|
invalidate_split_lines();
|
|
}
|
|
|
|
void cubic_bezier_curve_to(FloatPoint c1, FloatPoint c2, FloatPoint p2)
|
|
{
|
|
append_segment<DeprecatedPathSegment::CubicBezierCurveTo>(c1, c2, p2);
|
|
invalidate_split_lines();
|
|
}
|
|
|
|
void elliptical_arc_to(FloatPoint point, FloatSize radii, float x_axis_rotation, bool large_arc, bool sweep);
|
|
void arc_to(FloatPoint point, float radius, bool large_arc, bool sweep)
|
|
{
|
|
elliptical_arc_to(point, { radius, radius }, 0, large_arc, sweep);
|
|
}
|
|
|
|
FloatPoint last_point()
|
|
{
|
|
if (!m_points.is_empty())
|
|
return m_points.last();
|
|
return {};
|
|
}
|
|
|
|
void close();
|
|
void close_all_subpaths();
|
|
|
|
DeprecatedPath stroke_to_fill(float thickness) const;
|
|
DeprecatedPath copy_transformed(AffineTransform const&) const;
|
|
|
|
ReadonlySpan<FloatLine> split_lines() const
|
|
{
|
|
if (!m_split_lines.has_value()) {
|
|
const_cast<DeprecatedPath*>(this)->segmentize_path();
|
|
VERIFY(m_split_lines.has_value());
|
|
}
|
|
return m_split_lines->lines;
|
|
}
|
|
|
|
Gfx::FloatRect const& bounding_box() const
|
|
{
|
|
(void)split_lines();
|
|
return m_split_lines->bounding_box;
|
|
}
|
|
|
|
ByteString to_byte_string() const;
|
|
|
|
PathSegmentIterator begin() const
|
|
{
|
|
return PathSegmentIterator(m_points, m_commands);
|
|
}
|
|
|
|
PathSegmentIterator end() const
|
|
{
|
|
return PathSegmentIterator(m_points, m_commands, m_points.size(), m_commands.size());
|
|
}
|
|
|
|
bool is_empty() const
|
|
{
|
|
return m_commands.is_empty();
|
|
}
|
|
|
|
void clear()
|
|
{
|
|
*this = DeprecatedPath {};
|
|
}
|
|
|
|
private:
|
|
void approximate_elliptical_arc_with_cubic_beziers(FloatPoint center, FloatSize radii, float x_axis_rotation, float theta, float theta_delta);
|
|
|
|
void invalidate_split_lines()
|
|
{
|
|
m_split_lines.clear();
|
|
}
|
|
void segmentize_path();
|
|
|
|
template<DeprecatedPathSegment::Command command, typename... Args>
|
|
void append_segment(Args&&... args)
|
|
{
|
|
constexpr auto point_count = sizeof...(Args);
|
|
static_assert(point_count == DeprecatedPathSegment::points_per_command(command));
|
|
FloatPoint points[] { args... };
|
|
// Note: This should maintain the invariant that `m_points.last()` is always the last point in the path.
|
|
m_points.append(points, point_count);
|
|
m_commands.append(command);
|
|
}
|
|
|
|
Vector<FloatPoint> m_points {};
|
|
Vector<DeprecatedPathSegment::Command> m_commands {};
|
|
|
|
struct SplitLines {
|
|
Vector<FloatLine> lines;
|
|
Gfx::FloatRect bounding_box;
|
|
};
|
|
|
|
Optional<SplitLines> m_split_lines {};
|
|
};
|
|
|
|
}
|