cnd - npm Package Compare versions

Comparing version 5.3.0 to 5.3.1

lib/BITSNPIECES.js

@@ -1,2 +0,2 @@
-// Generated by CoffeeScript 2.4.1
+// Generated by CoffeeScript 2.5.1
 (function() {
@@ -97,3 +97,3 @@ //###########################################################################################################
     /* Given a `text`, return the same with all regular expression metacharacters properly escaped. Escaped
-    characters are `[]{}()*+?-.,\^$|#` plus whitespace. */
+     characters are `[]{}()*+?-.,\^$|#` plus whitespace. */
     //.........................................................................................................
@@ -106,3 +106,3 @@ return text.replace(/[-[\]{}()*+?.,\\\/^$|#\s]/g, "\\$&");
     /* Given a `text`, return the same with all characters critical in HTML (`&`, `<`, `>`) properly
-    escaped. */
+     escaped. */
     var R;
@@ -171,4 +171,4 @@ R = text;
     /* This method works similar to `get_rnd`; it accepts two `seed`s which are used to produce random number
-    generators and returns a predictable shuffling function that accepts arguments like Bits'N'Pieces
-    `shuffle`. */
+     generators and returns a predictable shuffling function that accepts arguments like Bits'N'Pieces
+     `shuffle`. */
     var random_integer, rnd;
@@ -216,4 +216,4 @@ rnd = this.get_rnd(seed_0);
     /* Return a random number between min (inclusive) and max (exclusive).
-    From https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Math/random
-    via http://stackoverflow.com/a/1527820/256361. */
+     From https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Math/random
+     via http://stackoverflow.com/a/1527820/256361. */
     return Math.random() * (max - min) + min;
@@ -231,4 +231,4 @@ };
     /* Return a random integer between min (inclusive) and max (inclusive).
-    From https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Math/random
-    via http://stackoverflow.com/a/1527820/256361. */
+     From https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Math/random
+     via http://stackoverflow.com/a/1527820/256361. */
     return this.integer_from_normal_float(Math.random(), min, max);
@@ -278,3 +278,3 @@ };
       /* Reset the generator. After calling `rnd.reset` (or `rnd.seed` with the same arguments), ensuing calls
-      to `rnd` will always result in the same sequence of pseudo-random numbers. */
+         to `rnd` will always result in the same sequence of pseudo-random numbers. */
       if (seed == null) {
@@ -323,3 +323,3 @@ seed = this._seed;
     /* Given some object `x`, a `name` and a `fallback`, return the value of `x[ name ]`, or, if it does not
-    exist, `fallback`. When the method returns, `x[ name ]` has been deleted. */
+     exist, `fallback`. When the method returns, `x[ name ]` has been deleted. */
     if (x[name] != null) {
@@ -469,9 +469,9 @@ R = x[name];
     /* Given a number of `values` and a `length`, return an ID with `length` hexadecimal digits (`[0-9a-f]`)
-    that deterministically depends on the input but can probably not reverse-engeneered to yield the input
-    values. This is in no way meant to be cryptographically strong, just arbitrary enough so that we have a
-    convenient method to derive an ID with little chance of overlap given different inputs. **Note** It is
-    certainly possible to use this method (or `id_from_text`) to create a hash from a password to be stored in
-    a DB. Don't do this. Use `bcrypt` or similar best-practices for password storage. Again, the intent of
-    the BITSNPIECES ID utilities is *not* to be 'crypto-safe'; its intent is to give you a tool for generating
-    repetition-free IDs. */
+     that deterministically depends on the input but can probably not reverse-engeneered to yield the input
+     values. This is in no way meant to be cryptographically strong, just arbitrary enough so that we have a
+     convenient method to derive an ID with little chance of overlap given different inputs. **Note** It is
+     certainly possible to use this method (or `id_from_text`) to create a hash from a password to be stored in
+     a DB. Don't do this. Use `bcrypt` or similar best-practices for password storage. Again, the intent of
+     the BITSNPIECES ID utilities is *not* to be 'crypto-safe'; its intent is to give you a tool for generating
+     repetition-free IDs. */
     return this.id_from_text(((function() {
@@ -491,7 +491,7 @@ var i, len, results;
     /* Like `create_id`, but with an extra random factor built in that should exclude that two identical
-    outputs are ever returned for any two identical inputs. Under the assumption that two calls to this
-    method are highly unlikely two produce an identical pair `( 1 * new Date(), Math.random() )` (which could
-    only happen if `Math.random()` returned the same number again *within the same clock millisecond*), and
-    assuming you are using a reasonable value for `length` (i.e., say, `7 < length < 20`), you should never
-    see the same ID twice. */
+     outputs are ever returned for any two identical inputs. Under the assumption that two calls to this
+     method are highly unlikely two produce an identical pair `( 1 * new Date(), Math.random() )` (which could
+     only happen if `Math.random()` returned the same number again *within the same clock millisecond*), and
+     assuming you are using a reasonable value for `length` (i.e., say, `7 < length < 20`), you should never
+     see the same ID twice. */
     values.push(1 * new Date() * Math.random());
@@ -573,5 +573,5 @@ return this.create_id(values, length);
     /* Given a `text` and a `length`, return an ID with `length` hexadecimal digits (`[0-9a-f]`)—this is like
-    `create_id`, but working on a text rather than a number of arbitrary values. The hash algorithm currently
-    used is SHA-1, which returns 40 hex digits; it should be good enough for the task at hand and has the
-    advantage of being widely implemented. */
+     `create_id`, but working on a text rather than a number of arbitrary values. The hash algorithm currently
+     used is SHA-1, which returns 40 hex digits; it should be good enough for the task at hand and has the
+     advantage of being widely implemented. */
     /* TAINT should be a user option, or take 'good' algorithm universally available */
@@ -713,3 +713,3 @@ var R;
     /* `is_subset subset, superset` returns whether `subset` is a subset of `superset`; this is true if each
-    element of `subset` is also an element of `superset`. */
+     element of `subset` is also an element of `superset`. */
     var done, element, i, iterator, len, type_of_sub, type_of_super, value;
@@ -716,0 +716,0 @@ type_of_sub = CND.type_of(subset);

lib/candidates.js

@@ -1,2 +0,2 @@
-// Generated by CoffeeScript 2.4.1
+// Generated by CoffeeScript 2.5.1
 (function() {
@@ -3,0 +3,0 @@ /* LIST methods */

lib/exception-handler.js

 (function() {
-  'use strict';
+  'use strict';//########################################################################################################
   var CND, FS, PATH, alert, badge, bold, cyan, debug, echo, get_context, gold, green, grey, help, info, isa_text, log, red, reverse, rpr, show_error_with_source_context, stackman, steel, urge, warn, whisper, white, yellow;
 
   //###########################################################################################################
+  //###########################################################################################################
+  //###########################################################################################################
+  /* see https://medium.com/@nodejs/source-maps-in-node-js-482872b56116
+  */
+  //###########################################################################################################
+  //###########################################################################################################
+
+  //###########################################################################################################
   CND = require('cnd');
@@ -7,0 +15,0 @@

lib/jkroso-equals.js

@@ -1,2 +0,2 @@
-// Generated by CoffeeScript 2.4.1
+// Generated by CoffeeScript 2.5.1
 (function() {
@@ -3,0 +3,0 @@

lib/jkroso-type.js

@@ -1,2 +0,2 @@
-// Generated by CoffeeScript 2.4.1
+// Generated by CoffeeScript 2.5.1
 (function() {
@@ -3,0 +3,0 @@

lib/main.js

@@ -0,1 +1,2 @@
+// Generated by CoffeeScript 2.5.1
 (function() {
@@ -47,1 +48,3 @@ 'use strict';
 }).call(this);
+
+//# sourceMappingURL=main.js.map

lib/tests.js

@@ -0,1 +1,2 @@
+// Generated by CoffeeScript 2.5.1
 (function() {
@@ -302,1 +303,3 @@ //###########################################################################################################
 }).call(this);
+
+//# sourceMappingURL=tests.js.map

lib/TRM-CONSTANTS.js

@@ -1,2 +0,2 @@
-// Generated by CoffeeScript 2.4.1
+// Generated by CoffeeScript 2.5.1
 (function() {
@@ -3,0 +3,0 @@ //-----------------------------------------------------------------------------------------------------------

lib/TRM-VT100-ANALYZER.js

@@ -1,2 +0,2 @@
-// Generated by CoffeeScript 2.4.1
+// Generated by CoffeeScript 2.5.1
 (function() {
@@ -3,0 +3,0 @@ var CND, ansi_vt100_cc_matcher, rgb_hex_by_vt100_colorcode;

lib/TRM.js

@@ -1,2 +0,2 @@
-// Generated by CoffeeScript 2.4.1
+// Generated by CoffeeScript 2.5.1
 (function() {
@@ -52,3 +52,3 @@ //###########################################################################################################
     /* Given any number of arguments, return a text representing the arguments as seen fit for output
-    commands like `log`, `echo`, and the colors. */
+     commands like `log`, `echo`, and the colors. */
     return (this._pen(...P)).concat('\n');
@@ -303,3 +303,3 @@ };
   //                         gold yellow""".split /\s+/
-  rainbow_color_names = "red orange yellow green blue pink".split(/\s+/);
+  rainbow_color_names = `red orange yellow green blue pink`.split(/\s+/);
 
@@ -306,0 +306,0 @@ rainbow_idx = -1;

lib/TYPES.js

@@ -1,2 +0,2 @@
-// Generated by CoffeeScript 2.4.1
+// Generated by CoffeeScript 2.5.1
 (function() {
@@ -62,3 +62,3 @@ //###########################################################################################################
   this.type_of = function(x) {
-    "Given any kind of value ``x``, return its type.";
+    `Given any kind of value \`\`x\`\`, return its type.`;
     var R, js_type;
@@ -101,3 +101,4 @@ //.........................................................................................................
   this.isa = function(x, probe) {
-    "Given any value ``x`` and a non-empty text ``probe``, return whether ``TYPES/type_of x`` equals\n``probe``.";
+    `Given any value \`\`x\`\` and a non-empty text \`\`probe\`\`, return whether \`\`TYPES/type_of x\`\` equals
+\`\`probe\`\`.`;
     // validate_name probe
@@ -104,0 +105,0 @@ return (this.type_of(x)) === probe;

lib/universal-copy.js

@@ -1,2 +0,2 @@
-// Generated by CoffeeScript 2.4.1
+// Generated by CoffeeScript 2.5.1
 (function() {
@@ -3,0 +3,0 @@ /*

package.json

 {
   "name": "cnd",
-  "version": "5.3.0",
+  "version": "5.3.1",
   "description": "a grab-bag NodeJS package mainly for functionalities that used to live in coffeenode-trm, coffeenode-bitsnpieces, and coffeenode-types",
@@ -32,9 +32,9 @@ "main": "lib/main.js",
   "dependencies": {
-    "mkdirp": "^0.5.1",
-    "stackman": "^4.0.0",
+    "mkdirp": "^1.0.3",
+    "stackman": "^4.0.1",
     "trycatch": "^1.5.21"
   },
   "devDependencies": {
-    "guy-test": "^1.4.1"
+    "guy-test": "^1.4.2"
   }
 }

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

391841

increased by6.98%

Lines of code

2787

increased by0.43%

Dependency changes

• + Addedmkdirp@1.0.4(transitive)

• - Removedminimist@1.2.8(transitive)

• - Removedmkdirp@0.5.6(transitive)

• Updatedmkdirp@^1.0.3

• Updatedstackman@^4.0.1