#ifndef ShadowTree_h
#define ShadowTree_h
#include "ExceptionCode.h"
#include "HTMLContentSelector.h"
#include "ShadowRoot.h"
#include <wtf/DoublyLinkedList.h>
#include <wtf/Noncopyable.h>
#include <wtf/OwnPtr.h>
#include <wtf/PassRefPtr.h>
#include <wtf/Vector.h>
namespace WebCore {
class Node;
class Element;
class InsertionPoint;
class TreeScope;
class HTMLContentSelection;
class ShadowTree {
public:
ShadowTree();
~ShadowTree();
Element* host() const;
bool hasShadowRoot() const;
ShadowRoot* youngestShadowRoot() const;
ShadowRoot* oldestShadowRoot() const;
void addShadowRoot(Element* shadowHost, PassRefPtr<ShadowRoot>, ExceptionCode&);
void removeAllShadowRoots();
void willRemove();
void setParentTreeScope(TreeScope*);
void attach();
void detach();
void reattach();
void attachHost(Element*);
void detachHost(Element*);
bool childNeedsStyleRecalc();
bool needsStyleRecalc();
void recalcShadowTreeStyle(Node::StyleChange);
void setNeedsReattachHostChildrenAndShadow();
void clearNeedsReattachHostChildrenAndShadow();
bool needsReattachHostChildrenAndShadow();
void reattachHostChildrenAndShadow();
void hostChildrenChanged();
InsertionPoint* insertionPointFor(const Node*) const;
HTMLContentSelection* selectionFor(const Node*) const;
HTMLContentSelector& selector();
const HTMLContentSelector& selector() const;
private:
DoublyLinkedList<ShadowRoot> m_shadowRoots;
HTMLContentSelector m_selector;
bool m_needsRecalculateContent : 1;
WTF_MAKE_NONCOPYABLE(ShadowTree);
};
inline bool ShadowTree::hasShadowRoot() const
{
return !m_shadowRoots.isEmpty();
}
inline ShadowRoot* ShadowTree::youngestShadowRoot() const
{
return m_shadowRoots.head();
}
inline ShadowRoot* ShadowTree::oldestShadowRoot() const
{
return m_shadowRoots.tail();
}
inline HTMLContentSelector& ShadowTree::selector()
{
return m_selector;
}
inline const HTMLContentSelector& ShadowTree::selector() const
{
return m_selector;
}
inline void ShadowTree::clearNeedsReattachHostChildrenAndShadow()
{
m_needsRecalculateContent = false;
}
inline Element* ShadowTree::host() const
{
ASSERT(hasShadowRoot());
return youngestShadowRoot()->host();
}
class ShadowRootVector : public Vector<RefPtr<ShadowRoot> > {
public:
explicit ShadowRootVector(ShadowTree* tree)
{
for (ShadowRoot* root = tree->youngestShadowRoot(); root; root = root->olderShadowRoot())
append(root);
}
};
}
#endif