lib: intro `Float.lerp` for simple linear interpolation

[nit.git] / lib / ai / search.nit

diff --git a/lib/ai/search.nit b/lib/ai/search.nit
index 21a349d..69b5c0d 100644 (file)
--- a/lib/ai/search.nit
+++ b/lib/ai/search.nit
@@ -159,8 +159,6 @@ interface SearchProblem[S: Object, A]
        # `steps` is the maximum number of steps a giver configuration can run.
        fun run_configs(steps: Int)
        do
-               var s
-
                var c = 0
                loop
                        if astar.run_config(steps, c, "A*") then break
@@ -199,7 +197,7 @@ end
 # 2. Apply the method `run`, that will search and return a solution.
 # 3. Retrieve information from the solution.
 #
-# ~~~~
+# ~~~~nitish
 # var p: SearchProblem = new MyProblem
 # var res = p.astar.run
 # if res != null then print "Found plan with {res.depth} actions, that cost {res.cost}: {res.plan.join(", ")}"
@@ -597,7 +595,7 @@ class SearchSolver[S: Object, A]
                print msg
 
                var t = new Clock
-               var res = run_steps(steps)
+               run_steps(steps)
                print "\t{self}"
                var l = t.lapse
                print "\ttime={l}"