mirror of
https://github.com/renbaoshuo/S2OJ.git
synced 2024-11-22 23:28:40 +00:00
96d4a3ecf7
Due to historical reasons, the code is in subfolder "1". With SVN removal, we place the code back and remove the annoying "1" folder.
43 lines
1.7 KiB
JavaScript
43 lines
1.7 KiB
JavaScript
// CodeMirror, copyright (c) by Marijn Haverbeke and others
|
|
// Distributed under an MIT license: http://codemirror.net/LICENSE
|
|
|
|
(function(mod) {
|
|
if (typeof exports == "object" && typeof module == "object") // CommonJS
|
|
mod(require("../../lib/codemirror"));
|
|
else if (typeof define == "function" && define.amd) // AMD
|
|
define(["../../lib/codemirror"], mod);
|
|
else // Plain browser env
|
|
mod(CodeMirror);
|
|
})(function(CodeMirror) {
|
|
"use strict";
|
|
|
|
var WORD = /[\w$]+/, RANGE = 500;
|
|
|
|
CodeMirror.registerHelper("hint", "anyword", function(editor, options) {
|
|
var word = options && options.word || WORD;
|
|
var range = options && options.range || RANGE;
|
|
var cur = editor.getCursor(), curLine = editor.getLine(cur.line);
|
|
var start = cur.ch, end = start;
|
|
while (end < curLine.length && word.test(curLine.charAt(end))) ++end;
|
|
while (start && word.test(curLine.charAt(start - 1))) --start;
|
|
var curWord = start != end && curLine.slice(start, end);
|
|
|
|
var list = [], seen = {};
|
|
var re = new RegExp(word.source, "g");
|
|
for (var dir = -1; dir <= 1; dir += 2) {
|
|
var line = cur.line, endLine = Math.min(Math.max(line + dir * range, editor.firstLine()), editor.lastLine()) + dir;
|
|
for (; line != endLine; line += dir) {
|
|
var text = editor.getLine(line), m;
|
|
while (m = re.exec(text)) {
|
|
if (line == cur.line && m[0] === curWord) continue;
|
|
if ((!curWord || m[0].lastIndexOf(curWord, 0) == 0) && !Object.prototype.hasOwnProperty.call(seen, m[0])) {
|
|
seen[m[0]] = true;
|
|
list.push(m[0]);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return {list: list, from: CodeMirror.Pos(cur.line, start), to: CodeMirror.Pos(cur.line, end)};
|
|
});
|
|
});
|