feat: replace new keyword with this constructor syntax and ClassName.new() calls across core library and docs

Replace all uses of the `new` reserved word with explicit `this new()` constructor definitions and `ClassName.new()` instantiation calls in builtin/core.wren. Update all documentation files (classes.markdown, fiber.markdown, fn.markdown, sequence.markdown, error-handling.markdown, expressions.markdown, fibers.markdown, functions.markdown) to reflect the new constructor syntax, removing `new` keyword examples and replacing them with `ClassName.new()` patterns and `this new()` definitions.

test/benchmark/binary_trees.wren

@@ -1,13 +1,13 @@
 // Ported from the Python version.
 
 class Tree {
-  new(item, depth) {
+  this new(item, depth) {
     _item = item
     if (depth > 0) {
       var item2 = item + item
       depth = depth - 1
-      _left = new Tree(item2 - 1, depth)
-      _right = new Tree(item2, depth)
+      _left = Tree.new(item2 - 1, depth)
+      _right = Tree.new(item2, depth)
     }
   }
 
@@ -27,9 +27,9 @@ var stretchDepth = maxDepth + 1
 var start = IO.clock
 
 IO.print("stretch tree of depth ", stretchDepth, " check: ",
-    new Tree(0, stretchDepth).check)
+    Tree.new(0, stretchDepth).check)
 
-var longLivedTree = new Tree(0, maxDepth)
+var longLivedTree = Tree.new(0, maxDepth)
 
 // iterations = 2 ** maxDepth
 var iterations = 1
@@ -41,7 +41,7 @@ var depth = minDepth
 while (depth < stretchDepth) {
   var check = 0
   for (i in 1..iterations) {
-    check = check + new Tree(i, depth).check + new Tree(-i, depth).check
+    check = check + Tree.new(i, depth).check + Tree.new(-i, depth).check
   }
 
   IO.print((iterations * 2), " trees of depth ", depth, " check: ", check)

test/benchmark/delta_blue.wren

@@ -50,7 +50,7 @@ var ORDERED = null
 // disrupting current constraints.  Strengths cannot be created outside
 // this class, so == can be used for value comparison.
 class Strength {
-  new(value, name) {
+  this new(value, name) {
     _value = value
     _name = name
   }
@@ -67,13 +67,13 @@ class Strength {
 }
 
 // Compile time computed constants.
-REQUIRED        = new Strength(0, "required")
-STRONG_REFERRED = new Strength(1, "strongPreferred")
-PREFERRED       = new Strength(2, "preferred")
-STRONG_DEFAULT  = new Strength(3, "strongDefault")
-NORMAL          = new Strength(4, "normal")
-WEAK_DEFAULT    = new Strength(5, "weakDefault")
-WEAKEST         = new Strength(6, "weakest")
+REQUIRED        = Strength.new(0, "required")
+STRONG_REFERRED = Strength.new(1, "strongPreferred")
+PREFERRED       = Strength.new(2, "preferred")
+STRONG_DEFAULT  = Strength.new(3, "strongDefault")
+NORMAL          = Strength.new(4, "normal")
+WEAK_DEFAULT    = Strength.new(5, "weakDefault")
+WEAKEST         = Strength.new(6, "weakest")
 
 ORDERED = [
   WEAKEST, WEAK_DEFAULT, NORMAL, STRONG_DEFAULT, PREFERRED, STRONG_REFERRED
@@ -82,7 +82,7 @@ ORDERED = [
 var ThePlanner
 
 class Constraint {
-  new(strength) {
+  this new(strength) {
     _strength = strength
   }
 
@@ -131,7 +131,7 @@ class Constraint {
 
 // Abstract superclass for constraints having a single possible output variable.
 class UnaryConstraint is Constraint {
-  new(myOutput, strength) {
+  this new(myOutput, strength) {
     super(strength)
     _satisfied = false
     _myOutput = myOutput
@@ -187,7 +187,7 @@ class UnaryConstraint is Constraint {
 // change their output during plan execution.  This is called "stay
 // optimization".
 class StayConstraint is UnaryConstraint {
-  new(variable, strength) {
+  this new(variable, strength) {
     super(variable, strength)
   }
 
@@ -199,7 +199,7 @@ class StayConstraint is UnaryConstraint {
 // A unary input constraint used to mark a variable that the client
 // wishes to change.
 class EditConstraint is UnaryConstraint {
-  EditConstraint(variable, strength) {
+  this new(variable, strength) {
     super(variable, strength)
   }
 
@@ -219,7 +219,7 @@ var BACKWARD = 0
 // Abstract superclass for constraints having two possible output
 // variables.
 class BinaryConstraint is Constraint {
-  new(v1, v2, strength) {
+  this new(v1, v2, strength) {
     super(strength)
     _v1 = v1
     _v2 = v2
@@ -328,7 +328,7 @@ class BinaryConstraint is Constraint {
 // this relationship but the scale factor and offset are considered
 // read-only.
 class ScaleConstraint is BinaryConstraint {
-  new(src, scale, offset, dest, strength) {
+  this new(src, scale, offset, dest, strength) {
     _scale = scale
     _offset = offset
     super(src, dest, strength)
@@ -376,7 +376,7 @@ class ScaleConstraint is BinaryConstraint {
 
 // Constrains two variables to have the same value.
 class EqualityConstraint is BinaryConstraint {
-  new(v1, v2, strength) {
+  this new(v1, v2, strength) {
     super(v1, v2, strength)
   }
 
@@ -391,7 +391,7 @@ class EqualityConstraint is BinaryConstraint {
 // various parameters of interest to the DeltaBlue incremental
 // constraint solver.
 class Variable {
-  new(name, value) {
+  this new(name, value) {
     _constraints = []
     _determinedBy = null
     _mark = 0
@@ -430,7 +430,7 @@ class Variable {
 // to resatisfy all currently satisfiable constraints in the face of
 // one or more changing inputs.
 class Plan {
-  new {
+  this new() {
     _list = []
   }
 
@@ -448,7 +448,7 @@ class Plan {
 }
 
 class Planner {
-  new {
+  this new() {
     _currentMark = 0
   }
 
@@ -521,7 +521,7 @@ class Planner {
   // Assume: [sources] are all satisfied.
   makePlan(sources) {
     var mark = newMark
-    var plan = new Plan
+    var plan = Plan.new()
     var todo = sources
     while (todo.count > 0) {
       var constraint = todo.removeAt(-1)
@@ -622,23 +622,23 @@ var total = 0
 // constraint so it cannot be accomodated. The cost in this case is,
 // of course, very low. Typical situations lie somewhere between these
 // two extremes.
-var chainTest = new Fn {|n|
-  ThePlanner = new Planner
+var chainTest = Fn.new {|n|
+  ThePlanner = Planner.new()
   var prev = null
   var first = null
   var last = null
 
   // Build chain of n equality constraints.
   for (i in 0..n) {
-    var v = new Variable("v", 0)
-    if (prev != null) new EqualityConstraint(prev, v, REQUIRED)
+    var v = Variable.new("v", 0)
+    if (prev != null) EqualityConstraint.new(prev, v, REQUIRED)
     if (i == 0) first = v
     if (i == n) last = v
     prev = v
   }
 
-  new StayConstraint(last, STRONG_DEFAULT)
-  var edit = new EditConstraint(first, PREFERRED)
+  StayConstraint.new(last, STRONG_DEFAULT)
+  var edit = EditConstraint.new(first, PREFERRED)
   var plan = ThePlanner.extractPlanFromConstraints([edit])
   for (i in 0...100) {
     first.value = i
@@ -647,8 +647,8 @@ var chainTest = new Fn {|n|
   }
 }
 
-var change = new Fn {|v, newValue|
-  var edit = new EditConstraint(v, PREFERRED)
+var change = Fn.new {|v, newValue|
+  var edit = EditConstraint.new(v, PREFERRED)
   var plan = ThePlanner.extractPlanFromConstraints([edit])
   for (i in 0...10) {
     v.value = newValue
@@ -662,20 +662,20 @@ var change = new Fn {|v, newValue|
 // other by a simple linear transformation (scale and offset). The
 // time is measured to change a variable on either side of the
 // mapping and to change the scale and offset factors.
-var projectionTest = new Fn {|n|
-  ThePlanner = new Planner
-  var scale = new Variable("scale", 10)
-  var offset = new Variable("offset", 1000)
+var projectionTest = Fn.new {|n|
+  ThePlanner = Planner.new()
+  var scale = Variable.new("scale", 10)
+  var offset = Variable.new("offset", 1000)
   var src = null
   var dst = null
 
   var dests = []
   for (i in 0...n) {
-    src = new Variable("src", i)
-    dst = new Variable("dst", i)
+    src = Variable.new("src", i)
+    dst = Variable.new("dst", i)
     dests.add(dst)
-    new StayConstraint(src, NORMAL)
-    new ScaleConstraint(src, scale, offset, dst, REQUIRED)
+    StayConstraint.new(src, NORMAL)
+    ScaleConstraint.new(src, scale, offset, dst, REQUIRED)
   }
 
   change.call(src, 17)

test/benchmark/fibers.wren

@@ -5,7 +5,7 @@ var sum = 0
 var start = IO.clock
 
 for (i in 0...100000) {
-  fibers.add(new Fiber {
+  fibers.add(Fiber.new {
     sum = sum + i
     if (i < 99999) fibers[i + 1].call()
   })

test/benchmark/method_call.wren

@@ -1,5 +1,5 @@
 class Toggle {
-  new(startState) {
+  this new(startState) {
     _state = startState
   }
 
@@ -11,7 +11,7 @@ class Toggle {
 }
 
 class NthToggle is Toggle {
-  new(startState, maxCounter) {
+  this new(startState, maxCounter) {
     super(startState)
     _countMax = maxCounter
     _count = 0
@@ -31,7 +31,7 @@ class NthToggle is Toggle {
 var start = IO.clock
 var n = 100000
 var val = true
-var toggle = new Toggle(val)
+var toggle = Toggle.new(val)
 
 for (i in 0...n) {
   val = toggle.activate.value
@@ -49,7 +49,7 @@ for (i in 0...n) {
 IO.print(toggle.value)
 
 val = true
-var ntoggle = new NthToggle(val, 3)
+var ntoggle = NthToggle.new(val, 3)
 
 for (i in 0...n) {
   val = ntoggle.activate.value