mirror of
https://github.com/flutter/flutter.git
synced 2026-02-20 02:29:02 +08:00
117 lines
4.7 KiB
C++
117 lines
4.7 KiB
C++
/*
|
|
* Copyright (C) 2013 Google Inc. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are
|
|
* met:
|
|
*
|
|
* * Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* * Redistributions in binary form must reproduce the above
|
|
* copyright notice, this list of conditions and the following disclaimer
|
|
* in the documentation and/or other materials provided with the
|
|
* distribution.
|
|
* * Neither the name of Google Inc. nor the names of its
|
|
* contributors may be used to endorse or promote products derived from
|
|
* this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef ShadowRootRareData_h
|
|
#define ShadowRootRareData_h
|
|
|
|
#include "core/dom/shadow/InsertionPoint.h"
|
|
#include "wtf/RefPtr.h"
|
|
#include "wtf/Vector.h"
|
|
|
|
namespace blink {
|
|
|
|
class ShadowRootRareData : public NoBaseWillBeGarbageCollected<ShadowRootRareData> {
|
|
public:
|
|
ShadowRootRareData()
|
|
: m_descendantShadowElementCount(0)
|
|
, m_descendantContentElementCount(0)
|
|
, m_childShadowRootCount(0)
|
|
{
|
|
}
|
|
|
|
HTMLShadowElement* shadowInsertionPointOfYoungerShadowRoot() const { return m_shadowInsertionPointOfYoungerShadowRoot.get(); }
|
|
void setShadowInsertionPointOfYoungerShadowRoot(PassRefPtrWillBeRawPtr<HTMLShadowElement> shadowInsertionPoint) { m_shadowInsertionPointOfYoungerShadowRoot = shadowInsertionPoint; }
|
|
|
|
void didAddInsertionPoint(InsertionPoint*);
|
|
void didRemoveInsertionPoint(InsertionPoint*);
|
|
|
|
bool containsShadowElements() const { return m_descendantShadowElementCount; }
|
|
bool containsContentElements() const { return m_descendantContentElementCount; }
|
|
bool containsShadowRoots() const { return m_childShadowRootCount; }
|
|
|
|
unsigned descendantShadowElementCount() const { return m_descendantShadowElementCount; }
|
|
|
|
void didAddChildShadowRoot() { ++m_childShadowRootCount; }
|
|
void didRemoveChildShadowRoot() { ASSERT(m_childShadowRootCount > 0); --m_childShadowRootCount; }
|
|
|
|
unsigned childShadowRootCount() const { return m_childShadowRootCount; }
|
|
|
|
const WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> >& descendantInsertionPoints() { return m_descendantInsertionPoints; }
|
|
void setDescendantInsertionPoints(WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> >& list) { m_descendantInsertionPoints.swap(list); }
|
|
void clearDescendantInsertionPoints() { m_descendantInsertionPoints.clear(); }
|
|
|
|
StyleSheetList* styleSheets() { return m_styleSheetList.get(); }
|
|
void setStyleSheets(PassRefPtrWillBeRawPtr<StyleSheetList> styleSheetList) { m_styleSheetList = styleSheetList; }
|
|
|
|
void trace(Visitor* visitor)
|
|
{
|
|
visitor->trace(m_shadowInsertionPointOfYoungerShadowRoot);
|
|
visitor->trace(m_descendantInsertionPoints);
|
|
visitor->trace(m_styleSheetList);
|
|
}
|
|
|
|
private:
|
|
RefPtrWillBeMember<HTMLShadowElement> m_shadowInsertionPointOfYoungerShadowRoot;
|
|
unsigned m_descendantShadowElementCount;
|
|
unsigned m_descendantContentElementCount;
|
|
unsigned m_childShadowRootCount;
|
|
WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> > m_descendantInsertionPoints;
|
|
RefPtrWillBeMember<StyleSheetList> m_styleSheetList;
|
|
};
|
|
|
|
inline void ShadowRootRareData::didAddInsertionPoint(InsertionPoint* point)
|
|
{
|
|
ASSERT(point);
|
|
if (isHTMLShadowElement(*point))
|
|
++m_descendantShadowElementCount;
|
|
else if (isHTMLContentElement(*point))
|
|
++m_descendantContentElementCount;
|
|
else
|
|
ASSERT_NOT_REACHED();
|
|
}
|
|
|
|
inline void ShadowRootRareData::didRemoveInsertionPoint(InsertionPoint* point)
|
|
{
|
|
ASSERT(point);
|
|
if (isHTMLShadowElement(*point))
|
|
--m_descendantShadowElementCount;
|
|
else if (isHTMLContentElement(*point))
|
|
--m_descendantContentElementCount;
|
|
else
|
|
ASSERT_NOT_REACHED();
|
|
|
|
ASSERT(m_descendantContentElementCount >= 0);
|
|
ASSERT(m_descendantShadowElementCount >= 0);
|
|
}
|
|
|
|
} // namespace blink
|
|
|
|
#endif
|