|
| 1 | + |
| 2 | +module TestEllipsisNotationCompat # use a module to avoid cluttering the global namespace |
| 3 | + |
| 4 | +using EllipsisNotation |
| 5 | +using HybridArrays |
| 6 | +using Test |
| 7 | + |
| 8 | + |
| 9 | +@testset "Compatibility with EllipsisNotation" begin |
| 10 | + u_array = rand(2, 10) |
| 11 | + u_hybrid = HybridArray{Tuple{2, HybridArrays.Dynamic()}}(copy(u_array)) |
| 12 | + @test u_hybrid ≈ u_array |
| 13 | + @test u_hybrid[1, ..] ≈ u_array[1, ..] |
| 14 | + @test u_hybrid[.., 1] ≈ u_array[.., 1] |
| 15 | + @test u_hybrid[..] ≈ u_array[..] |
| 16 | + |
| 17 | + @test_broken typeof(u_hybrid[1, ..]) == typeof(u_hybrid[1, :]) |
| 18 | + @test_broken typeof(u_hybrid[.., 1]) == typeof(u_hybrid[:, 1]) |
| 19 | + @test typeof(u_hybrid[..]) == typeof(u_hybrid[:, :]) |
| 20 | + |
| 21 | + @inferred u_hybrid[1, ..] |
| 22 | + @inferred u_hybrid[.., 1] |
| 23 | + @inferred u_hybrid[..] |
| 24 | + |
| 25 | + let new_values = rand(10) |
| 26 | + u_array[1, ..] .= new_values |
| 27 | + u_hybrid[1, ..] .= new_values |
| 28 | + @test u_hybrid ≈ u_array |
| 29 | + @test u_hybrid[1, ..] ≈ u_array[1, ..] |
| 30 | + @test u_hybrid[.., 1] ≈ u_array[.., 1] |
| 31 | + @test u_hybrid[..] ≈ u_array[..] |
| 32 | + end |
| 33 | + |
| 34 | + let new_values = rand(2) |
| 35 | + u_array[.., 1] .= new_values |
| 36 | + u_hybrid[.., 1] .= new_values |
| 37 | + @test u_hybrid ≈ u_array |
| 38 | + @test u_hybrid[1, ..] ≈ u_array[1, ..] |
| 39 | + @test u_hybrid[.., 1] ≈ u_array[.., 1] |
| 40 | + @test u_hybrid[..] ≈ u_array[..] |
| 41 | + end |
| 42 | + |
| 43 | + let new_values = rand(2, 10) |
| 44 | + u_array .= new_values |
| 45 | + u_hybrid .= new_values |
| 46 | + @test u_hybrid ≈ u_array |
| 47 | + @test u_hybrid[1, ..] ≈ u_array[1, ..] |
| 48 | + @test u_hybrid[.., 1] ≈ u_array[.., 1] |
| 49 | + @test u_hybrid[..] ≈ u_array[..] |
| 50 | + end |
| 51 | +end |
| 52 | + |
| 53 | + |
| 54 | +@testset "Compatibility with Cartesian indices" begin |
| 55 | + u_array = rand(2, 3, 4) |
| 56 | + u_hybrid = HybridArray{Tuple{2, 3, 4}}(copy(u_array)) |
| 57 | + @test u_hybrid ≈ u_array |
| 58 | + @test u_hybrid[CartesianIndex(1, 2), :] ≈ u_array[CartesianIndex(1, 2), :] |
| 59 | + @test u_hybrid[:, CartesianIndex(1, 2)] ≈ u_array[:, CartesianIndex(1, 2)] |
| 60 | + |
| 61 | + @test_broken typeof(u_hybrid[CartesianIndex(1, 2), :]) == typeof(u_hybrid[1, 2, :]) |
| 62 | + @test_broken typeof(u_hybrid[:, CartesianIndex(1, 2)]) == typeof(u_hybrid[:, 1, 2]) |
| 63 | + |
| 64 | + @inferred u_hybrid[CartesianIndex(1, 2), :] |
| 65 | + @inferred u_hybrid[:, CartesianIndex(1, 2)] |
| 66 | + @inferred u_hybrid[CartesianIndex(1, 2, 3)] |
| 67 | + |
| 68 | + let new_values = rand(4) |
| 69 | + u_array[CartesianIndex(1, 2), :] .= new_values |
| 70 | + u_hybrid[CartesianIndex(1, 2), :] .= new_values |
| 71 | + @test u_hybrid ≈ u_array |
| 72 | + @test u_hybrid[CartesianIndex(1, 2), :] ≈ u_array[CartesianIndex(1, 2), :] |
| 73 | + @test u_hybrid[:, CartesianIndex(1, 2)] ≈ u_array[:, CartesianIndex(1, 2)] |
| 74 | + end |
| 75 | + |
| 76 | + let new_values = rand(2) |
| 77 | + u_array[:, CartesianIndex(1, 2)] .= new_values |
| 78 | + u_hybrid[:, CartesianIndex(1, 2)] .= new_values |
| 79 | + @test u_hybrid ≈ u_array |
| 80 | + @test u_hybrid[CartesianIndex(1, 2), :] ≈ u_array[CartesianIndex(1, 2), :] |
| 81 | + @test u_hybrid[:, CartesianIndex(1, 2)] ≈ u_array[:, CartesianIndex(1, 2)] |
| 82 | + end |
| 83 | +end |
| 84 | + |
| 85 | + |
| 86 | +end # module |
0 commit comments