New Case Study:See how Anthropic automated 95% of dependency reviews with Socket.Learn More →
Socket
Sign inDemoInstall
Socket
Sign inDemoInstall

total-serialism

Package Overview
Dependencies
Maintainers
1
Versions
65
Alerts
File Explorer

Advanced tools

License
Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

total-serialism - npm Package Compare versions

Comparing version

1.1.1
to
1.2.1

22

lib/gen-stochastic.js

@@ -93,2 +93,22 @@ //==============================================================================

}
exports.dice = dice;
exports.dice = dice;
// shuffle a list, based on the
// Fisher-Yates shuffle algorithm
// by Ronald Fisher and Frank Yates in 1938
// algorithm has run time complexity of O(n)
//
// @param {Array} -> array to shuffle
// @return {Array}
//
function shuffle(a=[0]){
var arr = a.slice();
for (var i=arr.length-1; i>0; i-=1) {
var j = Math.floor(rng() * (i + 1));
var t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
return arr;
}
exports.shuffle = shuffle;

20

lib/transform.js

@@ -195,22 +195,2 @@ //==============================================================================

// shuffle a list, based on the
// Fisher-Yates shuffle algorithm
// by Ronald Fisher and Frank Yates in 1938
// algorithm has run time complexity of O(n)
//
// @param {Array} -> array to shuffle
// @return {Array}
//
function shuffle(a=[0]){
var arr = a.slice();
for (var i=arr.length-1; i>0; i-=1) {
var j = Math.floor(Math.random() * (i + 1));
var t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
return arr;
}
exports.shuffle = shuffle;
// spray the values of one array on the

@@ -217,0 +197,0 @@ // places of values of another array if

2

package.json
{
"name": "total-serialism",
"version": "1.1.1",
"version": "1.2.1",
"description": "A set of methods for the generation and transformation of number sequences useful in algorithmic composition",

@@ -5,0 +5,0 @@ "main": "index.js",

6

README.md

@@ -86,2 +86,5 @@ # Total Serialism

Rand.dice(4); //=> [4, 4, 2, 3]
// shuffle the items in an array, influenced by the random seed
Rand.shuffle([0, 5, 7, 12]); //=> [7, 5, 0, 12]
```

@@ -124,5 +127,2 @@

// shuffle the items in an array (Fisher-Yates shuffle algorithm)
Mod.shuffle([0, 5, 7, 12]); //=> [7, 5, 0, 12]
// spray values from one array on the non-zero places of another array

@@ -129,0 +129,0 @@ Mod.spray([12, 19, 24], [1, 0, 0, 1, 1, 0, 1, 0.3, 0]);

18

test/serialism.test.js

@@ -77,2 +77,13 @@

test("Rand.dice(4)");
// var shufArr = [0, 5, 7, 12];
// console.log(Mod.shuffle(shufArr));
// console.log(shufArr);
test("Rand.shuffle()");
test("Rand.seed(1473)");
test("Rand.shuffle([0, 5, 7, 12])");
test("Rand.shuffle([0, 5, 7, 12])");
test("Rand.seed(1473)");
test("Rand.shuffle([0, 5, 7, 12])");
}

@@ -163,9 +174,2 @@

// var shufArr = [0, 5, 7, 12];
// console.log(Mod.shuffle(shufArr));
// console.log(shufArr);
test("Mod.shuffle()");
test("Mod.shuffle([0, 5, 7, 12])");
test("Mod.shuffle([0, 5, 7, 12])");
// var sprArr1 = [12, 19, 24];

@@ -172,0 +176,0 @@ // var sprArr2 = [1, 0, 0, 1, 1, 0, 1, 0, 0.2];