-
-
Notifications
You must be signed in to change notification settings - Fork 5
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
54 changed files
with
2,616 additions
and
1,140 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,32 @@ | ||
| import { AhoCorasick } from '../model/TextFilter/filter' | ||
|
|
||
| /** | ||
| * Check if given string is already used in the game room (check duplicated nickname) | ||
| * @param compare plain text to be compared | ||
| * @returns return `true` when already in use | ||
| */ | ||
| export function isExistNickname(compare: string): boolean { | ||
| for (let eachPlayer of window.gameRoom.playerList.values()) { | ||
| if(eachPlayer.name.trim() === compare.trim()) { | ||
| return true; | ||
| } | ||
| } | ||
| return false; | ||
| } | ||
|
|
||
| /** | ||
| * Check if given string includes banned words from nickname filter | ||
| * @param pool banned words list | ||
| * @param compare plain text to be compared | ||
| * @returns return `true` when includes banned word(s) | ||
| */ | ||
| export function isIncludeBannedWords(pool: string[], compare: string): boolean { | ||
| const ac = new AhoCorasick(pool); | ||
| const results = ac.search(compare); | ||
|
|
||
| if(Array.isArray(results) && results.length) { | ||
| return true; | ||
| } else { | ||
| return false; | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,107 @@ | ||
| /* | ||
| Text filter for Haxbotron by dapucita | ||
| ============================ | ||
| Implementation of the Aho-Corasick string searching algorithm | ||
| Source code originally from https://github.com/BrunoRB/ahocorasick | ||
| var AhoCorasick = require('ahocorasick'); | ||
| var ac = new AhoCorasick(['keyword1', 'keyword2', 'etc']); | ||
| var results = ac.search('should find keyword1 at position 19 and keyword2 at position 47.'); | ||
| // [ [ 19, [ 'keyword1' ] ], [ 47, [ 'keyword2' ] ] ] | ||
| ============================ | ||
| MIT License | ||
| */ | ||
|
|
||
| export class AhoCorasick { | ||
| constructor(keywords) { | ||
| this._buildTables(keywords); | ||
| } | ||
| _buildTables(keywords) { | ||
| var gotoFn = { | ||
| 0: {} | ||
| }; | ||
| var output = {}; | ||
|
|
||
| var state = 0; | ||
| keywords.forEach(function (word) { | ||
| var curr = 0; | ||
| for (var i = 0; i < word.length; i++) { | ||
| var l = word[i]; | ||
| if (gotoFn[curr] && l in gotoFn[curr]) { | ||
| curr = gotoFn[curr][l]; | ||
| } | ||
| else { | ||
| state++; | ||
| gotoFn[curr][l] = state; | ||
| gotoFn[state] = {}; | ||
| curr = state; | ||
| output[state] = []; | ||
| } | ||
| } | ||
|
|
||
| output[curr].push(word); | ||
| }); | ||
|
|
||
| var failure = {}; | ||
| var xs = []; | ||
|
|
||
| // f(s) = 0 for all states of depth 1 (the ones from which the 0 state can transition to) | ||
| for (var l in gotoFn[0]) { | ||
| var state = gotoFn[0][l]; | ||
| failure[state] = 0; | ||
| xs.push(state); | ||
| } | ||
|
|
||
| while (xs.length) { | ||
| var r = xs.shift(); | ||
| // for each symbol a such that g(r, a) = s | ||
| for (var l in gotoFn[r]) { | ||
| var s = gotoFn[r][l]; | ||
| xs.push(s); | ||
|
|
||
| // set state = f(r) | ||
| var state = failure[r]; | ||
| while (state > 0 && !(l in gotoFn[state])) { | ||
| state = failure[state]; | ||
| } | ||
|
|
||
| if (l in gotoFn[state]) { | ||
| var fs = gotoFn[state][l]; | ||
| failure[s] = fs; | ||
| output[s] = output[s].concat(output[fs]); | ||
| } | ||
| else { | ||
| failure[s] = 0; | ||
| } | ||
| } | ||
| } | ||
|
|
||
| this.gotoFn = gotoFn; | ||
| this.output = output; | ||
| this.failure = failure; | ||
| } | ||
| search(string) { | ||
| var state = 0; | ||
| var results = []; | ||
| for (var i = 0; i < string.length; i++) { | ||
| var l = string[i]; | ||
| while (state > 0 && !(l in this.gotoFn[state])) { | ||
| state = this.failure[state]; | ||
| } | ||
| if (!(l in this.gotoFn[state])) { | ||
| continue; | ||
| } | ||
|
|
||
| state = this.gotoFn[state][l]; | ||
|
|
||
| if (this.output[state].length) { | ||
| var foundStrs = this.output[state]; | ||
| results.push([i, foundStrs]); | ||
| } | ||
| } | ||
|
|
||
| return results; | ||
| } | ||
| } |
Oops, something went wrong.