(self, *args)
return Basic._recursive_call(self, args)
Apply on the argument recursively through the expression tree.

        This method is used to simulate a common abuse of notation for
        operators. For instance in SymPy the the following will not work:

        ``(x+Lambda(y, 2*y))(z) == x+2*z``,

        however you can use

        >>> from sympy import Lambda
        >>> from sympy.abc import x,y,z
        >>> (x + Lambda(y, 2*y)).rcall(z)
        x + 2*z
Apply on the argument recursively through the expression tree.
Apply on the argument recursively through the expression tree .
def rcall(self, *args):
        """Apply on the argument recursively through the expression tree.

        This method is used to simulate a common abuse of notation for
        operators. For instance in SymPy the the following will not work:

        ``(x+Lambda(y, 2*y))(z) == x+2*z``,

        however you can use

        >>> from sympy import Lambda
        >>> from sympy.abc import x,y,z
        >>> (x + Lambda(y, 2*y)).rcall(z)
        x + 2*z
        """
        return Basic._recursive_call(self, args)
def rcall ( self , * args ) : return Basic . _recursive_call ( self , args )