Change table hashing and comparison logic to be *unordered*, but still

O(N)

1 files changed, 15 insertions, 0 deletions

diff --git a/test/tables.tm b/test/tables.tm
index e67c7127..6abbbe36 100644
--- a/test/tables.tm
+++ b/test/tables.tm
@@ -88,3 +88,18 @@ func main():
 		>> t4
 		= &{"one":999, "two":222}
 
+	do:
+		>> {1:1, 2:2} == {2:2, 1:1}
+		= yes
+		>> {1:1, 2:2} == {1:1, 2:999}
+		= no
+
+		>> {1:1, 2:2} <> {2:2, 1:1}
+		= 0
+		>> [{:Int:Int}, {0:0}, {99:99}, {1:1, 2:2, 3:3}, {1:1, 99:99, 3:3}, {1:1, 2:-99, 3:3}, {1:1, 99:-99, 3:4}]:sorted()
+		= [{}, {0:0}, {1:1, 2:-99, 3:3}, {1:1, 2:2, 3:3}, {1:1, 99:99, 3:3}, {1:1, 99:-99, 3:4}, {99:99}]
+
+		>> [{:Int}, {1}, {2}, {99}, {0, 3}, {1, 2}, {99}]:sorted()
+		= [{}, {0, 3}, {1}, {1, 2}, {2}, {99}, {99}]
+
+