* @brief Get the full inverse matrix \f$ [F^{(n)}]^{-1} \f$. * @details The inverse is recomputed from scratch on demand and cached until the nex

* @brief Get an element of the matrix \f$ M^{(n)} = [G^{(n)}]^{-1} \f$. * @details Advanced: uses the internal storage order, see get_x_internal_

* @brief Get the full inverse matrix in internal storage order. * @details For this class the internal order equals the user order, so this retur

Invert each block in place.

Copy and move vectors of the same type.

You can not convert a C++ const_view to a Python Gf ! Violates const correctness.

You can not convert a C++ const_view to a Python Gf ! Violates const correctness.

You can not convert a C++ const_view to a Python Gf ! Violates const correctness.

You can not convert a C++ const_view to a Python Gf ! Violates const correctness.

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

Whether ``y`` is a descriptor or a lazy expression. Parameters ---------- y : object Value to test. Returns -------

Return ``True``; in serial there is only the master rank.

* @brief Whether the timer is currently running. * @return True if the timer is running, false if it is stopped. */

Is the measure object a measure set?

Check whether the determinant is considered singular: (singular_threshold < 0 ? not std::isnormal(std::abs(det)) : (std::abs(det) < singular_threshold

Whether this node is a leaf node. Returns ------- bool ``True`` if ``tag == 'T'``, ``False`` otherwise.

True if the accumulator was constructed with an unbounded number of bins.

Construct a past-the-end (singular) iterator.

Default constructor creates a keyboard interrupt with an empty diagnostic message.

* @brief Kronecker delta function for a single Matsubara frequency. * * @param iw triqs::mesh::matsubara_freq object. * @return True, if the

Wrap a Python callable so it can be applied to lazy expressions. Parameters ---------- name : str Display name used when stringif

r"""Plot protocol for :class:`~triqs.gfs.gf.Gf` objects on a :class:`~triqs.mesh.meshes.MeshLegendre`. Parameters ---------- self :

* @brief Construct a Legendre polynomial generator at a given value \f$ x \f$. * @param x Value \f$ x \f$ at which to evaluate the Legendre polyn

* @brief Default construct a linear binning accumulator. * * @details The accumulator is unbounded (`max_n_bins` is set to \f$ -1 \f$) with

* @brief Default construct an empty linear mesh of size \f$ N = 0 \f$. */

* @brief Default construct a logarithmic binning accumulator. * * @details The accumulator is unbounded (`max_n_bins` is set to \f$ -1 \f$).