Serenity Operating System
at hosted 86 lines 2.7 kB view raw
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 27#pragma once 28 29#include <AK/RefPtr.h> 30 31namespace Web { 32 33class LayoutNode; 34 35struct LayoutPosition { 36 bool operator>=(const LayoutPosition& other) const 37 { 38 if (layout_node == other.layout_node) 39 return index_in_node >= other.index_in_node; 40 41 // FIXME: Implement. 42 return true; 43 } 44 45 bool operator<=(const LayoutPosition& other) const 46 { 47 if (layout_node == other.layout_node) 48 return index_in_node <= other.index_in_node; 49 50 // FIXME: Implement. 51 return false; 52 } 53 54 RefPtr<LayoutNode> layout_node; 55 int index_in_node { 0 }; 56}; 57 58class LayoutRange { 59public: 60 LayoutRange() {} 61 LayoutRange(const LayoutPosition& start, const LayoutPosition& end) 62 : m_start(start) 63 , m_end(end) 64 { 65 } 66 67 bool is_valid() const { return m_start.layout_node && m_end.layout_node; } 68 69 void set(const LayoutPosition& start, const LayoutPosition& end) 70 { 71 m_start = start; 72 m_end = end; 73 } 74 75 void set_start(const LayoutPosition& start) { m_start = start; } 76 void set_end(const LayoutPosition& end) { m_end = end; } 77 78 const LayoutPosition& start() const { return m_start; } 79 const LayoutPosition& end() const { return m_end; } 80 81private: 82 LayoutPosition m_start; 83 LayoutPosition m_end; 84}; 85 86}