Get the acceptance rate of the move. You need to call collect_statistics() first.

* @brief Get the target subspace \f$ B' \f$ of the annihilation operator \f$ \hat c_i \f$ acting on subspace * \f$ B \f$. * * @details

Get a const iterator to the beginning of the mesh.

* @brief Get the target subspace \f$ B' \f$ of the creation operator \f$ \hat c^\dagger_i \f$ acting on subspace * \f$ B \f$. * * @deta

Get a const iterator to the end of the mesh.

Return ``True`` once every input has been consumed.

Get the percentage of the requested number of cycles done.

* @brief Get a vector with all matrix builder arguments \f$ \mathbf{x} \f$. * @details Warning: this is slow, since it creates a new copy and reo

Linear index of the current grid point in the iteration order (x fastest, then y, then z).

Inverts the Green's function (in place).

* @brief Check if the current operator \f$ \hat{O} \f$ is close to zero. * * @param precision Tolerance \f$ \epsilon \f$ for considering a c

* @brief Check if a value \f$ \omega \f$ is within the mesh range. * * @param w Value to check. * @return True if \f$ -\omega_{\mathrm{

r"""Hybridization function built from bath hoppings and energies. .. math:: \Delta_{kl}(i\omega_n) = \sum_{j=1}^{N_b} V_{kj}\, S_j\, V_{

* @brief Build a tight-binding Hamiltonian from a Wannier90 `*_tb.dat` file. * * @details This is a convenience wrapper that reads the file and

r"""Solve Dyson's equation in the DLR basis by constrained residual minimization. Defines Dyson's equation as an optimization problem, .. ma

Number of spatial dimensions of the lattice. Returns ------- int Number of dimensions (1, 2 or 3).

* @brief Reserve memory to increase the capacity of the data storages. * * @details Like for `std::vector`, this reserves memory for a bigge

Reset the accumulated time to zero and put the timer in the stopped state.

Run the pipe-pumping loop until :meth:`stop` is called. Each iteration sleeps for one second to let the OS buffer up output, then attemp

* Project a Matsubara Green's function onto the Legendre basis of the output. * * @param gl The output Legendre Green's function modified in pla

* Project an imaginary-time Green's function onto the Legendre basis of the output. * * @param gl The output Legendre Green's function modified

* Analytically continue a Matsubara Green's function to the real-frequency axis using a Pade approximant. * * @param gw The output real-frequenc

* @brief Map a data index \f$ d \in \{0, 1, \ldots, N-1\} \f$ to the corresponding index \f$ l(d) \f$. * * @param d Data index \f$ d \f$ to

r"""Calculate the Kanamori interaction matrix (or full four-index tensor). The two-index matrix for parallel spins is .. math:: U_{m m'}^{\s

Check various invariants. Mainly for debug.

Check that SemiCircular(D, mu) gives the correct occupation on MeshImFreq.

Wrap scalar children of an additive node in :class:`~triqs.gfs.descriptor_base.Const`. Used as the node callback for :func:`~triqs.g

r""" Assert that two :class:`BlockGf` objects are equal block by block. Iterates over the blocks of ``a`` and ``b`` in parallel, checks t

Get a const iterator to the beginning of the set.

Get a const iterator to the beginning of the map that contains the monomials and their coefficients.

Get the current bin capacity.

* @brief Build the matrix \f$ F^{(n)} \f$ from scratch from the stored arguments. * @details Evaluates \f$ f(x_i, y_j) \f$ for all \f$ i, j \f$ a

define PRINT_ALL

Check mesh point.

Check mesh point.

* @brief Clear the data storages and reset the matrix to size zero. */

Conjugate of the Green's function. Returns ------- G : Gf (copy) Conjugate of the Green's function.

Return an independent :class:`DOS` with the same ``eps``, ``rho`` and ``name``.

In-place copy from ``another`` into ``self``. Parameters ---------- another : Gf Source Green's function. Must ha

helper to determine the return container dimension

Construct an imaginary frequency DLR mesh with given DLR operations.

Get only the full bins, i.e. bins that are filled up to the bin capacity.

* @brief Get the integer \f$ f \f$ corresponding to a given Fock state \f$ \lvert f \rangle \f$. * * @details It throws an exception if the

Wrapped payload, or ``None`` if this node is not a leaf. Returns ------- object or None ``childs[0]`` when ``tag

* @brief Get a vector with all matrix builder arguments \f$ \mathbf{y} \f$. * @details Warning: this is slow, since it creates a new copy and reo

* @brief Check if a Matsubara index \f$ n \f$ is valid. * * @param n Matsubara index \f$ n \f$ to check. * @return True if \f$ n_\text{

* @brief Check if an index \f$ l \f$ is valid. * * @param l Index \f$ l \f$ to check. * @return True if \f$ 0 \leq l < N \f$, false oth

Check if a value is valid.

Get the maximum number of bins.

* @brief Get the mean, its standard error and an estimate for the integrated autocorrelation time. * * @details For definitions of the stand

Get the hash value of the mesh to which the right hand side operand belongs.

* @brief Allgather full bins from multiple MPI processes. * * @details Only full bins are considered. Furthermore, if `same_capacity` is set

Get the number of accepted configurations, i.e. the number of times accept() has been called.

Number of blocks. Returns ------- int ``len(self.__GFlist)``.

Get the number of full bins, i.e. bins that are filled up to the bin capacity.

Get the number of proposed configurations, i.e. the number of times attempt() has been called.

Get the number of dimensions of the Bravais lattice.

* @brief Increase the degree of the polynomial from \f$ l \f$ to \f$ l + 1 \f$ using \f$ (l + 1) P_{l+1}(x) = * (2l + 1) x P_l(x) - l P_{l-1}(x)