Use initializer lists to construct container<>, lst.

[ginac.git] / check / exam_clifford.cpp

diff --git a/check/exam_clifford.cpp b/check/exam_clifford.cpp
index 24655e4877bf8a540a7a52c063547e7f2d52e612..0430e2daccd4df8bedb1ec1a55297cf3d1b7408d 100644 (file)
--- a/check/exam_clifford.cpp
+++ b/check/exam_clifford.cpp
@@ -70,11 +70,11 @@ static unsigned check_equal_simplify_term(const ex & e1, const ex & e2, idx & mu
        for (int j=0; j<4; j++) {
                ex esub = e.subs(
                                is_a<varidx>(mu)
-                                       ? lst (
+                                       ? lst {
                                                        mu == idx(j, mu.get_dim()),
                                                        ex_to<varidx>(mu).toggle_variance() == idx(j, mu.get_dim())
-                                               )
-                                       : lst(mu == idx(j, mu.get_dim()))
+                                               }
+                                       : lst{mu == idx(j, mu.get_dim())}
                        );
                if (!(canonicalize_clifford(esub).is_zero())) {
                        clog << "simplify_indexed(" << e1 << ") - (" << e2 << ") erroneously returned "
@@ -242,7 +242,7 @@ static unsigned clifford_check3()
        result += check_equal(dirac_trace(e, 0), dirac_ONE(1) / 4);
        result += check_equal(dirac_trace(e, 1), dirac_ONE(0) / 4);
        result += check_equal(dirac_trace(e, 2), e);
-       result += check_equal(dirac_trace(e, lst(0, 1)), 1);
+       result += check_equal(dirac_trace(e, lst{0, 1}), 1);
 
        e = dirac_gamma(mu, 0) * dirac_gamma(mu.toggle_variance(), 1) * dirac_gamma(nu, 0) * dirac_gamma(nu.toggle_variance(), 1);
        result += check_equal_simplify(dirac_trace(e, 0), 4 * dim * dirac_ONE(1));
@@ -250,7 +250,7 @@ static unsigned clifford_check3()
        // Fails with new tinfo mechanism because the order of gamma matrices with different rl depends on luck.
        // TODO: better check.
        //result += check_equal_simplify(dirac_trace(e, 2), canonicalize_clifford(e)); // e will be canonicalized by the calculation of the trace
-       result += check_equal_simplify(dirac_trace(e, lst(0, 1)), 16 * dim);
+       result += check_equal_simplify(dirac_trace(e, lst{0, 1}), 16 * dim);
 
        return result;
 }
@@ -417,17 +417,17 @@ template <typename IDX> unsigned clifford_check6(const matrix &A)
        realsymbol s("s"), t("t"), x("x"), y("y"), z("z");
 
        ex c = clifford_unit(nu, A, 1);
-       e = lst_to_clifford(lst(t, x, y, z), mu, A, 1) * lst_to_clifford(lst(1, 2, 3, 4), c);
+       e = lst_to_clifford(lst{t, x, y, z}, mu, A, 1) * lst_to_clifford(lst{1, 2, 3, 4}, c);
        e1 = clifford_inverse(e);
        result += check_equal_simplify_term2((e*e1).simplify_indexed(), dirac_ONE(1));
 
 /* lst_to_clifford() and clifford_to_lst()  check for vectors*/
-       e = lst(t, x, y, z);
+       e = lst{t, x, y, z};
        result += check_equal_lst(clifford_to_lst(lst_to_clifford(e, c), c, false), e);
        result += check_equal_lst(clifford_to_lst(lst_to_clifford(e, c), c, true), e);
 
 /* lst_to_clifford() and clifford_to_lst()  check for pseudovectors*/
-       e = lst(s, t, x, y, z);
+       e = lst{s, t, x, y, z};
        result += check_equal_lst(clifford_to_lst(lst_to_clifford(e, c), c, false), e);
        result += check_equal_lst(clifford_to_lst(lst_to_clifford(e, c), c, true), e);
 
@@ -436,32 +436,32 @@ template <typename IDX> unsigned clifford_check6(const matrix &A)
        c = clifford_unit(nu, A);
 
        e = clifford_moebius_map(0, dirac_ONE(), 
-                                                        dirac_ONE(), 0, lst(t, x, y, z), A); 
+                                                        dirac_ONE(), 0, lst{t, x, y, z}, A);
 /* this is just the inversion*/
        M1 = 0, dirac_ONE(),
                dirac_ONE(), 0;
-       e1 = clifford_moebius_map(M1, lst(t, x, y, z), A); 
+       e1 = clifford_moebius_map(M1, lst{t, x, y, z}, A);
 /* the inversion again*/
        result += check_equal_lst(e, e1);
 
-       e1 = clifford_to_lst(clifford_inverse(lst_to_clifford(lst(t, x, y, z), mu, A)), c);
+       e1 = clifford_to_lst(clifford_inverse(lst_to_clifford(lst{t, x, y, z}, mu, A)), c);
        result += check_equal_lst(e, e1);
 
-       e = clifford_moebius_map(dirac_ONE(), lst_to_clifford(lst(1, 2, 3, 4), nu, A), 
-                                                        0, dirac_ONE(), lst(t, x, y, z), A); 
+       e = clifford_moebius_map(dirac_ONE(), lst_to_clifford(lst{1, 2, 3, 4}, nu, A),
+                                                        0, dirac_ONE(), lst{t, x, y, z}, A);
 /*this is just a shift*/
-       M2 = dirac_ONE(), lst_to_clifford(lst(1, 2, 3, 4), c),
+       M2 = dirac_ONE(), lst_to_clifford(lst{1, 2, 3, 4}, c),
                0, dirac_ONE();
-       e1 = clifford_moebius_map(M2, lst(t, x, y, z), c); 
+       e1 = clifford_moebius_map(M2, lst{t, x, y, z}, c);
 /* the same shift*/
        result += check_equal_lst(e, e1);
 
-       result += check_equal(e, lst(t+1, x+2, y+3, z+4));
+       result += check_equal(e, lst{t+1, x+2, y+3, z+4});
 
 /* Check the group law for Moebius maps */
        e = clifford_moebius_map(M1, ex_to<lst>(e1), c);
 /*composition of M1 and M2*/
-       e1 = clifford_moebius_map(M1.mul(M2), lst(t, x, y, z), c);
+       e1 = clifford_moebius_map(M1.mul(M2), lst{t, x, y, z}, c);
 /* the product M1*M2*/
        result += check_equal_lst(e, e1);
        return result;
@@ -546,7 +546,7 @@ static unsigned clifford_check8()
        realsymbol a("a");
        varidx mu(symbol("mu", "\\mu"), 1);
 
-       ex e = clifford_unit(mu, diag_matrix(lst(-1))), e0 = e.subs(mu==0);
+       ex e = clifford_unit(mu, diag_matrix(lst{-1})), e0 = e.subs(mu==0);
        result += ( exp(a*e0)*e0*e0 == -exp(e0*a) ) ? 0 : 1;
 
        return result;
@@ -565,15 +565,15 @@ unsigned exam_clifford()
        result += clifford_check5(); cout << '.' << flush;
 
        // anticommuting, symmetric examples
-       result += clifford_check6<varidx>(ex_to<matrix>(diag_matrix(lst(-1, 1, 1, 1))));
-       result += clifford_check6<idx>(ex_to<matrix>(diag_matrix(lst(-1, 1, 1, 1))));; cout << '.' << flush;
-       result += clifford_check6<varidx>(ex_to<matrix>(diag_matrix(lst(-1, -1, -1, -1))))+clifford_check6<idx>(ex_to<matrix>(diag_matrix(lst(-1, -1, -1, -1))));; cout << '.' << flush;
-       result += clifford_check6<idx>(ex_to<matrix>(diag_matrix(lst(-1, 1, 1, -1))))+clifford_check6<idx>(ex_to<matrix>(diag_matrix(lst(-1, 1, 1, -1))));; cout << '.' << flush;
-       result += clifford_check6<varidx>(ex_to<matrix>(diag_matrix(lst(-1, 0, 1, -1))))+clifford_check6<idx>(ex_to<matrix>(diag_matrix(lst(-1, 0, 1, -1))));; cout << '.' << flush;
-       result += clifford_check6<varidx>(ex_to<matrix>(diag_matrix(lst(-3, 0, 2, -1))))+clifford_check6<idx>(ex_to<matrix>(diag_matrix(lst(-3, 0, 2, -1))));; cout << '.' << flush;
+       result += clifford_check6<varidx>(ex_to<matrix>(diag_matrix(lst{-1, 1, 1, 1})));
+       result += clifford_check6<idx>(ex_to<matrix>(diag_matrix(lst{-1, 1, 1, 1})));; cout << '.' << flush;
+       result += clifford_check6<varidx>(ex_to<matrix>(diag_matrix(lst{-1, -1, -1, -1})))+clifford_check6<idx>(ex_to<matrix>(diag_matrix(lst{-1, -1, -1, -1})));; cout << '.' << flush;
+       result += clifford_check6<idx>(ex_to<matrix>(diag_matrix(lst{-1, 1, 1, -1})))+clifford_check6<idx>(ex_to<matrix>(diag_matrix(lst{-1, 1, 1, -1})));; cout << '.' << flush;
+       result += clifford_check6<varidx>(ex_to<matrix>(diag_matrix(lst{-1, 0, 1, -1})))+clifford_check6<idx>(ex_to<matrix>(diag_matrix(lst{-1, 0, 1, -1})));; cout << '.' << flush;
+       result += clifford_check6<varidx>(ex_to<matrix>(diag_matrix(lst{-3, 0, 2, -1})))+clifford_check6<idx>(ex_to<matrix>(diag_matrix(lst{-3, 0, 2, -1})));; cout << '.' << flush;
 
        realsymbol s("s"), t("t"); // symbolic entries in matric
-       result += clifford_check6<varidx>(ex_to<matrix>(diag_matrix(lst(-1, 1, s, t))))+clifford_check6<idx>(ex_to<matrix>(diag_matrix(lst(-1, 1, s, t))));; cout << '.' << flush;
+       result += clifford_check6<varidx>(ex_to<matrix>(diag_matrix(lst{-1, 1, s, t})))+clifford_check6<idx>(ex_to<matrix>(diag_matrix(lst{-1, 1, s, t})));; cout << '.' << flush;
 
        matrix A(4, 4);
        A = 1,  0,  0,  0, // anticommuting, not symmetric, Tr=0