Release v2.0.1

cheminfo · Sep 4, 2015 · ff6d117 · ff6d117
1 parent 6871567
commit ff6d117
Show file tree

Hide file tree

Showing 5 changed files with 7 additions and 7 deletions.
diff --git a/bower.json b/bower.json
@@ -1,6 +1,6 @@
 {
   "name": "peaks-similarity",
-  "version": "2.0.0",
+  "version": "2.0.1",
   "description": "Peaks similarity - calculate the similarity between 2 ordered array of peaks",
   "keywords": [
     "similarity",

diff --git a/dist/peaks-similarity.js b/dist/peaks-similarity.js
@@ -345,10 +345,10 @@ return /******/ (function(modules) { // webpackBootstrap
 	        This works mainly when you have a array1 that is fixed
 	        newPeaks2 have to be normalized ! (sum to 1)
 	     */
-	    function fastSimilarity(newPeaks2, from, to, common) {
+	    function fastSimilarity(newPeaks2, from, to) {
 	        array1Extract=extract(array1, from, to);
 	        array2Extract=newPeaks2;
-	        if (common) array1Extract= getCommonArray(array1Extract, array2Extract, widthBottom)
+	        if (common&COMMON_SECOND) array1Extract= getCommonArray(array1Extract, array2Extract, widthBottom)
 	        normalize(array1Extract);
 	        var diff=calculateDiff();
 	        return calculateOverlapFromDiff(diff);
@@ -427,7 +427,7 @@ return /******/ (function(modules) { // webpackBootstrap
 	    var min=Stat.min(array[1]);
 	    var max=Stat.max(array[1]);
 	    var sum=Stat.sum(array[1]);
-	    var length=array[1] ? array[0].length : 0;
+	    var length=array[1] ? array[1].length : 0;
 	    if (sum!=0) {
 	        for (var i=0; i<length; i++) {
 	            array[1][i]/=sum;

diff --git a/dist/peaks-similarity.min.js b/dist/peaks-similarity.min.js
diff --git a/dist/peaks-similarity.min.js.map b/dist/peaks-similarity.min.js.map
diff --git a/package.json b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "peaks-similarity",
-  "version": "2.0.0",
+  "version": "2.0.1",
   "description": "Peaks similarity - calculate the similarity between 2 ordered array of peaks",
   "keywords": [
     "similarity",