File: back-references-to-captures.js

package info (click to toggle)
qt6-declarative 6.9.1%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: experimental
  • size: 308,920 kB
  • sloc: cpp: 775,911; javascript: 514,247; xml: 10,855; python: 2,806; ansic: 2,253; java: 810; sh: 262; makefile: 41; php: 27
file content (29 lines) | stat: -rw-r--r-- 1,395 bytes parent folder | download | duplicates (11)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
// Copyright (C) 2017 the V8 project authors. All rights reserved.
// This code is governed by the BSD license found in the LICENSE file.

/*---
esid: sec-assertion
description: Back references to captures inside the lookbehind.
info: |
  The production Assertion :: (?<=Disjunction) evaluates as follows:
    1. Evaluate Disjunction with -1 as its direction argument to obtain a Matcher m.
    2. Return an internal Matcher closure that takes two arguments, a State x and a Continuation
        c, and performs the following steps:
      a. Let d be a Continuation that always returns its State argument as a successful MatchResult.
      b. Call m(x, d) and let r be its result.
      c. If r is failure, return failure.
      d. Let y be r's State.
      e. Let cap be y's captures List.
      f. Let xe be x's endIndex.
      g. Let z be the State (xe, cap).
      h. Call c(z) and return its result.
features: [regexp-lookbehind]
includes: [compareArray.js]
---*/

assert.compareArray("abcCd".match(/(?<=\1(\w))d/i), ["d", "C"], "#1");
assert.compareArray("abxxd".match(/(?<=\1([abx]))d/), ["d", "x"], "#2");
assert.compareArray("ababc".match(/(?<=\1(\w+))c/), ["c", "ab"], "#3");
assert.compareArray("ababbc".match(/(?<=\1(\w+))c/), ["c", "b"], "#4");
assert.sameValue("ababdc".match(/(?<=\1(\w+))c/), null, "#5");
assert.compareArray("ababc".match(/(?<=(\w+)\1)c/), ["c", "abab"], "#6");