expand dendriform aglebra tests

chakravala · Jun 8, 2017 · f8e780b · f8e780b
1 parent 2fdb2c6
commit f8e780b
Showing 1 changed file with 18 additions and 7 deletions.
diff --git a/test/runtests.jl b/test/runtests.jl
@@ -3,9 +3,12 @@ using Base.Test
 import GroveAlg: GroveError, TreeInteger, TreeRational, TreeBase, TreeLoday
 
 d = 5
+@test promote(Grove(3,7),promote(PBTree(2,2),[1,2,3])...) |> typeof <: Tuple
+convert(Grove,[1,2,3]) == convert(Grove,[1 2 3])
 @test treecheck(3,treeindex([1,2,3])) && grovecheck([1,2,3])
 @test sum(GroveError(d)) == 0 == sum(GroveError(Grove(d))) == sum(GroveError(Grove(d).Y))
-@test treecheck([1,2,3]) == treecheck(PBTree([1,2,3])) == treecheck(Grove(3)) == treecheck(Grove(3).Y) == PBTree(3,5) |> treecheck
+@test treecheck([1,2,3]) == treecheck(PBTree([1,2,3])) == treecheck(Grove(3)) ==
+  treecheck(Grove(3).Y) == PBTree(3,5) |> treecheck
 @test treeindexCn(d) == [i//Cn(d) for i ∈ 1:Cn(d)] == treeindex(Grove(d).Y)//Cn(d)
 @test σ(σ(Grove(3,7))) == Grove(3,7)
 @test graft([1,2,3],[2,1]) |> Grove == graft([1,2],[3,2,1]) |> σ
@@ -15,15 +18,14 @@ d = 5
 @test [1,2,3] |> grovesort! == [1,2,3] |> Grove
 @test Grove(d) |> grovesort! == Grove(d) == Grove(d,2^Cn(d)-1)
 @test Grove(d) == d |> TreeBase |> TreeLoday
-@test (k = Grove(d) |> TreeBase |> TreeLoday;
-  k == k |> TreeBase |> TreeLoday)
+@test (k = Grove(d) |> TreeBase |> TreeLoday; k == k |> TreeBase |> TreeLoday)
 @test [TreeBase([1:d...])] == TreeBase(d,1)
 @test Grove(d) |> TreeBase |> TreeInteger == Grove(d) |> TreeInteger
 @test (grovesort(false); TreeLoday(d,treeindex(Grove(d))) == Grove(d))
 @test (grovesort(false); Grove(d)) == (grovesort(true); Grove(d))
 @test Grove(d,groveindex(Grove(d).Y)) == TreeLoday(d)
-@test GroveBin([1,4,2,1]) |> Grove |> grovecheck
-@test TreeLoday(d,grovebit(Grove(d))) == Grove(d) |> GroveBin |> Grove
+@test GroveBin([1,4,2,1]) |> Grove |> grovebit |> Grove |> grovecheck
+@test TreeLoday(d,grovebit(GroveBin(Grove(d)))) == Grove(d) |> GroveBin |> Grove
 @test Grove(d) |> groveindex == 2^Cn(d)-1 == Grove(d) |> grovebit |> groveindex
 @test TreeRational(d) == TreeRational(Grove(d))
 @test TreeRational(d,BigInt(d)) == Grove(d,d) |> TreeRational
@@ -32,9 +34,18 @@ d = 5
 @test TreeInteger(d,d)==TreeInteger(d,grovebit(d,d))==TreeInteger(d,treeindex(Grove(d,d)))
 @test (j = ([1,2]⊣[1,2])+[1,2,3]; TreeLoday(7,groveindex(j)) == j)
 @test (j = [1,2,3]+([1,2]⊢[1,2]); TreeLoday(7,groveindex(j)) == j)
-@test (Grove([1,2,3])⊣PBTree([1,3,1])) == (PBTree([1,2,3])⊣Grove([1,3,1])) == (Grove([1,2,3])⊣Grove([1,3,1])) == ((Grove([1,2,3]).Y)⊣(PBTree([1,3,1]).Y))
-@test (Grove([1,2,3])⊢PBTree([1,3,1])) == (PBTree([1,2,3])⊢Grove([1,3,1])) == (Grove([1,2,3])⊢Grove([1,3,1])) == ((Grove([1,2,3]).Y)⊢(PBTree([1,3,1]).Y))
+@test (Grove([1,2,3])⊣PBTree([1,3,1])) == (PBTree([1,2,3])⊣Grove([1,3,1])) ==
+  (Grove([1,2,3])⊣Grove([1,3,1])) == ((Grove([1,2,3]).Y)⊣(PBTree([1,3,1]).Y))
+@test (Grove([1,2,3])⊢PBTree([1,3,1])) == (PBTree([1,2,3])⊢Grove([1,3,1])) ==
+  (Grove([1,2,3])⊢Grove([1,3,1])) == ((Grove([1,2,3]).Y)⊢(PBTree([1,3,1]).Y))
+@test (GroveBin(Grove(5))⊣Grove(5)) == (Grove(5)⊣GroveBin(Grove(5)))
+@test (GroveBin(Grove(5))⊢Grove(5)) == (Grove(5)⊢GroveBin(Grove(5)))
 @test Grove(8,groveindex(Grove(5,1000)+Grove(3,7)))==Grove(5,1000)+Grove(3,7)
 @test grovecomposition(3,groveindex(3)) == 4
 @test println(Grove(3,7)) == print(TreeBase([1:d...]))
 @test TreeBase(d,1) |> print == println([Grove(d,1)])
+@test display(Grove(d,1)) == display(GroveBin(Grove(d,1))); print('\n')
+@test ((x,y)=(Grove(3,7),Grove(2,1)); σ(x+y)==σ(y)+σ(x) && σ(x*y)==σ(x)*σ(y))
+@test ((x,y)=(PBTree(3,4),PBTree(4,7)); σ(x∨y)==Grove(PBTree(σ(y).Y[:])∨PBTree(σ(x).Y[:]))
+  && σ(↗(x,y))==Grove(↖(PBTree(σ(y).Y[:]),PBTree(σ(x).Y[:])))
+  && σ(↖(x,y))==Grove(↗(PBTree(σ(y).Y[:]),PBTree(σ(x).Y[:]))))