Moving reset() into lexical scope & calling from constructor() & …

…`clear()`, fixing / simplifying `remove()`, fixes #7

lib/tiny-lru.js

@@ -13,17 +13,24 @@
 	const next = typeof process !== "undefined" ? process.nextTick : arg => setTimeout(arg, 1),
 		empty = null;
 
+	function reset () {
+		this.cache = {};
+		this.first = empty;
+		this.last = empty;
+		this.length = 0;
+
+		return this;
+	}
 	class LRU {
 		constructor (max, notify, ttl) {
 			this.max = max;
 			this.notify = notify;
 			this.ttl = ttl;
-
-			return this.reset();
+			reset.call(this);
 		}
 
 		clear (silent = false) {
-			this.reset();
+			reset.call(this);
 
 			if (silent === false && this.notify === true) {
 				next(this.onchange("clear", this.dump()));
@@ -95,23 +102,19 @@
 				this.length--;
 
 				if (result.previous !== empty) {
-					this.cache[result.previous].next = result.next !== key ? result.next : empty;
-
-					if (this.first === key) {
-						this.first = result.previous;
-					}
-				} else if (this.first === key) {
-					this.first = empty;
+					this.cache[result.previous].next = result.next;
 				}
 
 				if (result.next !== empty) {
-					this.cache[result.next].previous = result.previous !== key ? result.previous : empty;
+					this.cache[result.next].previous = result.previous;
+				}
 
-					if (this.last === key) {
-						this.last = result.next;
-					}
-				} else if (this.last === key) {
-					this.last = empty;
+				if (this.first === key) {
+					this.first = result.previous;
+				}
+
+				if (this.last === key) {
+					this.last = this.first;
 				}
 
 				if (silent === false && this.notify === true) {
@@ -122,15 +125,6 @@
 			return result;
 		}
 
-		reset () {
-			this.cache = {};
-			this.first = empty;
-			this.last = empty;
-			this.length = 0;
-
-			return this;
-		}
-
 		set (key, value, silent = false, bypass = false) {
 			if (bypass === true || this.has(key) === true) {
 				const item = this.cache[key];