-
Notifications
You must be signed in to change notification settings - Fork 291
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Adds an improved PhantomJS test runner.
This version uses the special abbot urls to get the list of tests to run. This means it can be used to run the SproutCore unit tests, but also to run the unit tests for your SproutCore app. This makes use of the callPhantom API in PhantomJS to get detailed results of the tests without needing to screen scrape. Output will be the results for each test file. Any failing assertions will be output as well. You can make this more verbose with -v and -V. Exit status will be 0 if all tests pass, 1 if any tests fail, and 2 if the test runner itself encounters an error. To run, do: > phantomjs phantomjs/test_runner.js Use the -h option to get details on how to use it. In addition, I updated the Travis CI configuration to use this. It is set to run all tests except for those in the experimental frameworks.
- Loading branch information
Greg Fairbanks
committed
Sep 12, 2013
1 parent
9c07b3e
commit 7d744cd
Showing
7 changed files
with
2,841 additions
and
627 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,181 @@ | ||
| module.exports = function (args, opts) { | ||
| if (!opts) opts = {}; | ||
|
|
||
| var flags = { bools : {}, strings : {} }; | ||
|
|
||
| [].concat(opts['boolean']).filter(Boolean).forEach(function (key) { | ||
| flags.bools[key] = true; | ||
| }); | ||
|
|
||
| [].concat(opts.string).filter(Boolean).forEach(function (key) { | ||
| flags.strings[key] = true; | ||
| }); | ||
|
|
||
| var aliases = {}; | ||
| Object.keys(opts.alias || {}).forEach(function (key) { | ||
| aliases[key] = [].concat(opts.alias[key]); | ||
| aliases[key].forEach(function (x) { | ||
| aliases[x] = [key].concat(aliases[key].filter(function (y) { | ||
| return x !== y; | ||
| })); | ||
| }); | ||
| }); | ||
|
|
||
| var defaults = opts['default'] || {}; | ||
|
|
||
| var argv = { _ : [] }; | ||
| Object.keys(flags.bools).forEach(function (key) { | ||
| setArg(key, defaults[key] === undefined ? false : defaults[key]); | ||
| }); | ||
|
|
||
| function setArg (key, val) { | ||
| var value = !flags.strings[key] && isNumber(val) | ||
| ? Number(val) : val | ||
| ; | ||
| setKey(argv, key.split('.'), value); | ||
|
|
||
| (aliases[key] || []).forEach(function (x) { | ||
| setKey(argv, x.split('.'), value); | ||
| }); | ||
| } | ||
|
|
||
| for (var i = 0; i < args.length; i++) { | ||
| var arg = args[i]; | ||
|
|
||
| if (arg === '--') { | ||
| argv._.push.apply(argv._, args.slice(i + 1)); | ||
| break; | ||
| } | ||
| else if (arg.match(/^--.+=/)) { | ||
| // Using [\s\S] instead of . because js doesn't support the | ||
| // 'dotall' regex modifier. See: | ||
| // http://stackoverflow.com/a/1068308/13216 | ||
| var m = arg.match(/^--([^=]+)=([\s\S]*)$/); | ||
| setArg(m[1], m[2]); | ||
| } | ||
| else if (arg.match(/^--no-.+/)) { | ||
| var key = arg.match(/^--no-(.+)/)[1]; | ||
| setArg(key, false); | ||
| } | ||
| else if (arg.match(/^--.+/)) { | ||
| var key = arg.match(/^--(.+)/)[1]; | ||
| var next = args[i + 1]; | ||
| if (next !== undefined && !next.match(/^-/) | ||
| && !flags.bools[key] | ||
| && (aliases[key] ? !flags.bools[aliases[key]] : true)) { | ||
| setArg(key, next); | ||
| i++; | ||
| } | ||
| else if (/^(true|false)$/.test(next)) { | ||
| setArg(key, next === 'true'); | ||
| i++; | ||
| } | ||
| else { | ||
| setArg(key, true); | ||
| } | ||
| } | ||
| else if (arg.match(/^-[^-]+/)) { | ||
| var letters = arg.slice(1,-1).split(''); | ||
|
|
||
| var broken = false; | ||
| for (var j = 0; j < letters.length; j++) { | ||
| var next = arg.slice(j+2); | ||
|
|
||
| if (next === '-') { | ||
| setArg(letters[j], next) | ||
| continue; | ||
| } | ||
|
|
||
| if (/[A-Za-z]/.test(letters[j]) | ||
| && /-?\d+(\.\d*)?(e-?\d+)?$/.test(next)) { | ||
| setArg(letters[j], next); | ||
| broken = true; | ||
| break; | ||
| } | ||
|
|
||
| if (letters[j+1] && letters[j+1].match(/\W/)) { | ||
| setArg(letters[j], arg.slice(j+2)); | ||
| broken = true; | ||
| break; | ||
| } | ||
| else { | ||
| setArg(letters[j], true); | ||
| } | ||
| } | ||
|
|
||
| var key = arg.slice(-1)[0]; | ||
| if (!broken && key !== '-') { | ||
|
|
||
| if (args[i+1] && !/^(-|--)[^-]/.test(args[i+1]) | ||
| && !flags.bools[key] | ||
| && (aliases[key] ? !flags.bools[aliases[key]] : true)) { | ||
| setArg(key, args[i+1]); | ||
| i++; | ||
| } | ||
| else if (args[i+1] && /true|false/.test(args[i+1])) { | ||
| setArg(key, args[i+1] === 'true'); | ||
| i++; | ||
| } | ||
| else { | ||
| setArg(key, true); | ||
| } | ||
| } | ||
| } | ||
| else { | ||
| argv._.push( | ||
| flags.strings['_'] || !isNumber(arg) ? arg : Number(arg) | ||
| ); | ||
| } | ||
| } | ||
|
|
||
| Object.keys(defaults).forEach(function (key) { | ||
| if (!hasKey(argv, key.split('.'))) { | ||
| setKey(argv, key.split('.'), defaults[key]); | ||
|
|
||
| (aliases[key] || []).forEach(function (x) { | ||
| setKey(argv, x.split('.'), defaults[key]); | ||
| }); | ||
| } | ||
| }); | ||
|
|
||
| return argv; | ||
| }; | ||
|
|
||
| function hasKey (obj, keys) { | ||
| var o = obj; | ||
| keys.slice(0,-1).forEach(function (key) { | ||
| o = (o[key] || {}); | ||
| }); | ||
|
|
||
| var key = keys[keys.length - 1]; | ||
| return key in o; | ||
| } | ||
|
|
||
| function setKey (obj, keys, value) { | ||
| var o = obj; | ||
| keys.slice(0,-1).forEach(function (key) { | ||
| if (o[key] === undefined) o[key] = {}; | ||
| o = o[key]; | ||
| }); | ||
|
|
||
| var key = keys[keys.length - 1]; | ||
| if (o[key] === undefined || typeof o[key] === 'boolean') { | ||
| o[key] = value; | ||
| } | ||
| else if (Array.isArray(o[key])) { | ||
| o[key].push(value); | ||
| } | ||
| else { | ||
| o[key] = [ o[key], value ]; | ||
| } | ||
| } | ||
|
|
||
| function isNumber (x) { | ||
| if (typeof x === 'number') return true; | ||
| if (/^0x[0-9a-f]+$/i.test(x)) return true; | ||
| return /^[-+]?(?:\d+(?:\.\d*)?|\.\d+)(e[-+]?\d+)?$/.test(x); | ||
| } | ||
|
|
||
| function longest (xs) { | ||
| return Math.max.apply(null, xs.map(function (x) { return x.length })); | ||
| } |
Oops, something went wrong.