fcb2bc0d51
parser package, moved the parsing aspect of reader to parser (still have some naughty stuff like WallChar and PathChar in parser but it'll be fixed in next commit)
385 lines
7.7 KiB
Go
385 lines
7.7 KiB
Go
package parser
|
|
|
|
import (
|
|
"fmt"
|
|
"maze-solver/io/reader"
|
|
"maze-solver/maze"
|
|
"maze-solver/utils"
|
|
"testing"
|
|
)
|
|
|
|
func TestTextReadTrivial(t *testing.T) {
|
|
fmt.Println("---------- Trivial ----------")
|
|
/* trivial.txt
|
|
## ##
|
|
# #
|
|
### #
|
|
|
|
Nodes are
|
|
##0##
|
|
#123#
|
|
###4#
|
|
*/
|
|
nodes := make([]*maze.Node, 5)
|
|
|
|
nodes[0] = maze.NewNode(maze.Coordinates{X: 2, Y: 0})
|
|
|
|
nodes[1] = maze.NewNode(maze.Coordinates{X: 1, Y: 1})
|
|
nodes[2] = maze.NewNode(maze.Coordinates{X: 2, Y: 1})
|
|
nodes[3] = maze.NewNode(maze.Coordinates{X: 3, Y: 1})
|
|
|
|
nodes[4] = maze.NewNode(maze.Coordinates{X: 3, Y: 2})
|
|
|
|
nodes[0].Down = nodes[2]
|
|
|
|
nodes[1].Right = nodes[2]
|
|
|
|
nodes[2].Up = nodes[0]
|
|
nodes[2].Left = nodes[1]
|
|
nodes[2].Right = nodes[3]
|
|
|
|
nodes[3].Left = nodes[2]
|
|
nodes[3].Down = nodes[4]
|
|
|
|
nodes[4].Up = nodes[3]
|
|
|
|
reader := reader.TextReader{
|
|
Filename: "../../assets/trivial.txt",
|
|
PathChar: ' ',
|
|
WallChar: '#',
|
|
}
|
|
|
|
got, err := Parse(reader)
|
|
utils.Check(err, "Couldn't create maze from %q", reader.Filename)
|
|
|
|
if len(nodes) != len(got.Nodes) {
|
|
t.Fatalf("Didn't get the same size of nodes: %v, want %v", len(got.Nodes), len(nodes))
|
|
}
|
|
|
|
for i, got := range got.Nodes {
|
|
expected := nodes[i]
|
|
|
|
checkNode(t, i, got, expected, "")
|
|
checkNode(t, i, got.Left, expected.Left, "left")
|
|
checkNode(t, i, got.Right, expected.Right, "Right")
|
|
checkNode(t, i, got.Up, expected.Up, "Up")
|
|
checkNode(t, i, got.Down, expected.Down, "Down")
|
|
}
|
|
}
|
|
|
|
func TestTextReadTrivialBigger(t *testing.T) {
|
|
fmt.Println("---------- Trivial Bigger ----------")
|
|
/* trivial-bigger.txt
|
|
### ###
|
|
### ###
|
|
# #
|
|
##### #
|
|
##### #
|
|
|
|
Nodes are
|
|
###0###
|
|
### ###
|
|
#1 2 3#
|
|
##### #
|
|
#####4#
|
|
*/
|
|
nodes := make([]*maze.Node, 5)
|
|
|
|
nodes[0] = maze.NewNode(maze.Coordinates{X: 3, Y: 0})
|
|
|
|
nodes[1] = maze.NewNode(maze.Coordinates{X: 1, Y: 2})
|
|
nodes[2] = maze.NewNode(maze.Coordinates{X: 3, Y: 2})
|
|
nodes[3] = maze.NewNode(maze.Coordinates{X: 5, Y: 2})
|
|
|
|
nodes[4] = maze.NewNode(maze.Coordinates{X: 5, Y: 4})
|
|
|
|
nodes[0].Down = nodes[2]
|
|
|
|
nodes[1].Right = nodes[2]
|
|
|
|
nodes[2].Up = nodes[0]
|
|
nodes[2].Left = nodes[1]
|
|
nodes[2].Right = nodes[3]
|
|
|
|
nodes[3].Left = nodes[2]
|
|
nodes[3].Down = nodes[4]
|
|
|
|
nodes[4].Up = nodes[3]
|
|
|
|
reader := reader.TextReader{
|
|
Filename: "../../assets/trivial-bigger.txt",
|
|
PathChar: ' ',
|
|
WallChar: '#',
|
|
}
|
|
|
|
got, err := Parse(reader)
|
|
utils.Check(err, "Couldn't create maze from %q", reader.Filename)
|
|
|
|
if len(nodes) != len(got.Nodes) {
|
|
t.Fatalf("Didn't get the same size of nodes: %v, want %v", len(got.Nodes), len(nodes))
|
|
}
|
|
|
|
for _, node := range got.Nodes {
|
|
fmt.Println(node)
|
|
}
|
|
|
|
for i, got := range got.Nodes {
|
|
expected := nodes[i]
|
|
|
|
checkNode(t, i, got, expected, "")
|
|
checkNode(t, i, got.Left, expected.Left, "left")
|
|
checkNode(t, i, got.Right, expected.Right, "Right")
|
|
checkNode(t, i, got.Up, expected.Up, "Up")
|
|
checkNode(t, i, got.Down, expected.Down, "Down")
|
|
}
|
|
}
|
|
|
|
func TestTextReadTrivialBiggerStaggered(t *testing.T) {
|
|
fmt.Println("---------- Trivial Staggered ----------")
|
|
/* trivial-bigger-staggered.txt
|
|
### ###
|
|
### ###
|
|
# #
|
|
#### ##
|
|
#### ##
|
|
|
|
Nodes are
|
|
###0###
|
|
### ###
|
|
#1 243#
|
|
#### ##
|
|
####5##
|
|
*/
|
|
nodes := make([]*maze.Node, 6)
|
|
|
|
nodes[0] = maze.NewNode(maze.Coordinates{X: 3, Y: 0})
|
|
|
|
nodes[1] = maze.NewNode(maze.Coordinates{X: 1, Y: 2})
|
|
nodes[2] = maze.NewNode(maze.Coordinates{X: 3, Y: 2})
|
|
nodes[3] = maze.NewNode(maze.Coordinates{X: 5, Y: 2})
|
|
|
|
nodes[4] = maze.NewNode(maze.Coordinates{X: 4, Y: 2})
|
|
|
|
nodes[5] = maze.NewNode(maze.Coordinates{X: 4, Y: 4})
|
|
|
|
nodes[0].Down = nodes[2]
|
|
|
|
nodes[1].Right = nodes[2]
|
|
|
|
nodes[2].Up = nodes[0]
|
|
nodes[2].Left = nodes[1]
|
|
nodes[2].Right = nodes[4]
|
|
|
|
nodes[3].Left = nodes[4]
|
|
|
|
nodes[4].Down = nodes[5]
|
|
nodes[4].Left = nodes[2]
|
|
nodes[4].Right = nodes[3]
|
|
|
|
nodes[5].Up = nodes[4]
|
|
|
|
reader := reader.TextReader{
|
|
Filename: "../../assets/trivial-bigger-staggered.txt",
|
|
PathChar: ' ',
|
|
WallChar: '#',
|
|
}
|
|
|
|
got, err := Parse(reader)
|
|
utils.Check(err, "Couldn't create maze from %q", reader.Filename)
|
|
|
|
if len(nodes) != len(got.Nodes) {
|
|
t.Fatalf("Didn't get the same size of nodes: %v, want %v", len(got.Nodes), len(nodes))
|
|
}
|
|
|
|
for _, node := range got.Nodes {
|
|
fmt.Println(node)
|
|
}
|
|
|
|
for i, got := range got.Nodes {
|
|
expected := nodes[i]
|
|
|
|
checkNode(t, i, got, expected, "")
|
|
checkNode(t, i, got.Left, expected.Left, "left")
|
|
checkNode(t, i, got.Right, expected.Right, "Right")
|
|
checkNode(t, i, got.Up, expected.Up, "Up")
|
|
checkNode(t, i, got.Down, expected.Down, "Down")
|
|
}
|
|
}
|
|
|
|
func TestTextReadNormal(t *testing.T) {
|
|
return
|
|
fmt.Println("---------- Normal ----------")
|
|
/* trivial-bigger-staggered.txt
|
|
##### #####
|
|
# # #
|
|
##### ### #
|
|
# # #
|
|
# # ##### #
|
|
# # #
|
|
### ### # #
|
|
# # # #
|
|
# ####### #
|
|
# # #
|
|
##### #####
|
|
|
|
Nodes are
|
|
#####0#####
|
|
#1 2#3 4#
|
|
##### ### #
|
|
#5 6#7 8#
|
|
# # ##### #
|
|
#9#A G B#
|
|
### ### # #
|
|
#C D#E F# #
|
|
# ####### #
|
|
#H I#J K#
|
|
#####L#####
|
|
*/
|
|
// TODO: we are not detecting vertical dead-ends that go downwards
|
|
nodes := make([]*maze.Node, 22)
|
|
|
|
// ---- Node creation ----
|
|
coords := []struct{ x, y int }{
|
|
{5, 0}, // 0
|
|
|
|
{1, 1}, // 1
|
|
{5, 1}, // 2
|
|
{7, 1}, // 3
|
|
{9, 1}, // 4
|
|
|
|
{1, 3}, // 5
|
|
{3, 3}, // 6
|
|
{5, 3}, // 7
|
|
{9, 3}, // 8
|
|
|
|
{1, 5}, // 9
|
|
{3, 5}, // A (10)
|
|
{7, 5}, // G (16)
|
|
{9, 5}, // B (11)
|
|
|
|
{1, 7}, // C (12)
|
|
{3, 7}, // D (13)
|
|
{5, 7}, // E (14)
|
|
{7, 7}, // F (15)
|
|
|
|
{1, 9}, // H (17)
|
|
{5, 9}, // I (18)
|
|
{7, 9}, // J (19)
|
|
{9, 9}, // K (20)
|
|
|
|
{5, 10}, // L (21)
|
|
}
|
|
|
|
for i, coord := range coords {
|
|
nodes[i] = maze.NewNode(maze.Coordinates{X: coord.x, Y: coord.y})
|
|
}
|
|
|
|
// ---- Node linking ----
|
|
nodes[0].Down = nodes[2]
|
|
|
|
nodes[1].Right = nodes[2]
|
|
|
|
nodes[2].Up = nodes[0]
|
|
nodes[2].Left = nodes[1]
|
|
nodes[2].Down = nodes[7]
|
|
|
|
nodes[3].Right = nodes[4]
|
|
|
|
nodes[4].Left = nodes[3]
|
|
nodes[4].Down = nodes[8]
|
|
|
|
nodes[5].Right = nodes[6]
|
|
nodes[5].Down = nodes[9]
|
|
|
|
nodes[6].Left = nodes[5]
|
|
nodes[6].Down = nodes[10]
|
|
|
|
nodes[7].Right = nodes[8]
|
|
|
|
nodes[8].Up = nodes[4]
|
|
nodes[8].Left = nodes[7]
|
|
nodes[8].Down = nodes[11]
|
|
|
|
nodes[9].Up = nodes[5]
|
|
|
|
nodes[10].Up = nodes[6]
|
|
nodes[10].Right = nodes[16]
|
|
nodes[10].Down = nodes[13]
|
|
|
|
nodes[11].Up = nodes[6]
|
|
nodes[11].Right = nodes[16]
|
|
nodes[11].Down = nodes[20]
|
|
|
|
nodes[12].Right = nodes[13]
|
|
nodes[12].Down = nodes[17]
|
|
|
|
nodes[13].Up = nodes[10]
|
|
nodes[13].Left = nodes[16]
|
|
|
|
nodes[14].Right = nodes[15]
|
|
|
|
nodes[15].Up = nodes[16]
|
|
nodes[15].Left = nodes[14]
|
|
|
|
nodes[16].Left = nodes[10]
|
|
nodes[16].Right = nodes[11]
|
|
nodes[16].Down = nodes[15]
|
|
|
|
nodes[17].Up = nodes[12]
|
|
nodes[17].Right = nodes[18]
|
|
|
|
nodes[18].Left = nodes[17]
|
|
nodes[18].Down = nodes[21]
|
|
|
|
nodes[19].Right = nodes[20]
|
|
|
|
nodes[20].Up = nodes[11]
|
|
nodes[20].Left = nodes[19]
|
|
|
|
nodes[21].Up = nodes[20]
|
|
|
|
reader := reader.TextReader{
|
|
Filename: "../../assets/normal.txt",
|
|
PathChar: ' ',
|
|
WallChar: '#',
|
|
}
|
|
|
|
got, err := Parse(reader)
|
|
utils.Check(err, "Couldn't create maze from %q", reader.Filename)
|
|
|
|
if len(nodes) != len(got.Nodes) {
|
|
for i, node := range got.Nodes {
|
|
fmt.Printf("%v: %v\n", i, node)
|
|
}
|
|
t.Fatalf("Didn't get the same size of nodes: %v, want %v", len(got.Nodes), len(nodes))
|
|
}
|
|
|
|
for _, node := range got.Nodes {
|
|
fmt.Println(node)
|
|
}
|
|
|
|
for i, got := range got.Nodes {
|
|
expected := nodes[i]
|
|
|
|
checkNode(t, i, got, expected, "")
|
|
checkNode(t, i, got.Left, expected.Left, "left")
|
|
checkNode(t, i, got.Right, expected.Right, "Right")
|
|
checkNode(t, i, got.Up, expected.Up, "Up")
|
|
checkNode(t, i, got.Down, expected.Down, "Down")
|
|
}
|
|
}
|
|
|
|
func checkNode(t *testing.T, i int, got *maze.Node, expected *maze.Node, side string) {
|
|
if expected == nil {
|
|
return
|
|
}
|
|
|
|
if got == nil {
|
|
t.Fatalf("No %s node of %v, want %v", side, i, expected.Coords)
|
|
}
|
|
|
|
if got.Coords != expected.Coords {
|
|
t.Fatalf("Coords %s node of %v: %v, but want %v", side, i, got.Coords, expected.Coords)
|
|
}
|
|
}
|