yomichan/ext/fg/js/source-range.js

151 lines
4.6 KiB
JavaScript
Raw Normal View History

2016-04-22 05:03:06 +00:00
/*
* 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/>.
*/
2016-07-23 20:12:24 +00:00
class TextSourceRange {
2016-04-22 05:03:06 +00:00
constructor(range) {
2016-04-24 05:34:56 +00:00
this.rng = range;
2016-04-22 05:03:06 +00:00
}
2016-07-26 03:07:54 +00:00
clone() {
return new TextSourceRange(this.rng.cloneRange());
}
2016-04-22 05:03:06 +00:00
text() {
2016-04-24 05:34:56 +00:00
return this.rng.toString();
2016-04-22 05:03:06 +00:00
}
2016-07-25 04:18:17 +00:00
setEndOffset(length) {
2016-07-26 03:07:54 +00:00
const lengthAdj = length + this.rng.startOffset;
const state = TextSourceRange.seekForward(this.rng.startContainer, lengthAdj);
this.rng.setEnd(state.node, state.offset);
return length - state.length;
2016-07-25 04:18:17 +00:00
}
setStartOffset(length) {
2016-07-26 03:07:54 +00:00
const lengthAdj = length + (this.rng.startContainer.length - this.rng.startOffset);
const state = TextSourceRange.seekBackward(this.rng.startContainer, lengthAdj);
this.rng.setStart(state.node, state.offset);
return length - state.length;
}
2016-04-23 05:25:12 +00:00
containsPoint(point) {
2016-04-24 18:04:24 +00:00
const rect = this.getPaddedRect();
2016-04-23 05:25:12 +00:00
return point.x >= rect.left && point.x <= rect.right;
}
2016-04-24 18:04:24 +00:00
getRect() {
return this.rng.getBoundingClientRect();
}
getPaddedRect() {
2016-07-26 03:07:54 +00:00
const range = this.rng.cloneRange();
2016-04-23 17:10:34 +00:00
const startOffset = range.startOffset;
2016-07-26 03:07:54 +00:00
const endOffset = range.endOffset;
const node = range.startContainer;
2016-04-22 05:03:06 +00:00
2016-04-23 17:10:34 +00:00
range.setStart(node, Math.max(0, startOffset - 1));
range.setEnd(node, Math.min(node.length, endOffset + 1));
return range.getBoundingClientRect();
}
2016-04-24 18:04:24 +00:00
select() {
2016-04-23 17:10:34 +00:00
const selection = window.getSelection();
2016-04-24 18:31:55 +00:00
selection.removeAllRanges();
2016-04-24 18:04:24 +00:00
selection.addRange(this.rng);
2016-04-23 17:10:34 +00:00
}
deselect() {
const selection = window.getSelection();
2016-04-24 04:09:33 +00:00
selection.removeAllRanges();
2016-04-23 17:10:34 +00:00
}
2016-07-23 20:06:09 +00:00
equals(other) {
return other.rng && other.rng.compareBoundaryPoints(Range.START_TO_START, this.rng) == 0;
2016-04-22 05:03:06 +00:00
}
2016-07-25 04:18:17 +00:00
static seekForward(node, length) {
2016-06-13 03:48:21 +00:00
const state = {node, offset: 0, length};
2016-07-25 04:18:17 +00:00
if (!TextSourceRange.seekForwardHelper(node, state)) {
return state;
}
2016-06-13 03:48:21 +00:00
2016-07-25 04:18:17 +00:00
for (let current = node; current !== null; current = current.parentElement) {
for (let sibling = current.nextSibling; sibling !== null; sibling = sibling.nextSibling) {
if (!TextSourceRange.seekForwardHelper(sibling, state)) {
return state;
}
}
2016-06-13 03:48:21 +00:00
}
2016-07-25 04:18:17 +00:00
return state;
}
static seekForwardHelper(node, state) {
if (node.nodeType === 3) {
const consumed = Math.min(node.length, state.length);
state.node = node;
state.offset = consumed;
state.length -= consumed;
} else {
for (let i = 0; i < node.childNodes.length; ++i) {
if (!TextSourceRange.seekForwardHelper(node.childNodes[i], state)) {
break;
}
2016-06-13 03:48:21 +00:00
}
}
2016-07-25 04:18:17 +00:00
return state.length > 0;
}
static seekBackward(node, length) {
const state = {node, offset: node.length, length};
if (!TextSourceRange.seekBackwardHelper(node, state)) {
return state;
}
for (let current = node; current !== null; current = current.parentElement) {
for (let sibling = current.previousSibling; sibling !== null; sibling = sibling.previousSibling) {
if (!TextSourceRange.seekBackwardHelper(sibling, state)) {
return state;
}
2016-06-13 03:48:21 +00:00
}
}
2016-07-25 04:18:17 +00:00
return state;
2016-06-13 03:48:21 +00:00
}
2016-07-25 04:18:17 +00:00
static seekBackwardHelper(node, state) {
2016-06-13 03:48:21 +00:00
if (node.nodeType === 3) {
const consumed = Math.min(node.length, state.length);
state.node = node;
2016-07-25 04:18:17 +00:00
state.offset = node.length - consumed;
2016-06-13 03:48:21 +00:00
state.length -= consumed;
} else {
2016-07-25 04:18:17 +00:00
for (let i = node.childNodes.length - 1; i >= 0; --i) {
if (!TextSourceRange.seekBackwardHelper(node.childNodes[i], state)) {
2016-06-13 03:48:21 +00:00
break;
}
}
}
return state.length > 0;
}
2016-04-22 05:03:06 +00:00
}