@fp-ts/data - npm Package Compare versions

Comparing version 0.0.13 to 0.0.14

HashMap.d.ts

		@@ -6,3 +6,2 @@ /**
		import type { HashSet } from "@fp-ts/data/HashSet";
		import type * as HMN from "@fp-ts/data/internal/HashMap/node";
		import type { Option } from "@fp-ts/data/Option";
		@@ -25,8 +24,2 @@ import type { Predicate, Refinement } from "@fp-ts/data/Predicate";
		* @since 1.0.0
		*/
		export declare namespace HashMap {
		type Node<Key, Value> = HMN.Node<Key, Value>;
		}
		/**
		* @since 1.0.0
		* @category refinements
		@@ -113,9 +106,2 @@ */
		/**
		* Sets the root of the `HashMap`.
		*
		* @since 1.0.0
		* @category mutations
		*/
		export declare const setTree: <K, V>(newRoot: HMN.Node<K, V>, newSize: number) => (self: HashMap<K, V>) => HashMap<K, V>;
		/**
		* Returns an `IterableIterator` of the keys within the `HashMap`.
		@@ -122,0 +108,0 @@ *

HashMap.js

		@@ -6,3 +6,3 @@ "use strict";
		});
		exports.values = exports.update = exports.unsafeGet = exports.union = exports.size = exports.setTree = exports.set = exports.removeMany = exports.remove = exports.reduceWithIndex = exports.reduce = exports.mutate = exports.modifyHash = exports.modify = exports.mapWithIndex = exports.map = exports.make = exports.keys = exports.keySet = exports.isHashMap = exports.isEmpty = exports.hasHash = exports.has = exports.getHash = exports.get = exports.from = exports.forEachWithIndex = exports.forEach = exports.flatMapWithIndex = exports.flatMap = exports.filterWithIndex = exports.filterMapWithIndex = exports.filterMap = exports.filter = exports.endMutation = exports.empty = exports.compact = exports.beginMutation = void 0;
		exports.values = exports.update = exports.unsafeGet = exports.union = exports.size = exports.set = exports.removeMany = exports.remove = exports.reduceWithIndex = exports.reduce = exports.mutate = exports.modifyHash = exports.modify = exports.mapWithIndex = exports.map = exports.make = exports.keys = exports.keySet = exports.isHashMap = exports.isEmpty = exports.hasHash = exports.has = exports.getHash = exports.get = exports.from = exports.forEachWithIndex = exports.forEach = exports.flatMapWithIndex = exports.flatMap = exports.filterWithIndex = exports.filterMapWithIndex = exports.filterMap = exports.filter = exports.endMutation = exports.empty = exports.compact = exports.beginMutation = void 0;

		@@ -122,11 +122,2 @@ var HM = /#__PURE__/_interopRequireWildcard( /#__PURE__/require("@fp-ts/data/internal/HashMap"));
		/**
		* Sets the root of the `HashMap`.
		*
		* @since 1.0.0
		* @category mutations
		*/

		exports.set = set;
		const setTree = HM.setTree;
		/**
		* Returns an `IterableIterator` of the keys within the `HashMap`.
		@@ -138,3 +129,3 @@ *

		exports.setTree = setTree;
		exports.set = set;
		const keys = HM.keys;
		@@ -141,0 +132,0 @@ /**

package.json

		{
		"name": "@fp-ts/data",
		"version": "0.0.13",
		"version": "0.0.14",
		"license": "MIT",
		@@ -5,0 +5,0 @@ "repository": {

Random.d.ts

		/**
		* @category model
		* @since 1.0.0
		*/
		export declare type PCGRandomState = [number, number, number, number];
		/**
		* @category model
		* @since 1.0.0
		*/
		export declare type OptionalNumber = number \| null \| undefined;
		/**
		* PCG is a family of simple fast space-efficient statistically good algorithms
		@@ -3,0 +13,0 @@ * for random number generation. Unlike many general-purpose RNGs, they are also

Random.js

		@@ -26,20 +26,8 @@ "use strict";
		}
		/** @internal */


		const defaultIncHi = 0x14057b7e;
		/** @internal */

		const defaultIncLo = 0xf767814f;
		/** @internal */

		const MUL_HI = 0x5851f42d >>> 0;
		/** @internal */

		const MUL_LO = 0x4c957f2d >>> 0;
		/** @internal */

		const BIT_53 = 9007199254740992.0;
		/** @internal */

		const BIT_27 = 134217728.0;
		@@ -46,0 +34,0 @@ /**

_mjs/HashMap.mjs