@lowentry/utils 1.16.2 → 1.18.1

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@lowentry/utils",
-  "version": "1.16.2",
+  "version": "1.18.1",
   "private": false,
   "type": "module",
   "main": "./index.js",

package/src/LeUtils.js

@@ -1127,6 +1127,47 @@ export const LeUtils = {
 			return 0;
 		},
 	
+	/**
+	 * Compares two strings in a natural way, meaning that it will compare numbers in the strings as actual numbers.
+	 *
+	 * This will correctly sort numeric parts so that "file5.txt" comes before "file10.txt", as well as that "file/5/test.txt" comes before "file/10/test.txt".
+	 *
+	 * @param {string} a
+	 * @param {string} b
+	 * @returns {number}
+	 */
+	compareNaturalStrings:
+		(a, b) =>
+		{
+			const re = /(\d+|\D+)/g; // split into runs of digits or non-digits
+			const aTokens = a.match(re) ?? [];
+			const bTokens = b.match(re) ?? [];
+			
+			const len = Math.min(aTokens.length, bTokens.length);
+			for(let i = 0; i < len; i++)
+			{
+				const x = aTokens[i];
+				const y = bTokens[i];
+				if(x === y)
+				{
+					continue;
+				}
+				
+				// if both are numbers, compare as numbers
+				const nx = parseInt(x, 10);
+				const ny = parseInt(y, 10);
+				if(!isNaN(nx) && !isNaN(ny))
+				{
+					return nx - ny;
+				}
+				
+				// otherwise compare lexically
+				return x < y ? -1 : 1;
+			}
+			
+			return aTokens.length - bTokens.length;
+		},
+	
 	/**
 	 * Compares two strings generated by LeUtils.timestamp(). Primarily used for sorting.
 	 *

package/src/classes/LinkedList.js

@@ -0,0 +1,145 @@
+class LinkedListNode
+{
+	/** @type {*} */
+	value;
+	
+	/** @type {LinkedListNode|null} */
+	next = null;
+	
+	/** @type {LinkedListNode|null} */
+	previous = null;
+	
+	/**
+	 * @param {*} value
+	 */
+	constructor(value)
+	{
+		this.value = value;
+	}
+}
+
+export class LinkedList
+{
+	/** @type {LinkedListNode|null} */
+	#head = null;
+	
+	/** @type {LinkedListNode|null} */
+	#tail = null;
+	
+	/** @type {number} */
+	#size = 0;
+	
+	constructor()
+	{
+	}
+	
+	/**
+	 * Returns the number of elements in the list.
+	 *
+	 * @returns {number}
+	 */
+	get size()
+	{
+		return this.#size;
+	}
+	
+	/**
+	 * Adds a new value to the beginning of the list.
+	 *
+	 * @param {*} value
+	 */
+	unshift(value)
+	{
+		const newNode = new LinkedListNode(value);
+		if(this.#head === null)
+		{
+			this.#head = newNode;
+			this.#tail = newNode;
+		}
+		else
+		{
+			newNode.next = this.#head;
+			this.#head.previous = newNode;
+			this.#head = newNode;
+		}
+		this.#size++;
+	}
+	
+	/**
+	 * Adds a new value to the end of the list.
+	 *
+	 * @param {*} value
+	 */
+	push(value)
+	{
+		const newNode = new LinkedListNode(value);
+		if(this.#tail === null)
+		{
+			this.#head = newNode;
+			this.#tail = newNode;
+		}
+		else
+		{
+			newNode.previous = this.#tail;
+			this.#tail.next = newNode;
+			this.#tail = newNode;
+		}
+		this.#size++;
+	}
+	
+	/**
+	 * Removes the first value from the list and returns it.
+	 *
+	 * @returns {*|undefined}
+	 */
+	shift()
+	{
+		if(this.#head === null)
+		{
+			return undefined;
+		}
+		
+		const value = this.#head.value;
+		this.#head = this.#head.next;
+		
+		if(this.#head !== null)
+		{
+			this.#head.previous = null;
+		}
+		else
+		{
+			this.#tail = null;
+		}
+		
+		this.#size--;
+		return value;
+	}
+	
+	/**
+	 * Removes the last value from the list and returns it.
+	 *
+	 * @returns {*|undefined}
+	 */
+	pop()
+	{
+		if(this.#tail === null)
+		{
+			return undefined;
+		}
+		
+		const value = this.#tail.value;
+		this.#tail = this.#tail.previous;
+		
+		if(this.#tail !== null)
+		{
+			this.#tail.next = null;
+		}
+		else
+		{
+			this.#head = null;
+		}
+		
+		this.#size--;
+		return value;
+	}
+}

package/src/classes/SerializableMap.js

@@ -0,0 +1,17 @@
+/**
+ * SerializableMap class extends the native Map to provide a JSON representation.
+ *
+ * This class can only have string keys, as JSON does not support non-string keys.
+ */
+export class SerializableMap extends Map
+{
+	/**
+	 * Returns a JSON representation of the map.
+	 *
+	 * @returns {object}
+	 */
+	toJSON()
+	{
+		return Object.fromEntries(this);
+	}
+}

package/src/index.js

@@ -1,2 +1,4 @@
 export {LeUtils} from './LeUtils.js';
 export {ISSET, IS_ARRAY, ARRAY, IS_OBJECT, OBJECT, STRING, STRING_ANY, INT, INT_ANY, FLOAT, FLOAT_ANY, INT_LAX, INT_LAX_ANY, FLOAT_LAX, FLOAT_LAX_ANY} from './LeTypes.js';
+export {LinkedList} from './classes/LinkedList.js';
+export {SerializableMap} from './classes/SerializableMap.js';

package/tests/sort.test.js

@@ -0,0 +1,33 @@
+import {describe, test, expect, jest} from '@jest/globals';
+import {LeUtils} from '../src/index.js';
+
+const wait = ms => LeUtils.promiseTimeout(ms ?? 100);
+
+
+describe('LeUtils.compareNaturalStrings', () =>
+{
+	test('should return 0 for equal paths', () =>
+	{
+		expect(LeUtils.compareNaturalStrings('path/to/file.txt', 'path/to/file.txt')).toBe(0);
+	});
+	
+	test('should return -1 for first path being "less than" second', () =>
+	{
+		expect(LeUtils.compareNaturalStrings('path/to/a.txt', 'path/to/b.txt')).toBeLessThan(0);
+	});
+	
+	test('should return 1 for first path being "greater than" second', () =>
+	{
+		expect(LeUtils.compareNaturalStrings('path/to/b.txt', 'path/to/a.txt')).toBeGreaterThan(0);
+	});
+	
+	test('test/5/test.txt should be less than test/10/test.txt', () =>
+	{
+		expect(LeUtils.compareNaturalStrings('test/5/test.txt', 'test/10/test.txt')).toBeLessThan(0);
+	});
+	
+	test('test5.txt should be less than test10.txt', () =>
+	{
+		expect(LeUtils.compareNaturalStrings('test5.txt', 'test10.txt')).toBeLessThan(0);
+	});
+});