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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
|
/*
* Copyright (C) 2016 Alex Yatskov <alex@foosoft.net>
* Author: Alex Yatskov <alex@foosoft.net>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
class Range {
constructor(range) {
this.rng = range;
}
text() {
return this.rng.toString();
}
setLength(length) {
const node = this.rng.startContainer;
const offset = this.rng.startOffset;
length = Math.min(node.length - offset, length);
if (length === 0) {
return null;
}
this.rng.setEnd(node, offset + length);
return length;
}
containsPoint(point) {
const rect = this.getBoundingClientRect();
return point.x >= rect.left && point.x <= rect.right;
}
getBoundingClientRect() {
const range = this.rng.cloneRange();
const startOffset = range.startOffset;
const endOffset = range.endOffset;
const node = range.startContainer;
range.setStart(node, Math.max(0, startOffset - 1));
range.setEnd(node, Math.min(node.length, endOffset + 1));
return range.getBoundingClientRect();
}
select(length) {
const range = this.rng.cloneRange();
range.setEnd(range.startContainer, range.startOffset + length);
const selection = window.getSelection();
selection.removeAllRanges();
selection.addRange(range);
}
deselect() {
const selection = window.getSelection();
selection.removeAllRanges();
}
equals(range) {
const equal =
range.rng.compareBoundaryPoints(Range.END_TO_END, this.rng) === 0 &&
range.rng.compareBoundaryPoints(Range.START_TO_START, this.rng) === 0;
return equal;
}
static fromPoint(point) {
const range = document.caretRangeFromPoint(point.x, point.y);
return range === null ? null : new Range(range);
}
}
|