12
12
p = randperm (n)
13
13
ip = invperm (p)
14
14
15
- t = (p... )
15
+ t = (p... , )
16
16
17
17
i = rand (1 : n)
18
18
@@ -24,8 +24,8 @@ i = rand(1:n)
24
24
25
25
@test @inferred (TupleTools. getindices (t, (1 ,2 ,3 ))) == t[1 : 3 ]
26
26
27
- @test @inferred (TupleTools. deleteat (t, i)) == (deleteat! (copy (p), i)... )
28
- @test @inferred (TupleTools. insertat (t, i, (1 ,2 ,3 ))) == (vcat (p[1 : i- 1 ], [1 ,2 ,3 ], p[i+ 1 : n])... )
27
+ @test @inferred (TupleTools. deleteat (t, i)) == (deleteat! (copy (p), i)... , )
28
+ @test @inferred (TupleTools. insertat (t, i, (1 ,2 ,3 ))) == (vcat (p[1 : i- 1 ], [1 ,2 ,3 ], p[i+ 1 : n])... , )
29
29
@test @inferred (TupleTools. vcat ((1 ,2 ,3 ),4 ,(5 ,),(),(6 ,7 ,8 ))) == (1 ,2 ,3 ,4 ,5 ,6 ,7 ,8 )
30
30
31
31
@test @inferred (TupleTools. sum (t)) == sum (t)
@@ -38,7 +38,7 @@ i = rand(1:n)
38
38
@test @inferred (TupleTools. indmin (t)) == indmin (t)
39
39
@test @inferred (TupleTools. indmax (t)) == indmax (t)
40
40
41
- @test @inferred (TupleTools. sort (t; rev = true )) == (sort (p; rev = true )... )
42
- @test @inferred (TupleTools. sortperm (t)) == (sortperm (p)... )
43
- @test @inferred (TupleTools. invperm (t)) == (ip... )
44
- @test @inferred (TupleTools. permute (t, t)) == (p[p]. .. )
41
+ @test @inferred (TupleTools. sort (t; rev = true )) == (sort (p; rev = true )... , )
42
+ @test @inferred (TupleTools. sortperm (t)) == (sortperm (p)... , )
43
+ @test @inferred (TupleTools. invperm (t)) == (ip... , )
44
+ @test @inferred (TupleTools. permute (t, t)) == (p[p]. .. , )
0 commit comments