rantjs 1.0.9 → 2.0.0

package/source/arrayMethods.js

@@ -1,162 +0,0 @@
-(function () {
-    var arrayMethods = {
-        /** Returns a shallow copy of this array */
-        copy: function () { return this.slice(0); },
-
-        /** Returns true if this array contains 'element', returns false otherwise */
-        contains: function (element) { return this.indexOf(element) >= 0; },
-
-        /**  Returns a copy of this array, removing the elements 'from' index 'to' index within it */
-        remove: function (from, to) {
-            var res = [];
-            var i = 0, j = 0;
-            for (i = 0; i < from; i++) {
-                res[i] = this[i];
-            }
-            j = i;
-            for (i = to; i < this.length; i++) {
-                res[j++] = this[i];
-            }
-            return res;
-        },
-
-        /** Returns a copy of this array, rotated 'n' places, counterclockwise if 'n' is positive, clockwise otherwise*/
-        rotate: function (n) {
-            if (!n) return this.slice(0);
-            var length = this.length;
-            var res = new Array(length);
-            var thisIndex = (n > 0) ? n : length + n, i = 0, j = 0;
-            for (i = thisIndex; i < length; i++) {
-                res[j++] = this[i];
-            }
-            for (i = 0; i < thisIndex; i++) {
-                res[j++] = this[i];
-            }
-            return res;
-        },
-
-        /**
-         * Returns a copy of this array, removing but
-         *         the first 'n' elements from it
-         *         assumes n=1 when called with no arguments.
-         */
-        skipFirst: function (n) {
-            if (n === 'undefined') n = 1;
-            return this.slice(n);
-        },
-
-        /**
-         * Returns a copy of this array, removing
-         *         but the last 'n' elements from it
-         *         assumes n=1 when called with no arguments.
-         */
-        skipLast: function (n) {
-            if (n === 'undefined') n = 1;
-            if (n > this.length) return [];
-            return this.slice(0, this.length - n);
-        },
-
-        /**
-         * Returns a copy of this array,
-         *         sorting its elements randomly
-         */
-
-        shuffle: function () {
-            array = this.splice(0);
-            var m = array.length, t, i;
-
-            // While there remain elements to shuffle…
-            while (m) {
-
-                // Pick a remaining element…
-                i = Math.floor(Math.random() * m--);
-
-                // And swap it with the current element.
-                t = array[m];
-                array[m] = array[i];
-                array[i] = t;
-            }
-
-            return array;
-        },
-
-        /**
-         * Returns an unique array
-         */
-        makeUnique: function(){
-            var u = {}, a = [];
-            for(var i = 0, l = this.length; i < l; ++i){
-                if(u.hasOwnProperty(this[i])) {
-                    continue;
-                }
-                a.push(this[i]);
-                u[this[i]] = 1;
-            }
-            return a;
-        },
-
-        /**
-         * Returns this associative array length
-         */
-        getAssociativeArrayLength: function () {
-            return this.length;
-        },
-
-        /**
-         * Returns a copy of this array that contains the difference
-         *         between source array and 'array'
-         */
-        difference: function (array) {
-            var filterFunc = filterOnOtherArray_diff.bind(array);
-            return this.filter(filterFunc);
-        },
-
-        /**
-         * Returns a copy of this array that contains the
-         *         intersection between source array and 'array'
-         */
-        intersection: function (array) {
-            var filterFunc = filterOnOtherArray_inter.bind(array);
-            return this.filter(filterFunc);
-        },
-
-        /**
-         * Returns a copy of this array that contains the union
-         *   between source array with 'array', removing duplicates
-         *    ! fails with a sparse array !
-         */
-        union: function (array) {
-            var obj = {}, res = [], i = 0, k = 0;
-            for (i = 0; i < this.length; i++) {
-                obj[this[i]] = this[i];
-            }
-            for (i = 0; i < array.length; i++) {
-                obj[array[i]] = array[i];
-            }
-            for (k in obj) {
-                res.push(obj[k]);
-            }
-            return res;
-        }
-    };
-
-    // let's install those methods on the prototype
-    for (var newMethodName in arrayMethods) {
-        installFunction(newMethodName, arrayMethods[newMethodName]);
-    }
-
-    function installFunction(name, fn) {
-        if (Array.prototype[name]) throw ('Array method ' + name + '() already defined.');
-        Object.defineProperty(Array.prototype, name, {
-            value: fn
-        });
-    }
-
-    function filterOnOtherArray_diff(arr, i) {
-        return (arr.indexOf(i) < 0);
-    }
-
-    function filterOnOtherArray_inter(arr, i) {
-        return (arr.indexOf(i) >= 0);
-    }
-})();

package/source/core/braceParser.js

@@ -1,60 +0,0 @@
-
-var braceParser = function (input, group, reps, sep, dic) {
-    dic = dic || require("./en_US");
-    var tempRes = "", matchIndex = 1;
-    var result = input, matches = [], token, replacement = [], regex;
-    matchIndex = 0;
-    group = group.replace("}", "");
-    group = group.replace("{", "");
-    var repetitions=reps.pop();
-    var separator=sep.pop();
-    var newGroup = '';
-
-
-    // Check for shorthand codes
-    //[rep:10][sep:\N]{\C}
-    regex = /\\\w+/g;
-    i = 0;
-    var replaceGroup='';
-    while (matches = regex.exec(group)) {
-        var groupCopy = group;
-        while (i < repetitions) {
-            if(matches[0]==="\\C"){  replaceGroup+=require("./randomString")(1); }
-            i++;
-        }
-
-        groupCopy=groupCopy.replace("\\C", replaceGroup );
-        if("undefined" != typeof separator){
-            if (separator.toLowerCase() === "n") groupCopy += separator.replace("n", "\n");
-            else if (separator.toLowerCase()  === "s") groupCopy += separator.replace("s", " ");
-            else groupCopy += separator;
-        }
-        return groupCopy;
-
-    }
-
-    // Check for token patterns
-    regex = /<(.*?)>/g;
-    i = 0;
-    while (i < repetitions) {
-        while (matches = regex.exec(group)) {
-            groupCopy = group;
-            re = new RegExp("\\w+", "g");
-            token = matches[1].match(re);
-            if (dic().tokens.indexOf(token[0]) != -1) {
-                if("undefined" != typeof separator){
-                    if (separator === "n") groupCopy += separator.replace("n", "\n");
-                    else if (separator === "s") groupCopy += separator.replace("s", " ");
-                    else groupCopy += separator;
-                }
-            }
-        }
-        newGroup += "undefined" == typeof groupCopy ? "" : groupCopy;
-
-        i++;
-    }
-    //console.log(group);
-    return "undefined" != typeof newGroup ? newGroup : group;
-};
-
-module.exports = braceParser;

package/source/core/capitalize.js

@@ -1,19 +0,0 @@
-
-var capitalize = function (s,_case) {
-    if(_case==="upper")
-        return s.toUpperCase();
-    else if(_case==="lower")
-        return s.toLowerCase();
-    else if(_case==="word")
-        return s.toWordCase();
-    else if(_case==="title")
-        return s.toTitleCase();
-    else if(_case==="sentence")
-        return s.toSentenceCase();
-    else if(_case==="none")
-        return s;
-    else
-        return s[0].toUpperCase() + s.slice(1); //default && first
-};
-
-module.exports = capitalize;