New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
test: remove unused config #21985
test: remove unused config #21985
Changes from all commits
File filter...
Jump to…
Diff settings
| @@ -23,12 +23,8 @@ | |||
| require('../common'); | |||
| const assert = require('assert'); | |||
|
|
|||
| // this is the inverse of test-next-tick-starvation. | |||
benjamingr
Author
Member
|
|||
| // it verifies that process.nextTick will *always* come before other | |||
| // events, up to the limit of the process.maxTickDepth value. | |||
|
|
|||
| // WARNING: unsafe! | |||
| process.maxTickDepth = Infinity; | |||
| // this is the inverse of test-next-tick-starvation. it verifies | |||
| // that process.nextTick will *always* come before other events | |||
|
|
|||
| let ran = false; | |||
| let starved = false; | |||
| @@ -22,13 +22,13 @@ | |||
| 'use strict'; | |||
| const common = require('../common'); | |||
| const Readable = require('stream').Readable; | |||
|
|
|||
| // This tests synchronous read callbacks and verifies that even if they nest | |||
| // heavily the process handles it without an error | |||
|
|
|||
| const r = new Readable(); | |||
| const N = 256 * 1024; | |||
|
|
|||
| // Go ahead and allow the pathological case for this test. | |||
refack
Member
|
|||
| // Yes, it's an infinite loop, that's the point. | |||
| process.maxTickDepth = N + 2; | |||
|
|
|||
| let reads = 0; | |||
| r._read = function(n) { | |||
| const chunk = reads++ === N ? null : Buffer.allocUnsafe(1); | |||
Could we keep the test description (these 3 lines)