@mark1russell7/collections 0.6.0 → 0.7.0

package/build/index.js

@@ -1,168 +1,5 @@
 import { compose as compose$1 } from "./core/layers.js";
-// src/core/effects.ts
-/**
-* The singleton None value.
-*/
-const None = Object.freeze({ _tag: "None" });
-/**
-* This function constructs a Some value containing the given value.
-*/
-const Some = (value) => Object.freeze({
-	_tag: "Some",
-	value
-});
-/**
-* Type guard to check if an Option is None.
-*/
-const isNone = (opt) => opt._tag === "None";
-/**
-* Type guard to check if an Option is Some.
-*/
-const isSome = (opt) => opt._tag === "Some";
-/**
-* This function extracts the value from a Some, or gives the default value if None.
-*/
-const getOrElse = (opt, defaultValue) => isSome(opt) ? opt.value : defaultValue;
-/**
-* This function extracts the value from a Some, or throws an error if None.
-*/
-const unwrap = (opt) => {
-	if (isSome(opt)) return opt.value;
-	throw new Error("Called unwrap on None");
-};
-/**
-* This function maps a function over the value in a Some, or gives None.
-*/
-const mapOption = (opt, f) => isSome(opt) ? Some(f(opt.value)) : None;
-/**
-* Chains Option-returning operations.
-*/
-const flatMapOption = (opt, f) => isSome(opt) ? f(opt.value) : None;
-/**
-* This function converts a nullable value to an Option.
-*/
-const fromNullable = (value) => value == null ? None : Some(value);
-/**
-* This function converts an Option to a nullable value.
-*/
-const toNullable = (opt) => isSome(opt) ? opt.value : void 0;
-/**
-* This function constructs an Ok result containing the given value.
-*/
-const Ok = (value) => Object.freeze({
-	_tag: "Ok",
-	value,
-	match: (f) => f.Ok(value)
-});
-/**
-* This function constructs an Err result containing the given error.
-*/
-const Err = (error) => Object.freeze({
-	_tag: "Err",
-	error,
-	match: (f) => f.Err(error)
-});
-/**
-* Type guard to check if a Result is Ok.
-*/
-const isOk = (result) => result._tag === "Ok";
-/**
-* Type guard to check if a Result is Err.
-*/
-const isErr = (result) => result._tag === "Err";
-/**
-* This function extracts the value from an Ok, or gives the default value if Err.
-*/
-const getOrElseResult = (result, defaultValue) => isOk(result) ? result.value : defaultValue;
-/**
-* This function extracts the value from an Ok, or throws the error if Err.
-*/
-const unwrapResult = (result) => {
-	if (isOk(result)) return result.value;
-	throw result.error;
-};
-/**
-* This function maps a function over the value in an Ok, or gives the Err unchanged.
-*/
-const mapResult = (result, f) => isOk(result) ? Ok(f(result.value)) : result;
-/**
-* This function maps a function over the error in an Err, or gives the Ok unchanged.
-*/
-const mapError = (result, f) => isErr(result) ? Err(f(result.error)) : result;
-/**
-* Chains Result-returning operations.
-*/
-const flatMapResult = (result, f) => isOk(result) ? f(result.value) : result;
-/**
-* This function converts a throwing function into a Result-returning function.
-*/
-const tryCatch = (fn, onError) => {
-	try {
-		return Ok(fn());
-	} catch (error) {
-		return Err(onError ? onError(error) : error);
-	}
-};
-/**
-* This function converts an async throwing function into a Result-returning async function.
-*/
-const tryCatchAsync = async (fn, onError) => {
-	try {
-		return Ok(await fn());
-	} catch (error) {
-		return Err(onError ? onError(error) : error);
-	}
-};
-/**
-* This function maps a function over an async Option.
-*/
-const mapAsyncOption = async (opt, f) => {
-	const resolved = await opt;
-	if (isSome(resolved)) return Some(await f(resolved.value));
-	return None;
-};
-/**
-* This function maps a function over an async Result.
-*/
-const mapAsyncResult = async (result, f) => {
-	const resolved = await result;
-	if (isOk(resolved)) return Ok(await f(resolved.value));
-	return resolved;
-};
-/**
-* This function converts an Option to a Result.
-* None becomes Err with the given error.
-*/
-const optionToResult = (opt, error) => isSome(opt) ? Ok(opt.value) : Err(error);
-/**
-* This function converts a Result to an Option.
-* Err becomes None, discarding the error.
-*/
-const resultToOption = (result) => isOk(result) ? Some(result.value) : None;
-/**
-* This function combines multiple Options into an Option of an array.
-* This function gives None if any input is None.
-*/
-const sequence = (opts) => {
-	const values = [];
-	for (const opt of opts) {
-		if (isNone(opt)) return None;
-		values.push(opt.value);
-	}
-	return Some(values);
-};
-/**
-* This function combines multiple Results into a Result of an array.
-* This function gives the first Err encountered, or Ok with all values.
-*/
-const sequenceResults = (results) => {
-	const values = [];
-	for (const result of results) {
-		if (isErr(result)) return result;
-		values.push(result.value);
-	}
-	return Ok(values);
-};
+import { none as none$1, some as some$1, toOptional, tryCatch } from "@mark1russell7/optional";
 // src/core/policies.ts
 /**
 * Default overflow policy: throw an error.
@@ -1899,32 +1736,29 @@ var HashMap = class {
 		return this._valueEq;
 	}
 	has(key) {
-		const hash = this._keyHash(key);
-		const index = this.bucketIndex(hash);
-		let node = this._buckets[index] ?? null;
-		while (node !== null) {
-			if (node.hash === hash && this._keyEq(node.key, key)) return true;
-			node = node.next;
-		}
-		return false;
+		return this.findNode(key) !== null;
 	}
 	get(key) {
-		const value = this.getOrUndefined(key);
-		if (value === void 0) throw new Error(`Key not found: ${key}`);
-		return value;
+		const node = this.findNode(key);
+		if (node === null) throw new Error(`Key not found: ${key}`);
+		return node.value;
 	}
 	getOrUndefined(key) {
+		return this.findNode(key)?.value;
+	}
+	getOrDefault(key, defaultValue) {
+		const node = this.findNode(key);
+		return node !== null ? node.value : defaultValue;
+	}
+	/** This method finds the node of a key, or gives `null`. */
+	findNode(key) {
 		const hash = this._keyHash(key);
-		const index = this.bucketIndex(hash);
-		let node = this._buckets[index] ?? null;
+		let node = this._buckets[this.bucketIndex(hash)] ?? null;
 		while (node !== null) {
-			if (node.hash === hash && this._keyEq(node.key, key)) return node.value;
+			if (node.hash === hash && this._keyEq(node.key, key)) return node;
 			node = node.next;
 		}
-	}
-	getOrDefault(key, defaultValue) {
-		const value = this.getOrUndefined(key);
-		return value !== void 0 ? value : defaultValue;
+		return null;
 	}
 	containsValue(value) {
 		for (const bucket of this._buckets) {
@@ -5094,16 +4928,13 @@ const unmodifiableCollection = readonlyCollection;
 /**
 * This function makes a safe List middleware.
 *
-* This function exposes a `safe` property with Option/Result-based operations.
+* This function exposes a `safe` property with Optional/Result-based operations.
 */
 function safeList() {
 	return (next) => {
 		return Object.assign(next, { safe: {
 			get(index) {
-				return tryCatch(() => next.get(index), () => "Index out of bounds").match({
-					Ok: (value) => Some(value),
-					Err: () => None
-				});
+				return toOptional(tryCatch(() => next.get(index)));
 			},
 			set(index, element) {
 				return tryCatch(() => next.set(index, element), (error) => String(error));
@@ -5112,24 +4943,18 @@ function safeList() {
 				return tryCatch(() => next.removeAt(index), (error) => String(error));
 			},
 			first() {
-				return next.isEmpty ? None : Some(next.first());
+				return next.isEmpty ? none$1 : some$1(next.first());
 			},
 			last() {
-				return next.isEmpty ? None : Some(next.last());
+				return next.isEmpty ? none$1 : some$1(next.last());
 			},
 			pop() {
-				if (next.isEmpty) return None;
-				return tryCatch(() => next.pop(), () => "List is empty").match({
-					Ok: (value) => Some(value),
-					Err: () => None
-				});
+				if (next.isEmpty) return none$1;
+				return toOptional(tryCatch(() => next.pop()));
 			},
 			shift() {
-				if (next.isEmpty) return None;
-				return tryCatch(() => next.shift(), () => "List is empty").match({
-					Ok: (value) => Some(value),
-					Err: () => None
-				});
+				if (next.isEmpty) return none$1;
+				return toOptional(tryCatch(() => next.shift()));
 			}
 		} });
 	};
@@ -5141,25 +4966,16 @@ function safeQueue() {
 	return (next) => {
 		return Object.assign(next, { safe: {
 			peek() {
-				if (next.isEmpty) return None;
-				return tryCatch(() => next.peek(), () => "Queue is empty").match({
-					Ok: (value) => Some(value),
-					Err: () => None
-				});
+				if (next.isEmpty) return none$1;
+				return toOptional(tryCatch(() => next.peek()));
 			},
 			poll() {
-				if (next.isEmpty) return None;
-				return tryCatch(() => next.poll(), () => "Queue is empty").match({
-					Ok: (value) => Some(value),
-					Err: () => None
-				});
+				if (next.isEmpty) return none$1;
+				return toOptional(tryCatch(() => next.poll()));
 			},
 			dequeue() {
-				if (next.isEmpty) return None;
-				return tryCatch(() => next.dequeue(), () => "Queue is empty").match({
-					Ok: (value) => Some(value),
-					Err: () => None
-				});
+				if (next.isEmpty) return none$1;
+				return toOptional(tryCatch(() => next.dequeue()));
 			}
 		} });
 	};
@@ -5171,39 +4987,33 @@ function safeDeque() {
 	return (next) => {
 		return Object.assign(next, { safe: {
 			peek() {
-				return next.isEmpty ? None : Some(next.peekFirst());
+				return next.isEmpty ? none$1 : some$1(next.peekFirst());
 			},
 			poll() {
-				if (next.isEmpty) return None;
-				return Some(next.pollFirst());
+				if (next.isEmpty) return none$1;
+				return some$1(next.pollFirst());
 			},
 			dequeue() {
-				if (next.isEmpty) return None;
-				return tryCatch(() => next.dequeue(), () => "Deque is empty").match({
-					Ok: (value) => Some(value),
-					Err: () => None
-				});
+				if (next.isEmpty) return none$1;
+				return toOptional(tryCatch(() => next.dequeue()));
 			},
 			peekFirst() {
-				return next.isEmpty ? None : Some(next.peekFirst());
+				return next.isEmpty ? none$1 : some$1(next.peekFirst());
 			},
 			peekLast() {
-				return next.isEmpty ? None : Some(next.peekLast());
+				return next.isEmpty ? none$1 : some$1(next.peekLast());
 			},
 			pollFirst() {
 				const result = next.pollFirst();
-				return result !== void 0 ? Some(result) : None;
+				return result !== void 0 ? some$1(result) : none$1;
 			},
 			pollLast() {
 				const result = next.pollLast();
-				return result !== void 0 ? Some(result) : None;
+				return result !== void 0 ? some$1(result) : none$1;
 			},
 			pop() {
-				if (next.isEmpty) return None;
-				return tryCatch(() => next.pop(), () => "Deque is empty").match({
-					Ok: (value) => Some(value),
-					Err: () => None
-				});
+				if (next.isEmpty) return none$1;
+				return toOptional(tryCatch(() => next.pop()));
 			}
 		} });
 	};
@@ -5215,7 +5025,7 @@ function safeMap() {
 	return (next) => {
 		return Object.assign(next, { safe: {
 			get(key) {
-				return next.has(key) ? Some(next.get(key)) : None;
+				return next.has(key) ? some$1(next.get(key)) : none$1;
 			},
 			set(key, value) {
 				return tryCatch(() => next.set(key, value), (error) => String(error));
@@ -8098,6 +7908,6 @@ function stringHashCode(str) {
 	}
 	return hash;
 }
-export { ArrayDeque, ArrayList, AsyncEmitter, AsyncQueue, Channel, CollectionBuilder, DEFAULT_CONFLICT_POLICY, DEFAULT_EVICTION_POLICY, DEFAULT_GROWTH_POLICY, DEFAULT_OVERFLOW_POLICY, DEFAULT_RETRY_POLICY, DEFAULT_UNDERFLOW_POLICY, DEFAULT_VALIDATION_POLICY, Emitter, Err, EventBatcher, HashMap, HashSet, KEY_DIGITS, LRUCache, LinkedHashMap, LinkedList, None, Ok, PriorityQueue, Some, StorageListeners, SummaryTree, TTLCache, TreeMap, TreeSet, arrayContains, arrayDeque, arrayIterator, arrayList, arrayRemove, arrayRemoveAll, asSettled, asyncQueue, average, averagingNumber, blockMethods, booleanCompare, bounded, boundedDeque, boundedList, boundedMap, boundedQueue, buffered, buildList, buildMap, bundle, channel, checkBounds, checkInsertBounds, checkRangeBounds, chunk, clamp, collect, toArray as collectToArray, toList as collectToList, toMap as collectToMap, toSet as collectToSet, combineHashes, compareKeys, comparing, comparingKey, compose, concat, count, counting, createEmitter, dateCompare, deepEq, defaultCompare, defaultEq, defaultHash, delegate, distinct, distinctConsecutive, dropIndex, emptyList, emptyMap, emptyQueue, enhanceMethod, enumerate, eqBy, evented, eventedDeque, eventedList, eventedMap, eventedQueue, every, fanIn, fanOut, filter, filtering, find, findIndex, findLastIndex, first, flatMap, flatMapOption, flatMapResult, flatMapping, flatten, forwardEvent, fromNullable, getOrElse, getOrElseResult, groupBy, groupingBy, groupingByWith, hasCapability, hashBy, hashMap, hashNumber, hashSet, hashString, immutableListOf, immutableMapOf, interceptMethods, isErr, isNone, isOk, isSome, isValidKey, toMap$1 as iterToMap, joining, keyBetween, keysBetween, keysForDrop, last, linkedHashMap, linkedList, listOf, lruCache, lruMap, map, mapAsyncOption, mapAsyncResult, mapError, mapOf, mapOption, mapResult, mapping, max, maxBy, merge, min, minBy, mutableListOf, mutableMapOf, nCopies, none, nullsFirst, nullsLast, numberCompare, onWhen, optionToResult, partition, partitioningBy, pipe, pipeline, priorityQueue, queueOf, range, rangeTo, readWriteLock, readonly, readonlyCollection, readonlyList, readonlyMap, readonlyQueue, reduce, reducing, reducingWith, reentrantSynchronized, reportListenerError, requireNonEmpty, requireNonNull, resultToOption, reverse, reverseArrayIterator, reversed, safe, safeDeque, safeList, safeMap, safeQueue, scan, select, sequence, sequenceResults, shallowEq, singletonList, singletonMap, skip, skipWhile, some, sort, stringCompare, stringCompareIgnoreCase, stringHashCode, sum, summarizingNumber, summaryTree, summingNumber, synchronized, synchronizedCollection, synchronizedList, synchronizedMap, synchronizedSet, take, takeWhile, tap, teeing, thenComparing, ticker, timeout, toArray$1 as toArray, toList$1 as toList, toMap$2 as toMap, toNullable, toSet$1 as toSet, treeMap, treeSet, tryCatch, tryCatchAsync, ttlCache, ttlCollection, ttlMap, unbuffered, unmodifiableCollection, unmodifiableList, unmodifiableMap, unwrap, unwrapResult, window, workerPool, zip };
+export { ArrayDeque, ArrayList, AsyncEmitter, AsyncQueue, Channel, CollectionBuilder, DEFAULT_CONFLICT_POLICY, DEFAULT_EVICTION_POLICY, DEFAULT_GROWTH_POLICY, DEFAULT_OVERFLOW_POLICY, DEFAULT_RETRY_POLICY, DEFAULT_UNDERFLOW_POLICY, DEFAULT_VALIDATION_POLICY, Emitter, EventBatcher, HashMap, HashSet, KEY_DIGITS, LRUCache, LinkedHashMap, LinkedList, PriorityQueue, StorageListeners, SummaryTree, TTLCache, TreeMap, TreeSet, arrayContains, arrayDeque, arrayIterator, arrayList, arrayRemove, arrayRemoveAll, asSettled, asyncQueue, average, averagingNumber, blockMethods, booleanCompare, bounded, boundedDeque, boundedList, boundedMap, boundedQueue, buffered, buildList, buildMap, bundle, channel, checkBounds, checkInsertBounds, checkRangeBounds, chunk, clamp, collect, toArray as collectToArray, toList as collectToList, toMap as collectToMap, toSet as collectToSet, combineHashes, compareKeys, comparing, comparingKey, compose, concat, count, counting, createEmitter, dateCompare, deepEq, defaultCompare, defaultEq, defaultHash, delegate, distinct, distinctConsecutive, dropIndex, emptyList, emptyMap, emptyQueue, enhanceMethod, enumerate, eqBy, evented, eventedDeque, eventedList, eventedMap, eventedQueue, every, fanIn, fanOut, filter, filtering, find, findIndex, findLastIndex, first, flatMap, flatMapping, flatten, forwardEvent, groupBy, groupingBy, groupingByWith, hasCapability, hashBy, hashMap, hashNumber, hashSet, hashString, immutableListOf, immutableMapOf, interceptMethods, isValidKey, toMap$1 as iterToMap, joining, keyBetween, keysBetween, keysForDrop, last, linkedHashMap, linkedList, listOf, lruCache, lruMap, map, mapOf, mapping, max, maxBy, merge, min, minBy, mutableListOf, mutableMapOf, nCopies, none, nullsFirst, nullsLast, numberCompare, onWhen, partition, partitioningBy, pipe, pipeline, priorityQueue, queueOf, range, rangeTo, readWriteLock, readonly, readonlyCollection, readonlyList, readonlyMap, readonlyQueue, reduce, reducing, reducingWith, reentrantSynchronized, reportListenerError, requireNonEmpty, requireNonNull, reverse, reverseArrayIterator, reversed, safe, safeDeque, safeList, safeMap, safeQueue, scan, select, shallowEq, singletonList, singletonMap, skip, skipWhile, some, sort, stringCompare, stringCompareIgnoreCase, stringHashCode, sum, summarizingNumber, summaryTree, summingNumber, synchronized, synchronizedCollection, synchronizedList, synchronizedMap, synchronizedSet, take, takeWhile, tap, teeing, thenComparing, ticker, timeout, toArray$1 as toArray, toList$1 as toList, toMap$2 as toMap, toSet$1 as toSet, treeMap, treeSet, ttlCache, ttlCollection, ttlMap, unbuffered, unmodifiableCollection, unmodifiableList, unmodifiableMap, window, workerPool, zip };
 
 //# sourceMappingURL=index.js.map