Merge pull request #10 from rabestro/release/4

refactor code

Author: Jegors Čemisovs

maze-runner.awk

@@ -23,31 +23,39 @@ $NF == "⇨" {
     EndRow = Height
 }
 {
-    for (;NF;--NF) Grid[Height, NF] = $NF
+    for (; NF; --NF) Grid[Height, NF] = $NF
 }
 
 END {
-    if (find_path(StartRow, 2)) {
-        print_maze()
-    } else {
-        print "Path not found"
-    }
+    if (!find_path(StartRow, 2))
+        die("Path not found")
+    print_maze()
 }
 
 function find_path(row, col) {
-    if (row < 1 || row > Height || col < 1 || col > Width || Grid[row, col] != " ") return 0
+    if (is_not_free(row, col)) return 0
     Grid[row, col] = "⋅"
-    if (row == EndRow && col == Width - 1 \
-        || find_path(row + 1, col) || find_path(row - 1, col) \
-        || find_path(row, col + 1) || find_path(row, col -1)) return 1
+    if (is_path_valid(row, col)) return 1
     Grid[row, col] = " "
     return 0
 }
-
+function is_not_free(row, col) {
+    return row < 1 || row > Height \
+        || col < 1 || col > Width \
+        || Grid[row, col] != " "
+}
+function is_path_valid(row, col) {
+    return row == EndRow && col == Width - 1 \
+        || find_path(row + 1, col) \
+        || find_path(row - 1, col) \
+        || find_path(row, col + 1) \
+        || find_path(row, col - 1)
+}
 function print_maze(   row, col) {
     while (row++ < Height) {
         for (col = Width; col; --col)
             $col = Grid[row, col]
         print
     }
 }
+function die(message) {print message > "/dev/stderr"; exit 1}