blob: 535905a638b577ebd56375e7448b7f9534151986 (
plain)
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
|
// Copyright 2015 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "third_party/blink/renderer/core/editing/editing_strategy.h"
#include "third_party/blink/renderer/core/editing/editing_utilities.h"
#include "third_party/blink/renderer/core/layout/layout_object.h"
namespace {
blink::EUserSelect UsedValueOfUserSelect(const blink::Node& node) {
auto* html_element = blink::DynamicTo<blink::HTMLElement>(node);
if (html_element && html_element->IsTextControl())
return blink::EUserSelect::kText;
if (!node.GetLayoutObject())
return blink::EUserSelect::kNone;
const blink::ComputedStyle* style = node.GetLayoutObject()->Style();
if (style->UserModify() != blink::EUserModify::kReadOnly)
return blink::EUserSelect::kText;
return style->UserSelect();
}
} // namespace
namespace blink {
// If a node can contain candidates for VisiblePositions, return the offset of
// the last candidate, otherwise return the number of children for container
// nodes and the length for unrendered text nodes.
template <typename Traversal>
int EditingAlgorithm<Traversal>::CaretMaxOffset(const Node& node) {
// For rendered text nodes, return the last position that a caret could
// occupy.
if (node.IsTextNode() && node.GetLayoutObject())
return node.GetLayoutObject()->CaretMaxOffset();
// For containers return the number of children. For others do the same as
// above.
return LastOffsetForEditing(&node);
}
template <typename Traversal>
int EditingAlgorithm<Traversal>::LastOffsetForEditing(const Node* node) {
DCHECK(node);
if (!node)
return 0;
if (auto* character_data = DynamicTo<CharacterData>(node))
return static_cast<int>(character_data->length());
if (Traversal::HasChildren(*node))
return Traversal::CountChildren(*node);
// FIXME: Try return 0 here.
if (!EditingIgnoresContent(*node))
return 0;
// editingIgnoresContent uses the same logic in
// IsEmptyNonEditableNodeInEditable (editing_utilities.cc). We don't
// understand why this function returns 1 even when the node doesn't have
// children.
return 1;
}
template <typename Strategy>
Node* EditingAlgorithm<Strategy>::RootUserSelectAllForNode(Node* node) {
if (!node || UsedValueOfUserSelect(*node) != EUserSelect::kAll)
return nullptr;
Node* parent = Strategy::Parent(*node);
if (!parent)
return node;
Node* candidate_root = node;
while (parent) {
if (!parent->GetLayoutObject()) {
parent = Strategy::Parent(*parent);
continue;
}
if (UsedValueOfUserSelect(*parent) != EUserSelect::kAll)
break;
candidate_root = parent;
parent = Strategy::Parent(*candidate_root);
}
return candidate_root;
}
template class CORE_TEMPLATE_EXPORT EditingAlgorithm<NodeTraversal>;
template class CORE_TEMPLATE_EXPORT EditingAlgorithm<FlatTreeTraversal>;
} // namespace blink
|
