mirrors/ladybird
1
0
Fork 0
mirror of https://github.com/LadybirdBrowser/ladybird.git synced 2025-04-21 03:55:24 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 10

LibHTML: Add Document::normalize()

Browse source 
This method wraps the document tree in <html> and <body> elements if needed.
This commit is contained in:
Sergey Bugaev 2019-09-25 12:26:26 +03:00 • committed by Andreas Kling
parent 599edba7a3
commit c1ef63379c
Notes: sideshowbarker 2024-07-19 11:56:19 +09:00
3 changed files with 36 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

15
Libraries/LibHTML/DOM/Document.cpp
View file

@ -19,3 +19,18 @@ StyleResolver& Document::style_resolver()
m_style_resolver = make<StyleResolver>(*this);
return *m_style_resolver;
}
void Document::normalize()
{
if (first_child() != nullptr && first_child()->is_element()) {
const Element& el = static_cast<const Element&>(*first_child());
if (el.tag_name() == "html")
return;
}
NonnullRefPtr<Element> body = adopt(*new Element("body"));
NonnullRefPtr<Element> html = adopt(*new Element("html"));
html->append_child(body);
this->donate_all_children_to(body);
this->append_child(html);
}

2
Libraries/LibHTML/DOM/Document.h
View file

@ -16,6 +16,8 @@ public:
Document();
virtual ~Document() override;
void normalize();
StyleResolver& style_resolver();
void add_sheet(const StyleSheet& sheet) { m_sheets.append(sheet); }

19
Libraries/LibHTML/TreeNode.h
View file

@ -34,6 +34,7 @@ public:
const T* last_child() const { return m_last_child; }
void append_child(NonnullRefPtr<T> node);
void donate_all_children_to(T& node);
protected:
TreeNode() { }
@ -59,3 +60,21 @@ inline void TreeNode<T>::append_child(NonnullRefPtr<T> node)
if (!m_first_child)
m_first_child = m_last_child;
}
template<typename T>
inline void TreeNode<T>::donate_all_children_to(T& node)
{
for (T* child = m_first_child; child != nullptr;) {
T* next_child = child->m_next_sibling;
child->m_parent = nullptr;
child->m_next_sibling = nullptr;
child->m_previous_sibling = nullptr;
node.append_child(adopt(*child));
child = next_child;
}
m_first_child = nullptr;
m_last_child = nullptr;
}