Editorial: remove uses of 'fresh'

tc39 · Oct 16, 2017 · 45890a3 · 45890a3
1 parent a231ff2
commit 45890a3
Showing 1 changed file with 3 additions and 3 deletions.
diff --git a/spec.html b/spec.html
@@ -29367,7 +29367,7 @@ <h1>Runtime Semantics: RepeatMatcher ( _m_, _min_, _max_, _greedy_, _x_, _c_, _p
               1. If _min_ is zero, let _min2_ be zero; otherwise let _min2_ be _min_-1.
               1. If _max_ is &infin;, let _max2_ be &infin;; otherwise let _max2_ be _max_-1.
               1. Call RepeatMatcher(_m_, _min2_, _max2_, _greedy_, _y_, _c_, _parenIndex_, _parenCount_) and return its result.
-            1. Let _cap_ be a fresh copy of _x_'s _captures_ List.
+            1. Let _cap_ be a copy of _x_'s _captures_ List.
             1. For each integer _k_ that satisfies _parenIndex_ &lt; _k_ and _k_ &le; _parenIndex_+_parenCount_, set _cap_[_k_] to *undefined*.
             1. Let _e_ be _x_'s _endIndex_.
             1. Let _xr_ be the State (_e_, _cap_).
@@ -29819,10 +29819,10 @@ <h1>Atom</h1>
           1. Let _parenIndex_ be the number of left-capturing parentheses in the entire regular expression that occur to the left of this |Atom|. This is the total number of <emu-grammar>Atom :: `(` Disjunction `)`</emu-grammar> Parse Nodes prior to or enclosing this |Atom|.
           1. Return an internal Matcher closure that takes two arguments, a State _x_ and a Continuation _c_, and performs the following steps:
             1. Let _d_ be an internal Continuation closure that takes one State argument _y_ and performs the following steps:
-              1. Let _cap_ be a fresh copy of _y_'s _captures_ List.
+              1. Let _cap_ be a copy of _y_'s _captures_ List.
               1. Let _xe_ be _x_'s _endIndex_.
               1. Let _ye_ be _y_'s _endIndex_.
-              1. Let _s_ be a fresh List whose characters are the characters of _Input_ at indices _xe_ (inclusive) through _ye_ (exclusive).
+              1. Let _s_ be a new List whose characters are the characters of _Input_ at indices _xe_ (inclusive) through _ye_ (exclusive).
               1. Set _cap_[_parenIndex_+1] to _s_.
               1. Let _z_ be the State (_ye_, _cap_).
               1. Call _c_(_z_) and return its result.