blob: 9f40d6ad48b432073c08affd7a0322ed51e0bf9f (
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
|
/*
* Copyright 2017 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkSGGroup.h"
namespace sksg {
Group::Group() {}
Group::~Group() {
for (const auto& child : fChildren) {
child->removeInvalReceiver(this);
}
}
void Group::addChild(sk_sp<RenderNode> node) {
// should we allow duplicates?
for (const auto& child : fChildren) {
if (child == node) {
return;
}
}
node->addInvalReceiver(this);
fChildren.push_back(std::move(node));
this->invalidateSelf();
}
void Group::removeChild(const sk_sp<RenderNode>& node) {
int origCount = fChildren.count();
for (int i = 0; i < origCount; ++i) {
if (fChildren[i] == node) {
fChildren.removeShuffle(i);
node->removeInvalReceiver(this);
break;
}
}
SkASSERT(fChildren.count() == origCount - 1);
this->invalidateSelf();
}
void Group::onRender(SkCanvas* canvas) const {
for (const auto& child : fChildren) {
child->render(canvas);
}
}
Node::RevalidationResult Group::onRevalidate(InvalidationController* ic, const SkMatrix& ctm) {
SkASSERT(this->hasInval());
RevalidationResult result = { SkRect::MakeEmpty(), Damage::kDefault };
for (const auto& child : fChildren) {
result.fBounds.join(child->revalidate(ic, ctm));
}
return result;
}
} // namespace sksg
|