@ixfx/process 0.38.0 → 0.40.0

package/LICENSE

@@ -19,3 +19,84 @@ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 SOFTWARE.
+
+---
+
+Mersenne Twister
+https://github.com/jawj/mtwist
+© Copyright 2014 – 2021 George MacKerron 
+MIT License
+
+---
+
+Ramer Douglas Peucker implementation
+
+Marius Karthaus
+http://www.LowVoice.nl
+
+---
+
+The MIT License (MIT)
+
+Copyright © 2022 github.com/pushkine/
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+---
+
+collections/BinaryTreeNode
+collections/BinarySearchTree
+collections/TreeNode
+https://github.com/amejiarosario/dsa.js-data-structures-algorithms-javascript
+
+MIT License
+
+Copyright (c) 2019 Adrian Mejia
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+----
+
+Package: colorjs.io
+
+MIT License
+
+Copyright (c) 2021 Lea Verou, Chris Lilley
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,17 @@
+The process module contains functions for orchestrating a simple series of data transformations. 
+
+Use `flow` to create this orchestration:
+
+```js
+const p = flow(
+ (value:string) => value.toUpperCase(), // Convert to uppercase
+ (value:string) => value.at(0) === 'A') // If first letter is an A, return true
+);
+```
+
+Once created, the flow can be invoked with an input value:
+```js
+p('apple'); // True
+```
+
+Each function in the processing flow takes one input and returns one result. There are a few in-built functions as well. Some of these are stateful, remembering previous values that have been processed (eg `seenToUndefined`).

package/dist/src/if-undefined.d.ts

@@ -1,4 +1,3 @@
-/**
 /**
  * Calls a function if the input value is not undefined.
  * Return value from function is passed to next function in flow.

package/dist/src/if-undefined.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"if-undefined.d.ts","sourceRoot":"","sources":["../../src/if-undefined.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,EAAE,SAAS,CAAC,KAAK,IAAI,IAC5E,OAAO,GAAG,gBAKnB;AAID;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,MAC3B,OAAO,GAAG,GAAG,SAAS,KAEZ,GAAG,CAEtB;AACD;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,IAAI,IAC3C,OAAO,GAAG,gCAInB"}
+{"version":3,"file":"if-undefined.d.ts","sourceRoot":"","sources":["../../src/if-undefined.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,EAAE,SAAS,CAAC,KAAK,IAAI,IAC5E,OAAO,GAAG,gBAKnB;AAID;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,MAC3B,OAAO,GAAG,GAAG,SAAS,KAEZ,GAAG,CAEtB;AACD;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,IAAI,IAC3C,OAAO,GAAG,gCAInB"}

package/dist/src/if-undefined.js

@@ -1,5 +1,4 @@
 import { CancelError } from "./cancel-error.js";
-/**
 /**
  * Calls a function if the input value is not undefined.
  * Return value from function is passed to next function in flow.

package/dist/src/seen.d.ts

@@ -1,12 +1,14 @@
 import type { Process } from "./types.js";
 /**
  * If a value is same as the previous value, _undefined_ is emitted instead.
+ *
  * @param eq Equality function. If not specified, === semantics are used.
  * @returns
  */
 export declare function seenLastToUndefined<TIn>(eq?: (a: TIn, b: TIn) => boolean): Process<TIn, TIn | undefined>;
 /**
  * If a value is same as any previously-seen value, _undefined_ is emitted instead.
+ *
  * It stores all previous values and compares against them for each new value.
  * This would likely be not very efficient compared to {@link seenToUndefinedByKey} which uses a one-time computed
  * key and efficient storage of only the keys (using a Set).
@@ -17,6 +19,7 @@ export declare function seenLastToUndefined<TIn>(eq?: (a: TIn, b: TIn) => boolea
 export declare function seenToUndefined<TIn>(eq?: (a: TIn, b: TIn) => boolean): Process<TIn, TIn | undefined>;
 /**
  * If a value is the same as any previously-seen value, _undefined_ is emitted instead.
+ *
  * This version uses a function to create a string key of the object, by default JSON.stringify.
  * Thus we don't need to store all previously seen objects, just their keys.
  *

package/dist/src/seen.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"seen.d.ts","sourceRoot":"","sources":["../../src/seen.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAG1C;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,KAAK,OAAO,GAAG,OAAO,CAAC,GAAG,EAAE,GAAG,GAAG,SAAS,CAAC,CAUxG;AAED;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,KAAK,OAAO,GAAG,OAAO,CAAC,GAAG,EAAE,GAAG,GAAG,SAAS,CAAC,CAWpG;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,MAAM,GAAG,OAAO,CAAC,GAAG,EAAE,GAAG,GAAG,SAAS,CAAC,CAU1G"}
+{"version":3,"file":"seen.d.ts","sourceRoot":"","sources":["../../src/seen.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAG1C;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,KAAK,OAAO,GAAG,OAAO,CAAC,GAAG,EAAE,GAAG,GAAG,SAAS,CAAC,CAUxG;AAED;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,KAAK,OAAO,GAAG,OAAO,CAAC,GAAG,EAAE,GAAG,GAAG,SAAS,CAAC,CAWpG;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,MAAM,GAAG,OAAO,CAAC,GAAG,EAAE,GAAG,GAAG,SAAS,CAAC,CAU1G"}

package/dist/src/seen.js

@@ -1,11 +1,12 @@
 import { isEqualDefault, toStringDefault } from "./util.js";
 /**
  * If a value is same as the previous value, _undefined_ is emitted instead.
+ *
  * @param eq Equality function. If not specified, === semantics are used.
  * @returns
  */
 export function seenLastToUndefined(eq) {
-    if (eq === undefined)
+    if (typeof eq === `undefined`)
         eq = isEqualDefault;
     let lastValue;
     return (value) => {
@@ -18,6 +19,7 @@ export function seenLastToUndefined(eq) {
 }
 /**
  * If a value is same as any previously-seen value, _undefined_ is emitted instead.
+ *
  * It stores all previous values and compares against them for each new value.
  * This would likely be not very efficient compared to {@link seenToUndefinedByKey} which uses a one-time computed
  * key and efficient storage of only the keys (using a Set).
@@ -26,8 +28,8 @@ export function seenLastToUndefined(eq) {
  * @returns
  */
 export function seenToUndefined(eq) {
-    let seen = [];
-    if (eq === undefined)
+    const seen = [];
+    if (typeof eq === `undefined`)
         eq = isEqualDefault;
     return (value) => {
         if (value === undefined)
@@ -42,6 +44,7 @@ export function seenToUndefined(eq) {
 }
 /**
  * If a value is the same as any previously-seen value, _undefined_ is emitted instead.
+ *
  * This version uses a function to create a string key of the object, by default JSON.stringify.
  * Thus we don't need to store all previously seen objects, just their keys.
  *
@@ -52,8 +55,8 @@ export function seenToUndefined(eq) {
  * @returns
  */
 export function seenToUndefinedByKey(toString) {
-    let seen = new Set();
-    if (toString === undefined)
+    const seen = new Set();
+    if (typeof toString === `undefined`)
         toString = toStringDefault;
     return (value) => {
         if (value === undefined)

package/package.json

@@ -1,12 +1,13 @@
 {
   "name": "@ixfx/process",
-  "version": "0.38.0",
+  "version": "0.40.0",
   "license": "MIT",
   "type": "module",
   "sideEffects": false,
   "files": [
     "dist/"
   ],
+  "dependencies": {},
   "exports": {
     ".": {
       "types": "./dist/src/index.d.ts",
@@ -17,6 +18,5 @@
       "import": "./dist/src/basic.js"
     }
   },
-  "dependencies": {},
   "main": "dist/src/index.js"
 }