LibWeb: Remove unused (Tree)Node::index_of_child()

This commit is contained in:
Jelle Raaijmakers 2024-12-18 14:02:54 +01:00 committed by Tim Ledbetter
parent 637f934f69
commit c357fbf036
Notes: github-actions[bot] 2024-12-18 23:47:29 +00:00
2 changed files with 0 additions and 51 deletions

View file

@ -389,39 +389,6 @@ public:
return index;
}
Optional<size_t> index_of_child(Node const& search_child)
{
VERIFY(search_child.parent() == this);
size_t index = 0;
auto* child = first_child();
VERIFY(child);
do {
if (child == &search_child)
return index;
index++;
} while (child && (child = child->next_sibling()));
return {};
}
template<typename ChildType>
Optional<size_t> index_of_child(Node const& search_child)
{
VERIFY(search_child.parent() == this);
size_t index = 0;
auto* child = first_child();
VERIFY(child);
do {
if (!is<ChildType>(child))
continue;
if (child == &search_child)
return index;
index++;
} while (child && (child = child->next_sibling()));
return {};
}
bool is_ancestor_of(Node const&) const;
bool is_inclusive_ancestor_of(Node const&) const;
bool is_descendant_of(Node const&) const;

View file

@ -41,24 +41,6 @@ public:
return index;
}
template<typename ChildType>
Optional<size_t> index_of_child(T const& search_child)
{
VERIFY(search_child.parent() == this);
size_t index = 0;
auto* child = first_child();
VERIFY(child);
do {
if (!is<ChildType>(child))
continue;
if (child == &search_child)
return index;
index++;
} while (child && (child = child->next_sibling()));
return {};
}
bool is_ancestor_of(TreeNode const&) const;
bool is_inclusive_ancestor_of(TreeNode const&) const;