passes & fails

Author: mcabbott

test/parsing.jl

@@ -128,7 +128,7 @@ using Tullio, Test, LinearAlgebra
     @test H[1,:] == M[2,:] # but H[3,:] gets written into twice.
 
     J′ = [1,2,10]
-    @tullio H′[J′[i'],k] := A[k] avx=false # StackOverflowError
+    @tullio H′[J′[i'],k] := A[k]
     @test size(H′) == (10, length(A))
     @test H′[2,:] == A
     @test H′[3,4] == 0 # zeroed before being written into
@@ -221,7 +221,7 @@ end
     # scatter operation
     D = similar(A, 10, 10) .= 999
     inds = [2,3,5,2]
-    @tullio D[inds[i],j] = A[j] avx=false # StackOverflowError
+    @tullio D[inds[i],j] = A[j]
     @test D[2,:] == A
     @test D[4,4] != 0 # not zeroed before writing.
 
@@ -410,7 +410,7 @@ end
     @test vcat(B, fill(B[end],5)) == @tullio D[i] := min(A[i], B[clamp(i)])
     @test [4,16,36,64,100,4] == @tullio E[i] := A[mod(2i)]  i in 1:6
 
-    @test vcat(zeros(5), B, zeros(5)) == @tullio C[i] := B[pad(i-5,5)]  avx=false # 1.4
+    @test vcat(zeros(5), B, zeros(5)) == @tullio C[i] := B[pad(i-5,5)]  avx=false # no method matching _vload(::VectorizationBase.FastRange{Int64,
     @test vcat(zeros(2), A, zeros(3)) == @tullio D[i+_] := A[pad(i,2,3)]
     @test vcat(A, zeros(10)) == @tullio E[i] := A[pad(i)]  i in 1:20
 
@@ -456,7 +456,7 @@ end
 
     @test true == @tullio (&) p := A[i] > 0
     @test true === @tullio (&) p := A[i] > 0
-    @test true == @tullio (|) q := A[i] > 50
+    @test true == @tullio (|) q := A[i] > 50  avx=false # zero_mask not defined
 
     # in-place
     C = copy(A)
@@ -477,7 +477,7 @@ end
     @test 200 == @tullio (max) m := A[i] init=200
     @tullio (max) C[i] := i^2   (i in 1:10, j in 1:1)  init=33.3 # widens type
     @test C == max.(33.3, A)
-    @tullio C[i] := 0   (i in 1:10, j in 1:1)  init=randn() tensor=false # runs once
+    @tullio C[i] := 0   (i in 1:10, j in 1:1)  init=randn() avx=false tensor=false # UndefVarError: ##op#1444_0__1 not defined
     @test C == fill(C[1], 10)
 
     # more dimensions
@@ -513,11 +513,11 @@ end
 
     # promotion of init & += cases:
     B = rand(10)
-    @test sum(B.^2)+2 ≈ @tullio s2 := B[i]^2 init=2 threads=false avx=false # InexactError: Int64 on LV 0.8
+    @test sum(B.^2)+2 ≈ @tullio s2 := B[i]^2 init=2 threads=false
     s3 = 3
     @test sum(B.^2)+3 ≈ @tullio s3 += B[i]^2
     s4 = 4im
-    @test sum(B.^2)+4im ≈ @tullio s4 += B[i]^2 avx=false # TypeError: in AbstractSIMD, in T, expected T<:(Union{Bool, Float32
+    @test sum(B.^2)+4im ≈ @tullio s4 += B[i]^2
 
     # no reduction means no redfun, and no init:
     @test_throws LoadError @eval @tullio (max) A2[i] := A[i]^2
@@ -601,7 +601,7 @@ end
     @test_throws LoadError @eval @tullio A[i] := (1:10)[i]^2  threads=:maybe
 
     # keyword verbose accepts values [true, false, 2, 3]
-    @tullio A[i] := (1:10)[i]^2  verbose=1 avx=false # @error: rejected by LoopVectorization's check_args
+    @tullio A[i] := (1:10)[i]^2  verbose=1
     @tullio A[i] := (1:10)[i]^2  verbose=false
     @test_throws LoadError @eval @tullio A[i] := (1:10)[i]^2  verbose=4