wg+dZddlmZddlmZddlmZddlmZm Z ddl m Z ddl m Z dd lmZdd lmZmZmZmZdd lmZdd lmZmZdd lmZddlmZddlmZddlm Z m!Z!ddl"m#Z#m$Z$ddl%m&Z&dZ'gdZ(d#dZ)GddeZ*e*jVZ,e e*jZZ.e e*Gdde*Z/d$dZ0dZ1ddl2m3Z3ddl4m5Z6m7Z7m8Z8eddd !e6Z5y")%z'Base class for all the objects in SymPy) annotations) defaultdict)Mapping)chain zip_longest) cmp_to_key)_prepare_class_assumptions)cacheit)_sympifysympify SympifyError_external_converter)ordered)Kind UndefinedKind) Printable) deprecated)sympy_deprecation_warning)iterablenumbered_symbols) filldedent func_name)getmrocb t|S#t$rtdt|zwxYw)zReturn expr as a Basic instance using strict sympify or raise a TypeError; this is just a wrapper to _sympify, raising a TypeError instead of a SympifyError.z)Argument must be a Basic object, not `%s`)r r TypeErrorr)exprs U/home/mcse/projects/flask/flask-venv/lib/python3.12/site-packages/sympy/core/basic.pyas_Basicrs?~  7) ;  s !.)DZeroOneHalfInfinityNaN NegativeOneNegativeInfinityIntegerRationalFloatExp1Pi ImaginaryUnitSymbolWildPowMulAdd DerivativeIntegralAbsSignSqrtFloorCeilingReImArg ConjugateExpLogSinCosTanCotASinACosATanACotSinhCoshTanhCothASinhACoshATanhACothRisingFactorialFallingFactorial factorialbinomialGamma LowerGamma UpperGamma PolyGammaErf Chebyshev Chebyshev2Function WildFunctionLambdaOrderEquality UnequalityStrictGreaterThanStrictLessThan GreaterThanLessThanc`t|tsy|j}|j}||k(ryttdz} tj |} tj |}||k(r||k(r ||kD||kz S||kD||kz S#t $r|}YCwxYw#t $r|}Y>wxYw)a[return -1, 0, 1 if the name of x is before that of y. A string comparison is done if either name does not appear in `ordering_of_classes`. This is the helper for ``Basic.compare`` Examples ======== >>> from sympy import cos, tan, sin >>> from sympy.core import basic >>> save = basic.ordering_of_classes >>> basic.ordering_of_classes = () >>> basic._cmp_name(cos, tan) -1 >>> basic.ordering_of_classes = ["tan", "sin", "cos"] >>> basic._cmp_name(cos, tan) 1 >>> basic._cmp_name(sin, cos) -1 >>> basic.ordering_of_classes = save rr ) issubclassBasic__name__lenordering_of_classesindex ValueError)xyn1n2UNKNOWNi1i2s r _cmp_namertPs0 a  B B Rx%&*G & &r * & &r * W}wRBG$$ GR      s$BB BB B-,B-c.eZdZUdZdZded<ded<edZfdZd Z d Z d Z d Z d Z d Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Z d Z!d Z"d Z#d Z$d Z%d Z&d ed <d ed <d ed <d ed<d ed<e'Z(ded<dZ)dZ*dZ+dZ,dZ-fdZ.dMdZ/dZ0edZ1dZ2e3dZ4e5dZ6e5dZ7e8dNdZ9d Z:d!Z;d"ZedOd%Z?ed&Z@d'ZAed(ZBd)ZCe3d*ZDd+ZEed,ZFed-ZGedPd.ZHed/ZIdQd1ZJd2ZKe8d3ZLd4ZMd5ZNd6ZOe8d7ZPdRd8ZQe8d9ZRd:ZSdSd;ZTdTd<ZUd=ZVdUd>ZWdTd?ZXdNd@ZYdAZZdBZ[dVdCZ\dDZ]d0dEdFZ^dGZ_dHZ`iZae5dIZbdJZcdKZddNdLZexZfS)Wrga Base class for all SymPy objects. Notes and conventions ===================== 1) Always use ``.args``, when accessing parameters of some instance: >>> from sympy import cot >>> from sympy.abc import x, y >>> cot(x).args (x,) >>> cot(x).args[0] x >>> (x*y).args (x, y) >>> (x*y).args[1] y 2) Never use internal methods or variables (the ones prefixed with ``_``): >>> cot(x)._args # do not use this, use cot(x).args instead (x,) 3) By "SymPy object" we mean something that can be returned by ``sympify``. But not all objects one encounters using SymPy are subclasses of Basic. For example, mutable objects are not: >>> from sympy import Basic, Matrix, sympify >>> A = Matrix([[1, 2], [3, 4]]).as_mutable() >>> isinstance(A, Basic) False >>> B = sympify(A) >>> isinstance(B, Basic) True )_mhash_args _assumptionstuple[Basic, ...]rwz int | Nonervcy)NTselfs r __sympy__zBasic.__sympy__sc8t|t|yN)super__init_subclass__r )cls __class__s rrzBasic.__init_subclass__s !#"3'rFz bool | Noneis_realis_extended_realis_zero is_negativeis_commutativerkindcntj|}|j|_d|_||_|Sr)object__new__default_assumptionsrxrvrw)rargsobjs rrz Basic.__new__s1nnS!22   rc4|j|jSr)funcrr|s rcopyz Basic.copystyy$))$$rc|jSrrr|s r__getnewargs__zBasic.__getnewargs__s yyrcyrr{r|s r __getstate__zBasic.__getstate__rcN|jD]\}}t|||yr)itemssetattr)r}statenamevalues r __setstate__zBasic.__setstate__s' ;;= 'KD% D$ & 'rcF|dkr d}t|t| |S)Nz6Only pickle protocol 2 or higher is supported by SymPy)NotImplementedErrorr __reduce_ex__)r}protocolmsgrs rrzBasic.__reduce_ex__s* a<JC%c* *w$X..rc|j}|7tt|jf|j z}||_|Sr)rvhashtyperh_hashable_content)r}hs r__hash__zBasic.__hash__sC KK 9d4j))+d.D.D.FFGADKrc|jS)aReturn a tuple of information about self that can be used to compute the hash. If a class defines additional attributes, like ``name`` in Symbol, then this method should be updated accordingly to return such relevant attributes. Defining more than _hashable_content is necessary if __eq__ has been defined by a class. See note about this in Basic.__eq__.rwr|s rrzBasic._hashable_content szzrciS)a Return object `type` assumptions. For example: Symbol('x', real=True) Symbol('x', integer=True) are different objects. In other words, besides Python type (Symbol in this case), the initial assumptions are also forming their typeinfo. Examples ======== >>> from sympy import Symbol >>> from sympy.abc import x >>> x.assumptions0 {'commutative': True} >>> x = Symbol("x", positive=True) >>> x.assumptions0 {'commutative': True, 'complex': True, 'extended_negative': False, 'extended_nonnegative': True, 'extended_nonpositive': False, 'extended_nonzero': True, 'extended_positive': True, 'extended_real': True, 'finite': True, 'hermitian': True, 'imaginary': False, 'infinite': False, 'negative': False, 'nonnegative': True, 'nonpositive': False, 'nonzero': True, 'positive': True, 'real': True, 'zero': False} r{r|s r assumptions0zBasic.assumptions0s < rc||ury|j}|j}t||}|r|S|j}|j}t|t|kDt|t|kz }|r|St ||D]l\}}t |t rt|n|}t |t rt|n|}t |tr|j|}n ||kD||kz }|sj|cSy)a Return -1, 0, 1 if the object is less than, equal, or greater than other in a canonical sense. Non-Basic are always greater than Basic. If both names of the classes being compared appear in the `ordering_of_classes` then the ordering will depend on the appearance of the names there. If either does not appear in that list, then the comparison is based on the class name. If the names are the same then a comparison is made on the length of the hashable content. Items of the equal-lengthed contents are then successively compared using the same rules. If there is never a difference then 0 is returned. Examples ======== >>> from sympy.abc import x, y >>> x.compare(y) -1 >>> x.compare(x) 0 >>> y.compare(x) 1 r) rrtrrizip isinstance frozensetrgcompare) r}otherrorpcstotlrs rrz Basic.compare3s< 5= ^^ __ b"  H  # # %  $ $ & Ws2w 3r7SW#4 5 HBK DAq'95q 1A'95q 1A!U#IIaLUq1u% rcFddlm}t||r t||syt||s t||ry|jrI|jr=|j|j z}|j|j z}||kD||kz Sddlm}|d|d|d}}}|j|||zz} | rH|| vrD| |} |j|||zz} | r&|| vr"| |} tj| | } | dk7r| Stj||S) aTreturn -1, 0, 1 if a is canonically less, equal or greater than b. This is used when 'order=old' is selected for printing. This puts Order last, orders Rationals according to value, puts terms in order wrt the power of the last power appearing in a term. Ties are broken using Basic.compare. r)r]r rer.p1p2p3) sympy.series.orderr]r is_Rationalpqsymbolr.matchrgr)abr]rrr.rrrr_aa3r_bb3rs r_compare_prettyzBasic._compare_prettyis - a  1e(<!U# 1e(< ==Q]]acc Aacc AEa!e$ $ $dT$ZdBB''"r2v+&CrSyWggb2r6k*29RB b"-AAv }}Q""rc $|t|i|S)aa Create a new object from an iterable. This is a convenience function that allows one to create objects from any iterable, without having to convert to a list or tuple first. Examples ======== >>> from sympy import Tuple >>> Tuple.fromiter(i for i in range(5)) (0, 1, 2, 3, 4) )tuple)rr assumptionss rfromiterzBasic.fromiters E$K/;//rc dd|jfS)zNice order of classes.rrhrs r class_keyzBasic.class_keys!S\\!!rc fd}|j}t|t|Dcgc] }|| c}f}|j|tj j tj fScc}w)a Return a sort key. Examples ======== >>> from sympy import S, I >>> sorted([S(1)/2, I, -I], key=lambda x: x.sort_key()) [1/2, -I, I] >>> S("[x, 1/x, 1/x**2, x**2, x**(1/2), x**(1/4), x**(3/2)]") [x, 1/x, x**(-2), x**2, sqrt(x), x**(1/4), x**(3/2)] >>> sorted(_, key=lambda x: x.sort_key()) [x**(-2), 1/x, x**(1/4), sqrt(x), x, x**(3/2), x**2] cJt|tr|jS|Sr)rrgsort_key)argorders r inner_keyz!Basic.sort_key..inner_keys!#u%||E** r) _sorted_argsrirrSr!r)r}rrrrs ` rrzBasic.sort_keysb*    4y%4 @C3 @AA~~quu~~'7>>!AsA; ct|jD]&}tj|}||||k(cSt |dr||j k(St S)aReturns a boolean indicating whether a == b when either a or b is not a Basic. This is only done for types that were either added to `converter` by a 3rd party or when the object has `_sympy_` defined. This essentially reuses the code in `_sympify` that is specific for this use case. Non-user defined types that are meant to work with SymPy should be handled directly in the __eq__ methods of the `Basic` classes it could equate to and not be converted. Note that after conversion, `==` is used again since it is not necessarily clear whether `self` or `other`'s __eq__ method needs to be used._sympy_)r__mro__rgethasattrrNotImplemented)r}r superclassconvs r_do_eq_sympifyzBasic._do_eq_sympifyseu+-- +J&**:6DtE{** + 5) $5==?* *rc||uryt|ts|j|S|jr |jst |t |k7ry|j |j }}||k7ryt ||D]<\}}t|ts|js$t |t |k7s<yy)aReturn a boolean indicating whether a == b on the basis of their symbolic trees. This is the same as a.compare(b) == 0 but faster. Notes ===== If a class that overrides __eq__() needs to retain the implementation of __hash__() from a parent class, the interpreter must be told this explicitly by setting __hash__ : Callable[[object], int] = .__hash__. Otherwise the inheritance of __hash__() will be blocked, just as if __hash__ had been explicitly set to None. References ========== from https://docs.python.org/dev/reference/datamodel.html#object.__hash__ TF)rrgr is_Numberrrr)r}rrrs r__eq__z Basic.__eq__s* 5=%'&&u- -EOOT d5k)%%')@)@)B1 61I DAqa'{{tAw$q'1   rc||k( S)z``a != b`` -> Compare two symbolic trees and see whether they are different this is the same as: ``a.compare(b) != 0`` but faster r{)r}rs r__ne__z Basic.__ne__s5=  rc|j}t|}|j}|jDcgc]}|js|}}t |dk(r|j }n||k(S|0|j}t |dk(r|j }n||k(S|j } |j|| i|j|| ik(Scc}w)a Compare two expressions and handle dummy symbols. Examples ======== >>> from sympy import Dummy >>> from sympy.abc import x, y >>> u = Dummy('u') >>> (u**2 + 1).dummy_eq(x**2 + 1) True >>> (u**2 + 1) == (x**2 + 1) False >>> (u**2 + y).dummy_eq(x**2 + y, x) True >>> (u**2 + y).dummy_eq(x**2 + y, y) False r )as_dummyr free_symbolsis_Dummyripoprxreplace) r}rrsoi dummy_symbolsdummysymbolstmps rdummy_eqzBasic.dummy_eq s. MMO UO JJL$%NNAqajjA A }  "!%%'E6M >nnG7|q  Av oozz5#,'1::vsm+DDD#Bs C Cc |r4t|Dcgc]}t|tr|n t|!c}}t|}|r|Dchc]}t||s|}}|S|Dchc]}|jr|}}|Scc}wcc}wcc}w)a- Returns the atoms that form the current object. By default, only objects that are truly atomic and cannot be divided into smaller pieces are returned: symbols, numbers, and number symbols like I and pi. It is possible to request atoms of any type, however, as demonstrated below. Examples ======== >>> from sympy import I, pi, sin >>> from sympy.abc import x, y >>> (1 + x + 2*sin(y + I*pi)).atoms() {1, 2, I, pi, x, y} If one or more types are given, the results will contain only those types of atoms. >>> from sympy import Number, NumberSymbol, Symbol >>> (1 + x + 2*sin(y + I*pi)).atoms(Symbol) {x, y} >>> (1 + x + 2*sin(y + I*pi)).atoms(Number) {1, 2} >>> (1 + x + 2*sin(y + I*pi)).atoms(Number, NumberSymbol) {1, 2, pi} >>> (1 + x + 2*sin(y + I*pi)).atoms(Number, NumberSymbol, I) {1, 2, I, pi} Note that I (imaginary unit) and zoo (complex infinity) are special types of number symbols and are not part of the NumberSymbol class. The type can be given implicitly, too: >>> (1 + x + 2*sin(y + I*pi)).atoms(x) # x is a Symbol {x, y} Be careful to check your assumptions when using the implicit option since ``S(1).is_Integer = True`` but ``type(S(1))`` is ``One``, a special type of SymPy atom, while ``type(S(2))`` is type ``Integer`` and will find all integers in an expression: >>> from sympy import S >>> (1 + x + 2*sin(y + I*pi)).atoms(S(1)) {1} >>> (1 + x + 2*sin(y + I*pi)).atoms(S(2)) {1, 2} Finally, arguments to atoms() can select more than atomic atoms: any SymPy type (loaded in core/__init__.py) can be listed as an argument and those types of "atoms" as found in scanning the arguments of the expression recursively: >>> from sympy import Function, Mul >>> from sympy.core.function import AppliedUndef >>> f = Function('f') >>> (1 + f(x) + 2*sin(y + I*pi)).atoms(Function) {f(x), sin(y + I*pi)} >>> (1 + f(x) + 2*sin(y + I*pi)).atoms(AppliedUndef) {f(x)} >>> (1 + x + 2*sin(y + I*pi)).atoms(Mul) {I*pi, 2*sin(y + I*pi)} )rrr_preorder_traversalr)r}typestnodesnoderesults ratomsz Basic.atoms8sJ @EF1jD)tAw6FHE#D) ',Ht 40GdHFH (->tDIId>F> GI>s$BBB&B 8B cVt}|jd|jDS)aReturn from the atoms of self those which are free symbols. Not all free symbols are ``Symbol``. Eg: IndexedBase('I')[0].free_symbols For most expressions, all symbols are free symbols. For some classes this is not true. e.g. Integrals use Symbols for the dummy variables which are bound variables, so Integral has a method to return all symbols except those. Derivative keeps track of symbols with respect to which it will perform a derivative; those are bound variables, too, so it has its own free_symbols method. Any other method that uses bound variables should implement a free_symbols method.c34K|]}|jywr)r).0rs r z%Basic.free_symbols..s?Q^^?s)setunionr)r}emptys rrzBasic.free_symbolss& Eu{{?TYY?@@rc2tdddtS)Nz The expr_free_symbols property is deprecated. Use free_symbols to get the free symbols of an expression. z1.9zdeprecated-expr-free-symbolsdeprecated_since_versionactive_deprecations_target)rrr|s rexpr_free_symbolszBasic.expr_free_symbolss!!# &+'E  G u rcnddlmm}fd}|j|s|S|j d|dS)anReturn the expression with any objects having structurally bound symbols replaced with unique, canonical symbols within the object in which they appear and having only the default assumption for commutativity being True. When applied to a symbol a new symbol having only the same commutativity will be returned. Examples ======== >>> from sympy import Integral, Symbol >>> from sympy.abc import x >>> r = Symbol('r', real=True) >>> Integral(r, (r, x)).as_dummy() Integral(_0, (_0, x)) >>> _.variables[0].is_real is None True >>> r.as_dummy() _r Notes ===== Any object that has structurally bound variables should have a property, `bound_symbols` that returns those symbols appearing in the object. r Dummyr-cJ|j}t|j}||zDcic] }| }}|j|}|j |j }|j |j Dcic]\}}|| c}}Scc}wcc}}wr)rr bound_symbolssubsrcanonical_variablesr)rmfreeboundrdkvrs rcanzBasic.as_dummy..cans>>D(E%*T\2EG2A2q A 1001A:: :1q!t:; ; 3 ;s B B ct|dS)Nr)rrms rz Basic.as_dummy..s ga1rF) simultaneous)rrr-hasreplace)r}r-rrs @rrzBasic.as_dummys?8 * <xxK|| 1   rcRt|dsiStd}i}|j}|jt |z Dchc]}|j }}|D]F}t |}|jr(|j |vrt |}|j |vr|||<H|Scc}w)aUReturn a dictionary mapping any variable defined in ``self.bound_symbols`` to Symbols that do not clash with any free symbols in the expression. Examples ======== >>> from sympy import Lambda >>> from sympy.abc import x >>> Lambda(x, 2*x).canonical_variables {x: _0} r_)rrrrrrnext is_Symbol)r}dumsrepsrrnamesrrs rrzBasic.canonical_variablesst_-I$""!%!2!2SZ!?@A@@ AT A{{ffoT AffoDG    AsB$c.tj||S)aApply 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 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 )rg_recursive_call)r}rs rrcallz Basic.rcalls$$T400rcddlm}d}t|r||rt||r|S||S|jr;|jDcgc]}t j ||}}t||S|Scc}w)zHelper for rcall method.r r-chtt|D]}d|jvs|tk7cSy)N__call__)rr__dict__rg)rrs rthe_call_method_is_overriddenz.the_call_method_is_overriddens0d4j) (-%<' (r)rr-callablerrrgr+r) expr_to_callon_argsr-r2subrs rr+zBasic._recursive_calls # ( L !&CL&Q,/###W--   )5):):<"%))W>> from sympy import exp_polar, pi, I >>> (I*exp_polar(I*pi/2)).is_comparable True >>> (I*exp_polar(I*pi*2)).is_comparable False A False result does not mean that `self` cannot be rewritten into a form that would be comparable. For example, the difference computed below is zero but without simplification it does not evaluate to a zero with precision: >>> e = 2**pi*(1 + 2**pi) >>> dif = e - e.expand() >>> dif.is_comparable False >>> dif.n(2)._prec 1 Frr )r is_number as_real_imagrevalf_prec)r}rrnrs r is_comparablezBasic.is_comparables6 00 u $~~&&(*#$++ 14*1   77a< *s&Bc|jS)a The top-level function in an expression. The following should hold for all objects:: >> x == x.func(*x.args) Examples ======== >>> from sympy.abc import x >>> a = 2*x >>> a.func >>> a.args (2, x) >>> a.func(*a.args) 2*x >>> a == a.func(*a.args) True rr|s rrz Basic.funcKs0~~rc|jS)a@Returns a tuple of arguments of 'self'. Examples ======== >>> from sympy import cot >>> from sympy.abc import x, y >>> cot(x).args (x,) >>> cot(x).args[0] x >>> (x*y).args (x, y) >>> (x*y).args[1] y Notes ===== Never use self._args, always use self.args. Only use _args in __new__ when creating a new function. Do not override .args() from Basic (so that it is easy to change the interface in the future if needed). rr|s rrz Basic.argses<zzrc|jS)z The same as ``args``. Derived classes which do not fix an order on their arguments should override this method to produce the sorted representation. rr|s rrzBasic._sorted_argssyyrTc&tj|fS)zA stub to allow Basic args (like Tuple) to be skipped when computing the content and primitive components of an expression. See Also ======== sympy.core.expr.Expr.as_content_primitive )rr!)r}radicalclears ras_content_primitivezBasic.as_content_primitivesuud{rcddlm}ddlm}mddlm}d}t|dk(r\|d}t|trd}nat||tfrd}|j}n>> from sympy import pi, exp, limit, oo >>> from sympy.abc import x, y >>> (1 + x*y).subs(x, pi) pi*y + 1 >>> (1 + x*y).subs({x:pi, y:2}) 1 + 2*pi >>> (1 + x*y).subs([(x, pi), (y, 2)]) 1 + 2*pi >>> reps = [(y, x**2), (x, 2)] >>> (x + y).subs(reps) 6 >>> (x + y).subs(reversed(reps)) x**2 + 2 >>> (x**2 + x**4).subs(x**2, y) y**2 + y To replace only the x**2 but not the x**4, use xreplace: >>> (x**2 + x**4).xreplace({x**2: y}) x**4 + y To delay evaluation until all substitutions have been made, set the keyword ``simultaneous`` to True: >>> (x/y).subs([(x, 0), (y, 0)]) 0 >>> (x/y).subs([(x, 0), (y, 0)], simultaneous=True) nan This has the added feature of not allowing subsequent substitutions to affect those already made: >>> ((x + y)/y).subs({x + y: y, y: x + y}) 1 >>> ((x + y)/y).subs({x + y: y, y: x + y}, simultaneous=True) y/(x + y) In order to obtain a canonical result, unordered iterables are sorted by count_op length, number of arguments and by the default_sort_key to break any ties. All other iterables are left unsorted. >>> from sympy import sqrt, sin, cos >>> from sympy.abc import a, b, c, d, e >>> A = (sqrt(sin(2*x)), a) >>> B = (sin(2*x), b) >>> C = (cos(2*x), c) >>> D = (x, d) >>> E = (exp(x), e) >>> expr = sqrt(sin(2*x))*sin(exp(x)*x)*cos(2*x) + sin(2*x) >>> expr.subs(dict([A, B, C, D, E])) a*c*sin(d*e) + b The resulting expression represents a literal replacement of the old arguments with the new arguments. This may not reflect the limiting behavior of the expression: >>> (x**3 - 3*x).subs({x: oo}) nan >>> limit(x**3 - 3*x, x, oo) oo If the substitution will be followed by numerical evaluation, it is better to pass the substitution to evalf as >>> (1/x).evalf(subs={x: 3.0}, n=21) 0.333333333333333333333 rather than >>> (1/x).subs({x: 3.0}).evalf(21) 0.333333333333333314830 as the former will ensure that the desired level of precision is obtained. See Also ======== replace: replacement capable of doing wildcard-like matching, parsing of match, and conditional replacements xreplace: exact node replacement in expr tree; also capable of using matching rules sympy.core.evalf.EvalfMixin.evalf: calculates the given formula to a desired level of precision r )Dictr)_illegalFrTz When a single argument is passed to subs it should be a dictionary of old: new pairs or an iterable of (old, new) tuples.rz$subs accepts either 1 or 2 argumentsct|tr|St|tr t|dSt|dSNF)strictTrstrrr )oldr-s r sympify_oldzBasic.subs..sympify_old!s;#s#c{"C&s511s400rcbt|ttfr t|dSt|dSrPrR)news r sympify_newzBasic.subs..sympify_new+s*#T{+s511s400rr )_nodesdefault_sort_keyc| Srr{)rmrYs rrzBasic.subs..Cs 6!9*r)defaultkeyshack2subs_msubs_d) commutative) containersrMrrr-numbersrNrirrrrrrlr_aresamersortingrYrZdictlistr enumeratereversedinsertr_subsrgrr!r)r}rkwargsrMrrN unorderedsequencerUrXs1s2r rZrrseqredor(rvmrTrWcomrr-rYs @@rrz Basic.subssb %)% t9>AwH(C( HtWo6 #>>+h' -,"-..Y!^vHCD D 1 1FNN62r[_k"o6NN,4LR8B;KRHLLzz.%8  9H~HWXu$ <A344QHQK(4H4(1((;Rfas1v?QRR!$8AOOAx||A78 DB"F7OhA$ S((;C(4RXXc1Q31&1!"e,Q eeDG;;t$ $B$ SRXXc31&1!"e,I  IiOM"5Ss$-II $I 4I&I+$I+c jfd}t||r|S|j||}| ||||}|S)a Substitutes an expression old -> new. If self is not equal to old then _eval_subs is called. If _eval_subs does not want to make any special replacement then a None is received which indicates that the fallback should be applied wherein a search for replacements is made amongst the arguments of self. >>> from sympy import Add >>> from sympy.abc import x, y, z Examples ======== Add's _eval_subs knows how to target x + y in the following so it makes the change: >>> (x + y + z).subs(x + y, 1) z + 1 Add's _eval_subs does not need to know how to find x + y in the following: >>> Add._eval_subs(z*(x + y) + 3, x + y, 1) is None True The returned None will cause the fallback routine to traverse the args and pass the z*(x + y) arg to Mul where the change will take place and the substitution will succeed: >>> (z*(x + y) + 3).subs(x + y, 1) z + 3 ** Developers Notes ** An _eval_subs routine for a class should be written if: 1) any arguments are not instances of Basic (e.g. bool, tuple); 2) some arguments should not be targeted (as in integration variables); 3) if there is something other than a literal replacement that should be attempted (as in Piecewise where the condition may be updated without doing a replacement). If it is overridden, here are some special cases that might arise: 1) If it turns out that no special change was made and all the original sub-arguments should be checked for replacements then None should be returned. 2) If it is necessary to do substitutions on a portion of the expression then _subs should be called. _subs will handle the case of any sub-expression being equal to old (which usually would not be the case) while its fallback will handle the recursion into the sub-arguments. For example, after Add's _eval_subs removes some matching terms it must process the remaining terms so it calls _subs on each of the un-matched terms and then adds them onto the terms previously obtained. 3) If the initial expression should remain unchanged then the original expression should be returned. (Whenever an expression is returned, modified or not, no further substitution of old -> new is attempted.) Sum's _eval_subs routine uses this strategy when a substitution is attempted on any of its summation variables. c0d}t|j}t|D]=\}}t|ds|j||fi }t |||r7d}|||<?|r|j |} jdd}|r|jr|jsstj} g} |D]%}|jr| |z} | j|'|j | } | tjur| S|j | | dS|S|S)zQ Try to replace old with new in any of self's arguments. F _eval_subsTr^)evaluate) rgrrhrrkrdrris_Mulrr!rappend) r}rTrWhitrrrrsr^coeff nonnumberhintss rfallbackzBasic._subs..fallbacksC ?D#D/ "3sL1ciiS2E2T!W-C!DG  "TYY% '51T[[EEE "I!0;;!QJE%,,Q/ 0 !* 9 5I~((#yy EyJJ Kr)rdrx)r}rTrWrrrss ` rrkz Basic._subshsCP @ D# J __S# & :$S)B rcy)zOverride this stub if you want to do anything more than attempt a replacement of old with new in the arguments of self. See also ======== _subs Nr{)r}rTrWs rrxzBasic._eval_subssrc.|j|\}}|S)a Replace occurrences of objects within the expression. Parameters ========== rule : dict-like Expresses a replacement rule Returns ======= xreplace : the result of the replacement Examples ======== >>> from sympy import symbols, pi, exp >>> x, y, z = symbols('x y z') >>> (1 + x*y).xreplace({x: pi}) pi*y + 1 >>> (1 + x*y).xreplace({x: pi, y: 2}) 1 + 2*pi Replacements occur only if an entire node in the expression tree is matched: >>> (x*y + z).xreplace({x*y: pi}) z + pi >>> (x*y*z).xreplace({x*y: pi}) x*y*z >>> (2*x).xreplace({2*x: y, x: z}) y >>> (2*2*x).xreplace({2*x: y, x: z}) 4*z >>> (x + y + 2).xreplace({x + y: 2}) x + y + 2 >>> (x + 2 + exp(x + 2)).xreplace({x + 2: y}) x + exp(y) + 2 xreplace does not differentiate between free and bound symbols. In the following, subs(x, y) would not change x since it is a bound symbol, but xreplace does: >>> from sympy import Integral >>> Integral(x, (x, 1, 2*x)).xreplace({x: y}) Integral(y, (y, 1, 2*y)) Trying to replace x with an expression raises an error: >>> Integral(x, (x, 1, 2*x)).xreplace({x: 2*y}) # doctest: +SKIP ValueError: Invalid limits given: ((2*y, 1, 4*y),) See Also ======== replace: replacement capable of doing wildcard-like matching, parsing of match, and conditional replacements subs: substitution of subexpressions as defined by the objects themselves. ) _xreplace)r}rulerr$s rrzBasic.xreplaces|>>$'q rc||vr||dfS|rxg}d}|jD]G}t|dd}|%||}|j|d||dz}7|j|It|}|r|j|dfS|dfS)zV Helper for xreplace. Tracks whether a replacement actually occurred. TFrNrr )rgetattrr{rr)r}rrchangedrra_xrs rrzBasic._xreplace$s 4<:t# # DGYY ##A{D9 ($T?DKKQ(tAw&GKKN #;D tyy$'--U{rc0|jtg|S)a Test whether any subexpression matches any of the patterns. Examples ======== >>> from sympy import sin >>> from sympy.abc import x, y, z >>> (x**2 + sin(x*y)).has(z) False >>> (x**2 + sin(x*y)).has(x, y, z) True >>> x.has(x) True Note ``has`` is a structural algorithm with no knowledge of mathematics. Consider the following half-open interval: >>> from sympy import Interval >>> i = Interval.Lopen(0, 5); i Interval.Lopen(0, 5) >>> i.args (0, 5, True, False) >>> i.has(4) # there is no "4" in the arguments False >>> i.has(0) # there *is* a "0" in the arguments True Instead, use ``contains`` to determine whether a number is in the interval or not: >>> i.contains(4) True >>> i.contains(0) False Note that ``expr.has(*patterns)`` is exactly equivalent to ``any(expr.has(p) for p in patterns)``. In particular, ``False`` is returned when the list of patterns is empty. >>> x.has() False )_hasiterargs)r}patternss rr!z Basic.has:s^tyy-H--rcvttur tdtfdt |DS)aGReturn True if self has any of the patterns in s as a free argument, else False. This is like `Basic.has_free` but this will only report exact argument matches. Examples ======== >>> from sympy import Function >>> from sympy.abc import x, y >>> f = Function('f') >>> f(x).has_xfree({f}) False >>> f(x).has_xfree({f(x)}) True >>> f(x + 1).has_xfree({x}) True >>> f(x + 1).has_xfree({x + 1}) True >>> f(x + y + 1).has_xfree({x + 1}) False zexpecting set argumentc3&K|]}|v ywrr{)rrrs rrz"Basic.has_xfree..s6a166s)rrrany iterfreeargs)r}rs `r has_xfreezBasic.has_xfreeks3. 7# 45 56<#5666rc|sy|d}t|dk(r/t|r$t|tst t dt |}|j|}|r|S|jtg|S)afReturn True if self has object(s) ``x`` as a free expression else False. Examples ======== >>> from sympy import Integral, Function >>> from sympy.abc import x, y >>> f = Function('f') >>> g = Function('g') >>> expr = Integral(f(x), (f(x), 1, g(y))) >>> expr.free_symbols {y} >>> expr.has_free(g(y)) True >>> expr.has_free(*(x, f(x))) False This works for subexpressions and types, too: >>> expr.has_free(g) True >>> (x + y + 1).has_free(y + 1) True Frr z Expecting 1 or more Basic args, not a single non-Basic iterable. Don't forget to unpack iterables: `eq.has_free(*patterns)`) rirrrgrrrrrr)r}rp0rrss rhas_freezBasic.has_frees6 a[ x=A (2,z"e7LJ(789 9 M ^^A  Ityy111rct}t}|D]a}t|tr"t|tr|j |5t|ts t |}|j |ct|}||D]}||vryt||sy||z D];}t|ds|jtfd||Ds;yy#t$rYwxYw)NT _has_matcherc3.K|] }|ywrr{)rrrs rrzBasic._has..s8#5:8sF) rrrrfrgaddr rrrrr) r}rrtype_setp_setrrrrs @rrz Basic._hass5 A!T"z!U'; Qa'  A IIaL h$ AEz!U#  ! A1n-NN$E8$88  -$s C,, C87C8c t tttr7fd ttrfd nt rfd nt dtt rlfd |#ddlm}tj|dkD}tt r|rfd n^fd  nXt r|rfd  nEfd  n?t d t r t rfd  nt dt d fd i  fd} ||}r| fS|S#t$rY0wxYw#t$rY4wxYw)a Replace matching subexpressions of ``self`` with ``value``. If ``map = True`` then also return the mapping {old: new} where ``old`` was a sub-expression found with query and ``new`` is the replacement value for it. If the expression itself does not match the query, then the returned value will be ``self.xreplace(map)`` otherwise it should be ``self.subs(ordered(map.items()))``. Traverses an expression tree and performs replacement of matching subexpressions from the bottom to the top of the tree. The default approach is to do the replacement in a simultaneous fashion so changes made are targeted only once. If this is not desired or causes problems, ``simultaneous`` can be set to False. In addition, if an expression containing more than one Wild symbol is being used to match subexpressions and the ``exact`` flag is None it will be set to True so the match will only succeed if all non-zero values are received for each Wild that appears in the match pattern. Setting this to False accepts a match of 0; while setting it True accepts all matches that have a 0 in them. See example below for cautions. The list of possible combinations of queries and replacement values is listed below: Examples ======== Initial setup >>> from sympy import log, sin, cos, tan, Wild, Mul, Add >>> from sympy.abc import x, y >>> f = log(sin(x)) + tan(sin(x**2)) 1.1. type -> type obj.replace(type, newtype) When object of type ``type`` is found, replace it with the result of passing its argument(s) to ``newtype``. >>> f.replace(sin, cos) log(cos(x)) + tan(cos(x**2)) >>> sin(x).replace(sin, cos, map=True) (cos(x), {sin(x): cos(x)}) >>> (x*y).replace(Mul, Add) x + y 1.2. type -> func obj.replace(type, func) When object of type ``type`` is found, apply ``func`` to its argument(s). ``func`` must be written to handle the number of arguments of ``type``. >>> f.replace(sin, lambda arg: sin(2*arg)) log(sin(2*x)) + tan(sin(2*x**2)) >>> (x*y).replace(Mul, lambda *args: sin(2*Mul(*args))) sin(2*x*y) 2.1. pattern -> expr obj.replace(pattern(wild), expr(wild)) Replace subexpressions matching ``pattern`` with the expression written in terms of the Wild symbols in ``pattern``. >>> a, b = map(Wild, 'ab') >>> f.replace(sin(a), tan(a)) log(tan(x)) + tan(tan(x**2)) >>> f.replace(sin(a), tan(a/2)) log(tan(x/2)) + tan(tan(x**2/2)) >>> f.replace(sin(a), a) log(x) + tan(x**2) >>> (x*y).replace(a*x, a) y Matching is exact by default when more than one Wild symbol is used: matching fails unless the match gives non-zero values for all Wild symbols: >>> (2*x + y).replace(a*x + b, b - a) y - 2 >>> (2*x).replace(a*x + b, b - a) 2*x When set to False, the results may be non-intuitive: >>> (2*x).replace(a*x + b, b - a, exact=False) 2/x 2.2. pattern -> func obj.replace(pattern(wild), lambda wild: expr(wild)) All behavior is the same as in 2.1 but now a function in terms of pattern variables is used rather than an expression: >>> f.replace(sin(a), lambda a: sin(2*a)) log(sin(2*x)) + tan(sin(2*x**2)) 3.1. func -> func obj.replace(filter, func) Replace subexpression ``e`` with ``func(e)`` if ``filter(e)`` is True. >>> g = 2*sin(x**3) >>> g.replace(lambda expr: expr.is_Number, lambda expr: expr**2) 4*sin(x**9) The expression itself is also targeted by the query but is done in such a fashion that changes are not made twice. >>> e = x*(x*y + 1) >>> e.replace(lambda x: x.is_Mul, lambda x: 2*x) 2*x*(2*x*y + 1) When matching a single symbol, `exact` will default to True, but this may or may not be the behavior that is desired: Here, we want `exact=False`: >>> from sympy import Function >>> f = Function('f') >>> e = f(1) + f(0) >>> q = f(a), lambda a: f(a + 1) >>> e.replace(*q, exact=False) f(1) + f(2) >>> e.replace(*q, exact=True) f(0) + f(2) But here, the nature of matching makes selecting the right setting tricky: >>> e = x**(1 + y) >>> (x**(1 + y)).replace(x**(1 + a), lambda a: x**-a, exact=False) x >>> (x**(1 + y)).replace(x**(1 + a), lambda a: x**-a, exact=True) x**(-x - y + 1) >>> (x**y).replace(x**(1 + a), lambda a: x**-a, exact=False) x >>> (x**y).replace(x**(1 + a), lambda a: x**-a, exact=True) x**(1 - y) It is probably better to use a different form of the query that describes the target expression more precisely: >>> (1 + x**(1 + y)).replace( ... lambda x: x.is_Pow and x.exp.is_Add and x.exp.args[0] == 1, ... lambda x: x.base**(1 - (x.exp - 1))) ... x**(1 - y) + 1 See Also ======== subs: substitution of subexpressions as defined by the objects themselves. xreplace: exact node replacement in expr tree; also capable of using matching rules ct|Srrrquerys rrzBasic.replace..s*T5"9rc"|jSrrrrrs rrzBasic.replace..eTYY.?rc"|jSrrrs rrzBasic.replace..rrz:given a type, replace() expects another type or a callablec&|jSrrrs rrzBasic.replace..s$**U"3rr rc\t|jrj|S|Sr)allvaluesrrs rrzBasic.replace..s)v}}/49::f3E59rc&j|Sr)rrs rrzBasic.replace..s%**V2Drc td|jDr6di|jDcic]\}}t|dd|c}}S|Scc}}w)Nc3 K|]}|ywrr{)rvals rrz2Basic.replace....s>ss>s rer{)rrrrSrrrrrs rrzBasic.replace..s[>fmmo>>494E4:LLNCDAqQaC4EDHCsAc |di|jDcic]\}}t|dd|c}}Scc}}w)Nrer{)rrSrs rrzBasic.replace..s<%3E4:LLNCDAqQaC3ECs8zGgiven an expression, replace() expects another expression or a callablec|Srr{rs rrzBasic.replace..s eDkrz4given a callable, replace() expects another callablezGfirst argument to replace() must be a type, an expression or a callablec t|dd}|e|r[t|Dcgc] }|| c}}||k7r6|j|}r%t|D]\}}||k(s |||k7s|cS||}|Scc}w)z4Apply ``F`` to args and then to result. rN)rrrrh) rsFrrnewargsrer walks rrzBasic.replace..walks2vt,D#$>AT!QZ$>?Gw$RWWg.')2$.1#%7qGAJ+-I.rUI%?sA8cX|}|s|ik(r||}|||k7r r||<|}|Srr{)rrr_query_valuemapmappings r rec_replacez"Basic.replace..rec_replacesBD\F24(=Q$Y() DKr) r rrrr3rrgrr.rir) r}rrrr exactr.rrsrrrrs ```` @@@@rr"z Basic.replacessF UOE UOE eT "9F%&?%?)**u %3F}(U[[./!3%';FEF% JFEF 788e_F9'((45 5 & $ $ #G}++w      s" D9 E 9 EE EEct|}tt|t|}|s t |Si}|D]}||vr||xxdz cc<d||<|S)z)Find all subexpressions matching a query.r )_make_find_queryrgfilterrr)r}rgroupresultsgroupsrs rfindz Basic.findsj 've%8%>?@w< F! 'V#6Na'N%&F6N  ' MrcTttfdt|DS)z,Count the number of matching subexpressions.c3@K|]}t|ywr)bool)rr6rs rrzBasic.count..sI4c #Is)rsumr)r}rs `rcountz Basic.counts$ 'I/B4/HIIIrc t|}t||jsy|i}n|j}||k(r|St |j t |j k7ry|}t |j |j D]c\}}||k(r |jr% |j|j|||}n#|j|j|||}|cy|S#t$rd}YwxYw)a Helper method for match() that looks for a match between Wild symbols in self and expressions in expr. Examples ======== >>> from sympy import symbols, Wild, Basic >>> a, b, c = symbols('a b c') >>> x = Wild('x') >>> Basic(a + x, x).matches(Basic(a + b, c)) is None True >>> Basic(a + x, x).matches(Basic(a + b + c, b + c)) {x_: b + c} NrT) r rrrrirr is_Relationalrmatchesr)r}r repl_dictrTrr other_args rrz Basic.matchess t}$/  I!(I 4<  tyy>S^ + !$))TYY7 NCi   Q// 1#/FA Q// 1#/FAy  !As&#C55 DDct|}d}||j|||}||Sddlm}ddlm}ddlm}m}m } |j||||| } t|| z rttd| t|z } | s|S|j|} | j||} | r|j| |S) a* Pattern matching. Wild symbols match all. Return ``None`` when expression (self) does not match with pattern. Otherwise return a dictionary such that:: pattern.xreplace(self.match(pattern)) == self Examples ======== >>> from sympy import Wild, Sum >>> from sympy.abc import x, y >>> p = Wild("p") >>> q = Wild("q") >>> r = Wild("r") >>> e = (x+y)**(x+y) >>> e.match(p**p) {p_: x + y} >>> e.match(p**q) {p_: x + y, q_: x + y} >>> e = (2*x)**2 >>> e.match(p*q**r) {p_: 4, q_: x, r_: 2} >>> (p*q**r).xreplace(e.match(p*q**r)) 4*x**2 Structurally bound symbols are ignored during matching: >>> Sum(x, (x, 1, 2)).match(Sum(y, (y, 1, p))) {p_: 2} But they can be identified if desired: >>> Sum(x, (x, 1, 2)).match(Sum(q, (q, 1, p))) {p_: 2, q_: x} The ``old`` flag will give the old-style pattern matching where expressions and patterns are essentially solved to give the match. Both of the following give None unless ``old=True``: >>> (x - 2).match(p - x, old=True) {p_: 2*x - 2} >>> (2/x).match(p*x, old=True) {p_: 2/x**2} c>|jr|S|jSr)r&rrs rrzBasic.match..Qs1;;aAJJLrrr r)r[r) WildTensorWildTensorIndexWildTensorHeadz Some `matches` routine did not use a copy of repl_dict and injected unexpected symbols. Report this as an error at https://github.com/sympy/sympy/issues)r rrr.functionr[ tensor.tensorrrrrrrlrrupdate)r}patternrT canonicalrtr.r[rrrwildbwildwpatws rrz Basic.matchsd'"@ g  & &yC & @ 9H *OO}}T<_n] q6D=Z)>?@ @ s1v H" LL3L ' HHQKrc ddlm}|||S)z7Wrapper for count_ops that returns the operation count.r ) count_ops)rr)r}visualrs rrzBasic.count_opsns'v&&rc |jddrJ|jDcgc]&}t|tr|jdi|n|(}}|j |S|Scc}w)aEvaluate objects that are not evaluated by default like limits, integrals, sums and products. All objects of this kind will be evaluated recursively, unless some species were excluded via 'hints' or unless the 'deep' hint was set to 'False'. >>> from sympy import Integral >>> from sympy.abc import x >>> 2*Integral(x, x) 2*Integral(x, x) >>> (2*Integral(x, x)).doit() x**2 >>> (2*Integral(x, x)).doit(deep=False) 2*Integral(x, x) deepTr{)rrrrgdoitr)r}rtermtermss rrz Basic.doitssn& 99VT "59YY@-1,6dE+BYTYY''L@E@499e$ $K @s+Ac  ddlm}||fi|S)z+See the simplify function in sympy.simplifyr)simplify)r:r)r}rlrs rrzBasic.simplifys4'''rc ddlm}|||S)z,See the refine function in sympy.assumptionsr)refine)sympy.assumptions.refiner)r} assumptionrs rrz Basic.refines3dJ''rcddlm}t|t|fr1|}t |D]}|j |}||k(s||S|}!Sy)Nr )r')rcr'rintrange_eval_derivative)r}rrBr'rrobj2s r_eval_derivative_n_timeszBasic._eval_derivative_n_timessa % a#w (C1X ++A.$;$,K   Krrcf|sS|j||dd}|d}t|trd|z}n9t|dr|j}d|z}n|j j}d|z}|r+t |dr|d}tfd|D}|sSj|||fi|S)a Rewrite *self* using a defined rule. Rewriting transforms an expression to another, which is mathematically equivalent but structurally different. For example you can rewrite trigonometric functions as complex exponentials or combinatorial functions as gamma function. This method takes a *pattern* and a *rule* as positional arguments. *pattern* is optional parameter which defines the types of expressions that will be transformed. If it is not passed, all possible expressions will be rewritten. *rule* defines how the expression will be rewritten. Parameters ========== args : Expr A *rule*, or *pattern* and *rule*. - *pattern* is a type or an iterable of types. - *rule* can be any object. deep : bool, optional If ``True``, subexpressions are recursively transformed. Default is ``True``. Examples ======== If *pattern* is unspecified, all possible expressions are transformed. >>> from sympy import cos, sin, exp, I >>> from sympy.abc import x >>> expr = cos(x) + I*sin(x) >>> expr.rewrite(exp) exp(I*x) Pattern can be a type or an iterable of types. >>> expr.rewrite(sin, exp) exp(I*x)/2 + cos(x) - exp(-I*x)/2 >>> expr.rewrite([cos,], exp) exp(I*x)/2 + I*sin(x) + exp(-I*x)/2 >>> expr.rewrite([cos, sin], exp) exp(I*x) Rewriting behavior can be implemented by defining ``_eval_rewrite()`` method. >>> from sympy import Expr, sqrt, pi >>> class MySin(Expr): ... def _eval_rewrite(self, rule, args, **hints): ... x, = args ... if rule == cos: ... return cos(pi/2 - x, evaluate=False) ... if rule == sqrt: ... return sqrt(1 - cos(x)**2) >>> MySin(MySin(x)).rewrite(cos) cos(-cos(-x + pi/2) + pi/2) >>> MySin(x).rewrite(sqrt) sqrt(1 - cos(x)**2) Defining ``_eval_rewrite_as_[...]()`` method is supported for backwards compatibility reason. This may be removed in the future and using it is discouraged. >>> class MySin(Expr): ... def _eval_rewrite_as_cos(self, *args, **hints): ... x, = args ... return cos(pi/2 - x, evaluate=False) >>> MySin(x).rewrite(cos) cos(-x + pi/2) rNrez_eval_rewrite_as_%srhrc3FK|]}j|s|ywr)r!rrr}s rrz Basic.rewrite.. s>!$((1+A>s!!) rrrSrrhrrr_rewrite)r}rrrrrmethodclsnames` rrewritez Basic.rewritesTK $ s)Bx dC *T1F T: &mmG*W4Fnn--G*W4F  #!!*>w>>G t}}WdF.sCajq1Cs)rrrrr _eval_rewriter) r}rrrrrrrmeth rewrittens ` rrzBasic._rewritesyy& !YY(AJJwf>>(D(99D#C7CC4.D $0%0 .D..tTCUC $  Ktyy$(sB(c yrr{)r}rrrs rrzBasic._eval_rewrite%rrc |jj}tt}|jD]j} dt |j D}tj|D]/\}}||j|Dcgc] }|||vs |c}1l|j|gD] } | |} |Scc}w#t$rYwxYw)Nc3K|]7}|tjvr#tj|j9ywr)rg"_constructor_postprocessor_mappingr)rrs rrz9Basic._exec_constructor_postprocessors..8s:*eFFF<Xa-YZ[  ##GR0 AC&C  .Z  s*A C C C  CC CCc|j}ddlm}|||jk(r td|jS)z Convert *self* to a symbolic expression of SageMath. This version of the method is merely a placeholder. r) sympy_initz)conversion to SageMath is not implemented)_sage_sage.interfaces.sympyr r)r} old_methodr s rr z Basic._sage_Gs; [[ 4  $%&QR R;;= rcyNFr{r|s rcould_extract_minus_signzBasic.could_extract_minus_signVsrcddlm}ddlm}t ||||D]T}d|vry|\}}t ||rt ||sy|r |||cS||k(r|j |j k(rTyy)aReturn True if a and b are structurally the same, else False. If `approx` is supplied, it will be used to test whether two numbers are the same or not. By default, only numbers of the same type will compare equal, so S.Half != Float(0.5). Examples ======== In SymPy (unlike Python) two numbers do not compare the same if they are not of the same type: >>> from sympy import S >>> 2.0 == S(2) False >>> 0.5 == S.Half False By supplying a function with which to compare two numbers, such differences can be ignored. e.g. `equal_valued` will return True for decimal numbers having a denominator that is a power of 2, regardless of precision. >>> from sympy import Float >>> from sympy.core.numbers import equal_valued >>> (S.Half/4).is_same(Float(0.125, 1), equal_valued) True >>> Float(1, 2).is_same(Float(1, 10), equal_valued) True But decimals without a power of 2 denominator will compare as not being the same. >>> Float(0.1, 9).is_same(Float(0.1, 10), equal_valued) False But arbitrary differences can be ignored by supplying a function to test the equivalence of two numbers: >>> import math >>> Float(0.1, 9).is_same(Float(0.1, 10), math.isclose) True Other objects might compare the same even though types are not the same. This routine will only return True if two expressions are identical in terms of class types. >>> from sympy import eye, Basic >>> eye(1) == S(eye(1)) # mutable vs immutable True >>> Basic.is_same(eye(1), S(eye(1))) False r )Number)postorder_traversalNFT)rcr traversalrrrr)rrapproxrpotrs ris_samez Basic.is_sameYsl $9SVSV, AqyDAq!V$!!V, !!Q<'Fq{{akk9 r)returnrr)r set[Basic])rry)FT)rr)FTNFr)T)grh __module__ __qualname____doc__ __slots____annotations__propertyr~rr>is_Atomr& is_symbol is_Indexedris_Wild is_Functionis_Addrzis_Powris_Floatr is_Integeris_NumberSymbolis_Order is_Derivative is_Piecewiseis_Polyis_AlgebraicNumberr is_Equality is_Booleanis_Not is_Matrix is_Vectoris_Point is_MatAdd is_MatMulrrrrrrrrrrrr staticmethodr classmethodrrr rrrrrrrrrrr,r+r<rCrrrrKrrkrxrrr!rrrr"rrrrrrrrrrrrrrr rr __classcell__rEs@rrgrg~s:*VI   (IGIIJHGK F F FIHKJOHMLGMKJ FIIHII !! D$%'/ >4l # #D00""" ? ?<&(T !,E\M^AA", \:1"  (., , \2> M^ m m^ ?B, .. ..`76 *2 *2X!F@,D$J ,\Ob' 4( ( &#'f=P &*,&8 !CrrgcfeZdZdZdZdZd dZd dZdZe dZ e dd Z d Z ed Zy)Atomz A parent class for atomic things. An atom is an expression with no subexpressions. Examples ======== Symbol, Number, Rational, Integer, ... But not: Add, Mul, Pow, ... Tr{Nc6||k(r|iS|jSyr)r)r}rrrTs rrz Atom.matchess& 4<  >># # rc&|j||Sr)r)r}rr^s rrz Atom.xreplacesxxd##rc |Srr{)r}rs rrz Atom.doit rc dd|jfS)Nrrrrs rrzAtom.class_keys!S\\!!rc|jdt|fftjj tjfS)Nr )rrSrr!r)r}rs rrz Atom.sort_keys2~~!c$i\!2AEENN4DaeeKKrc |Srr{)r}rls r_eval_simplifyzAtom._eval_simplifyr@rctd)NzXAtoms have no args. It might be necessary to make a check for Atoms in the calling code.)AttributeErrorr|s rrzAtom._sorted_argss :; ;rrrr)rhrrrr!rrrrr9rr rrDr rr{rrr<r<seGI$ $"" L L;;rr<ct|}t}t|trt |dd}| |hStSddlm}ddlm}m }t}|D]|} | |vr|j|j| t| |r| |vr|j| Kt| ||fsZ|s|j|j| ~|S)aMReturn atom-like quantities as far as substitution is concerned: Derivatives, Functions and Symbols. Do not return any 'atoms' that are inside such quantities unless they also appear outside, too, unless `recursive` is True. Examples ======== >>> from sympy import Derivative, Function, cos >>> from sympy.abc import x, y >>> from sympy.core.basic import _atomic >>> f = Function('f') >>> _atomic(x + y) {x, y} >>> _atomic(x + f(y)) {x, f(y)} >>> _atomic(Derivative(f(x), x) + cos(x) + y) {y, cos(x), Derivative(f(x), x)} rNr r.)r2rZ) rrrrgrrr-rr2rZskipr) r recursiverseenrr-r2rZrrs r_atomicrKs* a C 5D!Uq.$/ <3Ju . EE   9 HHJ   a Q$Y IIaL J1 2 IIaL  Lrc tttrfdSttrfdSS#t$rY7wxYw)z4Convert the argument of Basic.find() into a callablect|Srrrs rrz"_make_find_query.. sJtU3rc*|jduSrrrs rrz"_make_find_query.. sDJJu-T9r)r rrrrg)rs`rrr sL %33 E5 !99 L    s : AA)r)preorder_traversalrrz Using preorder_traversal from the sympy.core.basic submodule is deprecated. Instead, use preorder_traversal from the top-level sympy namespace, like sympy.preorder_traversal z1.10z$deprecated-traversal-functions-movedr N)rmrrnrrrr)9r __future__r collectionsrcollections.abcr itertoolsrr functoolsrrr cacher r r rrrerrrr_print_helpersrsympy.utilities.decoratorrsympy.utilities.exceptionsrsympy.utilities.iterablesrrsympy.utilities.miscrrinspectrrrjrtrgrrdr _args_sortkeyr<rKr singletonrrrOrrrr{rrr^s-"##( 3II%%0@@6 $$L+!\^ I^ @A ==5==) 5!-;5-;`+\  Z$E  r