node-red-contrib-tak-registration 0.16.3 → 0.16.7

package/node_modules/skmeans/dist/node/Gruntfile.js

@@ -1,49 +0,0 @@
-'use strict';
-
-module.exports = function (grunt) {
-	require('load-grunt-tasks')(grunt);
-
-	// Project configuration.
-	grunt.initConfig({
-		pkg: grunt.file.readJSON('package.json'),
-		browserify: {
-			dist: {
-				watch: true,
-				keepAlive: true,
-				files: {
-					'dist/browser/skmeans.js': ['browser.js']
-				}
-			}
-		},
-		babel: {
-			options: {
-				sourceMap: true,
-				presets: ['es2015']
-			},
-			dist: {
-				files: [{
-					expand: true,
-					src: ['*.js'],
-					dest: 'dist/node',
-					ext: '.js'
-				}, {
-					'dist/browser/skmeans.js': ['dist/browser/skmeans.js']
-				}]
-			}
-		},
-		uglify: {
-			options: {
-				banner: '/*! <%= pkg.name %> <%= grunt.template.today("yyyy-mm-dd") %> */\n'
-			},
-			dist: {
-				files: {
-					'dist/browser/skmeans.min.js': ['dist/browser/skmeans.js']
-				}
-			}
-		},
-		clean: ['dist/browser/*.js', 'dist/browser/*.map']
-	});
-
-	grunt.registerTask('default', ['browserify', 'babel', 'uglify']);
-};
-//# sourceMappingURL=Gruntfile.js.map

package/node_modules/skmeans/dist/node/Gruntfile.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../Gruntfile.js"],"names":["module","exports","grunt","require","initConfig","pkg","file","readJSON","browserify","dist","watch","keepAlive","files","babel","options","sourceMap","presets","expand","src","dest","ext","uglify","banner","clean","registerTask"],"mappings":";;AAAAA,OAAOC,OAAP,GAAiB,UAASC,KAAT,EAAgB;AAChCC,SAAQ,kBAAR,EAA4BD,KAA5B;;AAEA;AACAA,OAAME,UAAN,CAAiB;AACfC,OAAKH,MAAMI,IAAN,CAAWC,QAAX,CAAoB,cAApB,CADU;AAEhBC,cAAY;AACXC,SAAM;AACLC,WAAO,IADF;AAELC,eAAW,IAFN;AAGLC,WAAO;AACN,gCAA2B,CAAC,YAAD;AADrB;AAHF;AADK,GAFI;AAWhBC,SAAO;AACNC,YAAS;AACRC,eAAW,IADH;AAERC,aAAS,CAAC,QAAD;AAFD,IADH;AAKNP,SAAM;AACLG,WAAO,CACN;AACCK,aAAQ,IADT;AAECC,UAAK,CAAC,MAAD,CAFN;AAGCC,WAAM,WAHP;AAICC,UAAK;AAJN,KADM,EAON;AACC,gCAA2B,CAAC,yBAAD;AAD5B,KAPM;AADF;AALA,GAXS;AA8BfC,UAAQ;AACNP,YAAS;AACPQ,YAAQ;AADD,IADH;AAIRb,SAAO;AACNG,WAAO;AACN,oCAAgC,CAAC,yBAAD;AAD1B;AADD;AAJC,GA9BO;AAwChBW,SAAO,CAAC,mBAAD,EAAqB,oBAArB;AAxCS,EAAjB;;AA2CArB,OAAMsB,YAAN,CAAmB,SAAnB,EAA8B,CAAC,YAAD,EAAc,OAAd,EAAsB,QAAtB,CAA9B;AACA,CAhDD","file":"Gruntfile.js","sourcesContent":["module.exports = function(grunt) {\n\trequire('load-grunt-tasks')(grunt);\n\n\t// Project configuration.\n\tgrunt.initConfig({\n\t  pkg: grunt.file.readJSON('package.json'),\n\t\tbrowserify: {\n\t\t\tdist: {\n\t\t\t\twatch: true,\n\t\t\t\tkeepAlive: true,\n\t\t\t\tfiles: {\n\t\t\t\t\t'dist/browser/skmeans.js': ['browser.js']\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\tbabel: {\n\t\t\toptions: {\n\t\t\t\tsourceMap: true,\n\t\t\t\tpresets: ['es2015']\n\t\t\t},\n\t\t\tdist: {\n\t\t\t\tfiles: [\n\t\t\t\t\t{\n\t\t\t\t\t\texpand: true,\n\t\t\t\t\t\tsrc: ['*.js'],\n\t\t\t\t\t\tdest: 'dist/node',\n\t\t\t\t\t\text: '.js'\n\t\t\t\t\t},\n\t\t\t\t\t{\n\t\t\t\t\t\t'dist/browser/skmeans.js': ['dist/browser/skmeans.js'],\n\t\t\t\t\t}\n\t\t\t\t]\n\t\t\t}\n\t\t},\n\t  uglify: {\n\t    options: {\n\t      banner: '/*! <%= pkg.name %> <%= grunt.template.today(\"yyyy-mm-dd\") %> */\\n'\n\t    },\n\t\t\tdist : {\n\t\t\t\tfiles: {\n\t\t\t\t\t'dist/browser/skmeans.min.js' : ['dist/browser/skmeans.js']\n\t\t\t\t}\n\t\t\t}\n\t  },\n\t\tclean: ['dist/browser/*.js','dist/browser/*.map']\n\t});\n\n\tgrunt.registerTask('default', ['browserify','babel','uglify']);\n};\n"]}

package/node_modules/skmeans/dist/node/browser.js

@@ -1,19 +0,0 @@
-"use strict";
-
-(function () {
-  var root = this;
-  var previous_skmeans = root.skmeans;
-  var skmeans = require('./main.js');
-
-  if (typeof exports !== 'undefined') {
-    if (typeof module !== 'undefined' && module.exports) {
-      exports = module.exports = skmeans;
-    }
-    exports.skmeans = skmeans;
-  }
-
-  if (typeof window !== 'undefined') {
-    window.skmeans = skmeans;
-  }
-}).call(undefined);
-//# sourceMappingURL=browser.js.map

package/node_modules/skmeans/dist/node/browser.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../browser.js"],"names":["root","previous_skmeans","skmeans","require","exports","module","window","call"],"mappings":"AAAA;;AAEA,CAAC,YAAW;AACV,MAAIA,OAAO,IAAX;AACA,MAAIC,mBAAmBD,KAAKE,OAA5B;AACD,MAAIA,UAAUC,QAAQ,WAAR,CAAd;;AAEA,MAAI,OAAOC,OAAP,KAAmB,WAAvB,EAAqC;AAClC,QAAI,OAAOC,MAAP,KAAkB,WAAlB,IAAiCA,OAAOD,OAA5C,EAAsD;AACpDA,gBAAUC,OAAOD,OAAP,GAAiBF,OAA3B;AACD;AACDE,YAAQF,OAAR,GAAkBA,OAAlB;AACD;;AAEF,MAAG,OAAOI,MAAP,KAAkB,WAArB,EAAkC;AAC/BA,WAAOJ,OAAP,GAAiBA,OAAjB;AACD;AAEF,CAhBD,EAgBGK,IAhBH","file":"browser.js","sourcesContent":["\"use strict\";\n\n(function() {\n  var root = this\n  var previous_skmeans = root.skmeans;\n\tvar skmeans = require('./main.js');\n\n\tif( typeof exports !== 'undefined' ) {\n    if( typeof module !== 'undefined' && module.exports ) {\n      exports = module.exports = skmeans;\n    }\n    exports.skmeans = skmeans;\n  }\n\n\tif(typeof window !== 'undefined') {\n    window.skmeans = skmeans;\n  }\n\n}).call(this);\n"]}

package/node_modules/skmeans/dist/node/distance.js

@@ -1,39 +0,0 @@
-"use strict";
-
-module.exports = {
-	/**
-  * Euclidean distance
-  */
-	eudist: function eudist(v1, v2, sqrt) {
-		var len = v1.length;
-		var sum = 0;
-
-		for (var i = 0; i < len; i++) {
-			var d = (v1[i] || 0) - (v2[i] || 0);
-			sum += d * d;
-		}
-		// Square root not really needed
-		return sqrt ? Math.sqrt(sum) : sum;
-	},
-	mandist: function mandist(v1, v2, sqrt) {
-		var len = v1.length;
-		var sum = 0;
-
-		for (var i = 0; i < len; i++) {
-			sum += Math.abs((v1[i] || 0) - (v2[i] || 0));
-		}
-
-		// Square root not really needed
-		return sqrt ? Math.sqrt(sum) : sum;
-	},
-
-
-	/**
-  * Unidimensional distance
-  */
-	dist: function dist(v1, v2, sqrt) {
-		var d = Math.abs(v1 - v2);
-		return sqrt ? d : d * d;
-	}
-};
-//# sourceMappingURL=distance.js.map

package/node_modules/skmeans/dist/node/distance.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../distance.js"],"names":["module","exports","eudist","v1","v2","sqrt","len","length","sum","i","d","Math","mandist","abs","dist"],"mappings":";;AAAAA,OAAOC,OAAP,GAAiB;AAChB;;;AAGAC,OAJgB,kBAITC,EAJS,EAINC,EAJM,EAIHC,IAJG,EAIG;AAClB,MAAIC,MAAMH,GAAGI,MAAb;AACA,MAAIC,MAAM,CAAV;;AAEA,OAAI,IAAIC,IAAE,CAAV,EAAYA,IAAEH,GAAd,EAAkBG,GAAlB,EAAuB;AACtB,OAAIC,IAAI,CAACP,GAAGM,CAAH,KAAO,CAAR,KAAcL,GAAGK,CAAH,KAAO,CAArB,CAAR;AACAD,UAAOE,IAAEA,CAAT;AACA;AACD;AACA,SAAOL,OAAMM,KAAKN,IAAL,CAAUG,GAAV,CAAN,GAAuBA,GAA9B;AACA,EAde;AAgBhBI,QAhBgB,mBAgBRT,EAhBQ,EAgBLC,EAhBK,EAgBFC,IAhBE,EAgBI;AACnB,MAAIC,MAAMH,GAAGI,MAAb;AACA,MAAIC,MAAM,CAAV;;AAEA,OAAI,IAAIC,IAAE,CAAV,EAAYA,IAAEH,GAAd,EAAkBG,GAAlB,EAAuB;AACtBD,UAAOG,KAAKE,GAAL,CAAS,CAACV,GAAGM,CAAH,KAAO,CAAR,KAAcL,GAAGK,CAAH,KAAO,CAArB,CAAT,CAAP;AACA;;AAED;AACA,SAAOJ,OAAMM,KAAKN,IAAL,CAAUG,GAAV,CAAN,GAAuBA,GAA9B;AACA,EA1Be;;;AA4BhB;;;AAGAM,KA/BgB,gBA+BXX,EA/BW,EA+BRC,EA/BQ,EA+BLC,IA/BK,EA+BC;AAChB,MAAIK,IAAIC,KAAKE,GAAL,CAASV,KAAGC,EAAZ,CAAR;AACA,SAAOC,OAAMK,CAAN,GAAUA,IAAEA,CAAnB;AACA;AAlCe,CAAjB","file":"distance.js","sourcesContent":["module.exports = {\n\t/**\n\t * Euclidean distance\n\t */\n\teudist(v1,v2,sqrt) {\n\t\tvar len = v1.length;\n\t\tvar sum = 0;\n\n\t\tfor(let i=0;i<len;i++) {\n\t\t\tvar d = (v1[i]||0) - (v2[i]||0);\n\t\t\tsum += d*d;\n\t\t}\n\t\t// Square root not really needed\n\t\treturn sqrt? Math.sqrt(sum) : sum;\n\t},\n\n\tmandist(v1,v2,sqrt) {\n\t\tvar len = v1.length;\n\t\tvar sum = 0;\n\n\t\tfor(let i=0;i<len;i++) {\n\t\t\tsum += Math.abs((v1[i]||0) - (v2[i]||0));\n\t\t}\n\n\t\t// Square root not really needed\n\t\treturn sqrt? Math.sqrt(sum) : sum;\n\t},\n\n\t/**\n\t * Unidimensional distance\n\t */\n\tdist(v1,v2,sqrt) {\n\t\tvar d = Math.abs(v1-v2);\n\t\treturn sqrt? d : d*d;\n\t}\n\n}\n"]}

package/node_modules/skmeans/dist/node/kinit.js

@@ -1,110 +0,0 @@
-"use strict";
-
-var Distance = require("./distance.js"),
-    eudist = Distance.eudist,
-    dist = Distance.dist;
-
-module.exports = {
-	kmrand: function kmrand(data, k) {
-		var map = {},
-		    ks = [],
-		    t = k << 2;
-		var len = data.length;
-		var multi = data[0].length > 0;
-
-		while (ks.length < k && t-- > 0) {
-			var d = data[Math.floor(Math.random() * len)];
-			var key = multi ? d.join("_") : "" + d;
-			if (!map[key]) {
-				map[key] = true;
-				ks.push(d);
-			}
-		}
-
-		if (ks.length < k) throw new Error("Error initializating clusters");else return ks;
-	},
-
-
-	/**
-  * K-means++ initial centroid selection
-  */
-	kmpp: function kmpp(data, k) {
-		var distance = data[0].length ? eudist : dist;
-		var ks = [],
-		    len = data.length;
-		var multi = data[0].length > 0;
-		var map = {};
-
-		// First random centroid
-		var c = data[Math.floor(Math.random() * len)];
-		var key = multi ? c.join("_") : "" + c;
-		ks.push(c);
-		map[key] = true;
-
-		// Retrieve next centroids
-		while (ks.length < k) {
-			// Min Distances between current centroids and data points
-			var dists = [],
-			    lk = ks.length;
-			var dsum = 0,
-			    prs = [];
-
-			for (var i = 0; i < len; i++) {
-				var min = Infinity;
-				for (var j = 0; j < lk; j++) {
-					var _dist = distance(data[i], ks[j]);
-					if (_dist <= min) min = _dist;
-				}
-				dists[i] = min;
-			}
-
-			// Sum all min distances
-			for (var _i = 0; _i < len; _i++) {
-				dsum += dists[_i];
-			}
-
-			// Probabilities and cummulative prob (cumsum)
-			for (var _i2 = 0; _i2 < len; _i2++) {
-				prs[_i2] = { i: _i2, v: data[_i2], pr: dists[_i2] / dsum, cs: 0 };
-			}
-
-			// Sort Probabilities
-			prs.sort(function (a, b) {
-				return a.pr - b.pr;
-			});
-
-			// Cummulative Probabilities
-			prs[0].cs = prs[0].pr;
-			for (var _i3 = 1; _i3 < len; _i3++) {
-				prs[_i3].cs = prs[_i3 - 1].cs + prs[_i3].pr;
-			}
-
-			// Randomize
-			var rnd = Math.random();
-
-			// Gets only the items whose cumsum >= rnd
-			var idx = 0;
-			while (idx < len - 1 && prs[idx++].cs < rnd) {}
-			ks.push(prs[idx - 1].v);
-			/*
-   let done = false;
-   while(!done) {
-   	// this is our new centroid
-   	c = prs[idx-1].v
-   	key = multi? c.join("_") : `${c}`;
-   	if(!map[key]) {
-   		map[key] = true;
-   		ks.push(c);
-   		done = true;
-   	}
-   	else {
-   		idx++;
-   	}
-   }
-   */
-		}
-
-		return ks;
-	}
-};
-//# sourceMappingURL=kinit.js.map

package/node_modules/skmeans/dist/node/kinit.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../kinit.js"],"names":["Distance","require","eudist","dist","module","exports","kmrand","data","k","map","ks","t","len","length","multi","d","Math","floor","random","key","join","push","Error","kmpp","distance","c","dists","lk","dsum","prs","i","min","Infinity","j","v","pr","cs","sort","a","b","rnd","idx"],"mappings":";;AAAA,IACCA,WAAWC,QAAQ,eAAR,CADZ;AAAA,IAECC,SAASF,SAASE,MAFnB;AAAA,IAGCC,OAAOH,SAASG,IAHjB;;AAKAC,OAAOC,OAAP,GAAiB;AAChBC,OADgB,kBACTC,IADS,EACJC,CADI,EACD;AACd,MAAIC,MAAM,EAAV;AAAA,MAAcC,KAAK,EAAnB;AAAA,MAAuBC,IAAIH,KAAG,CAA9B;AACA,MAAII,MAAML,KAAKM,MAAf;AACA,MAAIC,QAAQP,KAAK,CAAL,EAAQM,MAAR,GAAe,CAA3B;;AAEA,SAAMH,GAAGG,MAAH,GAAUL,CAAV,IAAgBG,GAAD,GAAM,CAA3B,EAA8B;AAC7B,OAAII,IAAIR,KAAKS,KAAKC,KAAL,CAAWD,KAAKE,MAAL,KAAcN,GAAzB,CAAL,CAAR;AACA,OAAIO,MAAML,QAAOC,EAAEK,IAAF,CAAO,GAAP,CAAP,QAAwBL,CAAlC;AACA,OAAG,CAACN,IAAIU,GAAJ,CAAJ,EAAc;AACbV,QAAIU,GAAJ,IAAW,IAAX;AACAT,OAAGW,IAAH,CAAQN,CAAR;AACA;AACD;;AAED,MAAGL,GAAGG,MAAH,GAAUL,CAAb,EAAgB,MAAM,IAAIc,KAAJ,CAAU,+BAAV,CAAN,CAAhB,KACK,OAAOZ,EAAP;AACL,EAjBe;;;AAmBhB;;;AAGAa,KAtBgB,gBAsBXhB,IAtBW,EAsBNC,CAtBM,EAsBH;AACZ,MAAIgB,WAAWjB,KAAK,CAAL,EAAQM,MAAR,GAAgBX,MAAhB,GAAyBC,IAAxC;AACA,MAAIO,KAAK,EAAT;AAAA,MAAaE,MAAML,KAAKM,MAAxB;AACA,MAAIC,QAAQP,KAAK,CAAL,EAAQM,MAAR,GAAe,CAA3B;AACA,MAAIJ,MAAM,EAAV;;AAEA;AACA,MAAIgB,IAAIlB,KAAKS,KAAKC,KAAL,CAAWD,KAAKE,MAAL,KAAcN,GAAzB,CAAL,CAAR;AACA,MAAIO,MAAML,QAAOW,EAAEL,IAAF,CAAO,GAAP,CAAP,QAAwBK,CAAlC;AACAf,KAAGW,IAAH,CAAQI,CAAR;AACAhB,MAAIU,GAAJ,IAAW,IAAX;;AAEA;AACA,SAAMT,GAAGG,MAAH,GAAUL,CAAhB,EAAmB;AAClB;AACA,OAAIkB,QAAQ,EAAZ;AAAA,OAAgBC,KAAKjB,GAAGG,MAAxB;AACA,OAAIe,OAAO,CAAX;AAAA,OAAcC,MAAM,EAApB;;AAEA,QAAI,IAAIC,IAAE,CAAV,EAAYA,IAAElB,GAAd,EAAkBkB,GAAlB,EAAuB;AACtB,QAAIC,MAAMC,QAAV;AACA,SAAI,IAAIC,IAAE,CAAV,EAAYA,IAAEN,EAAd,EAAiBM,GAAjB,EAAsB;AACrB,SAAI9B,QAAOqB,SAASjB,KAAKuB,CAAL,CAAT,EAAiBpB,GAAGuB,CAAH,CAAjB,CAAX;AACA,SAAG9B,SAAM4B,GAAT,EAAcA,MAAM5B,KAAN;AACd;AACDuB,UAAMI,CAAN,IAAWC,GAAX;AACA;;AAED;AACA,QAAI,IAAID,KAAE,CAAV,EAAYA,KAAElB,GAAd,EAAkBkB,IAAlB,EAAuB;AACtBF,YAAQF,MAAMI,EAAN,CAAR;AACA;;AAED;AACA,QAAI,IAAIA,MAAE,CAAV,EAAYA,MAAElB,GAAd,EAAkBkB,KAAlB,EAAuB;AACtBD,QAAIC,GAAJ,IAAS,EAACA,GAAEA,GAAH,EAAMI,GAAE3B,KAAKuB,GAAL,CAAR,EAAiBK,IAAGT,MAAMI,GAAN,IAASF,IAA7B,EAAmCQ,IAAG,CAAtC,EAAT;AACA;;AAED;AACAP,OAAIQ,IAAJ,CAAS,UAACC,CAAD,EAAGC,CAAH;AAAA,WAAOD,EAAEH,EAAF,GAAKI,EAAEJ,EAAd;AAAA,IAAT;;AAEA;AACAN,OAAI,CAAJ,EAAOO,EAAP,GAAYP,IAAI,CAAJ,EAAOM,EAAnB;AACA,QAAI,IAAIL,MAAE,CAAV,EAAYA,MAAElB,GAAd,EAAkBkB,KAAlB,EAAuB;AACtBD,QAAIC,GAAJ,EAAOM,EAAP,GAAYP,IAAIC,MAAE,CAAN,EAASM,EAAT,GAAcP,IAAIC,GAAJ,EAAOK,EAAjC;AACA;;AAED;AACA,OAAIK,MAAMxB,KAAKE,MAAL,EAAV;;AAEA;AACA,OAAIuB,MAAM,CAAV;AACA,UAAMA,MAAI7B,MAAI,CAAR,IAAaiB,IAAIY,KAAJ,EAAWL,EAAX,GAAcI,GAAjC;AACA9B,MAAGW,IAAH,CAAQQ,IAAIY,MAAI,CAAR,EAAWP,CAAnB;AACA;;;;;;;;;;;;;;;;AAgBA;;AAED,SAAOxB,EAAP;AACA;AA9Fe,CAAjB","file":"kinit.js","sourcesContent":["const\n\tDistance = require(\"./distance.js\"),\n\teudist = Distance.eudist,\n\tdist = Distance.dist;\n\nmodule.exports = {\n\tkmrand(data,k) {\n\t\tvar map = {}, ks = [], t = k<<2;\n\t\tvar len = data.length;\n\t\tvar multi = data[0].length>0;\n\n\t\twhile(ks.length<k && (t--)>0) {\n\t\t\tlet d = data[Math.floor(Math.random()*len)];\n\t\t\tlet key = multi? d.join(\"_\") : `${d}`;\n\t\t\tif(!map[key]) {\n\t\t\t\tmap[key] = true;\n\t\t\t\tks.push(d);\n\t\t\t}\n\t\t}\n\n\t\tif(ks.length<k) throw new Error(\"Error initializating clusters\");\n\t\telse return ks;\n\t},\n\n\t/**\n\t * K-means++ initial centroid selection\n\t */\n\tkmpp(data,k) {\n\t\tvar distance = data[0].length? eudist : dist;\n\t\tvar ks = [], len = data.length;\n\t\tvar multi = data[0].length>0;\n\t\tvar map = {};\n\n\t\t// First random centroid\n\t\tvar c = data[Math.floor(Math.random()*len)];\n\t\tvar key = multi? c.join(\"_\") : `${c}`;\n\t\tks.push(c);\n\t\tmap[key] = true;\n\n\t\t// Retrieve next centroids\n\t\twhile(ks.length<k) {\n\t\t\t// Min Distances between current centroids and data points\n\t\t\tlet dists = [], lk = ks.length;\n\t\t\tlet dsum = 0, prs = [];\n\n\t\t\tfor(let i=0;i<len;i++) {\n\t\t\t\tlet min = Infinity;\n\t\t\t\tfor(let j=0;j<lk;j++) {\n\t\t\t\t\tlet dist = distance(data[i],ks[j]);\n\t\t\t\t\tif(dist<=min) min = dist;\n\t\t\t\t}\n\t\t\t\tdists[i] = min;\n\t\t\t}\n\n\t\t\t// Sum all min distances\n\t\t\tfor(let i=0;i<len;i++) {\n\t\t\t\tdsum += dists[i]\n\t\t\t}\n\n\t\t\t// Probabilities and cummulative prob (cumsum)\n\t\t\tfor(let i=0;i<len;i++) {\n\t\t\t\tprs[i] = {i:i, v:data[i],\tpr:dists[i]/dsum, cs:0}\n\t\t\t}\n\n\t\t\t// Sort Probabilities\n\t\t\tprs.sort((a,b)=>a.pr-b.pr);\n\n\t\t\t// Cummulative Probabilities\n\t\t\tprs[0].cs = prs[0].pr;\n\t\t\tfor(let i=1;i<len;i++) {\n\t\t\t\tprs[i].cs = prs[i-1].cs + prs[i].pr;\n\t\t\t}\n\n\t\t\t// Randomize\n\t\t\tlet rnd = Math.random();\n\n\t\t\t// Gets only the items whose cumsum >= rnd\n\t\t\tlet idx = 0;\n\t\t\twhile(idx<len-1 && prs[idx++].cs<rnd);\n\t\t\tks.push(prs[idx-1].v);\n\t\t\t/*\n\t\t\tlet done = false;\n\t\t\twhile(!done) {\n\t\t\t\t// this is our new centroid\n\t\t\t\tc = prs[idx-1].v\n\t\t\t\tkey = multi? c.join(\"_\") : `${c}`;\n\t\t\t\tif(!map[key]) {\n\t\t\t\t\tmap[key] = true;\n\t\t\t\t\tks.push(c);\n\t\t\t\t\tdone = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tidx++;\n\t\t\t\t}\n\t\t\t}\n\t\t\t*/\n\t\t}\n\n\t\treturn ks;\n\t}\n\n}\n"]}

package/node_modules/skmeans/dist/node/main.js

@@ -1,161 +0,0 @@
-"use strict";
-
-/*jshint esversion: 6 */
-
-var Distance = require("./distance.js"),
-    ClusterInit = require("./kinit.js"),
-    eudist = Distance.eudist,
-    mandist = Distance.mandist,
-    dist = Distance.dist,
-    kmrand = ClusterInit.kmrand,
-    kmpp = ClusterInit.kmpp;
-
-var MAX = 10000;
-
-/**
- * Inits an array with values
- */
-function init(len, val, v) {
-	v = v || [];
-	for (var i = 0; i < len; i++) {
-		v[i] = val;
-	}return v;
-}
-
-function skmeans(data, k, initial, maxit) {
-	var ks = [],
-	    old = [],
-	    idxs = [],
-	    dist = [];
-	var conv = false,
-	    it = maxit || MAX;
-	var len = data.length,
-	    vlen = data[0].length,
-	    multi = vlen > 0;
-	var count = [];
-
-	if (!initial) {
-		var _idxs = {};
-		while (ks.length < k) {
-			var idx = Math.floor(Math.random() * len);
-			if (!_idxs[idx]) {
-				_idxs[idx] = true;
-				ks.push(data[idx]);
-			}
-		}
-	} else if (initial == "kmrand") {
-		ks = kmrand(data, k);
-	} else if (initial == "kmpp") {
-		ks = kmpp(data, k);
-	} else {
-		ks = initial;
-	}
-
-	do {
-		// Reset k count
-		init(k, 0, count);
-
-		// For each value in data, find the nearest centroid
-		for (var i = 0; i < len; i++) {
-			var min = Infinity,
-			    _idx = 0;
-			for (var j = 0; j < k; j++) {
-				// Multidimensional or unidimensional
-				var dist = multi ? eudist(data[i], ks[j]) : Math.abs(data[i] - ks[j]);
-				if (dist <= min) {
-					min = dist;
-					_idx = j;
-				}
-			}
-			idxs[i] = _idx; // Index of the selected centroid for that value
-			count[_idx]++; // Number of values for this centroid
-		}
-
-		// Recalculate centroids
-		var sum = [],
-		    old = [],
-		    dif = 0;
-		for (var _j = 0; _j < k; _j++) {
-			// Multidimensional or unidimensional
-			sum[_j] = multi ? init(vlen, 0, sum[_j]) : 0;
-			old[_j] = ks[_j];
-		}
-
-		// If multidimensional
-		if (multi) {
-			for (var _j2 = 0; _j2 < k; _j2++) {
-				ks[_j2] = [];
-			} // Sum values and count for each centroid
-			for (var _i = 0; _i < len; _i++) {
-				var _idx2 = idxs[_i],
-				    // Centroid for that item
-				vsum = sum[_idx2],
-				    // Sum values for this centroid
-				vect = data[_i]; // Current vector
-
-				// Accumulate value on the centroid for current vector
-				for (var h = 0; h < vlen; h++) {
-					vsum[h] += vect[h];
-				}
-			}
-			// Calculate the average for each centroid
-			conv = true;
-			for (var _j3 = 0; _j3 < k; _j3++) {
-				var ksj = ks[_j3],
-				    // Current centroid
-				sumj = sum[_j3],
-				    // Accumulated centroid values
-				oldj = old[_j3],
-				    // Old centroid value
-				cj = count[_j3]; // Number of elements for this centroid
-
-				// New average
-				for (var _h = 0; _h < vlen; _h++) {
-					ksj[_h] = sumj[_h] / cj || 0; // New centroid
-				}
-
-				// Find if centroids have moved
-				if (conv) {
-					for (var _h2 = 0; _h2 < vlen; _h2++) {
-						if (oldj[_h2] != ksj[_h2]) {
-							conv = false;
-							break;
-						}
-					}
-				}
-			}
-		}
-		// If unidimensional
-		else {
-				// Sum values and count for each centroid
-				for (var _i2 = 0; _i2 < len; _i2++) {
-					var _idx3 = idxs[_i2];
-					sum[_idx3] += data[_i2];
-				}
-				// Calculate the average for each centroid
-				for (var _j4 = 0; _j4 < k; _j4++) {
-					ks[_j4] = sum[_j4] / count[_j4] || 0; // New centroid
-				}
-				// Find if centroids have moved
-				conv = true;
-				for (var _j5 = 0; _j5 < k; _j5++) {
-					if (old[_j5] != ks[_j5]) {
-						conv = false;
-						break;
-					}
-				}
-			}
-
-		conv = conv || --it <= 0;
-	} while (!conv);
-
-	return {
-		it: MAX - it,
-		k: k,
-		idxs: idxs,
-		centroids: ks
-	};
-}
-
-module.exports = skmeans;
-//# sourceMappingURL=main.js.map

package/node_modules/skmeans/dist/node/main.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../main.js"],"names":["Distance","require","ClusterInit","eudist","mandist","dist","kmrand","kmpp","MAX","init","len","val","v","i","skmeans","data","k","initial","maxit","ks","old","idxs","conv","it","length","vlen","multi","count","idx","Math","floor","random","push","min","Infinity","j","abs","sum","dif","vsum","vect","h","ksj","sumj","oldj","cj","centroids","module","exports"],"mappings":";;AAAA;;AAEA,IACCA,WAAWC,QAAQ,eAAR,CADZ;AAAA,IAECC,cAAcD,QAAQ,YAAR,CAFf;AAAA,IAGCE,SAASH,SAASG,MAHnB;AAAA,IAICC,UAAUJ,SAASI,OAJpB;AAAA,IAKCC,OAAOL,SAASK,IALjB;AAAA,IAMCC,SAASJ,YAAYI,MANtB;AAAA,IAOCC,OAAOL,YAAYK,IAPpB;;AASA,IAAMC,MAAM,KAAZ;;AAEA;;;AAGA,SAASC,IAAT,CAAcC,GAAd,EAAkBC,GAAlB,EAAsBC,CAAtB,EAAyB;AACxBA,KAAIA,KAAK,EAAT;AACA,MAAI,IAAIC,IAAE,CAAV,EAAYA,IAAEH,GAAd,EAAkBG,GAAlB;AAAuBD,IAAEC,CAAF,IAAOF,GAAP;AAAvB,EACA,OAAOC,CAAP;AACA;;AAED,SAASE,OAAT,CAAiBC,IAAjB,EAAsBC,CAAtB,EAAwBC,OAAxB,EAAgCC,KAAhC,EAAuC;AACtC,KAAIC,KAAK,EAAT;AAAA,KAAaC,MAAM,EAAnB;AAAA,KAAuBC,OAAO,EAA9B;AAAA,KAAkChB,OAAO,EAAzC;AACA,KAAIiB,OAAO,KAAX;AAAA,KAAkBC,KAAKL,SAASV,GAAhC;AACA,KAAIE,MAAMK,KAAKS,MAAf;AAAA,KAAuBC,OAAOV,KAAK,CAAL,EAAQS,MAAtC;AAAA,KAA8CE,QAAQD,OAAK,CAA3D;AACA,KAAIE,QAAQ,EAAZ;;AAEA,KAAG,CAACV,OAAJ,EAAa;AACZ,MAAII,QAAO,EAAX;AACA,SAAMF,GAAGK,MAAH,GAAUR,CAAhB,EAAmB;AAClB,OAAIY,MAAMC,KAAKC,KAAL,CAAWD,KAAKE,MAAL,KAAcrB,GAAzB,CAAV;AACA,OAAG,CAACW,MAAKO,GAAL,CAAJ,EAAe;AACdP,UAAKO,GAAL,IAAY,IAAZ;AACAT,OAAGa,IAAH,CAAQjB,KAAKa,GAAL,CAAR;AACA;AACD;AACD,EATD,MAUK,IAAGX,WAAS,QAAZ,EAAsB;AAC1BE,OAAKb,OAAOS,IAAP,EAAYC,CAAZ,CAAL;AACA,EAFI,MAGA,IAAGC,WAAS,MAAZ,EAAoB;AACxBE,OAAKZ,KAAKQ,IAAL,EAAUC,CAAV,CAAL;AACA,EAFI,MAGA;AACJG,OAAKF,OAAL;AACA;;AAED,IAAG;AACF;AACAR,OAAKO,CAAL,EAAO,CAAP,EAASW,KAAT;;AAEA;AACA,OAAI,IAAId,IAAE,CAAV,EAAYA,IAAEH,GAAd,EAAkBG,GAAlB,EAAuB;AACtB,OAAIoB,MAAMC,QAAV;AAAA,OAAoBN,OAAM,CAA1B;AACA,QAAI,IAAIO,IAAE,CAAV,EAAYA,IAAEnB,CAAd,EAAgBmB,GAAhB,EAAqB;AACpB;AACA,QAAI9B,OAAOqB,QAAOvB,OAAOY,KAAKF,CAAL,CAAP,EAAeM,GAAGgB,CAAH,CAAf,CAAP,GAA+BN,KAAKO,GAAL,CAASrB,KAAKF,CAAL,IAAQM,GAAGgB,CAAH,CAAjB,CAA1C;AACA,QAAG9B,QAAM4B,GAAT,EAAc;AACbA,WAAM5B,IAAN;AACAuB,YAAMO,CAAN;AACA;AACD;AACDd,QAAKR,CAAL,IAAUe,IAAV,CAVsB,CAUP;AACfD,SAAMC,IAAN,IAXsB,CAWP;AACf;;AAED;AACA,MAAIS,MAAM,EAAV;AAAA,MAAcjB,MAAM,EAApB;AAAA,MAAwBkB,MAAM,CAA9B;AACA,OAAI,IAAIH,KAAE,CAAV,EAAYA,KAAEnB,CAAd,EAAgBmB,IAAhB,EAAqB;AACpB;AACAE,OAAIF,EAAJ,IAAST,QAAOjB,KAAKgB,IAAL,EAAU,CAAV,EAAYY,IAAIF,EAAJ,CAAZ,CAAP,GAA6B,CAAtC;AACAf,OAAIe,EAAJ,IAAShB,GAAGgB,EAAH,CAAT;AACA;;AAED;AACA,MAAGT,KAAH,EAAU;AACT,QAAI,IAAIS,MAAE,CAAV,EAAYA,MAAEnB,CAAd,EAAgBmB,KAAhB;AAAqBhB,OAAGgB,GAAH,IAAQ,EAAR;AAArB,IADS,CAGT;AACA,QAAI,IAAItB,KAAE,CAAV,EAAYA,KAAEH,GAAd,EAAkBG,IAAlB,EAAuB;AACtB,QAAIe,QAAMP,KAAKR,EAAL,CAAV;AAAA,QAAoB;AAClB0B,WAAOF,IAAIT,KAAJ,CADT;AAAA,QACmB;AACjBY,WAAOzB,KAAKF,EAAL,CAFT,CADsB,CAGH;;AAEnB;AACA,SAAI,IAAI4B,IAAE,CAAV,EAAYA,IAAEhB,IAAd,EAAmBgB,GAAnB,EAAwB;AACvBF,UAAKE,CAAL,KAAWD,KAAKC,CAAL,CAAX;AACA;AACD;AACD;AACAnB,UAAO,IAAP;AACA,QAAI,IAAIa,MAAE,CAAV,EAAYA,MAAEnB,CAAd,EAAgBmB,KAAhB,EAAqB;AACpB,QAAIO,MAAMvB,GAAGgB,GAAH,CAAV;AAAA,QAAkB;AAChBQ,WAAON,IAAIF,GAAJ,CADT;AAAA,QACiB;AACfS,WAAOxB,IAAIe,GAAJ,CAFT;AAAA,QAEkB;AAChBU,SAAKlB,MAAMQ,GAAN,CAHP,CADoB,CAIH;;AAEjB;AACA,SAAI,IAAIM,KAAE,CAAV,EAAYA,KAAEhB,IAAd,EAAmBgB,IAAnB,EAAwB;AACvBC,SAAID,EAAJ,IAAUE,KAAKF,EAAL,CAAD,GAAWI,EAAX,IAAkB,CAA3B,CADuB,CACO;AAC9B;;AAED;AACA,QAAGvB,IAAH,EAAS;AACR,UAAI,IAAImB,MAAE,CAAV,EAAYA,MAAEhB,IAAd,EAAmBgB,KAAnB,EAAwB;AACvB,UAAGG,KAAKH,GAAL,KAASC,IAAID,GAAJ,CAAZ,EAAoB;AACnBnB,cAAO,KAAP;AACA;AACA;AACD;AACD;AACD;AACD;AACD;AAtCA,OAuCK;AACJ;AACA,SAAI,IAAIT,MAAE,CAAV,EAAYA,MAAEH,GAAd,EAAkBG,KAAlB,EAAuB;AACtB,SAAIe,QAAMP,KAAKR,GAAL,CAAV;AACAwB,SAAIT,KAAJ,KAAYb,KAAKF,GAAL,CAAZ;AACA;AACD;AACA,SAAI,IAAIsB,MAAE,CAAV,EAAYA,MAAEnB,CAAd,EAAgBmB,KAAhB,EAAqB;AACpBhB,QAAGgB,GAAH,IAAQE,IAAIF,GAAJ,IAAOR,MAAMQ,GAAN,CAAP,IAAmB,CAA3B,CADoB,CACU;AAC9B;AACD;AACAb,WAAO,IAAP;AACA,SAAI,IAAIa,MAAE,CAAV,EAAYA,MAAEnB,CAAd,EAAgBmB,KAAhB,EAAqB;AACpB,SAAGf,IAAIe,GAAJ,KAAQhB,GAAGgB,GAAH,CAAX,EAAkB;AACjBb,aAAO,KAAP;AACA;AACA;AACD;AACD;;AAEDA,SAAOA,QAAS,EAAEC,EAAF,IAAM,CAAtB;AACA,EAxFD,QAwFO,CAACD,IAxFR;;AA0FA,QAAO;AACNC,MAAKf,MAAIe,EADH;AAENP,KAAIA,CAFE;AAGNK,QAAOA,IAHD;AAINyB,aAAY3B;AAJN,EAAP;AAMA;;AAED4B,OAAOC,OAAP,GAAiBlC,OAAjB","file":"main.js","sourcesContent":["/*jshint esversion: 6 */\n\nconst\n\tDistance = require(\"./distance.js\"),\n\tClusterInit = require(\"./kinit.js\"),\n\teudist = Distance.eudist,\n\tmandist = Distance.mandist,\n\tdist = Distance.dist,\n\tkmrand = ClusterInit.kmrand,\n\tkmpp = ClusterInit.kmpp;\n\nconst MAX = 10000;\n\n/**\n * Inits an array with values\n */\nfunction init(len,val,v) {\n\tv = v || [];\n\tfor(let i=0;i<len;i++) v[i] = val;\n\treturn v;\n}\n\nfunction skmeans(data,k,initial,maxit) {\n\tvar ks = [], old = [], idxs = [], dist = [];\n\tvar conv = false, it = maxit || MAX;\n\tvar len = data.length, vlen = data[0].length, multi = vlen>0;\n\tvar count = [];\n\n\tif(!initial) {\n\t\tlet idxs = {};\n\t\twhile(ks.length<k) {\n\t\t\tlet idx = Math.floor(Math.random()*len);\n\t\t\tif(!idxs[idx]) {\n\t\t\t\tidxs[idx] = true;\n\t\t\t\tks.push(data[idx]);\n\t\t\t}\n\t\t}\n\t}\n\telse if(initial==\"kmrand\") {\n\t\tks = kmrand(data,k);\n\t}\n\telse if(initial==\"kmpp\") {\n\t\tks = kmpp(data,k);\n\t}\n\telse {\n\t\tks = initial;\n\t}\n\n\tdo {\n\t\t// Reset k count\n\t\tinit(k,0,count);\n\n\t\t// For each value in data, find the nearest centroid\n\t\tfor(let i=0;i<len;i++) {\n\t\t\tlet min = Infinity, idx = 0;\n\t\t\tfor(let j=0;j<k;j++) {\n\t\t\t\t// Multidimensional or unidimensional\n\t\t\t\tvar dist = multi? eudist(data[i],ks[j]) : Math.abs(data[i]-ks[j]);\n\t\t\t\tif(dist<=min) {\n\t\t\t\t\tmin = dist;\n\t\t\t\t\tidx = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tidxs[i] = idx;\t// Index of the selected centroid for that value\n\t\t\tcount[idx]++;\t\t// Number of values for this centroid\n\t\t}\n\n\t\t// Recalculate centroids\n\t\tvar sum = [], old = [], dif = 0;\n\t\tfor(let j=0;j<k;j++) {\n\t\t\t// Multidimensional or unidimensional\n\t\t\tsum[j] = multi? init(vlen,0,sum[j]) : 0;\n\t\t\told[j] = ks[j];\n\t\t}\n\n\t\t// If multidimensional\n\t\tif(multi) {\n\t\t\tfor(let j=0;j<k;j++) ks[j] = [];\n\n\t\t\t// Sum values and count for each centroid\n\t\t\tfor(let i=0;i<len;i++) {\n\t\t\t\tlet\tidx = idxs[i],\t\t// Centroid for that item\n\t\t\t\t\t\tvsum = sum[idx],\t// Sum values for this centroid\n\t\t\t\t\t\tvect = data[i];\t\t// Current vector\n\n\t\t\t\t// Accumulate value on the centroid for current vector\n\t\t\t\tfor(let h=0;h<vlen;h++) {\n\t\t\t\t\tvsum[h] += vect[h];\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Calculate the average for each centroid\n\t\t\tconv = true;\n\t\t\tfor(let j=0;j<k;j++) {\n\t\t\t\tlet ksj = ks[j],\t\t// Current centroid\n\t\t\t\t\t\tsumj = sum[j],\t// Accumulated centroid values\n\t\t\t\t\t\toldj = old[j], \t// Old centroid value\n\t\t\t\t\t\tcj = count[j];\t// Number of elements for this centroid\n\n\t\t\t\t// New average\n\t\t\t\tfor(let h=0;h<vlen;h++) {\n\t\t\t\t\tksj[h] = (sumj[h])/(cj) || 0;\t// New centroid\n\t\t\t\t}\n\n\t\t\t\t// Find if centroids have moved\n\t\t\t\tif(conv) {\n\t\t\t\t\tfor(let h=0;h<vlen;h++) {\n\t\t\t\t\t\tif(oldj[h]!=ksj[h]) {\n\t\t\t\t\t\t\tconv = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// If unidimensional\n\t\telse {\n\t\t\t// Sum values and count for each centroid\n\t\t\tfor(let i=0;i<len;i++) {\n\t\t\t\tlet idx = idxs[i];\n\t\t\t\tsum[idx] += data[i];\n\t\t\t}\n\t\t\t// Calculate the average for each centroid\n\t\t\tfor(let j=0;j<k;j++) {\n\t\t\t\tks[j] = sum[j]/count[j] || 0;\t// New centroid\n\t\t\t}\n\t\t\t// Find if centroids have moved\n\t\t\tconv = true;\n\t\t\tfor(let j=0;j<k;j++) {\n\t\t\t\tif(old[j]!=ks[j]) {\n\t\t\t\t\tconv = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tconv = conv || (--it<=0);\n\t}while(!conv);\n\n\treturn {\n\t\tit : MAX-it,\n\t\tk : k,\n\t\tidxs : idxs,\n\t\tcentroids : ks\n\t};\n}\n\nmodule.exports = skmeans;\n"]}

package/node_modules/skmeans/distance.js

@@ -1,37 +0,0 @@
-module.exports = {
-	/**
-	 * Euclidean distance
-	 */
-	eudist(v1,v2,sqrt) {
-		var len = v1.length;
-		var sum = 0;
-
-		for(let i=0;i<len;i++) {
-			var d = (v1[i]||0) - (v2[i]||0);
-			sum += d*d;
-		}
-		// Square root not really needed
-		return sqrt? Math.sqrt(sum) : sum;
-	},
-
-	mandist(v1,v2,sqrt) {
-		var len = v1.length;
-		var sum = 0;
-
-		for(let i=0;i<len;i++) {
-			sum += Math.abs((v1[i]||0) - (v2[i]||0));
-		}
-
-		// Square root not really needed
-		return sqrt? Math.sqrt(sum) : sum;
-	},
-
-	/**
-	 * Unidimensional distance
-	 */
-	dist(v1,v2,sqrt) {
-		var d = Math.abs(v1-v2);
-		return sqrt? d : d*d;
-	}
-
-}

package/node_modules/skmeans/kinit.js

@@ -1,102 +0,0 @@
-const
-	Distance = require("./distance.js"),
-	eudist = Distance.eudist,
-	dist = Distance.dist;
-
-module.exports = {
-	kmrand(data,k) {
-		var map = {}, ks = [], t = k<<2;
-		var len = data.length;
-		var multi = data[0].length>0;
-
-		while(ks.length<k && (t--)>0) {
-			let d = data[Math.floor(Math.random()*len)];
-			let key = multi? d.join("_") : `${d}`;
-			if(!map[key]) {
-				map[key] = true;
-				ks.push(d);
-			}
-		}
-
-		if(ks.length<k) throw new Error("Error initializating clusters");
-		else return ks;
-	},
-
-	/**
-	 * K-means++ initial centroid selection
-	 */
-	kmpp(data,k) {
-		var distance = data[0].length? eudist : dist;
-		var ks = [], len = data.length;
-		var multi = data[0].length>0;
-		var map = {};
-
-		// First random centroid
-		var c = data[Math.floor(Math.random()*len)];
-		var key = multi? c.join("_") : `${c}`;
-		ks.push(c);
-		map[key] = true;
-
-		// Retrieve next centroids
-		while(ks.length<k) {
-			// Min Distances between current centroids and data points
-			let dists = [], lk = ks.length;
-			let dsum = 0, prs = [];
-
-			for(let i=0;i<len;i++) {
-				let min = Infinity;
-				for(let j=0;j<lk;j++) {
-					let dist = distance(data[i],ks[j]);
-					if(dist<=min) min = dist;
-				}
-				dists[i] = min;
-			}
-
-			// Sum all min distances
-			for(let i=0;i<len;i++) {
-				dsum += dists[i]
-			}
-
-			// Probabilities and cummulative prob (cumsum)
-			for(let i=0;i<len;i++) {
-				prs[i] = {i:i, v:data[i],	pr:dists[i]/dsum, cs:0}
-			}
-
-			// Sort Probabilities
-			prs.sort((a,b)=>a.pr-b.pr);
-
-			// Cummulative Probabilities
-			prs[0].cs = prs[0].pr;
-			for(let i=1;i<len;i++) {
-				prs[i].cs = prs[i-1].cs + prs[i].pr;
-			}
-
-			// Randomize
-			let rnd = Math.random();
-
-			// Gets only the items whose cumsum >= rnd
-			let idx = 0;
-			while(idx<len-1 && prs[idx++].cs<rnd);
-			ks.push(prs[idx-1].v);
-			/*
-			let done = false;
-			while(!done) {
-				// this is our new centroid
-				c = prs[idx-1].v
-				key = multi? c.join("_") : `${c}`;
-				if(!map[key]) {
-					map[key] = true;
-					ks.push(c);
-					done = true;
-				}
-				else {
-					idx++;
-				}
-			}
-			*/
-		}
-
-		return ks;
-	}
-
-}