viperjs 0.3.0

An embeddable JavaScript engine in safe Rust, with zero runtime dependencies.
Documentation
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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
//! §22.2.6's four `Symbol` methods — what `String.prototype` calls when it is handed a pattern.
//!
//! # Why these are on `RegExp` and not in `String`
//!
//! `"a".replace(x, y)` asks `x` for its `Symbol.replace` and hands the whole operation over. That
//! is the extension point: a regular expression supplies these, and so may anything else. So the
//! String methods know nothing about patterns and these know nothing about how they were reached,
//! and the two meet at a well-known Symbol.
//!
//! # `RegExpExec` and why every one of them goes through it
//!
//! §22.2.7.1 reads `exec` **off the object** and calls it if it is callable, falling back to the
//! built-in only when it is not. So a program may override `exec` on one regular expression and
//! every one of these obeys it — which is the whole reason they are written in terms of an
//! operation rather than calling the built-in directly.

use super::{key, regexp::builtin_exec};
use crate::heap::{Heap, NativeCall, ObjectId, PropertyDescriptor};
use crate::realm::Realm;
use crate::value::{Abrupt, Completion, Value};
use crate::vm::Vm;

/// §22.2.7.1 `RegExpExec` — the object's own `exec` if it has a callable one.
fn regexp_exec(
    vm: &mut Vm,
    heap: &mut Heap,
    object: ObjectId,
    subject: &[u16],
) -> Completion<Value> {
    let name = key(heap, "exec");
    let found = vm.get_property_key(Value::Object(object), name, heap)?;
    if heap.is_callable(found) {
        let text = Value::String(heap.intern(subject));
        let answer = vm.call_value(found, Value::Object(object), &[text], heap)?;
        // Step 3.c — an overriding `exec` must answer an Object or null. Anything else is a
        // TypeError rather than something the caller has to guess at.
        if !matches!(answer, Value::Object(_) | Value::Null) {
            return Err(Abrupt::type_error(
                "a regular expression's exec must answer an object or null",
            ));
        }
        return Ok(answer);
    }
    builtin_exec(vm, heap, object, subject)
}

/// The receiver as an object, which every one of these requires — §22.2.6.
fn this_object(receiver: Value) -> Completion<ObjectId> {
    match receiver {
        Value::Object(object) => Ok(object),
        _ => Err(Abrupt::type_error(
            "this method requires a regular expression",
        )),
    }
}

/// The subject as code units, after `ToString`.
fn subject_of(vm: &mut Vm, heap: &mut Heap, value: Value) -> Completion<Vec<u16>> {
    let text = vm.to_string(value, heap)?;
    Ok(heap.string(text).unwrap_or(&[]).to_vec())
}

/// Whether the receiver's `flags` contain a letter — read as a *property*, per §22.2.6.
///
/// Every one of these clauses reads `flags` with `Get` rather than the slot, so a subclass that
/// overrides it is obeyed. That is observable and it is why this is not `found.flags().global`.
fn has_flag(vm: &mut Vm, heap: &mut Heap, object: ObjectId, letter: u8) -> Completion<bool> {
    let name = key(heap, "flags");
    let held = vm.get_property_key(Value::Object(object), name, heap)?;
    let text = vm.to_string(held, heap)?;
    Ok(heap
        .string(text)
        .unwrap_or(&[])
        .contains(&u16::from(letter)))
}

/// Read `lastIndex`, and write it — §22.2.6's own bookkeeping between matches.
fn set_last_index(vm: &mut Vm, heap: &mut Heap, object: ObjectId, at: usize) -> Completion<()> {
    let name = key(heap, "lastIndex");
    let value = Value::Number(f64::from(u32::try_from(at).unwrap_or(u32::MAX)));
    super::set_or_throw(vm, heap, object, name, value)?;
    Ok(())
}

/// §22.2.6.6 `RegExp.prototype[Symbol.match]`.
fn symbol_match(vm: &mut Vm, heap: &mut Heap, call: &NativeCall<'_>) -> Completion<Value> {
    let object = this_object(call.this_value)?;
    let subject = subject_of(vm, heap, call.argument(0))?;
    // Step 5 — a pattern that is not global answers *one match*, in `exec`'s shape. A global one
    // answers an array of the matched **strings** and no captures at all, which is the one place
    // the two differ in kind rather than in count.
    if !has_flag(vm, heap, object, b'g')? {
        return regexp_exec(vm, heap, object, &subject);
    }
    set_last_index(vm, heap, object, 0)?;
    let mut found = Vec::new();
    loop {
        let result = regexp_exec(vm, heap, object, &subject)?;
        let Value::Object(result) = result else {
            break;
        };
        let zero = heap.index_key(0);
        let text = vm.get_property_key(Value::Object(result), zero, heap)?;
        let text = Value::String(vm.to_string(text, heap)?);
        // Step 8.d.iii.2 — an *empty* match would leave `lastIndex` where it was, so it is
        // advanced by hand. Without this the loop never ends for a pattern like `/(?:)/g`.
        if matches!(text, Value::String(id) if heap.string(id).is_none_or(<[u16]>::is_empty)) {
            let name = key(heap, "lastIndex");
            let held = vm.get_property_key(Value::Object(object), name, heap)?;
            let at = vm.to_number(held, heap)?;
            let next = usize::try_from(at.max(0.0) as u64).unwrap_or(usize::MAX);
            set_last_index(vm, heap, object, next.saturating_add(1))?;
        }
        found.push(text);
    }
    // Step 8.a — no match at all is **null**, not an empty array, so a caller can tell "found
    // nothing" from "found nothing yet".
    if found.is_empty() {
        return Ok(Value::Null);
    }
    super::array::from_values(vm, heap, &found)
}

/// §22.2.6.11 `RegExp.prototype[Symbol.search]`.
fn symbol_search(vm: &mut Vm, heap: &mut Heap, call: &NativeCall<'_>) -> Completion<Value> {
    let object = this_object(call.this_value)?;
    let subject = subject_of(vm, heap, call.argument(0))?;
    // Steps 4 and 8 — `lastIndex` is saved and *put back*, because a search is not supposed to
    // move it. That is the difference from `exec`, and the only reason this is not two lines.
    let name = key(heap, "lastIndex");
    let held = vm.get_property_key(Value::Object(object), name, heap)?;
    set_last_index(vm, heap, object, 0)?;
    let result = regexp_exec(vm, heap, object, &subject);
    super::set_or_throw(vm, heap, object, name, held)?;
    let Value::Object(result) = result? else {
        return Ok(Value::Number(-1.0));
    };
    let index = key(heap, "index");
    vm.get_property_key(Value::Object(result), index, heap)
}

/// §22.2.6.9 `RegExp.prototype[Symbol.replace]`.
fn symbol_replace(vm: &mut Vm, heap: &mut Heap, call: &NativeCall<'_>) -> Completion<Value> {
    let object = this_object(call.this_value)?;
    let subject = subject_of(vm, heap, call.argument(0))?;
    let with = call.argument(1);
    let functional = heap.is_callable(with);
    let with = match functional {
        true => with,
        // Step 5 — a non-callable replacement is converted to a String *now*, before any matching,
        // which is observable when it has a `toString` that throws.
        false => Value::String(vm.to_string(with, heap)?),
    };
    let global = has_flag(vm, heap, object, b'g')?;
    if global {
        set_last_index(vm, heap, object, 0)?;
    }
    // Step 8 — every match is collected *first* and the replacements applied afterwards. The
    // ordering is observable: a replacement function may change `lastIndex`, and the matches it
    // sees must be the ones found before it ran.
    let mut results = Vec::new();
    loop {
        let result = regexp_exec(vm, heap, object, &subject)?;
        let Value::Object(result) = result else {
            break;
        };
        results.push(result);
        if !global {
            break;
        }
        let zero = heap.index_key(0);
        let text = vm.get_property_key(Value::Object(result), zero, heap)?;
        let text = vm.to_string(text, heap)?;
        if heap.string(text).is_none_or(<[u16]>::is_empty) {
            let name = key(heap, "lastIndex");
            let held = vm.get_property_key(Value::Object(object), name, heap)?;
            let at = vm.to_number(held, heap)?;
            let next = usize::try_from(at.max(0.0) as u64).unwrap_or(usize::MAX);
            set_last_index(vm, heap, object, next.saturating_add(1))?;
        }
    }
    let mut built: Vec<u16> = Vec::with_capacity(subject.len());
    let mut copied = 0;
    for result in results {
        let found = super::string_replace::parts_of(vm, heap, result, &subject)?;
        let position = found.position.min(subject.len());
        let matched = found.matched.clone();
        let text = match functional {
            true => super::string_replace::from_function(vm, heap, with, &found, &subject)?,
            false => {
                let template = match with {
                    Value::String(id) => heap.string(id).unwrap_or(&[]).to_vec(),
                    _ => Vec::new(),
                };
                super::string_replace::fill_in(
                    &matched,
                    &subject,
                    position,
                    &found.captures,
                    found.named.as_deref(),
                    &template,
                )
            }
        };
        // Step 14.n — a match that begins before what has already been copied is *skipped*, which
        // is how an `exec` that moves backwards cannot make the answer nonsense.
        if position >= copied {
            built.extend_from_slice(&subject[copied..position]);
            built.extend_from_slice(&text);
            copied = position + matched.len();
        }
    }
    built.extend_from_slice(&subject[copied.min(subject.len())..]);
    Ok(Value::String(heap.intern(&built)))
}

/// §22.2.6.14 `RegExp.prototype[Symbol.split]`.
///
/// # Nothing here is a regular expression
///
/// The receiver need only be an Object: the clause reads `flags` off it with `Get` and hands the
/// object itself to a constructor, never touching a pattern. And what does the matching is
/// whatever `SpeciesConstructor` answered, reached through §22.2.7.1 — so a plain object with an
/// `exec` method and a `lastIndex` accessor splits a string, and test262 has one that does.
///
/// That is why `newFlags` is assembled as **text** and never validated. `flags` may be any string
/// at all; it is an argument to somebody else's constructor, and only `%RegExp%` — reached when
/// the species declined to have an opinion — has any business refusing it.
fn symbol_split(vm: &mut Vm, heap: &mut Heap, call: &NativeCall<'_>) -> Completion<Value> {
    // Step 2.
    let object = this_object(call.this_value)?;
    // Step 3 — before the species is asked, so a `toString` that throws is what the caller sees.
    let subject = subject_of(vm, heap, call.argument(0))?;
    // Step 4.
    let default = vm.realm().regexp_constructor();
    let constructor = super::promise::species_of(vm, heap, object, default)?;
    // Step 5.
    let flags_name = key(heap, "flags");
    let held = vm.get_property_key(Value::Object(object), flags_name, heap)?;
    let spelled = vm.to_string(held, heap)?;
    let letters = heap.string(spelled).unwrap_or(&[]).to_vec();
    // Step 6 — read from the flags the receiver reported, not from what the splitter turns out to
    // have. The two are the same for `%RegExp%` and need not be for anything else.
    let unicode = letters.contains(&u16::from(b'u')) || letters.contains(&u16::from(b'v'));
    // Step 7 — a **sticky** copy, so each attempt is anchored where the last piece ended rather
    // than searching forward. The test is for a lowercase `y` and nothing else: flags of `"Y"`
    // become `"Yy"`.
    let new_flags = match letters.contains(&u16::from(b'y')) {
        true => spelled,
        false => {
            let mut with_sticky = letters;
            with_sticky.push(u16::from(b'y'));
            heap.intern(&with_sticky)
        }
    };
    // Step 8 — the receiver itself is the first argument, not its source. `new RegExp(rx, flags)`
    // reads the pattern back out of it, and a species that is not `%RegExp%` may want the object.
    let splitter = vm.construct_value(
        Value::Object(constructor),
        &[Value::Object(object), Value::String(new_flags)],
        heap,
    )?;
    let Value::Object(splitter) = splitter else {
        return Err(Abrupt::type_error("the species did not make an object"));
    };
    // Steps 9 to 11 — the limit is converted **here**, after the species has been asked and the
    // splitter built. A `valueOf` on it that throws therefore lands after both, which is the only
    // way to tell this order from the obvious one.
    let mut pieces: Vec<Value> = Vec::new();
    let limit = match call.argument(1) {
        Value::Undefined => u32::MAX,
        given => {
            let number = vm.to_number(given, heap)?;
            // §7.1.6 `ToUint32` — a limit of zero means an empty answer, and a negative one wraps.
            (number as i64).rem_euclid(0x1_0000_0000) as u32
        }
    };
    // Step 12.
    if limit == 0 {
        return super::array::from_values(vm, heap, &pieces);
    }
    if subject.is_empty() {
        // Step 13 — an empty subject answers one empty piece, unless the pattern matches it, in
        // which case it answers none at all.
        let found = regexp_exec(vm, heap, splitter, &subject)?;
        if matches!(found, Value::Null) {
            let whole = Value::String(heap.intern(&subject));
            pieces.push(whole);
        }
        return super::array::from_values(vm, heap, &pieces);
    }
    let mut piece_start = 0;
    let mut at = 0;
    while at < subject.len() {
        set_last_index(vm, heap, splitter, at)?;
        let found = regexp_exec(vm, heap, splitter, &subject)?;
        let Value::Object(found) = found else {
            // Step 16.c — a failure advances by a whole code point under `u` or `v`, so a walk
            // cannot stop between the halves of a surrogate pair.
            at = advanced(&subject, at, unicode);
            continue;
        };
        let name = key(heap, "lastIndex");
        let held = vm.get_property_key(Value::Object(splitter), name, heap)?;
        let end = vm.to_number(held, heap)?;
        // Step 16.d.i and ii — `ToLength`, which clamps rather than wrapping, and then to the
        // subject. A splitter is free to put anything at all in `lastIndex`.
        let end = usize::try_from(super::array_methods::to_length(end))
            .unwrap_or(usize::MAX)
            .min(subject.len());
        // Step 16.d.iii — a match that consumed nothing where the last piece ended would split
        // forever, so it is stepped over rather than acted on.
        if end == piece_start {
            at = advanced(&subject, at, unicode);
            continue;
        }
        let piece = Value::String(heap.intern(&subject[piece_start..at]));
        pieces.push(piece);
        if pieces.len() >= limit as usize {
            return super::array::from_values(vm, heap, &pieces);
        }
        // Step 16.d.iv.5 — `p` moves to `e` *before* the captures are read, and a getter among
        // them can throw. Written after them it would be skipped on that path.
        piece_start = end;
        // Steps 16.d.iv.6 and 7 — the captures go into the answer too, which is what makes
        // `"a1b".split(/(\d)/)` three pieces and not two. `LengthOfArrayLike` is `ToLength`, so a
        // result claiming a length of `-1` contributes none rather than wrapping to four billion.
        let length = key(heap, "length");
        let count = vm.get_property_key(Value::Object(found), length, heap)?;
        let count = vm.to_number(count, heap)?;
        let count = super::array_methods::to_length(count).saturating_sub(1);
        // A key past `u32::MAX` is not an array index, and a walk that reached one would have made
        // four billion `Get` calls on the way. Bounded rather than wrapped, so that two captures
        // can never be read from the same slot on any path a program can actually run.
        let count = u32::try_from(count).unwrap_or(u32::MAX);
        for index in 1..=count {
            let slot = heap.index_key(index);
            let capture = vm.get_property_key(Value::Object(found), slot, heap)?;
            pieces.push(capture);
            if pieces.len() >= limit as usize {
                return super::array::from_values(vm, heap, &pieces);
            }
        }
        // Step 16.d.iv.10 — the next attempt starts where this piece ended.
        at = piece_start;
    }
    let last = Value::String(heap.intern(&subject[piece_start.min(subject.len())..]));
    pieces.push(last);
    super::array::from_values(vm, heap, &pieces)
}

/// §22.2.6.8 `RegExp.prototype[Symbol.matchAll]`.
fn symbol_match_all(vm: &mut Vm, heap: &mut Heap, call: &NativeCall<'_>) -> Completion<Value> {
    // Step 2.
    let object = this_object(call.this_value)?;
    // Step 3.
    let subject = subject_of(vm, heap, call.argument(0))?;
    // Step 4 — asked **before** `flags`, which a getter on either can tell apart.
    let default = vm.realm().regexp_constructor();
    let constructor = super::promise::species_of(vm, heap, object, default)?;
    // Step 5.
    let flags_name = key(heap, "flags");
    let held = vm.get_property_key(Value::Object(object), flags_name, heap)?;
    let spelled = vm.to_string(held, heap)?;
    let letters = heap.string(spelled).unwrap_or(&[]).to_vec();
    // Step 6 — the walk goes through a **second object**, so a program that moves the original's
    // `lastIndex` half-way through a `for`-`of` does not disturb it. The flags are handed over
    // unchanged, unlike §22.2.6.14's, which adds a `y`.
    let matcher = vm.construct_value(
        Value::Object(constructor),
        &[Value::Object(object), Value::String(spelled)],
        heap,
    )?;
    let Value::Object(matcher) = matcher else {
        return Err(Abrupt::type_error("the species did not make an object"));
    };
    // Steps 7 and 8 — it starts where the original had got to, so `matchAll` on a pattern already
    // part-way through a subject continues rather than starting over.
    let index_name = key(heap, "lastIndex");
    let at = vm.get_property_key(Value::Object(object), index_name, heap)?;
    let at = vm.to_number(at, heap)?;
    // Step 7 is `ToLength` and this is not the spelling of it, deliberately: `set_last_index`
    // narrows to `u32` below, so the clamp at 2^53 - 1 that `ToLength` adds is one no program can
    // reach from here. Both spellings answer zero for a negative position and for a NaN.
    let at = usize::try_from(at.max(0.0) as u64).unwrap_or(usize::MAX);
    set_last_index(vm, heap, matcher, at)?;
    let text = heap.intern(&subject);
    let iterator = heap.new_object(Some(vm.realm().regexp_string_iterator_prototype()));
    if let Some(found) = heap.object_mut(iterator) {
        found.set_matches(crate::heap::Matches {
            regexp: matcher,
            subject: text,
            // Steps 9 to 12 — from the flags read at step 5, which are the **receiver's**. The
            // matcher is free to carry different ones, so `/\d/u` whose species answers `/\w/g`
            // walks once rather than to the end. Read once, too: a `flags` getter cannot change
            // what the walk does between one step and the next.
            global: letters.contains(&u16::from(b'g')),
            unicode: letters.contains(&u16::from(b'u')) || letters.contains(&u16::from(b'v')),
            done: false,
        });
    }
    Ok(Value::Object(iterator))
}

/// §22.2.9.2.1 — the iterator's `next`.
fn iterator_next(vm: &mut Vm, heap: &mut Heap, call: &NativeCall<'_>) -> Completion<Value> {
    let Value::Object(iterator) = call.this_value else {
        return Err(Abrupt::type_error(
            "this method requires a RegExp String Iterator",
        ));
    };
    let Some(state) = heap.object(iterator).and_then(crate::heap::Object::matches) else {
        return Err(Abrupt::type_error(
            "this method requires a RegExp String Iterator",
        ));
    };
    if state.done {
        return finished(vm, heap);
    }
    let subject = heap.string(state.subject).unwrap_or(&[]).to_vec();
    let found = regexp_exec(vm, heap, state.regexp, &subject)?;
    let Value::Object(found) = found else {
        // Step 6.a — nothing more. The walk is marked finished so a second `next` costs no call at
        // all, which a `return` on the regular expression could otherwise observe.
        stop(heap, iterator);
        return finished(vm, heap);
    };
    // Step 7 — a non-global pattern yields exactly one result and is done, whatever the subject
    // still holds. That is the difference the flag makes here, and it is read from the copy taken
    // when the iterator was made.
    if !state.global {
        stop(heap, iterator);
        return step(vm, heap, Value::Object(found));
    }
    // Step 8.e — an empty match would leave `lastIndex` where it is, so it is stepped over. Under
    // `u` or `v` the step is a whole code point, or the walk would stop inside a surrogate pair.
    let zero = heap.index_key(0);
    let text = vm.get_property_key(Value::Object(found), zero, heap)?;
    let text = vm.to_string(text, heap)?;
    if heap.string(text).is_none_or(<[u16]>::is_empty) {
        let name = key(heap, "lastIndex");
        let held = vm.get_property_key(Value::Object(state.regexp), name, heap)?;
        let at = vm.to_number(held, heap)?;
        let at = usize::try_from(at.max(0.0) as u64).unwrap_or(usize::MAX);
        set_last_index(
            vm,
            heap,
            state.regexp,
            advanced(&subject, at, state.unicode),
        )?;
    }
    step(vm, heap, Value::Object(found))
}

/// §22.2.7.3 `AdvanceStringIndex` — one unit, or one code point under `u`.
fn advanced(subject: &[u16], at: usize, unicode: bool) -> usize {
    if !unicode {
        return at.saturating_add(1);
    }
    let leading = subject.get(at).copied().unwrap_or(0);
    let trailing = subject.get(at + 1).copied().unwrap_or(0);
    match (0xD800..=0xDBFF).contains(&leading) && (0xDC00..=0xDFFF).contains(&trailing) {
        true => at.saturating_add(2),
        false => at.saturating_add(1),
    }
}

/// Mark a walk finished, which nothing undoes.
fn stop(heap: &mut Heap, iterator: ObjectId) {
    if let Some(state) = heap
        .object_mut(iterator)
        .and_then(crate::heap::Object::matches_mut)
    {
        state.done = true;
    }
}

/// §7.4.14 `CreateIterResultObject` with `done` true and nothing to hand over.
fn finished(vm: &mut Vm, heap: &mut Heap) -> Completion<Value> {
    result(vm, heap, Value::Undefined, true)
}

/// The same, with a value and `done` false.
fn step(vm: &mut Vm, heap: &mut Heap, value: Value) -> Completion<Value> {
    result(vm, heap, value, false)
}

/// §7.4.14 `CreateIterResultObject`.
fn result(vm: &mut Vm, heap: &mut Heap, value: Value, done: bool) -> Completion<Value> {
    let object = heap.new_object(Some(vm.realm().object_prototype()));
    super::define_value(heap, object, "value", value);
    super::define_value(heap, object, "done", Value::Boolean(done));
    Ok(Value::Object(object))
}

/// Put the four onto `RegExp.prototype`.
pub(super) fn install(heap: &mut Heap, realm: &Realm) {
    let prototype = realm.regexp_prototype();
    let methods: [(&str, u32, crate::heap::Native); 5] = [
        ("match", 1, symbol_match),
        ("matchAll", 1, symbol_match_all),
        ("replace", 2, symbol_replace),
        ("search", 1, symbol_search),
        ("split", 2, symbol_split),
    ];
    // §22.2.9.3 — the iterator's own prototype, which inherits `[Symbol.iterator]` from
    // `%IteratorPrototype%` and so is iterable without saying so itself.
    let iterating = realm.regexp_string_iterator_prototype();
    super::define_method(heap, realm, iterating, "next", 0, iterator_next);
    super::collection::tag_with(heap, iterating, "RegExp String Iterator");
    for (name, length, native) in methods {
        let Some(symbol) = heap.well_known(super::well_known_at(name)) else {
            continue;
        };
        let function = heap.new_native_function(realm.function_prototype(), native, realm.id());
        super::define_function_metadata(heap, function, &format!("[Symbol.{name}]"), length);
        let slot = crate::heap::PropertyKey::from_symbol(symbol);
        let _ = heap.define_own_property(
            prototype,
            slot,
            &PropertyDescriptor {
                value: Some(Value::Object(function)),
                writable: Some(true),
                enumerable: Some(false),
                configurable: Some(true),
                ..PropertyDescriptor::EMPTY
            },
        );
    }
}