| Index: Source/core/css/invalidation/DescendantInvalidationSetTest.cpp
|
| diff --git a/Source/core/css/invalidation/DescendantInvalidationSetTest.cpp b/Source/core/css/invalidation/DescendantInvalidationSetTest.cpp
|
| deleted file mode 100644
|
| index 36ecda57183a1512d522532d19a086dc89f89b69..0000000000000000000000000000000000000000
|
| --- a/Source/core/css/invalidation/DescendantInvalidationSetTest.cpp
|
| +++ /dev/null
|
| @@ -1,80 +0,0 @@
|
| -// 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>
|
| -
|
| -namespace blink {
|
| -
|
| -// 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());
|
| -}
|
| -
|
| -TEST(DescendantInvalidationSetTest, SubtreeInvalid_AddCustomPseudoBefore)
|
| -{
|
| - RefPtrWillBeRawPtr<DescendantInvalidationSet> set = DescendantInvalidationSet::create();
|
| - set->setCustomPseudoInvalid();
|
| - ASSERT_FALSE(set->isEmpty());
|
| -
|
| - set->setWholeSubtreeInvalid();
|
| - ASSERT_TRUE(set->isEmpty());
|
| -}
|
| -
|
| -#ifndef NDEBUG
|
| -TEST(DescendantInvalidationSetTest, ShowDebug)
|
| -{
|
| - RefPtrWillBeRawPtr<DescendantInvalidationSet> set = DescendantInvalidationSet::create();
|
| - set->show();
|
| -}
|
| -#endif // NDEBUG
|
| -
|
| -} // namespace blink
|
|
|