RGBCube/serenity
1
Fork 0
mirror of https://github.com/RGBCube/serenity synced 2025-05-31 08:58:11 +00:00
Code Issues Activity Actions

LibWeb: Fix build breakage after merging the oldish DOM inspector PR

Browse source
This commit is contained in:
Andreas Kling 2021-06-29 23:11:09 +02:00
parent fd06b8b713
commit 384cffaa04
2 changed files with 6 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

4
Userland/Libraries/LibWeb/DOM/Node.cpp
View file

@ -615,7 +615,7 @@ void Node::serialize_tree_as_json(JsonObjectSerializer<StringBuilder>& object) c
else if (is_element()) { else if (is_element()) {
object.add("type", "element"); object.add("type", "element");
auto element = downcast<DOM::Element>(this); auto element = static_cast<DOM::Element const*>(this);
if (element->has_attributes()) { if (element->has_attributes()) {
auto attributes = object.add_object("attributes"); auto attributes = object.add_object("attributes");
element->for_each_attribute([&attributes](auto& name, auto& value) { element->for_each_attribute([&attributes](auto& name, auto& value) {
@ -625,7 +625,7 @@ void Node::serialize_tree_as_json(JsonObjectSerializer<StringBuilder>& object) c
} else if (is_text()) { } else if (is_text()) {
object.add("type", "text"); object.add("type", "text");
auto text_node = downcast<DOM::Text>(this); auto text_node = static_cast<DOM::Text const*>(this);
object.add("text", text_node->data()); object.add("text", text_node->data());
} }

8
Userland/Libraries/LibWeb/DOMTreeJSONModel.cpp
View file

@ -66,7 +66,7 @@ GUI::ModelIndex DOMTreeJSONModel::parent_index(const GUI::ModelIndex& index) con
if (grandparent_children.is_empty()) if (grandparent_children.is_empty())
return {}; return {};
for (int grandparent_child_index = 0; grandparent_child_index < grandparent_children.size(); ++grandparent_child_index) { for (size_t grandparent_child_index = 0; grandparent_child_index < grandparent_children.size(); ++grandparent_child_index) {
auto child = grandparent_children[grandparent_child_index].as_object(); auto child = grandparent_children[grandparent_child_index].as_object();
if (get_internal_id(child) == parent_node_internal_id) if (get_internal_id(child) == parent_node_internal_id)
return create_index(grandparent_child_index, 0, (void*)(parent_node_internal_id)); return create_index(grandparent_child_index, 0, (void*)(parent_node_internal_id));
@ -134,7 +134,7 @@ GUI::Variant DOMTreeJSONModel::data(const GUI::ModelIndex& index, GUI::ModelRole
builder.append(node_name.to_lowercase()); builder.append(node_name.to_lowercase());
if (node.has("attributes")) { if (node.has("attributes")) {
auto attributes = node.get("attributes").as_object(); auto attributes = node.get("attributes").as_object();
attributes.for_each_member([&builder](auto& name, JsonValue& value) { attributes.for_each_member([&builder](auto& name, JsonValue const& value) {
builder.append(' '); builder.append(' ');
builder.append(name); builder.append(name);
builder.append('='); builder.append('=');
@ -163,7 +163,7 @@ Optional<JsonObject> DOMTreeJSONModel::find_parent_of_child_with_internal_id(Jso
{ {
auto children = get_children(node); auto children = get_children(node);
for (int i = 0; i < children.size(); ++i) { for (size_t i = 0; i < children.size(); ++i) {
auto child = children[i].as_object(); auto child = children[i].as_object();
auto child_internal_id = get_internal_id(child); auto child_internal_id = get_internal_id(child);
if (child_internal_id == internal_id) if (child_internal_id == internal_id)
@ -188,7 +188,7 @@ Optional<JsonObject> DOMTreeJSONModel::find_child_with_internal_id(JsonObject no
} }
auto children = get_children(node); auto children = get_children(node);
for (int i = 0; i < children.size(); ++i) { for (size_t i = 0; i < children.size(); ++i) {
auto child = children[i].as_object(); auto child = children[i].as_object();
auto maybe_node = find_child_with_internal_id(child, internal_id); auto maybe_node = find_child_with_internal_id(child, internal_id);
if (maybe_node.has_value()) if (maybe_node.has_value())