X-Git-Url: http://git.scottworley.com/slidingtile/blobdiff_plain/212a5629d44cb0aa108057fe5a6d0c67bb479d54..2bf3412d1ed0c9da3c83d9ca276a7c91e4356d6a:/sliding_tile_test.go

diff --git a/sliding_tile_test.go b/sliding_tile_test.go
index 28392ee..34f3fcc 100644
--- a/sliding_tile_test.go
+++ b/sliding_tile_test.go
@@ -1,5 +1,7 @@
 package main
 
+import "reflect"
+import "sort"
 import "testing"
 
 func Test_read_board_from_strings(t *testing.T) {
@@ -26,3 +28,43 @@ func Test_read_board_from_strings(t *testing.T) {
 		t.Fail()
 	}
 }
+
+// For sorting, for unordered equality testing
+type Spaces []Space
+
+func (s Spaces) Len() int           { return len(s) }
+func (s Spaces) Swap(i, j int)      { s[i], s[j] = s[j], s[i] }
+func (s Spaces) Less(i, j int) bool { return s[i] < s[j] }
+
+func Test_adjacent_spaces(t *testing.T) {
+	type TestCase struct {
+		s        Space
+		expected Spaces
+	}
+	cases := []TestCase{
+		{0, []Space{1, 4}},
+		{1, []Space{0, 2, 5}},
+		{2, []Space{1, 3, 6}},
+		{3, []Space{2, 7}},
+		{4, []Space{0, 5, 8}},
+		{5, []Space{1, 4, 6, 9}},
+		{6, []Space{2, 5, 7, 10}},
+		{7, []Space{3, 6, 11}},
+		{8, []Space{4, 9, 12}},
+		{9, []Space{5, 8, 10, 13}},
+		{10, []Space{6, 9, 11, 14}},
+		{11, []Space{7, 10, 15}},
+		{12, []Space{8, 13}},
+		{13, []Space{9, 12, 14}},
+		{14, []Space{10, 13, 15}},
+		{15, []Space{11, 14}},
+	}
+	for i, c := range cases {
+		var actual Spaces = adjacent_spaces(c.s)
+		sort.Sort(c.expected)
+		sort.Sort(actual)
+		if !reflect.DeepEqual(c.expected, actual) {
+			t.Error(i, c.expected, actual)
+		}
+	}
+}