emerge 1.0.4__py3-none-any.whl → 1.0.6__py3-none-any.whl

emerge/_emerge/solver.py

@@ -90,11 +90,16 @@ class SolveReport:
     sorter: str = 'None'
     precon: str = 'None'
     aux: dict[str, str] = field(default_factory=dict)
+    worker_name: str = 'Unknown Worker'
 
     def add(self, **kwargs: str):
         for key, value in kwargs.items():
             self.aux[key] = str(value)
     
+    @property
+    def mdof(self) -> float:
+        return (self.ndof**2)/((self.simtime+1e-6)*1e6)
+    
     def logprint(self, print_cal: Callable | None = None):
         if print_cal is None:
             print_cal = print
@@ -113,6 +118,7 @@ class SolveReport:
         parts.append(fmt("DOFsSolve", self.ndof_solve))
         parts.append(fmt("NNZSolve", self.nnz_solve))
         parts.append(fmt("Exit", self.exit_code))
+        parts.append(fmt("Worker",self.worker_name))
 
         if self.aux:
             for k, v in self.aux.items():
@@ -155,6 +161,7 @@ class SolveReport:
         row("DOFs (Solve)", self.ndof_solve)
         row("NNZ (Solve)", self.nnz_solve)
         row("Exit Code", self.exit_code)
+        row("Worker", self.worker_name)
         print_cal(border)
 
         if self.aux:
@@ -164,6 +171,8 @@ class SolveReport:
                 row(str(k), v)
             print_cal(border)
 
+def _pfx(name: str, id: int = 0) -> str:
+    return f'[{name}-j{id:03d}]'
 ############################################################
 #                 EIGENMODE FILTER ROUTINE                #
 ############################################################
@@ -322,9 +331,10 @@ class Solver:
     req_sorter: bool = False
     released_gil: bool = False
 
-    def __init__(self):
+    def __init__(self, pre: str = ''):
         self.own_preconditioner: bool = False
         self.initialized: bool = False
+        self.pre: str = pre
 
     def __str__(self) -> str:
         return f'{self.__class__.__name__}'
@@ -360,8 +370,9 @@ class EigSolver:
     real_only: bool = False
     req_sorter: bool = False
 
-    def __init__(self):
+    def __init__(self, pre: str = ''):
         self.own_preconditioner: bool = False
+        self.pre: str = pre
 
     def initialize(self) -> None:
         return None
@@ -370,7 +381,7 @@ class EigSolver:
         return f'{self.__class__.__name__}'
     
     def duplicate(self) -> Solver:
-        return self.__class__()
+        return self.__class__(self.pre)
 
     def eig(self, A: csr_matrix | csr_matrix, B: csr_matrix | csr_matrix, nmodes: int = 6, 
             target_k0: float = 0.0, which: str = 'LM', sign: float = 1.):
@@ -444,10 +455,10 @@ class SolverBicgstab(Solver):
 
     def callback(self, xk):
         convergence = np.linalg.norm((self.A @ xk - self.b))
-        logger.info(f'Iteration {convergence:.4f}')
+        logger.info(self.pre + f'Iteration {convergence:.4f}')
 
     def solve(self, A, b, precon, reuse_factorization: bool = False, id: int = -1) -> tuple[np.ndarray, SolveReport]:
-        logger.info(f'[ID={id}] Calling BiCGStab.')
+        logger.info(f'{_pfx(self.pre,id)} Calling BiCGStab.')
         self.A = A
         self.b = b
         if precon.M is not None:
@@ -466,10 +477,10 @@ class SolverGCROTMK(Solver):
 
     def callback(self, xk):
         convergence = np.linalg.norm((self.A @ xk - self.b))
-        logger.info(f'Iteration {convergence:.4f}')
+        logger.info(self.pre + f'Iteration {convergence:.4f}')
 
     def solve(self, A: csr_matrix, b: np.ndarray, precon: Preconditioner, reuse_factorization: bool = False, id: int = -1) -> tuple[np.ndarray, SolveReport]:
-        logger.info(f'[ID={id}] Calling GCRO-T(m,k) algorithm')
+        logger.info(f'{_pfx(self.pre,id)} Calling GCRO-T(m,k) algorithm')
         self.A = A
         self.b = b
         if precon.M is not None:
@@ -492,10 +503,10 @@ class SolverGMRES(Solver):
 
     def callback(self, norm):
         #convergence = np.linalg.norm((self.A @ xk - self.b))
-        logger.info(f'Iteration {norm:.4f}')
+        logger.info(self.pre + f'Iteration {norm:.4f}')
 
     def solve(self, A, b, precon, reuse_factorization: bool = False, id: int = -1) -> tuple[np.ndarray, SolveReport]:
-        logger.info(f'[ID={id}] Calling GMRES Function.')
+        logger.info(f'{_pfx(self.pre,id)} Calling GMRES Function.')
         self.A = A
         self.b = b
         if precon.M is not None:
@@ -516,8 +527,8 @@ class SolverSuperLU(Solver):
     real_only: bool = False
     released_gil: bool = True
 
-    def __init__(self):
-        super().__init__()
+    def __init__(self, pre: str):
+        super().__init__(pre)
         self.atol = 1e-5
 
         self.A: np.ndarray = None
@@ -527,7 +538,7 @@ class SolverSuperLU(Solver):
         self.lu = None
     
     def duplicate(self) -> Solver:
-        new_solver = self.__class__()
+        new_solver = self.__class__(self.pre)
         new_solver._pivoting_threshold = self._pivoting_threshold
         return new_solver
 
@@ -537,11 +548,11 @@ class SolverSuperLU(Solver):
             self._pivoting_threshold = pivoting_threshold
     
     def solve(self, A, b, precon, reuse_factorization: bool = False, id: int = -1) -> tuple[np.ndarray, SolveReport]:
-        logger.info(f'[ID={id}] Calling SuperLU Solver.')
+        logger.info(f'{_pfx(self.pre,id)} Calling SuperLU Solver.')
 
         self.single = True
         if not reuse_factorization:
-            logger.trace('Computing LU-Decomposition')
+            logger.trace(self.pre + 'Computing LU-Decomposition')
             self.lu = splu(A, permc_spec='MMD_AT_PLUS_A', relax=0, diag_pivot_thresh=self._pivoting_threshold, options=self.options)
         x = self.lu.solve(b)
         aux = {
@@ -554,9 +565,9 @@ class SolverUMFPACK(Solver):
     req_sorter = False
     real_only = False
 
-    def __init__(self):
-        super().__init__()
-        logger.trace('Creating UMFPACK solver')
+    def __init__(self, pre: str):
+        super().__init__(pre)
+        logger.trace(self.pre + 'Creating UMFPACK solver')
         self.A: np.ndarray = None
         self.b: np.ndarray = None
         
@@ -571,7 +582,7 @@ class SolverUMFPACK(Solver):
     def initialize(self):
         if self.initalized:
             return
-        logger.trace('Initializing UMFPACK Solver')
+        logger.trace(self.pre + 'Initializing UMFPACK Solver')
         self.umfpack = um.UmfpackContext('zl')
         self.umfpack.control[um.UMFPACK_PRL] = 0 # ty: ignore
         self.umfpack.control[um.UMFPACK_IRSTEP] = 2 # ty: ignore
@@ -584,7 +595,7 @@ class SolverUMFPACK(Solver):
         self.initalized = True
         
     def reset(self) -> None:
-        logger.trace('Resetting UMFPACK solver state')
+        logger.trace(self.pre + 'Resetting UMFPACK solver state')
         self.fact_symb = False
     
     def set_options(self, pivoting_threshold: float | None = None) -> None:
@@ -595,23 +606,23 @@ class SolverUMFPACK(Solver):
             self._pivoting_threshold = pivoting_threshold
 
     def duplicate(self) -> Solver:
-        new_solver = self.__class__()
+        new_solver = self.__class__(self.pre)
         new_solver.set_options(pivoting_threshold = self._pivoting_threshold)
         return new_solver
 
     def solve(self, A, b, precon, reuse_factorization: bool = False, id: int = -1) -> tuple[np.ndarray, SolveReport]:
-        logger.info(f'[ID={id}] Calling UMFPACK Solver.')
+        logger.info(f'{_pfx(self.pre,id)} Calling UMFPACK Solver.')
         A.indptr  = A.indptr.astype(np.int64)
         A.indices = A.indices.astype(np.int64)
         if self.fact_symb is False:
-            logger.trace(f'[ID={id}] Executing symbollic factorization.')
+            logger.trace(f'{_pfx(self.pre,id)} Executing symbollic factorization.')
             self.umfpack.symbolic(A)
             self.fact_symb = True
         if not reuse_factorization:
-            logger.trace(f'[ID={id}] Executing numeric factorization.')
+            logger.trace(f'{_pfx(self.pre,id)} Executing numeric factorization.')
             self.umfpack.numeric(A)
             self.A = A
-        logger.trace(f'[ID={id}] Solving linear system.')
+        logger.trace(f'{_pfx(self.pre,id)} Solving linear system.')
         x = self.umfpack.solve(um.UMFPACK_A, self.A, b, autoTranspose = False ) # ty: ignore
         aux = {
             "Pivoting Threshold": str(self._pivoting_threshold),
@@ -623,8 +634,8 @@ class SolverPardiso(Solver):
     real_only: bool = False
     req_sorter: bool = False
 
-    def __init__(self):
-        super().__init__()
+    def __init__(self, pre: str):
+        super().__init__(pre)
         self.solver: PardisoInterface | None = None
         self.fact_symb: bool = False
         self.A: np.ndarray = None
@@ -637,29 +648,30 @@ class SolverPardiso(Solver):
         self.initialized = True
         
     def solve(self, A, b, precon, reuse_factorization: bool = False, id: int = -1) -> tuple[np.ndarray, SolveReport]:
-        logger.info(f'[ID={id}] Calling Pardiso Solver')
+        logger.info(f'{_pfx(self.pre,id)} Calling Pardiso Solver')
         if self.fact_symb is False:
-            logger.trace(f'[ID={id}] Executing symbollic factorization.')
+            logger.trace(f'{_pfx(self.pre,id)} Executing symbollic factorization.')
             self.solver.symbolic(A)
             self.fact_symb = True
         if not reuse_factorization:
-            logger.trace(f'[ID={id}] Executing numeric factorization.')
+            logger.trace(f'{_pfx(self.pre,id)} Executing numeric factorization.')
             self.solver.numeric(A)
             self.A = A
-        logger.trace(f'[ID={id}] Solving linear system.')
+        logger.trace(f'{_pfx(self.pre,id)} Solving linear system.')
         x, error = self.solver.solve(A, b)
         if error != 0:
-            logger.error(f'[ID={id}] Terminated with error code {error}')
-            logger.error(self.solver.get_error(error))
-            raise SimulationError(f'[ID={id}] PARDISO Terminated with error code {error}')
+            logger.error(f'{_pfx(self.pre,id)} Terminated with error code {error}')
+            logger.error(self.pre + self.solver.get_error(error))
+            raise SimulationError(f'{_pfx(self.pre,id)} PARDISO Terminated with error code {error}')
         aux = {}
         return x, SolveReport(solver=str(self), exit_code=error, aux=aux)
     
 
 class SolverCuDSS(Solver):
     real_only = False
-    def __init__(self):
-        super().__init__()
+    
+    def __init__(self, pre: str):
+        super().__init__(pre)
         self._cudss: CuDSSInterface | None = None
         self.fact_symb: bool = False
         self.fact_numb: bool = False
@@ -676,18 +688,18 @@ class SolverCuDSS(Solver):
         self.fact_numb = False
 
     def solve(self, A, b, precon, reuse_factorization: bool = False, id: int = -1):
-        logger.info(f'[ID={id}] Calling cuDSS Solver')
+        logger.info(f'{_pfx(self.pre,id)} Calling cuDSS Solver')
         
         if self.fact_symb is False:
-            logger.trace(f'[ID={id}] Starting from symbollic factorization.')
+            logger.trace(f'{_pfx(self.pre,id)} Starting from symbollic factorization.')
             x = self._cudss.from_symbolic(A,b)
             self.fact_symb = True
         else:
             if reuse_factorization:
-                logger.trace(f'[ID={id}] Solving linear system.')
+                logger.trace(f'{_pfx(self.pre,id)} Solving linear system.')
                 x = self._cudss.from_solve(b)
             else:
-                logger.trace(f'[ID={id}] Starting from numeric factorization.')
+                logger.trace(f'{_pfx(self.pre,id)} Starting from numeric factorization.')
                 x = self._cudss.from_numeric(A,b)
         
         return x, SolveReport(solver=str(self), exit_code=0, aux={})
@@ -699,8 +711,6 @@ class SolverCuDSS(Solver):
 
 class SolverLAPACK(EigSolver):
 
-    def __init__(self):
-        super().__init__()
     
     def eig(self, 
             A: csr_matrix | csr_matrix, 
@@ -725,7 +735,7 @@ class SolverLAPACK(EigSolver):
         lam  : (m,) real ndarray      eigenvalues  (m = n or k)
         vecs : (n, m) complex ndarray eigenvectors, B-orthonormal  (xiᴴ B xj = δij)
         """
-        logger.debug('Calling LAPACK eig solver')
+        logger.info(f'{_pfx(self.pre)} Calling LAPACK eig solver')
         lam, vecs = eig(A.toarray(), B.toarray(), overwrite_a=True, overwrite_b=True, check_finite=False)
         lam, vecs = filter_real_modes(lam, vecs, target_k0, 2, 2, sign=sign)
         return lam, vecs
@@ -738,8 +748,6 @@ class SolverLAPACK(EigSolver):
 
 class SolverARPACK(EigSolver):
     """ Implements the Scipy ARPACK iterative eigenmode solver."""
-    def __init__(self):
-        super().__init__()
 
     def eig(self, 
             A: csr_matrix | csr_matrix, 
@@ -748,7 +756,7 @@ class SolverARPACK(EigSolver):
             target_k0: float = 0,
             which: str = 'LM',
             sign: float = 1.0) -> tuple[np.ndarray, np.ndarray]:
-        logger.info(f'Searching around 	β = {target_k0:.2f} rad/m with ARPACK')
+        logger.info(f'{_pfx(self.pre)} Searching around β = {target_k0:.2f} rad/m with ARPACK')
         sigma = sign*(target_k0**2)
         eigen_values, eigen_modes = eigs(A, k=nmodes, M=B, sigma=sigma, which=which)
         return eigen_values, eigen_modes
@@ -758,8 +766,8 @@ class SmartARPACK_BMA(EigSolver):
     
     The Solver searches in a geometric range around the target wave constant.
     """
-    def __init__(self):
-        super().__init__()
+    def __init__(self, pre: str):
+        super().__init__(pre)
         self.symmetric_steps: int = 41
         self.search_range: float = 2.0
         self.energy_limit: float = 1e-4
@@ -772,7 +780,7 @@ class SmartARPACK_BMA(EigSolver):
             which: str = 'LM',
             sign: float = 1.) -> tuple[np.ndarray, np.ndarray]:
 
-        logger.info(f'Searching around 	β = {target_k0:.2f} rad/m with SmartARPACK (BMA)')
+        logger.info(f'{_pfx(self.pre)} Searching around β = {target_k0:.2f} rad/m with SmartARPACK (BMA)')
         qs = np.geomspace(1, self.search_range, self.symmetric_steps)
         tot_eigen_values = []
         tot_eigen_modes = []
@@ -808,8 +816,8 @@ class SmartARPACK(EigSolver):
     
     The Solver searches in a geometric range around the target wave constant.
     """
-    def __init__(self):
-        super().__init__()
+    def __init__(self, pre: str):
+        super().__init__(pre)
         self.symmetric_steps: int = 3
         self.search_range: float = 2.0
         self.energy_limit: float = 1e-4
@@ -821,7 +829,7 @@ class SmartARPACK(EigSolver):
             target_k0: float = 0,
             which: str = 'LM',
             sign: float = 1.) -> tuple[np.ndarray, np.ndarray]:
-        logger.info(f'Searching around 	β = {target_k0:.2f} rad/m with SmartARPACK')
+        logger.info(f'{_pfx(self.pre)} Searching around 	β = {target_k0:.2f} rad/m with SmartARPACK')
         qs = np.geomspace(1, self.search_range, self.symmetric_steps)
         tot_eigen_values = []
         tot_eigen_modes = []
@@ -871,14 +879,14 @@ class EMSolver(Enum):
     SMART_ARPACK_BMA = 7
     CUDSS = 8
 
-    def create_solver(self) -> Solver | EigSolver | None:
+    def create_solver(self, pre: str) -> Solver | EigSolver | None:
         if self==EMSolver.UMFPACK and not _UMFPACK_AVAILABLE:
             return None
         elif self==EMSolver.PARDISO and not _PARDISO_AVAILABLE:
             return None
         if self==EMSolver.CUDSS and not _CUDSS_AVAILABLE:
             return None
-        return self._clss()
+        return self._clss(pre)
 
     @property
     def _clss(self) -> type[Solver]:
@@ -907,11 +915,15 @@ class SolveRoutine:
     and goes through a sequence of steps to solve a linear system or find eigenmodes.
 
     """
-    def __init__(self):
+    def __init__(self, thread_nr: int = 0, proc_nr: int = 0):
+        
+        self.pre: str = ''
+        self._set_name(thread_nr, proc_nr)
+        
         
         self.sorter: Sorter = ReverseCuthillMckee()
         self.precon: Preconditioner = ILUPrecon()
-        self.solvers: dict[EMSolver, Solver | EigSolver] = {slv: slv.create_solver() for slv in EMSolver}
+        self.solvers: dict[EMSolver, Solver | EigSolver] = {slv: slv.create_solver(self.pre) for slv in EMSolver}
         self.solvers = {key: solver for key, solver in self.solvers.items() if solver is not None}
 
         self.parallel: Literal['SI','MT','MP'] = 'SI'
@@ -922,8 +934,11 @@ class SolveRoutine:
         self.use_sorter: bool = False
         self.use_preconditioner: bool = False
         self.use_direct: bool = True
+        
 
-    
+    def _set_name(self, thread_nr: int, proc_nr: int):
+        self.pre = f'p{int(proc_nr):02d}/t{int(thread_nr):02d}'
+        
     def __str__(self) -> str:
         return 'SolveRoutine()'
     
@@ -936,11 +951,11 @@ class SolveRoutine:
         Returns:
             bool: If the solver is legal
         """
-        if any(isinstance(solver, solvertype) for solvertype in self.disabled_solver):
-            logger.warning(f'The selected solver {solver} cannot be used as it is disabled.')
+        if any(isinstance(solver, solvertype.__class__) for solvertype in self.disabled_solver):
+            logger.warning(self.pre + f'The selected solver {solver} cannot be used as it is disabled.')
             return False
         if self.parallel=='MT' and not solver.released_gil:
-            logger.warning(f'The selected solver {solver} cannot be used in MultiThreading as it does not release the GIL')
+            logger.warning(self.pre + f'The selected solver {solver} cannot be used in MultiThreading as it does not release the GIL')
             return False
         return True
     
@@ -969,9 +984,9 @@ class SolveRoutine:
             return solver  # type: ignore
         for alternative in self.all_solvers:
             if self._legal_solver(alternative):
-                logger.debug(f'Falling back on legal solver: {alternative}')
+                logger.debug(self.pre + f'Falling back on legal solver: {alternative}')
                 return alternative
-        raise RuntimeError(f'No legal solver could be found. The following are disabled: {self.disabled_solver}')
+        raise RuntimeError(self.pre + f'No legal solver could be found. The following are disabled: {self.disabled_solver}')
     
     def duplicate(self) -> SolveRoutine:
         """Creates a copy of this SolveRoutine class object.
@@ -1009,13 +1024,15 @@ class SolveRoutine:
         """
         for solver in solvers:
             if isinstance(solver, EMSolver):
-                self.disabled_solver.append(solver.create_solver().__class__)
+                self.disabled_solver.append(self.solvers[solver])
             else:
-                self.disabled_solver.append(solver.__class__)
+                self.disabled_solver.append(solver)
 
     def _configure_routine(self, 
                   parallel: Literal['SI','MT','MP'] = 'SI', 
-                  smart_search: bool = False) -> SolveRoutine:
+                  smart_search: bool = False,
+                  thread_nr: int = 0,
+                  proc_nr: int = 0) -> SolveRoutine:
         """Configure the solver with the given settings
 
         Args:
@@ -1032,6 +1049,12 @@ class SolveRoutine:
         """
         self.parallel = parallel
         self.smart_search = smart_search
+        if thread_nr != 1 or proc_nr != 1:
+            self._set_name(thread_nr, proc_nr)
+            for solver in self.solvers.values():
+                if not isinstance(solver, (Solver, EigSolver)):
+                    continue
+                solver.pre = self.pre
         return self
 
     def configure(self,
@@ -1171,10 +1194,10 @@ class SolveRoutine:
         bsel = b[solve_ids]
         nnz = Asel.nnz
 
-        logger.debug(f'[ID={id}] Removed {NF-NS} prescribed DOFs ({NS:,} left, {nnz:,}≠0)')
+        logger.debug(f'{_pfx(self.pre,id)} Removed {NF-NS} prescribed DOFs ({NS:,} left, {nnz:,}≠0)')
 
         if solver.real_only:
-            logger.debug(f'[ID={id}] Converting to real matrix')
+            logger.debug(f'{_pfx(self.pre,id)} Converting to real matrix')
             Asel, bsel = complex_to_real_block(Asel, bsel)
 
         # SORT
@@ -1197,8 +1220,8 @@ class SolveRoutine:
         x_solved, report = solver.solve(Asorted, bsorted, self.precon, reuse_factorization=reuse, id=id)
         end = time.time()
         simtime = end-start
-        logger.info(f'[ID={id}] Elapsed time taken: {simtime:.3f} seconds')
-        logger.debug(f'[ID={id}] O(N²) performance = {(NS**2)/((end-start+1e-6)*1e6):.3f} MDoF/s')
+        logger.info(f'{_pfx(self.pre,id)} Elapsed time taken: {simtime:.3f} seconds')
+        logger.debug(f'{_pfx(self.pre,id)} O(N²) performance = {(NS**2)/((end-start+1e-6)*1e6):.3f} MDoF/s')
         
         if self.use_sorter and solver.req_sorter:
             x = self.sorter.unsort(x_solved)
@@ -1206,14 +1229,14 @@ class SolveRoutine:
             x = x_solved
         
         if solver.real_only:
-            logger.debug(f'[ID={id}] Converting back to complex matrix')
+            logger.debug(f'{_pfx(self.pre,id)} Converting back to complex matrix')
             x = real_to_complex_block(x)
 
         solution = np.zeros((NF,), dtype=np.complex128)
         
         solution[solve_ids] = x
 
-        logger.debug(f'[ID={id}] Solver complete!')
+        logger.debug(f'{_pfx(self.pre,id)} Solver complete!')
         report.jobid = id
         report.sorter = str(sorter)
         report.simtime = simtime
@@ -1222,6 +1245,7 @@ class SolveRoutine:
         report.nnz_solve = Asorted.nnz
         report.ndof_solve = bsorted.shape[0]
         report.precon = precon
+        report.worker_name = self.pre
 
         return solution, report
     
@@ -1258,7 +1282,7 @@ class SolveRoutine:
         NF = A.shape[0]
         NS = solve_ids.shape[0]
 
-        logger.debug(f'Removing {NF-NS} prescribed DOFs ({NS} left)')
+        logger.debug(self.pre + f'Removing {NF-NS} prescribed DOFs ({NS} left)')
 
         Asel = A[np.ix_(solve_ids, solve_ids)]
         Bsel = B[np.ix_(solve_ids, solve_ids)]
@@ -1301,7 +1325,7 @@ class SolveRoutine:
         NF = A.shape[0]
         NS = solve_ids.shape[0]
 
-        logger.debug(f'Removing {NF-NS} prescribed DOFs ({NS} left)')
+        logger.debug(self.pre + f'Removing {NF-NS} prescribed DOFs ({NS} left)')
 
         Asel = A[np.ix_(solve_ids, solve_ids)]
         Bsel = B[np.ix_(solve_ids, solve_ids)]

{emerge-1.0.4.dist-info → emerge-1.0.6.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: emerge
-Version: 1.0.4
+Version: 1.0.6
 Summary: An open source EM FEM simulator in Python
 Project-URL: Homepage, https://github.com/FennisRobert/EMerge
 Project-URL: Issues, https://github.com/FennisRobert/EMerge/issues
@@ -32,7 +32,7 @@ Hello everybody. Thanks for showing interest in this repository.
 Feel free to download your version of EMerge and start playing around with it!
 If you have suggestions/changes/questions either use the Github issue system or join the Discord using the following link:
 
-**https://discord.gg/uArxywnz**
+**[Discord Invitation](https://discord.gg/VMftDCZcNz)**
 
 ## How to install
 

{emerge-1.0.4.dist-info → emerge-1.0.6.dist-info}/RECORD

@@ -1,4 +1,4 @@
-emerge/__init__.py,sha256=hgaavnd2z2brL5QWk8XSNpqE3GDT54YHyQ9eeLgcCdA,3122
+emerge/__init__.py,sha256=m1aBdjv_Ae2k7RzIgtl-5CMEH5FQmWw28SOk0V_ro0Y,3162
 emerge/__main__.py,sha256=WVf16sfrOI910QWohrQDaChZdRifMNoS6VKzCT6f3ZA,92
 emerge/cli.py,sha256=NU1uhwuZ6i50680v3_I4kDZPTHqz74gOYK71UBhb8oE,666
 emerge/ext.py,sha256=IBoHH5PQFj5pYMfp6r-uMpNNgbSe8c0g9x8qjBzzVmU,223
@@ -14,19 +14,19 @@ emerge/_emerge/cs.py,sha256=gULfov6s0jODOdQkH6NmGBbG5wvny1-bJU8fdAlpCHo,19730
 emerge/_emerge/dataset.py,sha256=UcSAJ_siLrOjNBBWRWsS3GUZUpayp63EM6pP6ClwKDI,1534
 emerge/_emerge/emerge_update.py,sha256=0G91xr7k7Me5gOlk3pXbKWe-6ALXtoCJ5syTa1Y5Bhw,2042
 emerge/_emerge/geo2d.py,sha256=e_HkX1GQ2iYrdO0zeEgzVOzfGyU1WGJyjeGBAobOttE,3323
-emerge/_emerge/geometry.py,sha256=-QLLDyYXCXfZW01aKwW8IfkvtAr5PVjsM4r-xtEbOzY,24677
+emerge/_emerge/geometry.py,sha256=9WnZt2xtF4HEJfdPyT41i_q8gRMZRrG0C9PILaz1PvA,25523
 emerge/_emerge/howto.py,sha256=c4UxUNpA1tygr3OoR-LH-h0UZv-Tf9K8tpCiAU18BKE,8173
 emerge/_emerge/logsettings.py,sha256=OpsH_1dQAdZry_as8y0OQt4yKP_AMFfQG2d5Nz5yywg,4789
-emerge/_emerge/material.py,sha256=q6dhtfxPfy1PbCRjG7-jOimR5dVE6vf1kyfpBdoYrK4,16038
+emerge/_emerge/material.py,sha256=zXmKEZctqz4T574KSfRMdhiT2F_6l-QwiqlxNx6zkI0,17451
 emerge/_emerge/mesh3d.py,sha256=6NWTqJVwyaOhFKQgNghkH3zgrYFWbI0qAEBpvq-JOwI,35790
-emerge/_emerge/mesher.py,sha256=64hMTe2sSQgytnf8ryXUH8PIkUOsV5KJEXpibgJOhSg,16052
+emerge/_emerge/mesher.py,sha256=AUrMhXHHf1O5QtEyKlB172kV0B17jq9nzjq4JADZTV4,16079
 emerge/_emerge/periodic.py,sha256=dUuWqjlDR8mHtQR3ecINP2FFjJJ0cKg0blOVZ0PCcAo,12087
 emerge/_emerge/plot.py,sha256=cf1I9mj7EIUJcq8vmANlUkqoV6QqVaJaP-zlC-T9E18,8041
 emerge/_emerge/selection.py,sha256=ltT8ubMFG3-sFrAh7K7iAgSoBt3r25B02ShzMlOGSXQ,21527
 emerge/_emerge/settings.py,sha256=wZFMzQSnMEEJptatu--67El1L0I_YEv9S8QjqI69bfs,265
-emerge/_emerge/simmodel.py,sha256=8p82_R_hFAd1gOaLn6kaeFyQGJAQKjE04iZethx3V_o,26458
+emerge/_emerge/simmodel.py,sha256=yw21pUhO2_BB3vTN4UY7fhZxXuWNvcTaA5xRCcUg7vs,26525
 emerge/_emerge/simulation_data.py,sha256=23o-xbm6Q6s9sYisyK9u1GTmuaXRl0WDGQwzPO7lkr0,15115
-emerge/_emerge/solver.py,sha256=Li8CYXuK-B-iXZ2z9SD-g8xJs0t86CtJsT3_7BxqKgE,51469
+emerge/_emerge/solver.py,sha256=imgvQkVE9B3QEA1WmsBhhOLzHO44-Oh-onMXmLnfCFY,52980
 emerge/_emerge/system.py,sha256=p4HNz7d_LMRNE9Gk75vVdFecDH2iN_groAM9u-yQTpk,1618
 emerge/_emerge/elements/__init__.py,sha256=I3n9aic6lJW-oGeqTEZ-Fpxvyl2i-WqsHdnrM3v1oB8,799
 emerge/_emerge/elements/femdata.py,sha256=ZSB7dICyU3GOWbxpuowBc-Khh2mpXa02ZfMkHwdDol4,8377
@@ -35,13 +35,13 @@ emerge/_emerge/elements/ned2_interp.py,sha256=BGRdJGXCcDdqMBf3pOvc_-m-vngRI1VvE5
 emerge/_emerge/elements/nedelec2.py,sha256=OssFCnPp7wkMBcUISGvTgT94jayfGOmX0x-RctIYSuI,6645
 emerge/_emerge/elements/nedleg2.py,sha256=1SA6AvnbChhU2iodS1PVMUdbSn9wF2XKam12WTBDtsw,9049
 emerge/_emerge/geo/__init__.py,sha256=yTeuT4Oexrsdkr7MxRLeTHEY5iP4IHsWeCvit57fK5g,1161
-emerge/_emerge/geo/horn.py,sha256=otrtPphO2zoRaSOb7NV-iRaydL1uWDAl2xJ6-8Sef24,4148
+emerge/_emerge/geo/horn.py,sha256=tI-w-O0Fm_siMaVhKpZ_k5URLfZkqcbEpURX94fhKDs,4645
 emerge/_emerge/geo/modeler.py,sha256=_PMz3lFSa7FmJHWdY-4U1Sqbed-Egy85S_AdjlCldC4,15572
-emerge/_emerge/geo/operations.py,sha256=cKQfVjN0Qt9tj91w7zevm7EKsYPxcD8TRFCeQMQZFwY,12446
-emerge/_emerge/geo/pcb.py,sha256=Mzn7Lho18Xc7A-XShfWZK9Kop4xlLYONMeRhtKkETJU,57577
+emerge/_emerge/geo/operations.py,sha256=WYWfOXWrT0voeKW9U26g-PhQfqJl3ovRQ8uDQXUr7Nc,12459
+emerge/_emerge/geo/pcb.py,sha256=oRx9CnFFzhnDNtwxnw2rcm_CtN1h2y3-0jXOaBqGZ_E,57544
 emerge/_emerge/geo/pmlbox.py,sha256=gaIG_AoZNQnIyJ8C7x64U-Hw5dsmllWMiZDAH4iRoM0,8784
-emerge/_emerge/geo/polybased.py,sha256=G4oJG7I7oZ69PKiQVoAOPSNAWnjhuYUDdqibZhUdiv4,32059
-emerge/_emerge/geo/shapes.py,sha256=LPprT9vR7p6TqSBVKS6eG8P3iYWO7_yC7LNUYw5B8Sk,24196
+emerge/_emerge/geo/polybased.py,sha256=D_Ef4anrwV2RArEFrvWppZ_c7oN_Hm5h7ltMi2U3v2o,32891
+emerge/_emerge/geo/shapes.py,sha256=bLZM8ey05yvpKGgZS_DXFDaTQRP5kpsc7Xgp6Xaxc_Q,26903
 emerge/_emerge/geo/step.py,sha256=XcAiEN8W4umNmZdYmrGHX_aJUuiMgc6vgT-UIk8Gbqc,2689
 emerge/_emerge/geo/pcb_tools/calculator.py,sha256=VbMP2xC9i7OFwtqnnwfYgyJSEcJIjr2VIy_Ez1hYqlU,859
 emerge/_emerge/geo/pcb_tools/dxf.py,sha256=Xv7iP_bB0f2Y46sxZloa5KYGyj5dtApXoR-kgL7KHZA,11744
@@ -54,17 +54,17 @@ emerge/_emerge/mth/pairing.py,sha256=i8bBvTeMmzgF0JdiDNJiTXxx913x4f10777pzD6FJo0
 emerge/_emerge/physics/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 emerge/_emerge/physics/microwave/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 emerge/_emerge/physics/microwave/adaptive_freq.py,sha256=aWhijhCVAbnuwkru-I1AaRdY20uyozf6OWRIh9r2ijg,9786
-emerge/_emerge/physics/microwave/microwave_3d.py,sha256=FYUczByjAVTR3F15B2S1u7KPbYv4oABEqcj-uxemlGY,44396
-emerge/_emerge/physics/microwave/microwave_bc.py,sha256=n8lO-jUCKyQfsXVTWgFASxa3EcoFYz5uKXm-WiDKvIY,43655
-emerge/_emerge/physics/microwave/microwave_data.py,sha256=CwFg7lukrN5KrgCo-kZT6jSwqbU3I2xC5Xo621zm2Rk,49639
+emerge/_emerge/physics/microwave/microwave_3d.py,sha256=mnfD6QPNVqtMMayu73yRdvErqL2-mPSqiKbOte9a3GQ,44632
+emerge/_emerge/physics/microwave/microwave_bc.py,sha256=bMV3SrIE5BNTdBbTncwy0N67TERsYWzzFypzFgDBW54,43697
+emerge/_emerge/physics/microwave/microwave_data.py,sha256=yAjWGzpTa14JfYKJVMMwx3ETONK_mjYRz98iDKEdDk8,49893
 emerge/_emerge/physics/microwave/periodic.py,sha256=wYSUgLFVtCLqSG3EDKoCDRU93iPUzBdXzVRdHTRmbpI,3000
 emerge/_emerge/physics/microwave/port_functions.py,sha256=d-W1D-7P05MfXdOs7WlhPi_RqlSpC0HkYU6yl3GrxgE,2173
 emerge/_emerge/physics/microwave/sc.py,sha256=WZvoPhmHkfEv619RhmN09sXDBV0ryTqybwErA8Rc7lU,4735
 emerge/_emerge/physics/microwave/simjob.py,sha256=aCWCs7IXBfVBWWYhwyHvXSRHY3FOd3CK5ABcaFEsNnM,4927
 emerge/_emerge/physics/microwave/sparam.py,sha256=1SXGyr1UsrPnCIi4ffwobM4pzgkj50y4LrWCr_J5IRY,4946
 emerge/_emerge/physics/microwave/touchstone.py,sha256=pMcCOLWVqIKctcShcJxyaV-0rhRWXMSS1Jz14dVQEyY,5799
-emerge/_emerge/physics/microwave/assembly/assembler.py,sha256=cHmWu5NOCPXbXPK1BkiHAUSvVOYs6aP-44GF7RuRTXA,23926
-emerge/_emerge/physics/microwave/assembly/curlcurl.py,sha256=ksK7CcRrix2FMTXwV5SCVKcRcyfih39qhR6brqmt7ds,18663
+emerge/_emerge/physics/microwave/assembly/assembler.py,sha256=sNsAa2bTSe9-tYMRePTOE2EKrqZhsJChD_anr4GC4Vo,23936
+emerge/_emerge/physics/microwave/assembly/curlcurl.py,sha256=4CwMSUua8pvbp39gq2e3AxwVHOIVuPdr53qQM2BigQo,19688
 emerge/_emerge/physics/microwave/assembly/generalized_eigen.py,sha256=7jNU_hWd7q-ni53wmlhB5kmyJxp2xsx_WyBXZ6hPwo0,16907
 emerge/_emerge/physics/microwave/assembly/generalized_eigen_hb.py,sha256=tGf9EOzmp-dqtTodwYzcswuT_eLeZRtgdAZvgPz9QJo,17340
 emerge/_emerge/physics/microwave/assembly/periodicbc.py,sha256=N64uGx49Qs0PJxi_EH5pLx0zcrgJxqMy6DI1TqVXfmQ,4645
@@ -76,7 +76,7 @@ emerge/_emerge/plot/simple_plots.py,sha256=szIpmQmO8o6ubzB_E3zTJfEx16mJ3-OXrMYdD
 emerge/_emerge/plot/matplotlib/mpldisplay.py,sha256=e8V6EhGdCW7nRkSFvjHCcRO5uR-FcD0yHQ1nxPQCbp4,8674
 emerge/_emerge/plot/pyvista/__init__.py,sha256=CPclatEu6mFnJZzCQk09g6T6Fh20WTbiLAJGSwAnPXU,30
 emerge/_emerge/plot/pyvista/cmap_maker.py,sha256=_GVXYdtXpJwAO9O-Iekjzn6YcR0MVT8LNh12nqvF2IA,2498
-emerge/_emerge/plot/pyvista/display.py,sha256=IemCSptqlO7EfUZnLNetGiVxn0CgLD8qJ5B9SNTxCOo,41704
+emerge/_emerge/plot/pyvista/display.py,sha256=k5hkIGZCyzYXw1zdDtWCDRwm2dwO0Xz8Sw9YTGGPo5k,45356
 emerge/_emerge/plot/pyvista/display_settings.py,sha256=gV5hjRGEAl3oQeBPobas6b6JzYfMFrXIGtVSaeml4N0,1074
 emerge/_emerge/projects/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 emerge/_emerge/projects/_gen_base.txt,sha256=DqQz36PZg6v1ovQjHvPjd0t4AIbmikZdb9dmrNYsK3w,598
@@ -88,8 +88,8 @@ emerge/beta/dxf.py,sha256=Bw4lVk0TquOgCxTZV23BZN7PrgqxBrMZxbHV1waC5U0,50
 emerge/materials/__init__.py,sha256=Z9tu3m_nqj6F9I-FwoVoN0vCTYUlFesH3KxJ38wkZck,19
 emerge/materials/isola.py,sha256=kSDxHJZVn2CcanoUjlwRVKIPvadRbBybURTdIHWx728,18660
 emerge/materials/rogers.py,sha256=4u6ma_XQdXGKWE3WsFkaMTamCQNo9kTYSTU8S1gCAYU,3388
-emerge-1.0.4.dist-info/METADATA,sha256=AaEHuRZDRdnr-OyyDKli2libsKPtis2OmCRB33Uak-g,3282
-emerge-1.0.4.dist-info/WHEEL,sha256=qtCwoSJWgHk21S1Kb4ihdzI2rlJ1ZKaIurTj_ngOhyQ,87
-emerge-1.0.4.dist-info/entry_points.txt,sha256=8rFvAXticpKg4OTC8JEvAksnduW72KIEskCGG9XnFf8,43
-emerge-1.0.4.dist-info/licenses/LICENSE,sha256=VOCXWddrjMN5j7TvnSAOh1Dx7jkugdwq9Lqhycf5inc,17852
-emerge-1.0.4.dist-info/RECORD,,
+emerge-1.0.6.dist-info/METADATA,sha256=wJysFFkQJJgPoC2pdAtzEvWLsMPB-usHAQweDuNwPqk,3306
+emerge-1.0.6.dist-info/WHEEL,sha256=qtCwoSJWgHk21S1Kb4ihdzI2rlJ1ZKaIurTj_ngOhyQ,87
+emerge-1.0.6.dist-info/entry_points.txt,sha256=8rFvAXticpKg4OTC8JEvAksnduW72KIEskCGG9XnFf8,43
+emerge-1.0.6.dist-info/licenses/LICENSE,sha256=VOCXWddrjMN5j7TvnSAOh1Dx7jkugdwq9Lqhycf5inc,17852
+emerge-1.0.6.dist-info/RECORD,,