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
|
/*
* Copyright (C) 2013 Google Inc. All rights reserved.
* Copyright (C) 2013, 2014 Igalia S.L.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * 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.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* 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
* OWNER 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.
*/
#ifndef GridCoordinate_h
#define GridCoordinate_h
#if ENABLE(CSS_GRID_LAYOUT)
#include "GridResolvedPosition.h"
#include <wtf/HashMap.h>
#include <wtf/text/WTFString.h>
namespace WebCore {
// Recommended maximum size for both explicit and implicit grids.
const unsigned kGridMaxTracks = 1000000;
// A span in a single direction (either rows or columns). Note that |resolvedInitialPosition|
// and |resolvedFinalPosition| are grid lines' indexes.
// Iterating over the span shouldn't include |resolvedFinalPosition| to be correct.
class GridSpan {
public:
static GridSpan definiteGridSpan(const GridResolvedPosition& resolvedInitialPosition, const GridResolvedPosition& resolvedFinalPosition)
{
return GridSpan(resolvedInitialPosition, resolvedFinalPosition, Definite);
}
static GridSpan indefiniteGridSpan()
{
return GridSpan(0, 1, Indefinite);
}
bool operator==(const GridSpan& o) const
{
return m_type == o.m_type && m_resolvedInitialPosition == o.m_resolvedInitialPosition && m_resolvedFinalPosition == o.m_resolvedFinalPosition;
}
unsigned integerSpan() const
{
ASSERT(isDefinite());
return m_resolvedFinalPosition.toInt() - m_resolvedInitialPosition.toInt();
}
const GridResolvedPosition& resolvedInitialPosition() const
{
ASSERT(isDefinite());
return m_resolvedInitialPosition;
}
const GridResolvedPosition& resolvedFinalPosition() const
{
ASSERT(isDefinite());
return m_resolvedFinalPosition;
}
typedef GridResolvedPosition iterator;
iterator begin() const
{
ASSERT(isDefinite());
return m_resolvedInitialPosition;
}
iterator end() const
{
ASSERT(isDefinite());
return m_resolvedFinalPosition;
}
bool isDefinite() const
{
return m_type == Definite;
}
private:
enum GridSpanType {Definite, Indefinite};
GridSpan(const GridResolvedPosition& resolvedInitialPosition, const GridResolvedPosition& resolvedFinalPosition, GridSpanType type)
: m_resolvedInitialPosition(std::min(resolvedInitialPosition.toInt(), kGridMaxTracks - 1))
, m_resolvedFinalPosition(std::min(resolvedFinalPosition.toInt(), kGridMaxTracks))
, m_type(type)
{
ASSERT(resolvedInitialPosition < resolvedFinalPosition);
}
GridResolvedPosition m_resolvedInitialPosition;
GridResolvedPosition m_resolvedFinalPosition;
GridSpanType m_type;
};
// This represents a grid area that spans in both rows' and columns' direction.
class GridCoordinate {
public:
// HashMap requires a default constuctor.
GridCoordinate()
: columns(GridSpan::indefiniteGridSpan())
, rows(GridSpan::indefiniteGridSpan())
{
}
GridCoordinate(const GridSpan& r, const GridSpan& c)
: columns(c)
, rows(r)
{
}
bool operator==(const GridCoordinate& o) const
{
return columns == o.columns && rows == o.rows;
}
bool operator!=(const GridCoordinate& o) const
{
return !(*this == o);
}
GridSpan columns;
GridSpan rows;
};
typedef HashMap<String, GridCoordinate> NamedGridAreaMap;
} // namespace WebCore
#endif /* ENABLE(CSS_GRID_LAYOUT) */
#endif // GridCoordinate_h
|
