|
| | q_bases.x |
| |
| | q_bases.y |
| |
| | q_bases.z |
| |
| | q_bases.args = parse_args() |
| |
| | q_bases.path = os.path.abspath(args.output) |
| |
| list | q_bases.dims = [1, 2, 3] |
| |
| list | q_bases.orders = [0, 1, 2, 3, -2] |
| |
| str | q_bases.namev = f"auto_q_bases_{dim}d_val" |
| |
| str | q_bases.namen = f"auto_q_bases_{dim}d_nodes" |
| |
| str | q_bases.nameg = f"auto_q_bases_{dim}d_grad" |
| |
| str | q_bases.cppv = f"#include \"{namev}.hpp\"\n\n\n" |
| |
| str | q_bases.cppn = f"#include \"{namen}.hpp\"\n\n\n" |
| |
| str | q_bases.cppg = f"#include \"{nameg}.hpp\"\n\n\n" |
| |
| str | q_bases.eextern = "" |
| |
| str | q_bases.hppv = "#pragma once\n\n#include <Eigen/Dense>\n#include <cassert>\n\n" |
| |
| str | q_bases.hppn = "#pragma once\n\n#include <Eigen/Dense>\n#include <cassert>\n\n" |
| |
| str | q_bases.hppg = "#pragma once\n\n#include <Eigen/Dense>\n#include <cassert>\n\n" |
| |
| str | q_bases.suffix = 2 else ("_3d" if dim == 3 else "_1d") |
| |
| str | q_bases.unique_nodes |
| |
| str | q_bases.unique_fun |
| |
| str | q_bases.dunique_fun |
| |
| list | q_bases.vertices = [[0], [1]] |
| |
| list | q_bases.orderss = orders + [4, 5, 6] |
| |
| | q_bases.nbf |
| |
| | q_bases.N |
| |
| | q_bases.points |
| |
| | q_bases.fe = Lagrange(dim, 2) |
| |
| tuple | q_bases.tmp |
| |
| | q_bases.current_indices = list(range(0, len(fe.points))) |
| |
| list | q_bases.indices = [] |
| |
| list | q_bases.vv = vertices[i] |
| |
| int | q_bases.norm = 0 |
| |
| | q_bases.nn = max(0, abs(order) - 1) |
| |
| | q_bases.npts = int(nn * nn) |
| |
| | q_bases.reverse |
| |
| int | q_bases.orderN = 0 else "m"+str(-order) |
| |
| str | q_bases.nodes |
| |
| str | q_bases.func |
| |
| str | q_bases.dfunc |
| |
| str | q_bases.base = "auto x=uv.col(0).array();" |
| |
| str | q_bases.dbase = base |
| |
| list | q_bases.real_index = indices[i] |
| |
| str | q_bases.tcppg = f"#include \"{nameg}.hpp\"\n\n\n" |
| |
| str | q_bases.hpp = "#pragma once\n\n#include <Eigen/Dense>\n#include <cassert>\n\n" |
| |