Setup webpack to make things more organize

Especially after the publicity of that tweet. If this adds unnecessary overhead, I'll just concatenate the code manually

Author: iampueroo

js/Node.js

@@ -0,0 +1,46 @@
+export default class Node {
+
+	constructor(char) {
+		this.char = char
+		this.lowerChar = char.toLowerCase();
+		this.children = {};
+		this.count = 1;
+		this.priority = 0; // Binary weights
+	}
+
+	setPriority(_) {
+		this.priority = _;
+	}
+
+	isWord() {
+		return this._isWord === true;
+	}
+
+	setIsWord(_) {
+		this._isWord = !!_;
+	}
+
+	upCount() {
+		this.count++;
+	}
+
+	wordNodes() {
+		const words = []; // ordered list of { node, string}
+		if (this.isWord()) {
+			words.push({
+				s: this.char, // string
+				n: this, // node
+			})
+		}
+		for (const key of Object.keys(this.children)) {
+			const childNodes = this.children[key].wordNodes();
+			for (const d of childNodes) {
+				words.push({
+					s: this.char + d.s,
+					n: d.n,
+				});
+			}
+		}
+		return words;
+	}
+}

js/Trie.js

@@ -0,0 +1,73 @@
+import Node from './Node.js';
+
+export default class Trie {
+
+	constructor() {
+		this.root = new Node('');
+		this.size = 0;
+	}
+
+	addWords(words) {
+		words.forEach(w => this.addWord(w));
+	}
+
+	addWord(word) {
+		let node = this.root;
+		for (const char of word) {
+			if (!node.children[char]) {
+				node.children[char] = new Node(char);
+			}
+			node = node.children[char];
+		}
+		node.setIsWord(true);
+		node.upCount();
+		this.size++;
+	}
+
+	markSpecial(words) {
+		if (typeof words === 'string') {
+			words = [words];
+		}
+		words.forEach(w => {
+			if (!this.get(w)) {
+				this.addWord(w);
+			}
+			this.get(w).setPriority(1);
+		})
+	}
+
+	contains(word) {
+		const node = this.get(word);
+		return node && node.isWord();
+	}
+
+	find(prefix) {
+		if (!prefix) {
+			return '';
+		}
+		const node = this.get(prefix);
+		const words = node ? node.wordNodes() : [];
+		prefix = prefix.substr(0, prefix.length - 1);
+		return words.sort((a,b) => b.n.priority - a.n.priority).map(w => prefix + w.s);
+	}
+
+	get(word) {
+		let node = this.root;
+		let lowerChar;
+		for (const char of word) {
+			let lowerChar = char.toLowerCase();
+			if (node.children[char]) {
+				node = node.children[char];
+			} else if (node.children[lowerChar]) {
+				node = node.children[lowerChar];
+			} else {
+				return;
+			}
+		}
+		return node;
+	}
+
+	size() {
+		return this.size;
+	}
+}

js/Utils.js

@@ -0,0 +1,33 @@
+
+export function getFirstParent(el, selector) {
+	if (!el.parentElement) {
+		return false;
+	} else if (el.parentElement.matches(selector)) {
+		return el.parentElement;
+	}
+	return getFirstParent(el.parentElement, selector);
+}
+
+export function log(...args) {
+	if (true || window.logmeplease) {
+		console.log(...args);
+	}
+}
+
+export function time() {
+	return (new Date()).getTime();
+}
+
+export function totalOffset(element) {
+	const offset = { top: 0, left: 0 };
+	while (element) {
+		offset.left += element.offsetLeft || 0;
+		offset.top += element.offsetTop || 0;
+		element = element.offsetParent;
+	}
+	return offset;
+}
+
+export function clean(s) {
+	return s.replace(CLEAN_REGEX, ' ');
+}