mirror of https://github.com/lukechilds/node.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
55 lines
1.7 KiB
55 lines
1.7 KiB
// Copyright Joyent, Inc. and other Node contributors.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a
|
|
// copy of this software and associated documentation files (the
|
|
// "Software"), to deal in the Software without restriction, including
|
|
// without limitation the rights to use, copy, modify, merge, publish,
|
|
// distribute, sublicense, and/or sell copies of the Software, and to permit
|
|
// persons to whom the Software is furnished to do so, subject to the
|
|
// following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included
|
|
// in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
|
// USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
var common = require('../common');
|
|
var assert = require('assert');
|
|
var i;
|
|
|
|
var N = 30;
|
|
var done = [];
|
|
|
|
function get_printer(timeout) {
|
|
return function() {
|
|
console.log('Running from setTimeout ' + timeout);
|
|
done.push(timeout);
|
|
};
|
|
}
|
|
|
|
process.nextTick(function() {
|
|
console.log('Running from nextTick');
|
|
done.push('nextTick');
|
|
});
|
|
|
|
for (i = 0; i < N; i += 1) {
|
|
setTimeout(get_printer(i), i);
|
|
}
|
|
|
|
console.log('Running from main.');
|
|
|
|
|
|
process.on('exit', function() {
|
|
assert.equal('nextTick', done[0]);
|
|
/* Disabling this test. I don't think we can ensure the order
|
|
for (i = 0; i < N; i += 1) {
|
|
assert.equal(i, done[i + 1]);
|
|
}
|
|
*/
|
|
});
|
|
|