1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237
|
/*
* Copyright (C) 2018 Apple Inc. 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 APPLE INC. AND ITS 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 APPLE INC. OR ITS 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 "LayoutUnit.h"
#include "LayoutPoint.h"
#include "LayoutRect.h"
#include "MarginTypes.h"
#include <wtf/HashFunctions.h>
#include <wtf/HashTraits.h>
namespace WebCore {
namespace Layout {
#define USE_FLOAT_AS_INLINE_LAYOUT_UNIT 1
#if USE_FLOAT_AS_INLINE_LAYOUT_UNIT
using InlineLayoutUnit = float;
using InlineLayoutPoint = FloatPoint;
using InlineLayoutSize = FloatSize;
using InlineLayoutRect = FloatRect;
#else
using InlineLayoutUnit = LayoutUnit;
using InlineLayoutPoint = LayoutPoint;
using InlineLayoutSize = LayoutSize;
using InlineLayoutRect = LayoutRect;
#endif
struct Position {
operator LayoutUnit() const { return value; }
LayoutUnit value;
};
inline bool operator<(const Position& a, const Position& b)
{
return a.value < b.value;
}
inline bool operator==(const Position& a, const Position& b)
{
return a.value == b.value;
}
struct Point {
// FIXME: Use Position<Horizontal>, Position<Vertical> to avoid top/left vs. x/y confusion.
LayoutUnit x; // left
LayoutUnit y; // top
Point() = default;
Point(LayoutUnit, LayoutUnit);
Point(LayoutPoint);
static Point max() { return { LayoutUnit::max(), LayoutUnit::max() }; }
void move(LayoutSize);
void moveBy(LayoutPoint);
operator LayoutPoint() const { return { x, y }; }
};
// FIXME: Wrap these into structs.
using PointInContextRoot = Point;
using PositionInContextRoot = Position;
inline Point::Point(LayoutPoint point)
: x(point.x())
, y(point.y())
{
}
inline Point::Point(LayoutUnit x, LayoutUnit y)
: x(x)
, y(y)
{
}
inline void Point::move(LayoutSize offset)
{
x += offset.width();
y += offset.height();
}
inline void Point::moveBy(LayoutPoint offset)
{
x += offset.x();
y += offset.y();
}
// Margin, border, padding
struct HorizontalEdges {
LayoutUnit left;
LayoutUnit right;
};
struct VerticalEdges {
LayoutUnit top;
LayoutUnit bottom;
};
struct Edges {
HorizontalEdges horizontal;
VerticalEdges vertical;
LayoutUnit width() const { return horizontal.left + horizontal.right; }
LayoutUnit height() const { return vertical.top + vertical.bottom; }
};
inline Edges operator/(const Edges& edge, size_t value)
{
return { { edge.horizontal.left / value, edge.horizontal.right / value }, { edge.vertical.top / value, edge.vertical.bottom / value } };
}
struct ContentWidthAndMargin {
LayoutUnit contentWidth;
UsedHorizontalMargin usedMargin;
};
struct ContentHeightAndMargin {
LayoutUnit contentHeight;
UsedVerticalMargin::NonCollapsedValues nonCollapsedMargin;
};
struct HorizontalGeometry {
LayoutUnit left;
LayoutUnit right;
ContentWidthAndMargin contentWidthAndMargin;
};
struct VerticalGeometry {
LayoutUnit top;
LayoutUnit bottom;
ContentHeightAndMargin contentHeightAndMargin;
};
struct OverriddenHorizontalValues {
std::optional<LayoutUnit> width;
std::optional<UsedHorizontalMargin> margin;
};
struct OverriddenVerticalValues {
// Consider collapsing it.
std::optional<LayoutUnit> height;
};
inline LayoutUnit toLayoutUnit(InlineLayoutUnit value)
{
return LayoutUnit { value };
}
inline LayoutUnit ceiledLayoutUnit(InlineLayoutUnit value)
{
return LayoutUnit::fromFloatCeil(value);
}
inline LayoutPoint toLayoutPoint(const InlineLayoutPoint& point)
{
return LayoutPoint { point };
}
inline LayoutRect toLayoutRect(const InlineLayoutRect& rect)
{
return LayoutRect { rect };
}
inline InlineLayoutUnit maxInlineLayoutUnit()
{
#if USE_FLOAT_AS_INLINE_LAYOUT_UNIT
return std::numeric_limits<float>::max();
#else
return LayoutUnit::max();
#endif
}
struct SlotPosition {
SlotPosition() = default;
SlotPosition(size_t column, size_t row);
size_t column { 0 };
size_t row { 0 };
};
inline SlotPosition::SlotPosition(size_t column, size_t row)
: column(column)
, row(row)
{
}
inline bool operator==(const SlotPosition& a, const SlotPosition& b)
{
return a.column == b.column && a.row == b.row;
}
struct CellSpan {
size_t column { 1 };
size_t row { 1 };
};
}
}
namespace WTF {
struct SlotPositionHash {
static unsigned hash(const WebCore::Layout::SlotPosition& slotPosition) { return pairIntHash(slotPosition.column, slotPosition.row); }
static bool equal(const WebCore::Layout::SlotPosition& a, const WebCore::Layout::SlotPosition& b) { return a == b; }
static const bool safeToCompareToEmptyOrDeleted = true;
};
template<> struct HashTraits<WebCore::Layout::SlotPosition> : GenericHashTraits<WebCore::Layout::SlotPosition> {
static WebCore::Layout::SlotPosition emptyValue() { return WebCore::Layout::SlotPosition(0, std::numeric_limits<size_t>::max()); }
static void constructDeletedValue(WebCore::Layout::SlotPosition& slot) { slot.column = std::numeric_limits<size_t>::max(); }
static bool isDeletedValue(const WebCore::Layout::SlotPosition& slot) { return slot.column == std::numeric_limits<size_t>::max(); }
};
template<> struct DefaultHash<WebCore::Layout::SlotPosition> : SlotPositionHash { };
}
|