@tanishiking/aho-corasick
Version:
TypeScript implementation of the Aho-Corasick algorithm for efficient string matching
30 lines (29 loc) • 1.09 kB
JavaScript
;
var __extends = (this && this.__extends) || (function () {
var extendStatics = function (d, b) {
extendStatics = Object.setPrototypeOf ||
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
return extendStatics(d, b);
};
return function (d, b) {
extendStatics(d, b);
function __() { this.constructor = d; }
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
};
})();
Object.defineProperty(exports, "__esModule", { value: true });
exports.Emit = void 0;
var interval_1 = require("./interval/interval");
var Emit = /** @class */ (function (_super) {
__extends(Emit, _super);
function Emit(start, end, keyword) {
var _this = _super.call(this, start, end) || this;
_this.start = start;
_this.end = end;
_this.keyword = keyword;
return _this;
}
return Emit;
}(interval_1.Interval));
exports.Emit = Emit;