jssm 5.78.0 → 5.79.0

package/dist/es6/jssm_util.js

@@ -1,3 +1,4 @@
+import { JssmError } from './jssm_error';
 /*******
  *
  *  Predicate for validating an array for uniqueness.  Not generally meant for
@@ -70,6 +71,21 @@ const weighted_histo_key = (n, opts, prob_prop, extract) => // TODO FIXME no any
  histograph(weighted_sample_select(n, opts, prob_prop)
     .map((s) => s[extract] // TODO FIXME eslint-disable-line flowtype/no-weak-types
 ));
+/*******
+ *
+ *  Internal method generating names for edges for the hook lookup map.  Not
+ *  meant for external use.
+ *
+ */
+function name_bind_prop_and_state(prop, state) {
+    if (typeof prop !== 'string') {
+        throw new JssmError(undefined, `Name of property must be a string; got ${prop}`);
+    }
+    if (typeof state !== 'string') {
+        throw new JssmError(undefined, `Name of state must be a string; got ${prop}`);
+    }
+    return JSON.stringify([prop, state]);
+}
 /*******
  *
  *  Internal method generating names for edges for the hook lookup map.  Not
@@ -100,4 +116,55 @@ const make_mulberry_rand = (a) => () => {
     t ^= t + Math.imul(t ^ t >>> 7, t | 61);
     return ((t ^ t >>> 14) >>> 0) / 4294967296;
 };
-export { seq, arr_uniq_p, histograph, weighted_histo_key, weighted_rand_select, weighted_sample_select, array_box_if_string, hook_name, named_hook_name, make_mulberry_rand };
+/*******
+ *
+ *  Reduces an array to its unique contents.  Compares with `===` and makes no
+ *  effort to deep-compare contents; two matching arrays or objects contained
+ *  will be treated as distinct, according to javascript rules.  This also means
+ *  that `NaNs` will be ***dropped***, because they do not self-compare.
+ *
+ *  ```typescript
+ *  unique( [] );                     // []
+ *  unique( [0,0] );                  // [0]
+ *  unique( [0,1,2, 0,1,2, 0,1,2] );  // [0,1,2]
+ *  unique( [ [1], [1] ] );           // [ [1], [1] ] because arrays don't match
+ *  unique( [0,NaN,2] );              // [0,2]
+ *  ```
+ *
+ */
+const unique = (arr) => arr.filter((v, i, a) => a.indexOf(v) === i);
+/*******
+ *
+ *  Lists all repeated items in an array along with their counts.  Subject to
+ *  matching rules of Map.  `NaN` is manually removed because of conflict rules
+ *  around {@link unique}.  Because these are compared with `===` and because
+ *  arrays and objects never match that way unless they're the same object,
+ *  arrays and objects are never considered repeats.
+ *
+ *  ```typescript
+ *  find_repeated<string>([ ]);                     // []
+ *  find_repeated<string>([ "one" ]);               // []
+ *  find_repeated<string>([ "one", "two" ]);        // []
+ *  find_repeated<string>([ "one", "one" ]);        // [ ["one", 2] ]
+ *  find_repeated<string>([ "one", "two", "one" ]); // [ ["one", 2] ]
+ *  find_repeated<number>([ 0, NaN, 0, NaN ]);      // [ [0,     2] ]
+ *  ```
+ *
+ */
+function find_repeated(arr) {
+    const uniqued = unique(arr);
+    if (uniqued.length !== arr.length) {
+        const residue_keys = new Map();
+        arr.forEach(k => residue_keys.set(k, residue_keys.has(k)
+            ? (residue_keys.get(k) + 1)
+            : 1));
+        uniqued.forEach(k => residue_keys.set(k, residue_keys.get(k) - 1));
+        return [...residue_keys.entries()]
+            .filter((e) => ((e[1] > 0) && (!(Number.isNaN(e[0])))))
+            .map((e) => [e[0], e[1] + 1]);
+    }
+    else {
+        return [];
+    }
+}
+export { seq, unique, find_repeated, arr_uniq_p, histograph, weighted_histo_key, weighted_rand_select, weighted_sample_select, array_box_if_string, name_bind_prop_and_state, hook_name, named_hook_name, make_mulberry_rand };

package/dist/es6/version.js

@@ -1,2 +1,2 @@
-const version = "5.78.0";
+const version = "5.79.0";
 export { version };