db6cf9b37d
The AAA is a somewhat daunting algorithm you have to run for certain tag when inserted inside the <body> element. The purpose of it is to resolve issues with mismatched tags. This patch implements the first half of the AAA. We also move the "list of active formatting elements" to its own class, since it kept accumulating little behaviors. "Marker" entries are now signified by null Element pointers in the list.
97 lines
3.3 KiB
C++
97 lines
3.3 KiB
C++
/*
|
|
* Copyright (c) 2020, Andreas Kling <kling@serenityos.org>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* 2. 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.
|
|
*
|
|
* 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 HOLDER 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.
|
|
*/
|
|
|
|
#include <LibWeb/DOM/Element.h>
|
|
#include <LibWeb/Parser/StackOfOpenElements.h>
|
|
|
|
namespace Web {
|
|
|
|
static Vector<FlyString> s_base_list { "applet", "caption", "html", "table", "td", "th", "marquee", "object", "template" };
|
|
|
|
StackOfOpenElements::~StackOfOpenElements()
|
|
{
|
|
}
|
|
|
|
bool StackOfOpenElements::has_in_scope_impl(const FlyString& tag_name, const Vector<FlyString>& list) const
|
|
{
|
|
for (ssize_t i = m_elements.size() - 1; i >= 0; --i) {
|
|
auto& node = m_elements.at(i);
|
|
if (node.tag_name() == tag_name)
|
|
return true;
|
|
if (list.contains_slow(node.tag_name()))
|
|
return false;
|
|
}
|
|
ASSERT_NOT_REACHED();
|
|
}
|
|
|
|
bool StackOfOpenElements::has_in_scope(const FlyString& tag_name) const
|
|
{
|
|
return has_in_scope_impl(tag_name, s_base_list);
|
|
}
|
|
|
|
bool StackOfOpenElements::has_in_scope_impl(const Element& target_node, const Vector<FlyString>& list) const
|
|
{
|
|
for (ssize_t i = m_elements.size() - 1; i >= 0; --i) {
|
|
auto& node = m_elements.at(i);
|
|
if (&node == &target_node)
|
|
return true;
|
|
if (list.contains_slow(node.tag_name()))
|
|
return false;
|
|
}
|
|
ASSERT_NOT_REACHED();
|
|
}
|
|
|
|
bool StackOfOpenElements::has_in_scope(const Element& target_node) const
|
|
{
|
|
return has_in_scope_impl(target_node, s_base_list);
|
|
}
|
|
|
|
bool StackOfOpenElements::has_in_button_scope(const FlyString& tag_name) const
|
|
{
|
|
auto list = s_base_list;
|
|
list.append("button");
|
|
return has_in_scope_impl(tag_name, list);
|
|
}
|
|
|
|
bool StackOfOpenElements::has_in_table_scope(const FlyString& tag_name) const
|
|
{
|
|
auto list = s_base_list;
|
|
list.append("html");
|
|
list.append("table");
|
|
list.append("template");
|
|
return has_in_scope_impl(tag_name, list);
|
|
}
|
|
|
|
bool StackOfOpenElements::contains(const Element& element) const
|
|
{
|
|
for (auto& element_on_stack : m_elements) {
|
|
if (&element == &element_on_stack)
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
}
|