Rename

Author: eelstork

Runtime/Details/SolverStats.cs

@@ -7,7 +7,7 @@ public interface SolverStats{
 
     PlanningState status { get; }
     int  peak      { get; }
-    int  I               { get; }
+    int  iteration { get; }
 
 }
 

Runtime/Solver.cs

@@ -13,31 +13,31 @@ public class Solver<T> : SolverStats where T : class{
     public bool  brfs, safe = true;
     public PlanningState status { get; private set; }
     public int  peak            { get; private set; }
-    public int  I               { get; private set; }
+    public int  iteration               { get; private set; }
     T           initialState;
     Dish<T>     dish;
     Goal<T>     goal;
     NodeSet<T>  avail = null;
 
     public bool isRunning => status == S.Running;
 
-    public Node<T> Next(T s, in Goal<T> goal, int iter=-1){
+    public Node<T> Next(T s, in Goal<T> goal, int cap=-1){
         if(s == null) throw new NullRef(NO_INIT_ERR);
         dish = dish ?? Dish<T>.Create(s, safe);
         initialState = s;
         this.goal    = goal;
-        I            = 0;
+        iteration            = 0;
         avail        = new NodeSet<T>(s, goal.h, !brfs, maxNodes,
                                                         tolerance);
-        return Iterate(iter);
+        return Iterate(cap);
     }
 
-    public Node<T> Iterate(int iter=-1){
+    public Node<T> Iterate(int cap=-1){
         if(initialState == null) throw new InvOp(NO_INIT_ERR);
         if(status == S.MaxIterExceeded) return null;
-        if(iter == -1) iter = maxIter;
+        if(cap == -1) cap = maxIter;
         int i = 0;
-        while(avail && i++ < iter && I++ < maxIter){
+        while(avail && i++ < cap && iteration++ < maxIter){
             var current = avail.Pop();
             if(goal.match(current.state)){
                 status = S.Done;
@@ -51,7 +51,7 @@ public Node<T> Iterate(int iter=-1){
             status = S.CapacityExceeded;
         }else{
             status = avail
-                ? (I < maxIter ? S.Running : S.MaxIterExceeded)
+                ? (iteration < maxIter ? S.Running : S.MaxIterExceeded)
                 : S.Failed;
         }
         return null;

Tests/Editor/SolverTest.cs

@@ -43,12 +43,12 @@ [Test] public void IsRunning_false_after_solving(){
     }
 
     [Test] public void IsRunning_true_with_zero_frames_budget(){
-        var z = x.Next(new Idler(), unreachable, iter: 0);
+        var z = x.Next(new Idler(), unreachable, cap: 0);
         o( x.isRunning, true);
     }
 
     [Test] public void IsRunning_true_with_remaining_frames(){
-        var z = x.Next(new Inc(), unreachable, iter: 1);
+        var z = x.Next(new Inc(), unreachable, cap: 1);
         o( x.isRunning, true);
     }