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