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
|
/*
* Copyright (C) 2020 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.
*/
#include "config.h"
#include "BoundaryPoint.h"
#include "ContainerNode.h"
namespace WebCore {
template std::partial_ordering treeOrder<Tree>(const BoundaryPoint&, const BoundaryPoint&);
template std::partial_ordering treeOrder<ShadowIncludingTree>(const BoundaryPoint&, const BoundaryPoint&);
template std::partial_ordering treeOrder<ComposedTree>(const BoundaryPoint&, const BoundaryPoint&);
std::optional<BoundaryPoint> makeBoundaryPointBeforeNode(Node& node)
{
auto parent = node.parentNode();
if (!parent)
return std::nullopt;
return BoundaryPoint { *parent, node.computeNodeIndex() };
}
std::optional<BoundaryPoint> makeBoundaryPointAfterNode(Node& node)
{
auto parent = node.parentNode();
if (!parent)
return std::nullopt;
return BoundaryPoint { *parent, node.computeNodeIndex() + 1 };
}
static bool isOffsetBeforeChild(ContainerNode& container, unsigned offset, Node& child)
{
if (!offset)
return true;
// If the container is not the parent, the child is part of a shadow tree, which we sort between offset 0 and offset 1.
if (child.parentNode() != &container)
return false;
unsigned currentOffset = 0;
for (auto currentChild = container.firstChild(); currentChild && currentChild != &child; currentChild = currentChild->nextSibling()) {
if (offset <= ++currentOffset)
return true;
}
return false;
}
template<TreeType treeType> std::partial_ordering treeOrder(const BoundaryPoint& a, const BoundaryPoint& b)
{
if (a.container.ptr() == b.container.ptr())
return a.offset <=> b.offset;
for (auto ancestor = b.container.ptr(); ancestor; ) {
auto nextAncestor = parent<treeType>(*ancestor);
if (nextAncestor == a.container.ptr())
return isOffsetBeforeChild(*nextAncestor, a.offset, *ancestor) ? std::strong_ordering::less : std::strong_ordering::greater;
ancestor = nextAncestor;
}
for (auto ancestor = a.container.ptr(); ancestor; ) {
auto nextAncestor = parent<treeType>(*ancestor);
if (nextAncestor == b.container.ptr())
return isOffsetBeforeChild(*nextAncestor, b.offset, *ancestor) ? std::strong_ordering::greater : std::strong_ordering::less;
ancestor = nextAncestor;
}
return treeOrder<treeType>(a.container, b.container);
}
std::partial_ordering treeOrderForTesting(TreeType type, const BoundaryPoint& a, const BoundaryPoint& b)
{
switch (type) {
case Tree:
return treeOrder<Tree>(a, b);
case ShadowIncludingTree:
return treeOrder<ShadowIncludingTree>(a, b);
case ComposedTree:
return treeOrder<ComposedTree>(a, b);
}
ASSERT_NOT_REACHED();
return std::partial_ordering::unordered;
}
TextStream& operator<<(TextStream& stream, const BoundaryPoint& boundaryPoint)
{
TextStream::GroupScope scope(stream);
stream << "BoundaryPoint ";
stream.dumpProperty("node", boundaryPoint.container->debugDescription());
stream.dumpProperty("offset", boundaryPoint.offset);
return stream;
}
}
|
