-
Notifications
You must be signed in to change notification settings - Fork 466
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
Add tests for proposal-duplicate-named-capturing-groups #3625
Merged
Merged
Changes from all commits
Commits
Show all changes
4 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
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
24 changes: 24 additions & 0 deletions
24
test/built-ins/RegExp/named-groups/duplicate-names-group-property-enumeration-order.js
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,24 @@ | ||
// Copyright 2022 Kevin Gibbons. All rights reserved. | ||
// This code is governed by the BSD license found in the LICENSE file. | ||
|
||
/*--- | ||
description: Enumeration order of the groups object with duplicate named capture groups | ||
esid: prod-GroupSpecifier | ||
features: [regexp-duplicate-named-groups] | ||
includes: [compareArray.js] | ||
---*/ | ||
|
||
|
||
let regexp = /(?<y>a)(?<x>a)|(?<x>b)(?<y>b)/; | ||
|
||
assert.compareArray( | ||
Object.keys(regexp.exec("aa").groups), | ||
["y", "x"], | ||
"property enumeration order of the groups object is based on source order, not match order" | ||
); | ||
|
||
assert.compareArray( | ||
Object.keys(regexp.exec("bb").groups), | ||
["y", "x"], | ||
"property enumeration order of the groups object is based on source order, not match order" | ||
); | ||
15 changes: 15 additions & 0 deletions
15
test/built-ins/RegExp/named-groups/duplicate-names-match-indices.js
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,15 @@ | ||
// Copyright 2022 Kevin Gibbons. All rights reserved. | ||
// This code is governed by the BSD license found in the LICENSE file. | ||
|
||
/*--- | ||
description: match indices with duplicate named capture groups | ||
esid: sec-makematchindicesindexpairarray | ||
features: [regexp-duplicate-named-groups, regexp-match-indices] | ||
includes: [compareArray.js] | ||
---*/ | ||
|
||
let indices = "..ab".match(/(?<x>a)|(?<x>b)/d).indices; | ||
assert.compareArray(indices.groups.x, [2, 3]); | ||
|
||
indices = "..ba".match(/(?<x>a)|(?<x>b)/d).indices; | ||
assert.compareArray(indices.groups.x, [2, 3]); |
17 changes: 17 additions & 0 deletions
17
test/built-ins/RegExp/named-groups/duplicate-names-replace.js
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,17 @@ | ||
// Copyright 2022 Kevin Gibbons. All rights reserved. | ||
// This code is governed by the BSD license found in the LICENSE file. | ||
|
||
/*--- | ||
description: String.prototype.replace behavior with duplicate named capture groups | ||
esid: prod-GroupSpecifier | ||
features: [regexp-duplicate-named-groups] | ||
---*/ | ||
|
||
assert.sameValue("ab".replace(/(?<x>a)|(?<x>b)/, "[$<x>]"), "[a]b"); | ||
assert.sameValue("ba".replace(/(?<x>a)|(?<x>b)/, "[$<x>]"), "[b]a"); | ||
|
||
assert.sameValue("ab".replace(/(?<x>a)|(?<x>b)/, "[$<x>][$1][$2]"), "[a][a][]b"); | ||
assert.sameValue("ba".replace(/(?<x>a)|(?<x>b)/, "[$<x>][$1][$2]"), "[b][][b]a"); | ||
|
||
assert.sameValue("ab".replace(/(?<x>a)|(?<x>b)/g, "[$<x>]"), "[a][b]"); | ||
assert.sameValue("ba".replace(/(?<x>a)|(?<x>b)/g, "[$<x>]"), "[b][a]"); |
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,22 @@ | ||
// Copyright 2022 Kevin Gibbons. All rights reserved. | ||
// This code is governed by the BSD license found in the LICENSE file. | ||
|
||
/*--- | ||
description: Matching behavior with duplicate named capture groups | ||
esid: prod-GroupSpecifier | ||
features: [regexp-duplicate-named-groups] | ||
includes: [compareArray.js] | ||
---*/ | ||
|
||
assert.compareArray(["b", "b"], "bab".match(/(?<x>a)|(?<x>b)/)); | ||
assert.compareArray(["b", "b"], "bab".match(/(?<x>b)|(?<x>a)/)); | ||
|
||
assert.compareArray(["aa", "aa", undefined], "aa".match(/(?:(?<x>a)|(?<x>b))\k<x>/)); | ||
assert.compareArray(["bb", undefined, "bb"], "bb".match(/(?:(?<x>a)|(?<x>b))\k<x>/)); | ||
|
||
let matchResult = "aabb".match(/(?:(?:(?<x>a)|(?<x>b))\k<x>){2}/); | ||
assert.compareArray(["aabb", undefined, "bb"], matchResult); | ||
assert.sameValue(matchResult.groups.x, "bb"); | ||
bakkot marked this conversation as resolved.
Show resolved
Hide resolved
|
||
|
||
let notMatched = "abab".match(/(?:(?:(?<x>a)|(?<x>b))\k<x>){2}/); | ||
assert.sameValue(notMatched, null); |
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
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I'd like for these messages to be distinct, but I can't come up with clear replacements that are.