blob: 3732ebf405e92770221802b2544d393db3e21efd (
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
|
// Copyright 2014 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 "config.h"
#include "core/css/invalidation/DescendantInvalidationSet.h"
#include <gtest/gtest.h>
using namespace WebCore;
namespace {
// Once we setWholeSubtreeInvalid, we should not keep the HashSets.
TEST(DescendantInvalidationSetTest, SubtreeInvalid_AddBefore)
{
RefPtrWillBeRawPtr<DescendantInvalidationSet> set = DescendantInvalidationSet::create();
set->addClass("a");
set->setWholeSubtreeInvalid();
ASSERT_TRUE(set->isEmpty());
}
// Don't (re)create HashSets if we've already setWholeSubtreeInvalid.
TEST(DescendantInvalidationSetTest, SubtreeInvalid_AddAfter)
{
RefPtrWillBeRawPtr<DescendantInvalidationSet> set = DescendantInvalidationSet::create();
set->setWholeSubtreeInvalid();
set->addTagName("a");
ASSERT_TRUE(set->isEmpty());
}
// No need to keep the HashSets when combining with a wholeSubtreeInvalid set.
TEST(DescendantInvalidationSetTest, SubtreeInvalid_Combine_1)
{
RefPtrWillBeRawPtr<DescendantInvalidationSet> set1 = DescendantInvalidationSet::create();
RefPtrWillBeRawPtr<DescendantInvalidationSet> set2 = DescendantInvalidationSet::create();
set1->addId("a");
set2->setWholeSubtreeInvalid();
set1->combine(*set2);
ASSERT_TRUE(set1->wholeSubtreeInvalid());
ASSERT_TRUE(set1->isEmpty());
}
// No need to add HashSets from combining set when we already have wholeSubtreeInvalid.
TEST(DescendantInvalidationSetTest, SubtreeInvalid_Combine_2)
{
RefPtrWillBeRawPtr<DescendantInvalidationSet> set1 = DescendantInvalidationSet::create();
RefPtrWillBeRawPtr<DescendantInvalidationSet> set2 = DescendantInvalidationSet::create();
set1->setWholeSubtreeInvalid();
set2->addAttribute("a");
set1->combine(*set2);
ASSERT_TRUE(set1->wholeSubtreeInvalid());
ASSERT_TRUE(set1->isEmpty());
}
} // namespace
|