| /external/skia/modules/sksg/src/ |
| D | SkSGGroup.cpp | 17 : fChildren(std::move(children)) { in Group()
18 for (const auto& child : fChildren) { in Group()
24 for (const auto& child : fChildren) { in ~Group()
30 for (const auto& child : fChildren) { in clear()
33 fChildren.clear(); in clear()
38 for (const auto& child : fChildren) { in addChild()
45 fChildren.push_back(std::move(node)); in addChild()
51 SkDEBUGCODE(const auto origSize = fChildren.size()); in removeChild()
52 fChildren.erase(std::remove(fChildren.begin(), fChildren.end(), node), fChildren.end()); in removeChild()
53 SkASSERT(fChildren.size() == origSize - 1); in removeChild()
[all …]
|
| /external/skqp/modules/sksg/src/ |
| D | SkSGGroup.cpp | 15 : fChildren(std::move(children)) { in Group()
16 for (const auto& child : fChildren) { in Group()
22 for (const auto& child : fChildren) { in ~Group()
28 for (const auto& child : fChildren) { in clear()
31 fChildren.clear(); in clear()
36 for (const auto& child : fChildren) { in addChild()
43 fChildren.push_back(std::move(node)); in addChild()
49 SkDEBUGCODE(const auto origSize = fChildren.size()); in removeChild()
50 fChildren.erase(std::remove(fChildren.begin(), fChildren.end(), node), fChildren.end()); in removeChild()
51 SkASSERT(fChildren.size() == origSize - 1); in removeChild()
[all …]
|
| /external/skqp/src/sksl/lex/ |
| D | RegexNode.cpp | 20 for (const RegexNode& child : fChildren) { in createStates()
28 while (chars.size() <= (size_t) child.fChildren[1].fPayload.fChar) { in createStates()
31 for (char c = child.fChildren[0].fPayload.fChar; in createStates()
32 c <= child.fChildren[1].fPayload.fChar; in createStates()
42 std::vector<int> right = fChildren[1].createStates(nfa, accept); in createStates()
43 result = fChildren[0].createStates(nfa, right); in createStates()
50 std::vector<int> states = fChildren[0].createStates(nfa, accept); in createStates()
52 states = fChildren[1].createStates(nfa, accept); in createStates()
61 result = fChildren[0].createStates(nfa, next); in createStates()
66 result = fChildren[0].createStates(nfa, accept); in createStates()
[all …]
|
| D | RegexNode.h | 44 fChildren.emplace_back(kChar_Kind, *children); in RegexNode()
51 fChildren.push_back(std::move(child)); in RegexNode()
56 fChildren.push_back(std::move(child1)); in RegexNode()
57 fChildren.push_back(std::move(child2)); in RegexNode()
75 std::vector<RegexNode> fChildren; member
|
| /external/skia/src/sksl/lex/ |
| D | RegexNode.cpp | 20 for (const RegexNode& child : fChildren) { in createStates()
28 while (chars.size() <= (size_t) child.fChildren[1].fPayload.fChar) { in createStates()
31 for (char c = child.fChildren[0].fPayload.fChar; in createStates()
32 c <= child.fChildren[1].fPayload.fChar; in createStates()
42 std::vector<int> right = fChildren[1].createStates(nfa, accept); in createStates()
43 result = fChildren[0].createStates(nfa, right); in createStates()
50 std::vector<int> states = fChildren[0].createStates(nfa, accept); in createStates()
52 states = fChildren[1].createStates(nfa, accept); in createStates()
61 result = fChildren[0].createStates(nfa, next); in createStates()
66 result = fChildren[0].createStates(nfa, accept); in createStates()
[all …]
|
| D | RegexNode.h | 44 fChildren.emplace_back(kChar_Kind, *children); in RegexNode()
51 fChildren.push_back(std::move(child)); in RegexNode()
56 fChildren.push_back(std::move(child1)); in RegexNode()
57 fChildren.push_back(std::move(child2)); in RegexNode()
75 std::vector<RegexNode> fChildren; member
|
| /external/skqp/experimental/svg/model/ |
| D | SkSVGContainer.cpp | 17 fChildren.push_back(std::move(node)); in appendChild()
21 return !fChildren.empty(); in hasChildren()
25 for (int i = 0; i < fChildren.count(); ++i) { in onRender()
26 fChildren[i]->render(ctx); in onRender()
33 for (int i = 0; i < fChildren.count(); ++i) { in onAsPath()
34 const SkPath childPath = fChildren[i]->asPath(ctx); in onAsPath()
|
| /external/skia/experimental/svg/model/ |
| D | SkSVGContainer.cpp | 17 fChildren.push_back(std::move(node)); in appendChild()
21 return !fChildren.empty(); in hasChildren()
25 for (int i = 0; i < fChildren.count(); ++i) { in onRender()
26 fChildren[i]->render(ctx); in onRender()
33 for (int i = 0; i < fChildren.count(); ++i) { in onAsPath()
34 const SkPath childPath = fChildren[i]->asPath(ctx); in onAsPath()
|
| /external/icu/icu4c/source/tools/genrb/ |
| D | filterrb.cpp | 112 auto child = node->fChildren.find(key); in match()
114 if (child == node->fChildren.end()) { in match()
150 : fIncluded(other.fIncluded), fChildren(other.fChildren) { in Tree()
158 return fChildren.empty() && !fWildcard; in isLeaf()
174 fChildren.clear(); in applyRule()
189 for (auto& child : fChildren) { in applyRule()
196 auto search = fChildren.find(key); in applyRule()
197 if (search == fChildren.end()) { in applyRule()
200 search = fChildren.emplace(key, Tree(*fWildcard)).first; in applyRule()
202 search = fChildren.emplace(key, Tree()).first; in applyRule()
[all …]
|
| /external/skia/experimental/xform/ |
| D | SkXform.cpp | 20 for (auto c : fChildren) { in debugValidate()
49 SkASSERT(fChildren.find(child) < 0); in internalAddChild()
50 fChildren.push_back(child); in internalAddChild()
54 int index = fChildren.find(child); in internalRemoveChild()
56 fChildren.removeShuffle(index); in internalRemoveChild()
63 for (auto c : fChildren) { in invalidateCaches()
|
| /external/skqp/tools/bookmaker/ |
| D | includeWriter.cpp | 16 for (auto& item : parent->fChildren) { in checkChildCommentLength()
22 for (auto& itemChild : item->fChildren) { in checkChildCommentLength()
41 if (std::any_of(enumItem->fChildren.begin(), enumItem->fChildren.end(), in checkEnumLengths()
95 for (auto prop : def->fChildren) { in descriptionOut()
113 size_t childSize = prop->fChildren.size(); in descriptionOut()
115 if (MarkType::kLiteral == prop->fChildren[0]->fMarkType) { in descriptionOut()
117 … SkASSERT(1 == childSize || MarkType::kOutdent == prop->fChildren[1]->fMarkType); in descriptionOut()
118 commentStart = prop->fChildren[childSize - 1]->fContentStart; in descriptionOut()
121 MarkType::kOutdent == prop->fChildren[1]->fMarkType; in descriptionOut()
216 for (auto row : prop->fChildren) { in descriptionOut()
[all …]
|
| D | mdOut.cpp | 539 const char* exStart = example->fChildren.back()->fContentEnd; in setLink()
541 if (MarkType::kStdOut == example->fChildren.back()->fMarkType) { in setLink()
542 exStart = example->fChildren[example->fChildren.size() - 2]->fContentEnd; in setLink()
543 exEnd = example->fChildren.back()->fContentStart; in setLink()
755 for (auto child : found->fChildren) { in contains_referenced_child()
869 for (auto& child : def->fChildren) { in childrenOut()
908 for (auto child : def->fChildren) { in summaryOut()
912 auto oneLiner = std::find_if(child->fChildren.begin(), child->fChildren.end(), in summaryOut()
914 if (child->fChildren.end() == oneLiner) { in summaryOut()
953 for (auto child : topic->fChildren) { in csParent()
[all …]
|
| D | selfCheck.cpp | 74 for (auto child : csChild->fChildren) { in checkMethod()
87 for (auto child : csChild->fChildren) { in checkMethod()
121 for (auto& csChild : cs->fChildren) { in checkRelatedFunctions()
136 for (auto& rootChild : fRoot->fChildren) { in classOrStruct()
|
| /external/skia/src/pathops/ |
| D | SkPathOpsAsWinding.cpp | 28 vector<Contour*> fChildren; member
282 for (auto test : parent.fChildren) { in inParent()
289 for (auto iter = parent.fChildren.begin(); iter != parent.fChildren.end(); ) { in inParent()
291 contour.fChildren.push_back(*iter); in inParent()
292 iter = parent.fChildren.erase(iter); in inParent()
297 parent.fChildren.push_back(&contour); in inParent()
301 for (auto grandChild : child->fChildren) { in checkContainerChildren()
316 for (auto grandChild : child->fChildren) { in markReverse()
403 if (std::all_of(sorted.fChildren.begin(), sorted.fChildren.end(), in AsWinding()
404 [](const Contour* contour) -> bool { return !contour->fChildren.size(); } )) { in AsWinding()
[all …]
|
| /external/skqp/src/pathops/ |
| D | SkPathOpsAsWinding.cpp | 28 vector<Contour*> fChildren; member
282 for (auto test : parent.fChildren) { in inParent()
289 for (auto iter = parent.fChildren.begin(); iter != parent.fChildren.end(); ) { in inParent()
291 contour.fChildren.push_back(*iter); in inParent()
292 iter = parent.fChildren.erase(iter); in inParent()
297 parent.fChildren.push_back(&contour); in inParent()
301 for (auto grandChild : child->fChildren) { in checkContainerChildren()
316 for (auto grandChild : child->fChildren) { in markReverse()
403 if (std::all_of(sorted.fChildren.begin(), sorted.fChildren.end(), in AsWinding()
404 [](const Contour* contour) -> bool { return !contour->fChildren.size(); } )) { in AsWinding()
[all …]
|
| /external/skia/src/gpu/ |
| D | GrAuditTrail.cpp | 50 opNode->fChildren.push_back(auditOp); in addOp()
70 for (int i = 0; i < consumedOp.fChildren.count(); i++) { in opsCombined()
71 Op* childOp = consumedOp.fChildren[i]; in opsCombined()
75 childOp->fChildID = consumerOp.fChildren.count(); in opsCombined()
76 consumerOp.fChildren.push_back(childOp); in opsCombined()
94 for (int j = 0; j < bn->fChildren.count(); j++) { in copyOutFromOpsTask()
96 const Op* currentOp = bn->fChildren[j]; in copyOutFromOpsTask()
198 JsonifyTArray(writer, "Ops", fChildren); in toJson()
|
| /external/skqp/src/gpu/ |
| D | GrAuditTrail.cpp | 50 opNode->fChildren.push_back(auditOp); in addOp()
70 for (int i = 0; i < consumedOp.fChildren.count(); i++) { in opsCombined()
71 Op* childOp = consumedOp.fChildren[i]; in opsCombined()
75 childOp->fChildID = consumerOp.fChildren.count(); in opsCombined()
76 consumerOp.fChildren.push_back(childOp); in opsCombined()
94 for (int j = 0; j < bn->fChildren.count(); j++) { in copyOutFromOpList()
96 const Op* currentOp = bn->fChildren[j]; in copyOutFromOpList()
198 JsonifyTArray(writer, "Ops", fChildren); in toJson()
|
| /external/skia/src/core/ |
| D | SkRTree.cpp | 36 n->fChildren[0] = branches[0]; in insert()
130 n->fChildren[0] = (*branches)[currentBranch]; in bulkLoad()
137 n->fChildren[k] = (*branches)[currentBranch]; in bulkLoad()
156 if (SkRect::Intersects(node->fChildren[i].fBounds, query)) { in search()
158 results->push_back(node->fChildren[i].fOpIndex); in search()
160 this->search(node->fChildren[i].fSubtree, query, results); in search()
|
| D | SkRuntimeEffect.cpp | 235 , fChildren(std::move(children)) in SkRuntimeEffect()
346 , fChildren(children, children + childCount) {} in SkRuntimeColorFilter()
352 for (const auto& child : fChildren) { in asFragmentProcessor()
394 buffer.write32(fChildren.size()); in flatten()
395 for (const auto& child : fChildren) { in flatten()
405 std::vector<sk_sp<SkColorFilter>> fChildren; member in SkRuntimeColorFilter
448 , fChildren(children, children + childCount) {} in SkRTShader()
459 for (const auto& child : fChildren) { in asFragmentProcessor()
525 buffer.write32(fChildren.size()); in flatten()
526 for (const auto& child : fChildren) { in flatten()
[all …]
|
| /external/skia/tools/viewer/ |
| D | SkSLSlide.cpp | 75 fChildren.reset(); in unload()
90 fChildren.resize_back(effect->children().count()); in rebuild()
91 for (auto& c : fChildren) { in rebuild()
163 [tgt = fChildren[i]](auto p) { return p.second == tgt; }); in draw()
169 fChildren[i] = namedShader.second; in draw()
179 auto shader = fEffect->makeShader(std::move(inputs), fChildren.data(), fChildren.count(), in draw()
|
| /external/icu/icu4c/source/tools/toolutil/ |
| D | xmlparser.cpp | 394 el->fChildren.addElement(t, status); in parse()
410 el->fChildren.addElement(s.clone(), status); in parse()
448 el->fChildren.addElement(t, status); in parse()
686 fChildren(errorCode), in UXMLElement()
697 for (i=fChildren.size()-1; i>=0; i--) { in ~UXMLElement()
698 delete (UObject *)fChildren.elementAt(i); in ~UXMLElement()
717 int32_t i, count=fChildren.size(); in appendText()
719 node=(const UObject *)fChildren.elementAt(i); in appendText()
765 return fChildren.size(); in countChildren()
770 if(0<=i && i<fChildren.size()) { in getChild()
[all …]
|
| /external/skqp/src/core/ |
| D | SkRTree.cpp | 44 n->fChildren[0] = branches[0]; in insert()
146 n->fChildren[0] = (*branches)[currentBranch]; in bulkLoad()
153 n->fChildren[k] = (*branches)[currentBranch]; in bulkLoad()
173 if (SkRect::Intersects(node->fChildren[i].fBounds, query)) { in search()
175 results->push_back(node->fChildren[i].fOpIndex); in search()
177 this->search(node->fChildren[i].fSubtree, query, results); in search()
|
| /external/skqp/modules/sksg/include/ |
| D | SkSGGroup.h | 33 size_t size() const { return fChildren.size(); } in size()
34 bool empty() const { return fChildren.empty(); } in empty()
45 std::vector<sk_sp<RenderNode>> fChildren;
|
| /external/skia/modules/sksg/include/ |
| D | SkSGGroup.h | 33 size_t size() const { return fChildren.size(); } in size()
34 bool empty() const { return fChildren.empty(); } in empty()
47 std::vector<sk_sp<RenderNode>> fChildren;
|
| /external/junit/src/main/java/org/junit/runner/ |
| D | Description.java | 144 private final Collection<Description> fChildren = new ConcurrentLinkedQueue<Description>(); field in Description
182 fChildren.add(description); in addChild()
190 return new ArrayList<Description>(fChildren); in getChildren()
204 return fChildren.isEmpty(); in isTest()
215 for (Description child : fChildren) { in testCount()
|