mout - npm Package Compare versions

Comparing version 0.12.0 to 1.0.0

function/after.js

src/function/after.js

doc/function.md

		@@ -5,3 +5,20 @@ # function #

		## after(fn, n):Function

		This creates a function that will only call `fn` if it was called `n` or more times.


		```js
		function onLoaded() {
		console.log('all images loaded');
		}

		var imagePaths = ['1.jpg', '2.jpg', '3.jpg'];
		var callback = after(onLoaded, imagePaths.length);

		forEach(imagePaths, function(path) {
		asyncLoad(path, callback);
		});
		```

		## awaitDelay(fn, delay):Function
		@@ -8,0 +25,0 @@

doc/random.md

		@@ -223,3 +223,3 @@ # random #
		See this [detailed explanation about PRNG in
		JavaScript](http://baagoe.org/en/w/index.php/Better_random_numbers_for_javascript)
		JavaScript](https://github.com/nquinlan/better-random-numbers-for-javascript-mirror)
		to understand the issues with the native `Math.random` and also for a list of
		@@ -226,0 +226,0 @@ algorithms that could be used instead.

function.js

		@@ -6,2 +6,3 @@
		module.exports = {
		'after' : require('./function/after'),
		'awaitDelay' : require('./function/awaitDelay'),
		@@ -8,0 +9,0 @@ 'bind' : require('./function/bind'),

index.js

		/**@license
		* mout v0.12.0 \| http://moutjs.com \| MIT license
		* mout v1.0.0 \| http://moutjs.com \| MIT license
		*/
		@@ -9,3 +9,3 @@
		module.exports = {
		'VERSION' : '0.12.0',
		'VERSION' : '1.0.0',
		'array' : require('./array'),
		@@ -12,0 +12,0 @@ 'collection' : require('./collection'),

math/overflow.js

		@@ -14,6 +14,7 @@

		while( number >= max ) number -= difference;
		while( number < min ) number += difference;
		if ( number < min ) {
		number += difference * ( ~~( ( min - number ) / difference ) + 1 );
		}

		return number;
		return min + ( number - min ) % difference;
		}
		@@ -20,0 +21,0 @@

package.json

		{
		"name": "mout",
		"description": "Modular Utilities",
		"version": "0.12.0",
		"version": "1.0.0",
		"homepage": "http://moutjs.com/",
		@@ -42,3 +42,3 @@ "author": "Miller Medeiros <contact@millermedeiros.com> (http://blog.millermedeiros.com)",
		"jasmine-node": "~1.14.5",
		"requirejs": "2.x",
		"requirejs": "~2.2.0",
		"nodefy": "*",
		@@ -49,4 +49,4 @@ "mdoc": "~0.3.2",
		"rocambole": "~0.2.3",
		"jshint": "2.x",
		"rimraf": "2.2.2",
		"jshint": "~2.9.1",
		"rimraf": "~2.5.2",
		"regenerate": "~0.5.4"
		@@ -53,0 +53,0 @@ },

src/function.js

		@@ -6,2 +6,3 @@ define(function(require){
		return {
		'after' : require('./function/after'),
		'awaitDelay' : require('./function/awaitDelay'),
		@@ -8,0 +9,0 @@ 'bind' : require('./function/bind'),

src/index.js

		/**@license
		* mout v0.12.0 \| http://moutjs.com \| MIT license
		* mout v1.0.0 \| http://moutjs.com \| MIT license
		*/
		@@ -9,3 +9,3 @@ define(function(require){
		return {
		'VERSION' : '0.12.0',
		'VERSION' : '1.0.0',
		'array' : require('./array'),
		@@ -12,0 +12,0 @@ 'collection' : require('./collection'),

src/math/overflow.js

		@@ -14,6 +14,7 @@ define(function () {

		while( number >= max ) number -= difference;
		while( number < min ) number += difference;
		if ( number < min ) {
		number += difference * ( ~~( ( min - number ) / difference ) + 1 );
		}

		return number;
		return min + ( number - min ) % difference;
		}
		@@ -20,0 +21,0 @@

New alerts