mirrors/ladybird
0
0
Fork 0
mirror of https://github.com/LadybirdBrowser/ladybird.git synced 2025-07-05 00:21:52 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 9

LibWeb: Add Range::for_each_contained()

Browse source 
This centralizes the logic for iterating over a Range's contained nodes.
This commit is contained in:
Jelle Raaijmakers 2025-01-09 10:20:07 +01:00 • committed by Andreas Kling
parent 2466021e55
commit 4323669939
Notes: github-actions[bot] 2025-01-10 22:39:13 +00:00
5 changed files with 44 additions and 26 deletions
Download patch file Download diff file Expand all files Collapse all files

12
Libraries/LibWeb/Editing/Internal/Algorithms.cpp
View file

@ -590,21 +590,17 @@ void delete_the_selection(Selection& selection, bool block_merging, bool strip_w
// 24. For each node contained in the active range, append node to node list if the last member of node list (if
// any) is not an ancestor of node; node is editable; and node is not a thead, tbody, tfoot, tr, th, or td.
auto common_ancestor = active_range()->common_ancestor_container();
common_ancestor->for_each_in_subtree([&](GC::Ref<DOM::Node> node) {
if (!active_range()->contains_node(node))
return TraversalDecision::SkipChildrenAndContinue;
active_range()->for_each_contained([&node_list](GC::Ref<DOM::Node> node) {
if (!node_list.is_empty() && node_list.last()->is_ancestor_of(node))
return TraversalDecision::SkipChildrenAndContinue;
return IterationDecision::Continue;
if (!node->is_editable())
return TraversalDecision::Continue;
return IterationDecision::Continue;
if (!is<HTML::HTMLTableSectionElement>(*node) && !is<HTML::HTMLTableRowElement>(*node) && !is<HTML::HTMLTableCellElement>(*node))
node_list.append(node);
return TraversalDecision::Continue;
return IterationDecision::Continue;
});
// 25. For each node in node list: