blob: 2efcc4af3c3dc1e586766e054151995075dd5ce5 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
/*
* Copyright (c) 2020, the SerenityOS developers.
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#pragma once
#include <LibVT/Position.h>
namespace VT {
class Range {
public:
Range() { }
Range(const VT::Position& start, const VT::Position& end)
: m_start(start)
, m_end(end)
{
}
bool is_valid() const { return m_start.is_valid() && m_end.is_valid(); }
void clear()
{
m_start = {};
m_end = {};
}
VT::Position& start() { return m_start; }
VT::Position& end() { return m_end; }
const VT::Position& start() const { return m_start; }
const VT::Position& end() const { return m_end; }
Range normalized() const { return Range(normalized_start(), normalized_end()); }
void set_start(const VT::Position& position) { m_start = position; }
void set_end(const VT::Position& position) { m_end = position; }
void set(const VT::Position& start, const VT::Position& end)
{
m_start = start;
m_end = end;
}
bool operator==(const Range& other) const
{
return m_start == other.m_start && m_end == other.m_end;
}
bool contains(const VT::Position& position) const
{
if (!(position.row() > m_start.row() || (position.row() == m_start.row() && position.column() >= m_start.column())))
return false;
if (!(position.row() < m_end.row() || (position.row() == m_end.row() && position.column() <= m_end.column())))
return false;
return true;
}
private:
VT::Position normalized_start() const { return m_start < m_end ? m_start : m_end; }
VT::Position normalized_end() const { return m_start < m_end ? m_end : m_start; }
VT::Position m_start;
VT::Position m_end;
};
};
|
