mirror of https://github.com/tc39/test262.git
65 lines
1.8 KiB
JavaScript
65 lines
1.8 KiB
JavaScript
// Copyright (C) 2020 Rick Waldron. All rights reserved.
|
|
// This code is governed by the BSD license found in the LICENSE file.
|
|
|
|
/*---
|
|
esid: sec-promise.any
|
|
description: Resolution ticks are set in a predictable sequence
|
|
info: |
|
|
Runtime Semantics: PerformPromiseAny ( iteratorRecord, constructor, resultCapability )
|
|
|
|
Let remainingElementsCount be a new Record { [[Value]]: 1 }.
|
|
...
|
|
|
|
Set remainingElementsCount.[[Value]] to remainingElementsCount.[[Value]] - 1.
|
|
If remainingElementsCount.[[Value]] is 0, then
|
|
Let error be a newly created AggregateError object.
|
|
Perform ! DefinePropertyOrThrow(error, "errors",
|
|
Property Descriptor {
|
|
[[Configurable]]: true,
|
|
[[Enumerable]]: false,
|
|
[[Writable]]: true,
|
|
[[Value]]: errors
|
|
}).
|
|
Return ? Call(promiseCapability.[[Reject]], undefined, « error »).
|
|
...
|
|
flags: [async]
|
|
includes: [promiseHelper.js]
|
|
features: [Promise.any]
|
|
---*/
|
|
|
|
let sequence = [];
|
|
|
|
let p1 = new Promise((_, reject) => {
|
|
reject('foo');
|
|
});
|
|
let p2 = new Promise((_, reject) => {
|
|
reject('bar');
|
|
});
|
|
|
|
sequence.push(1);
|
|
|
|
p1.catch(() => {
|
|
sequence.push(3);
|
|
assert.sameValue(sequence.length, 3);
|
|
checkSequence(sequence, 'Expected to be called first.');
|
|
}).catch($DONE);
|
|
|
|
Promise.any([p1, p2]).then(() => {
|
|
sequence.push(5);
|
|
assert.sameValue(sequence.length, 5);
|
|
checkSequence(sequence, 'Expected to be called third.');
|
|
}).then($DONE, outcome => {
|
|
assert(outcome instanceof AggregateError);
|
|
assert.sameValue(outcome.errors.length, 2);
|
|
assert.sameValue(outcome.errors[0], 'foo');
|
|
assert.sameValue(outcome.errors[1], 'bar');
|
|
}).then($DONE, $DONE);
|
|
|
|
p2.catch(() => {
|
|
sequence.push(4);
|
|
assert.sameValue(sequence.length, 4);
|
|
checkSequence(sequence, 'Expected to be called second.');
|
|
}).catch($DONE);
|
|
|
|
sequence.push(2);
|