smock 0.1.9 → 0.1.10

data/node_modules/coffee-loader/node_modules/loader-utils/node_modules/big.js/perf/bigtime.js

@@ -1,324 +0,0 @@
-
-var arg, i, j, max, method, methodIndex, decimalPlaces, rounding, reps, start,
-     timesEqual, xs, ys, prevRss, prevHeapUsed, prevHeapTotal, showMemory,
-    bdM, bdT, bdR, bdRs,
-    bnM, bnT, bnR, bnRs,
-    args = process.argv.splice(2),
-    BigDecimal = require('./lib/bigdecimal_GWT/bigdecimal').BigDecimal,
-    Big = require('../big'),
-    bdMs = ['add', 'subtract', 'multiply', 'divide', 'remainder', 'pow', 'compareTo'],
-    bnMs = ['plus', 'minus', 'times', 'div', 'mod', 'pow', 'cmp'],
-    Ms = [bdMs, bnMs],
-    allMs = [].concat.apply([], Ms),
-    bdRounding = [1, 4, 6, 0],
-    bdTotal = 0,
-    bnTotal = 0,
-    BD = {},
-    BN = {},
-
-    ALWAYS_SHOW_MEMORY = false,
-    DEFAULT_MAX_DIGITS = 20,
-    DEFAULT_REPS = 1e4,
-    DEFAULT_POW_REPS = 100,
-    DEFAULT_PLACES = 20,
-    MAX_POWER = 50,
-    MAX_RANDOM_EXPONENT = 100,
-
-    getRandom = function (maxDigits) {
-        var i = 0, z,
-            // number of digits - 1
-            n = Math.random() * ( maxDigits || 1 ) | 0,
-            r = ( Math.random() * 10 | 0 ) + '';
-
-        if ( n ) {
-            if ( z = r === '0' ) {
-                r += '.';
-            }
-
-            for ( ; i++ < n; r += Math.random() * 10 | 0 ){}
-
-            // 20% chance of integer
-            if ( !z && Math.random() > 0.2 )
-                r = r.slice( 0, i = ( Math.random() * n | 0 ) + 1 ) + '.' + r.slice(i);
-        }
-
-        // Avoid 'division by zero' error with division and modulo.
-        if ((bnM == 'div' || bnM == 'mod') && parseFloat(r) === 0)
-            r = ( ( Math.random() * 9 | 0 ) + 1 ) + '';
-
-        // 50% chance of negative
-        return Math.random() > 0.5 ? r : '-' + r;
-    },
-
-    /*
-     * Returns exponential notation.
-     * Alternative to the above function which returns non-exponential notation.
-     */
-    //getRandom = function (maxDigits) {
-    //    var i = 0,
-    //        // n is the number of significant digits - 1
-    //        n = Math.random() * (maxDigits || 1) | 0,
-    //        r = ( ( Math.random() * 9 | 0 ) + 1 ) + ( n ? '.' : '' );
-    //
-    //    for (; i++ < n; r += Math.random() * 10 | 0 ){}
-    //
-    //    // Add exponent.
-    //    r += 'e' + ( Math.random() > 0.5 ? '+' : '-' ) +
-    //               ( Math.random() * MAX_RANDOM_EXPONENT | 0 );
-    //
-    //    // 50% chance of being negative.
-    //    return Math.random() > 0.5 ? r : '-' + r
-    //},
-
-    getFastest = function (bn, bd) {
-        var r;
-        if (Math.abs(bn - bd) > 2) {
-            r = 'Big' + ((bn < bd)
-                ? ' was ' + (bn ? parseFloat((bd / bn).toFixed(1)) : bd)
-                : 'Decimal was ' + (bd ? parseFloat((bn / bd).toFixed(1)) : bn)) +
-                    ' times faster';
-        } else {
-            timesEqual = 1;
-            r = 'Times approximately equal';
-        }
-        return r;
-    },
-
-    getMemory = function (obj) {
-        if (showMemory) {
-            var mem = process.memoryUsage(),
-                rss = mem.rss,
-                heapUsed = mem.heapUsed,
-                heapTotal = mem.heapTotal;
-
-            if (obj) {
-                obj.rss += (rss - prevRss);
-                obj.hU += (heapUsed - prevHeapUsed);
-                obj.hT += (heapTotal - prevHeapTotal);
-            }
-            prevRss = rss;
-            prevHeapUsed = heapUsed;
-            prevHeapTotal = heapTotal;
-        }
-    },
-
-    getMemoryTotals = function (obj) {
-        function toKB(m) {return parseFloat((m / 1024).toFixed(1))}
-        return '\trss: ' + toKB(obj.rss) +
-               '\thU: ' + toKB(obj.hU) +
-               '\thT: ' + toKB(obj.hT);
-    };
-
-arg = args[0];
-
-if (typeof arg != 'undefined' && !isFinite(arg) &&
-    allMs.indexOf(arg) == -1 && !/^-*m$/i.test(arg)) {
-    console.log(
-    '\n node bigtime [ METHOD ] [ METHOD_CALLS [ MAX_DIGITS [ DECIMAL_PLACES ] ] ]' +
-    '\n\n METHOD: The method to be timed and compared with the corresponding other' +
-    '\n\n\tBig:        plus minus    times    div    mod       pow cmp' +
-    '\n\n\tBigDecimal: add  subtract multiply divide remainder pow compareTo' +
-    '\n\n METHOD_CALLS:   The number of method calls to be timed for each' +
-    '\n\n MAX_DIGITS:     The maximum number of digits of the random operands' +
-    '\n\n DECIMAL_PLACES: The number of decimal places used in division' +
-    '\n\t\t (The rounding mode is randomly chosen)' +
-    '\n\n Default values: METHOD:         randomly chosen' +
-    '\n\t\t METHOD_CALLS:   ' + DEFAULT_REPS +
-    '  (pow: ' + DEFAULT_POW_REPS + ')' +
-    '\n\t\t MAX_DIGITS:     ' + DEFAULT_MAX_DIGITS +
-    '\n\t\t DECIMAL_PLACES: ' + DEFAULT_PLACES +
-    '\n\n E.g.   node bigtime\n\tnode bigtime minus\n\tnode bigtime add 100000' +
-    '\n\tnode bigtime times 20000 100\n\tnode bigtime div 100000 50 20' +
-    '\n\tnode bigtime 9000\n\tnode bigtime 1000000 20' +
-    '\n\n To show memory usage, include an argument m or -m' +
-    '\n E.g.   node bigtime m add');
-} else {
-    Number.prototype.toPlainString = Number.prototype.toString;
-
-    for (i = 0; i < args.length; i++) {
-        arg = args[i];
-        if (isFinite(arg)) {
-            arg = Math.abs(parseInt(arg));
-            if (reps == null) reps = arg <= 1e10 ? arg : 0;
-            else if (max == null) max = arg <= 1e6 ? arg : 0;
-            else if (decimalPlaces == null)
-                decimalPlaces = arg <= 1e6 ? arg : DEFAULT_PLACES;
-        } else if (/^-*m$/i.test(arg)) showMemory = true;
-        else if (method == null) method = arg;
-    }
-
-    for (i = 0;
-         i < Ms.length && (methodIndex = Ms[i].indexOf(method)) == -1;
-         i++) {}
-
-    bnM = methodIndex == -1
-        ? bnMs[methodIndex = Math.floor(Math.random() * bdMs.length)]
-        : (Ms[i][0] == 'add' ? bnMs : Ms[i])[methodIndex];
-
-    bdM = bdMs[methodIndex];
-
-    if (!reps) reps = bdM == 'pow' ? DEFAULT_POW_REPS : DEFAULT_REPS;
-    if (!max) max = DEFAULT_MAX_DIGITS;
-    if (decimalPlaces == null) decimalPlaces = DEFAULT_PLACES;
-
-    xs = [reps], ys = [reps], bdRs = [reps], bnRs = [reps];
-    BD.rss = BD.hU = BD.hT = BN.rss = BN.hU = BN.hT = 0;
-    showMemory = showMemory || ALWAYS_SHOW_MEMORY;
-
-    console.log('\n Big %s vs BigDecimal %s\n' +
-        '\n Method calls: %d\n\n Random operands: %d', bnM, bdM, reps, reps * 2);
-
-    console.log(' Maximum digits of operands: %d', max);
-
-    if (bdM == 'divide') {
-        rounding = Math.floor(Math.random() * 4);
-        console.log(
-            '\n Decimal places: %d\n Rounding mode: %d',
-            Big.DP = decimalPlaces,
-            Big.RM = rounding );
-        rounding = bdRounding[rounding];
-    }
-
-
-    // BEGIN TESTING
-
-
-    process.stdout.write('\n Testing started');
-
-    /*
-     * Create the random operands, time the method calls and check
-     * the results in batches of 10000 to limit memory usage.
-     */
-    outer:
-    for (; reps > 0; reps -= 1e4) {
-
-        j = Math.min(reps, 1e4);
-
-
-        // GENERATE RANDOM OPERANDS
-
-        for (i = 0; i < j; i++) {
-            xs[i] = getRandom(max);
-        }
-
-        if (bdM == 'pow') {
-            for (i = 0; i < j; i++) {
-                ys[i] = Math.floor(Math.random() * (MAX_POWER + 1));
-            }
-        } else {
-            for (i = 0; i < j; i++) {
-                ys[i] = getRandom(max);
-            }
-        }
-
-        getMemory();
-
-
-        // BIGDECIMAL
-
-        if (bdM == 'divide') {
-
-            start = +new Date();
-            for (i = 0; i < j; i++) {
-                bdRs[i] = new BigDecimal(xs[i])[bdM](new BigDecimal(ys[i]),
-                    decimalPlaces, rounding);
-            }
-            bdT = +new Date() - start;
-
-        } else if (bdM == 'pow') {
-
-            start = +new Date();
-            for (i = 0; i < j; i++) {
-                bdRs[i] = new BigDecimal(xs[i])[bdM](ys[i]);
-            }
-            bdT = +new Date() - start;
-
-        } else {
-
-            start = +new Date();
-            for (i = 0; i < j; i++) {
-                bdRs[i] = new BigDecimal(xs[i])[bdM](new BigDecimal(ys[i]));
-            }
-            bdT = +new Date() - start;
-
-        }
-
-        getMemory(BD);
-
-
-        // BIG
-
-        if (bdM == 'pow') {
-
-            start = +new Date();
-            for (i = 0; i < j; i++) {
-                bnRs[i] = new Big(xs[i])[bnM](ys[i]);
-            }
-            bnT = +new Date() - start;
-
-        } else {
-            /*
-             * Note: 'Big' methods do not require their argument operand to be a
-             * 'Big' but to match 'BigDecimal' above, which does require that
-             * its argument operand is a 'BigDecimal', pass a 'new Big' as the
-             * argument operand.
-             */
-
-            start = +new Date();
-            for (i = 0; i < j; i++) {
-                bnRs[i] = new Big(xs[i])[bnM](new Big(ys[i]));
-            }
-            bnT = +new Date() - start;
-
-        }
-
-        getMemory(BN);
-
-
-        // CHECK FOR MISMATCHES
-
-        for (i = 0; i < j; i++) {
-
-            // Ensure non-exponential notation.
-            bnR = bnRs[i].toFixed();
-            bdR = bdRs[i].toPlainString();
-
-            // Strip any trailing zeros from non-integer BigDecimals
-            if (bdR.indexOf('.') != -1) {
-                bdR = bdR.replace(/\.?0+$/, '');
-            }
-
-            if (bdR !== bnR) {
-                console.log('\n breaking on first mismatch (result number %d):' +
-                '\n\n BigDecimal: %s\n Big:        %s', i, bdR, bnR);
-                console.log('\n x: %s\n y: %s', xs[i], ys[i]);
-
-                if (bdM == 'divide')
-                    console.log('\n dp: %d\n r: %d', decimalPlaces, Big.RM);
-                break outer;
-            }
-        }
-
-        bdTotal += bdT;
-        bnTotal += bnT;
-
-        process.stdout.write(' .');
-    }
-
-
-    // TIMINGS SUMMARY
-
-
-    if (i == j) {
-        console.log(' done\n\n No mismatches.');
-        if (showMemory) {
-            console.log('\n Change in memory usage (KB):' +
-                        '\n\n\tBigDecimal' + getMemoryTotals(BD) +
-                        '\n\tBig       ' + getMemoryTotals(BN));
-        }
-        console.log('\n Time taken:' +
-                    '\n\n\tBigDecimal  ' + (bdTotal || '<1') + ' ms' +
-                    '\n\tBig         ' + (bnTotal || '<1') + ' ms\n\n ' +
-                        getFastest(bnTotal, bdTotal) + '\n');
-    }
-}

data/node_modules/coffee-loader/node_modules/loader-utils/node_modules/big.js/perf/lib/bigdecimal_GWT/BigDecTest.java

@@ -1,60 +0,0 @@
-// javac BigDecTest.java
-// java BigDecTest
-
-import java.math.BigDecimal;
-
-public class BigDecTest
-{
-    public static void main(String[] args) {
-
-    	int i;
-    	BigDecimal x, y, r;
-
-        // remainder
-
-    	x = new BigDecimal("9.785496E-2");
-    	y = new BigDecimal("-5.9219189762E-2");
-    	r = x.remainder(y);
-        System.out.println( r.toString() );
-    	// 0.038635770238
-
-        
-    	x = new BigDecimal("1.23693014661017964112E-5");
-    	y = new BigDecimal("-6.9318042E-7");
-    	r = x.remainder(y);
-    	System.out.println( r.toPlainString() );
-    	// 0.0000005852343261017964112
-
-        
-        // divide
-
-    	x = new BigDecimal("6.9609119610E-78");
-        y = new BigDecimal("4E-48");
-    	r = x.divide(y, 40, 6);                     // ROUND_HALF_EVEN
-    	System.out.println( r.toString() );
-    	// 1.7402279902E-30
-
-        
-        x = new BigDecimal("5.383458817E-83");
-        y = new BigDecimal("8E-54");
-        r = x.divide(y, 40, 6);
-        System.out.println( r.toString() );
-        // 6.7293235212E-30
-
-        
-        // compareTo
-
-    	x = new BigDecimal("0.04");
-        y = new BigDecimal("0.079393068");
-    	i = x.compareTo(y);
-    	System.out.println(i);
-    	// -1
-
-    	x = new BigDecimal("7.88749578569876987785987658649E-10");
-        y = new BigDecimal("4.2545098709E-6");
-    	i = x.compareTo(y);
-    	System.out.println(i);
-    	// -1
-    }
-}
-

data/node_modules/coffee-loader/node_modules/loader-utils/node_modules/big.js/perf/lib/bigdecimal_GWT/LICENCE.txt

@@ -1,205 +0,0 @@
-https://github.com/iriscouch/bigdecimal.js
-
-BigDecimal for Javascript is licensed under the Apache License, version 2.0:
-
-                             Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "[]"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright [yyyy] [name of copyright owner]
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.