LayoutPosition.h 2.7 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586
  1. /*
  2. * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice, this
  9. * list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  18. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  19. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  21. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  22. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  23. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. #pragma once
  27. #include <AK/RefPtr.h>
  28. namespace Web {
  29. class LayoutNode;
  30. struct LayoutPosition {
  31. bool operator>=(const LayoutPosition& other) const
  32. {
  33. if (layout_node == other.layout_node)
  34. return index_in_node >= other.index_in_node;
  35. // FIXME: Implement.
  36. return true;
  37. }
  38. bool operator<=(const LayoutPosition& other) const
  39. {
  40. if (layout_node == other.layout_node)
  41. return index_in_node <= other.index_in_node;
  42. // FIXME: Implement.
  43. return false;
  44. }
  45. RefPtr<LayoutNode> layout_node;
  46. int index_in_node { 0 };
  47. };
  48. class LayoutRange {
  49. public:
  50. LayoutRange() {}
  51. LayoutRange(const LayoutPosition& start, const LayoutPosition& end)
  52. : m_start(start)
  53. , m_end(end)
  54. {
  55. }
  56. bool is_valid() const { return m_start.layout_node && m_end.layout_node; }
  57. void set(const LayoutPosition& start, const LayoutPosition& end)
  58. {
  59. m_start = start;
  60. m_end = end;
  61. }
  62. void set_start(const LayoutPosition& start) { m_start = start; }
  63. void set_end(const LayoutPosition& end) { m_end = end; }
  64. const LayoutPosition& start() const { return m_start; }
  65. const LayoutPosition& end() const { return m_end; }
  66. private:
  67. LayoutPosition m_start;
  68. LayoutPosition m_end;
  69. };
  70. }