OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:insertionPoints
(Results
1 - 6
of
6
) sorted by null
/external/chromium_org/third_party/WebKit/Source/core/css/resolver/
SharedStyleFinder.cpp
184
WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8>
insertionPoints
, candidateInsertionPoints;
185
collectDestinationInsertionPoints(element(),
insertionPoints
);
187
if (
insertionPoints
.size() != candidateInsertionPoints.size())
189
for (size_t i = 0; i <
insertionPoints
.size(); ++i) {
190
if (
insertionPoints
[i] != candidateInsertionPoints[i])
/external/chromium_org/third_party/WebKit/Source/core/dom/shadow/
InsertionPoint.cpp
152
const WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> >&
insertionPoints
= shadowRoot->descendantInsertionPoints();
153
for (size_t i = 0; i <
insertionPoints
.size(); ++i) {
154
InsertionPoint* point =
insertionPoints
[i].get();
281
const DestinationInsertionPoints*
insertionPoints
= shadow->destinationInsertionPointsFor(&node);
282
if (!
insertionPoints
)
284
for (size_t i = 0; i <
insertionPoints
->size(); ++i)
285
results.append(
insertionPoints
->at(i).get());
286
ASSERT(current !=
insertionPoints
->last().get());
287
current =
insertionPoints
->last().get();
ElementShadow.cpp
263
const WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> >&
insertionPoints
= root->descendantInsertionPoints();
264
for (size_t i = 0; i <
insertionPoints
.size(); ++i) {
265
InsertionPoint* point =
insertionPoints
[i].get();
/external/chromium_org/third_party/WebKit/Source/core/events/
EventPath.cpp
111
WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8>
insertionPoints
;
112
collectDestinationInsertionPoints(*current,
insertionPoints
);
113
if (!
insertionPoints
.isEmpty()) {
114
for (size_t i = 0; i <
insertionPoints
.size(); ++i) {
115
InsertionPoint* insertionPoint =
insertionPoints
[i];
124
current =
insertionPoints
.last();
/external/chromium_org/third_party/WebKit/Source/core/css/
SelectorChecker.cpp
364
WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8>
insertionPoints
;
365
collectDestinationInsertionPoints(*element,
insertionPoints
);
366
for (size_t i = 0; i <
insertionPoints
.size(); ++i) {
367
nextContext.element =
insertionPoints
[i];
369
nextContext.scope =
insertionPoints
[i]->containingShadowRoot();
[
all
...]
/external/chromium_org/third_party/WebKit/Source/core/dom/
Node.cpp
[
all
...]
Completed in 852 milliseconds