NodeIterator.h 2.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081
  1. /*
  2. * Copyright (c) 2022, Andreas Kling <kling@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #pragma once
  7. #include <AK/RefCounted.h>
  8. #include <LibWeb/Bindings/Wrappable.h>
  9. #include <LibWeb/DOM/NodeFilter.h>
  10. namespace Web::DOM {
  11. // https://dom.spec.whatwg.org/#nodeiterator
  12. class NodeIterator
  13. : public RefCounted<NodeIterator>
  14. , public Bindings::Wrappable {
  15. public:
  16. using WrapperType = Bindings::NodeIteratorWrapper;
  17. virtual ~NodeIterator() override;
  18. static NonnullRefPtr<NodeIterator> create(Node& root, unsigned what_to_show, RefPtr<NodeFilter>);
  19. NonnullRefPtr<Node> root() { return m_root; }
  20. NonnullRefPtr<Node> reference_node() { return m_reference.node; }
  21. bool pointer_before_reference_node() const { return m_reference.is_before_node; }
  22. unsigned what_to_show() const { return m_what_to_show; }
  23. NodeFilter* filter() { return m_filter; }
  24. JS::ThrowCompletionOr<RefPtr<Node>> next_node();
  25. JS::ThrowCompletionOr<RefPtr<Node>> previous_node();
  26. void detach();
  27. void run_pre_removing_steps(Node&);
  28. private:
  29. NodeIterator(Node& root);
  30. enum class Direction {
  31. Next,
  32. Previous,
  33. };
  34. JS::ThrowCompletionOr<RefPtr<Node>> traverse(Direction);
  35. JS::ThrowCompletionOr<NodeFilter::Result> filter(Node&);
  36. // https://dom.spec.whatwg.org/#concept-traversal-root
  37. NonnullRefPtr<DOM::Node> m_root;
  38. struct NodePointer {
  39. NonnullRefPtr<DOM::Node> node;
  40. // https://dom.spec.whatwg.org/#nodeiterator-pointer-before-reference
  41. bool is_before_node { true };
  42. };
  43. void run_pre_removing_steps_with_node_pointer(Node&, NodePointer&);
  44. // https://dom.spec.whatwg.org/#nodeiterator-reference
  45. NodePointer m_reference;
  46. // While traversal is ongoing, we keep track of the current node pointer.
  47. // This allows us to adjust it during traversal if calling the filter ends up removing the node from the DOM.
  48. Optional<NodePointer> m_traversal_pointer;
  49. // https://dom.spec.whatwg.org/#concept-traversal-whattoshow
  50. unsigned m_what_to_show { 0 };
  51. // https://dom.spec.whatwg.org/#concept-traversal-filter
  52. RefPtr<DOM::NodeFilter> m_filter;
  53. // https://dom.spec.whatwg.org/#concept-traversal-active
  54. bool m_active { false };
  55. };
  56. }