solarite 0.5.2 → 0.7.1

package/src/MultiValueMap.js

@@ -1,105 +1,57 @@
-export default class MultiValueMap {
-
-	/** @type {Record<string, Set>} */
-	data = {};
-
-	// Set a new value for a key
-	add(key, value) {
-		let data = this.data;
-		let set = data[key]
-		if (!set) {
-			set = new Set();
-			data[key] = set;
-		}
-		set.add(value);
-	}
-
-	isEmpty() {
-		for (let key in this.data)
-			return true;
-		return false;
-	}
-
-	/**
-	 * Get all values for a key.
-	 * @param key {string}
-	 * @returns {Set|*[]} */
-	getAll(key) {
-		return this.data[key] || [];
-	}
-
-	/**
-	 * Remove one value from a key, and return it.
-	 * @param key {string}
-	 * @param val If specified, make sure we delete this specific value, if a key exists more than once.
-	 * @returns {*|undefined} The deleted item. */
-	delete(key, val=undefined) {
-		let data = this.data;
-		let result;
-		let set = data[key];
-		if (!set)
-			return undefined;
-
-		// Delete any value.
-		if (val === undefined) {
-			[result] = set; //  Get the first value from the set.
-			set.delete(result);
-		}
-
-		// Delete a specific value.
-		else {
-			set.delete(val);
-			result = val;
-		}
-
-		if (set.size === 0)
-			delete data[key];
-
-		return result;
-	}
-
-	/**
-	 * Remove any one value from a key, and return it.
-	 * @param key {string}
-	 * @returns {*|undefined} The deleted item. */
-	deleteAny(key) {
-		let data = this.data;
-		let result;
-		let set = data[key];
-		if (!set) // slower than pre-check.
-			return undefined;
-
-		[result] = set; // Get the first value from the set.
-		set.delete(result);
-
-		if (set.size === 0)
-			delete data[key];
-
-		return result;
-	}
-
-	deleteSpecific(key, val) {
-		let data = this.data;
-		let result;
-		let set = data[key];
-		if (!set)
-			return undefined;
-
-		set.delete(val);
-		result = val;
-
-		if (set.size === 0)
-			delete data[key];
-
-		return result;
-	}
-
-	hasValue(val) {
-		let data = this.data;
-		let names = [];
-		for (let name in data)
-			if (data[name].has(val)) // TODO: iterate twice to pre-size array?
-				names.push(name)
-		return names;
-	}
-}
+/**
+ * Maps a string key to multiple values.
+ * Values are stored in arrays because pushing them is much faster than Set operations,
+ * and deleteAny() needs no iterator allocation.
+ * deleteAny() returns values first-in-first-out by advancing a head index (array.head)
+ * instead of calling shift(), which would be O(n). */
+export default class MultiValueMap {
+
+	/** @type {Record<string, Array>} */
+	data = {};
+
+	// Add a new value for a key
+	add(key, value) {
+		let data = this.data;
+		let array = data[key]
+		if (!array)
+			data[key] = [value];
+		else
+			array.push(value);
+	}
+
+	/**
+	 * Add a new value for a key, unless the key already holds max values.
+	 * Used to bound pooled NodeGroup memory.
+	 * @param key {string}
+	 * @param value
+	 * @param max {int} */
+	addCapped(key, value, max) {
+		let data = this.data;
+		let array = data[key]
+		if (!array)
+			data[key] = [value];
+		else if (array.length - (array.head || 0) < max)
+			array.push(value);
+	}
+
+	/**
+	 * Remove the oldest value from a key, and return it.
+	 * @param key {string}
+	 * @returns {*|undefined} The deleted item. */
+	deleteAny(key) {
+		let data = this.data;
+		let array = data[key];
+		if (!array) // slower than pre-check.
+			return undefined;
+
+		let head = array.head || 0;
+		let result = array[head];
+		head++;
+		if (head >= array.length)
+			delete data[key];
+		else
+			array.head = head;
+
+		return result;
+	}
+}