(self, f, nodes, degree, prec, previous, verbose=False)
return self.ctx.fdot((w, f(x)) for (x,w) in nodes)
r"""
        Evaluates the step sum `\sum w_k f(x_k)` where the *nodes* list
        contains the `(w_k, x_k)` pairs.

        :func:`~mpmath.summation` will supply the list *results* of
        values computed by :func:`~mpmath.sum_next` at previous degrees, in
        case the quadrature rule is able to reuse them.
r"""
        Evaluates the step sum `\sum w_k f(x_k)` where the *nodes* list
        contains the `(w_k, x_k)` pairs.
r Evaluates the step sum \ sum w_k f ( x_k ) where the * nodes * list contains the ( w_k x_k ) pairs .
def sum_next(self, f, nodes, degree, prec, previous, verbose=False):
        r"""
        Evaluates the step sum `\sum w_k f(x_k)` where the *nodes* list
        contains the `(w_k, x_k)` pairs.

        :func:`~mpmath.summation` will supply the list *results* of
        values computed by :func:`~mpmath.sum_next` at previous degrees, in
        case the quadrature rule is able to reuse them.
        """
        return self.ctx.fdot((w, f(x)) for (x,w) in nodes)
def sum_next ( self , f , nodes , degree , prec , previous , verbose = False ) : return self . ctx . fdot ( ( w , f ( x ) ) for ( x , w ) in nodes )