2019-06-15 18:55:47 +02:00
|
|
|
#pragma once
|
|
|
|
|
2019-06-15 22:49:44 +02:00
|
|
|
#include <AK/Badge.h>
|
2019-06-21 18:45:35 +02:00
|
|
|
#include <AK/RefPtr.h>
|
2019-09-28 22:59:16 +02:00
|
|
|
#include <AK/String.h>
|
2019-06-15 18:55:47 +02:00
|
|
|
#include <AK/Vector.h>
|
2019-06-25 19:46:01 +02:00
|
|
|
#include <LibHTML/TreeNode.h>
|
2019-06-15 18:55:47 +02:00
|
|
|
|
|
|
|
enum class NodeType : unsigned {
|
|
|
|
INVALID = 0,
|
|
|
|
ELEMENT_NODE = 1,
|
|
|
|
TEXT_NODE = 3,
|
2019-10-12 23:26:47 +02:00
|
|
|
COMMENT_NODE = 8,
|
2019-06-15 18:55:47 +02:00
|
|
|
DOCUMENT_NODE = 9,
|
2019-10-09 20:17:01 +02:00
|
|
|
DOCUMENT_TYPE_NODE = 10,
|
2019-06-15 18:55:47 +02:00
|
|
|
};
|
|
|
|
|
2019-09-29 11:43:07 +02:00
|
|
|
class Document;
|
2019-10-06 19:54:50 +02:00
|
|
|
class Element;
|
2019-09-29 12:24:36 +02:00
|
|
|
class HTMLElement;
|
2019-09-29 11:59:38 +02:00
|
|
|
class HTMLAnchorElement;
|
2019-06-15 22:49:44 +02:00
|
|
|
class ParentNode;
|
2019-09-25 12:17:29 +03:00
|
|
|
class LayoutNode;
|
|
|
|
class StyleResolver;
|
|
|
|
class StyleProperties;
|
2019-06-15 22:49:44 +02:00
|
|
|
|
2019-06-25 19:46:01 +02:00
|
|
|
class Node : public TreeNode<Node> {
|
2019-06-15 18:55:47 +02:00
|
|
|
public:
|
|
|
|
virtual ~Node();
|
|
|
|
|
|
|
|
NodeType type() const { return m_type; }
|
|
|
|
bool is_element() const { return type() == NodeType::ELEMENT_NODE; }
|
|
|
|
bool is_text() const { return type() == NodeType::TEXT_NODE; }
|
|
|
|
bool is_document() const { return type() == NodeType::DOCUMENT_NODE; }
|
2019-10-09 20:17:01 +02:00
|
|
|
bool is_document_type() const { return type() == NodeType::DOCUMENT_TYPE_NODE; }
|
2019-10-12 23:26:47 +02:00
|
|
|
bool is_comment() const { return type() == NodeType::COMMENT_NODE; }
|
|
|
|
bool is_character_data() const { return type() == NodeType::TEXT_NODE || type() == NodeType::COMMENT_NODE; }
|
2019-06-15 18:55:47 +02:00
|
|
|
bool is_parent_node() const { return is_element() || is_document(); }
|
|
|
|
|
2019-10-09 20:17:01 +02:00
|
|
|
virtual RefPtr<LayoutNode> create_layout_node(const StyleResolver&, const StyleProperties* parent_style) const;
|
2019-09-25 12:17:29 +03:00
|
|
|
|
2019-09-28 22:59:16 +02:00
|
|
|
virtual String tag_name() const = 0;
|
|
|
|
|
2019-09-29 16:22:15 +02:00
|
|
|
virtual String text_content() const;
|
|
|
|
|
2019-09-29 11:43:07 +02:00
|
|
|
Document& document() { return m_document; }
|
|
|
|
const Document& document() const { return m_document; }
|
|
|
|
|
2019-09-29 11:59:38 +02:00
|
|
|
const HTMLAnchorElement* enclosing_link_element() const;
|
2019-09-29 12:24:36 +02:00
|
|
|
const HTMLElement* enclosing_html_element() const;
|
|
|
|
|
|
|
|
virtual bool is_html_element() const { return false; }
|
2019-09-29 11:59:38 +02:00
|
|
|
|
2019-10-06 20:47:57 +02:00
|
|
|
template<typename T>
|
|
|
|
const T* first_child_of_type() const;
|
2019-09-29 16:24:57 +02:00
|
|
|
|
2019-10-06 21:07:36 +02:00
|
|
|
template<typename T>
|
|
|
|
const T* first_ancestor_of_type() const;
|
|
|
|
|
2019-09-29 17:40:39 +02:00
|
|
|
virtual void inserted_into(Node&) {}
|
|
|
|
virtual void removed_from(Node&) {}
|
|
|
|
|
2019-10-04 21:05:52 +02:00
|
|
|
const LayoutNode* layout_node() const { return m_layout_node; }
|
|
|
|
LayoutNode* layout_node() { return m_layout_node; }
|
|
|
|
|
|
|
|
void set_layout_node(Badge<LayoutNode>, LayoutNode* layout_node) const { m_layout_node = layout_node; }
|
|
|
|
|
2019-10-06 19:54:50 +02:00
|
|
|
const Element* previous_element_sibling() const;
|
|
|
|
const Element* next_element_sibling() const;
|
|
|
|
|
2019-10-12 23:26:47 +02:00
|
|
|
virtual bool is_child_allowed(const Node&) const { return true; }
|
|
|
|
|
2019-10-14 18:32:02 +02:00
|
|
|
void invalidate_style();
|
|
|
|
|
2019-06-15 18:55:47 +02:00
|
|
|
protected:
|
2019-09-29 11:43:07 +02:00
|
|
|
Node(Document&, NodeType);
|
2019-06-15 18:55:47 +02:00
|
|
|
|
2019-09-29 11:43:07 +02:00
|
|
|
Document& m_document;
|
2019-10-04 21:05:52 +02:00
|
|
|
mutable LayoutNode* m_layout_node { nullptr };
|
2019-06-15 18:55:47 +02:00
|
|
|
NodeType m_type { NodeType::INVALID };
|
|
|
|
};
|
2019-10-06 20:37:39 +02:00
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
inline bool is(const Node&)
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
inline bool is(const Node* node)
|
|
|
|
{
|
|
|
|
return node && is<T>(*node);
|
|
|
|
}
|
|
|
|
|
|
|
|
template<>
|
|
|
|
inline bool is<Node>(const Node&)
|
|
|
|
{
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
template<>
|
|
|
|
inline bool is<ParentNode>(const Node& node)
|
|
|
|
{
|
|
|
|
return node.is_parent_node();
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
inline const T& to(const Node& node)
|
|
|
|
{
|
|
|
|
ASSERT(is<T>(node));
|
|
|
|
return static_cast<const T&>(node);
|
|
|
|
}
|
|
|
|
|
2019-10-06 20:47:57 +02:00
|
|
|
template<typename T>
|
|
|
|
inline T* to(Node* node)
|
|
|
|
{
|
|
|
|
ASSERT(is<T>(node));
|
|
|
|
return static_cast<T*>(node);
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
inline const T* to(const Node* node)
|
|
|
|
{
|
|
|
|
ASSERT(is<T>(node));
|
|
|
|
return static_cast<const T*>(node);
|
|
|
|
}
|
|
|
|
|
2019-10-06 20:37:39 +02:00
|
|
|
template<typename T>
|
|
|
|
inline T& to(Node& node)
|
|
|
|
{
|
|
|
|
ASSERT(is<T>(node));
|
|
|
|
return static_cast<T&>(node);
|
|
|
|
}
|
2019-10-06 20:47:57 +02:00
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
inline const T* Node::first_child_of_type() const
|
|
|
|
{
|
|
|
|
for (auto* child = first_child(); child; child = child->next_sibling()) {
|
|
|
|
if (is<T>(*child))
|
|
|
|
return to<T>(child);
|
|
|
|
}
|
|
|
|
return nullptr;
|
|
|
|
}
|
2019-10-06 21:07:36 +02:00
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
inline const T* Node::first_ancestor_of_type() const
|
|
|
|
{
|
|
|
|
for (auto* ancestor = parent(); ancestor; ancestor = ancestor->parent()) {
|
|
|
|
if (is<T>(*ancestor))
|
|
|
|
return to<T>(ancestor);
|
|
|
|
}
|
|
|
|
return nullptr;
|
|
|
|
}
|