mirror of https://github.com/tc39/test262.git
67 lines
2.4 KiB
JavaScript
67 lines
2.4 KiB
JavaScript
|
// Copyright (C) 2016 the V8 project authors. All rights reserved.
|
|||
|
|
// This code is governed by the BSD license found in the LICENSE file.
|
|||
|
|
/*---
|
|||
|
|
es6id: 13.12.11
|
|||
|
|
description: >
|
|||
|
|
Completion value when execution continues through multiple cases and ends
|
|||
|
|
with a normal completion
|
|||
|
|
info: >
|
|||
|
|
SwitchStatement : switch ( Expression ) CaseBlock
|
|||
|
|
|
|||
|
|
[...]
|
|||
|
|
8. Let R be the result of performing CaseBlockEvaluation of CaseBlock with
|
|||
|
|
argument switchValue.
|
|||
|
|
9. Set the running execution context’s LexicalEnvironment to oldEnv.
|
|||
|
|
10. Return R.
|
|||
|
|
|
|||
|
|
13.12.9 Runtime Semantics: CaseBlockEvaluation
|
|||
|
|
|
|||
|
|
CaseBlock : { CaseClausesopt DefaultClause CaseClausesopt }
|
|||
|
|
|
|||
|
|
1. Let V = undefined.
|
|||
|
|
2. Let A be the list of CaseClause items in the first CaseClauses, in
|
|||
|
|
source text order. If the first CaseClauses is not present A is « ».
|
|||
|
|
3. Let found be false.
|
|||
|
|
4. Repeat for each CaseClause C in A
|
|||
|
|
a. If found is false, then
|
|||
|
|
i. Let clauseSelector be the result of CaseSelectorEvaluation of C.
|
|||
|
|
ii. If clauseSelector is an abrupt completion, then
|
|||
|
|
[...]
|
|||
|
|
iii. Let found be the result of performing Strict Equality Comparison
|
|||
|
|
input === clauseSelector.[[value]].
|
|||
|
|
b. If found is true, then
|
|||
|
|
i. Let R be the result of evaluating C.
|
|||
|
|
ii. If R.[[value]] is not empty, let V = R.[[value]].
|
|||
|
|
[...]
|
|||
|
|
5. Let foundInB be false.
|
|||
|
|
6. Let B be the List containing the CaseClause items in the second
|
|||
|
|
CaseClauses, in source text order. If the second CaseClauses is not
|
|||
|
|
present B is « ».
|
|||
|
|
7. If found is false, then
|
|||
|
|
[...]
|
|||
|
|
[...]
|
|||
|
|
9. Let R be the result of evaluating DefaultClause.
|
|||
|
|
10. If R.[[value]] is not empty, let V = R.[[value]].
|
|||
|
|
11. If R is an abrupt completion, return Completion(UpdateEmpty(R, V)).
|
|||
|
|
12. Repeat for each CaseClause C in B (NOTE this is another complete
|
|||
|
|
iteration of the second CaseClauses)
|
|||
|
|
[...]
|
|||
|
|
13. Return NormalCompletion(V).
|
|||
|
|
---*/
|
|||
|
|
|
|||
|
|
assert.sameValue(
|
|||
|
|
eval('1; switch ("a") { case "a": 2; default: 3; }'),
|
|||
|
|
3,
|
|||
|
|
'Non-empty value replaces previous non-empty value'
|
|||
|
|
);
|
|||
|
|
assert.sameValue(
|
|||
|
|
eval('4; switch ("a") { case "a": default: 5; }'),
|
|||
|
|
5,
|
|||
|
|
'Non-empty value replaces empty value'
|
|||
|
|
);
|
|||
|
|
assert.sameValue(
|
|||
|
|
eval('6; switch ("a") { case "a": 7; default: }'),
|
|||
|
|
7,
|
|||
|
|
'Empty value does not replace previous non-empty value'
|
|||
|
|
);
|