| /dports/math/py-numpy/numpy-1.20.3/numpy/core/tests/ |
| H A D | test_scalarinherit.py | 66 assert_(np_s.__radd__(np_s) is NotImplemented)
67 assert_(np_s.__radd__(np_u) is NotImplemented)
68 assert_(np_s.__radd__(s) is NotImplemented)
69 assert_(np_s.__radd__(u) is NotImplemented)
70 assert_(np_u.__radd__(np_s) is NotImplemented)
71 assert_(np_u.__radd__(np_u) is NotImplemented)
72 assert_(np_u.__radd__(s) is NotImplemented)
73 assert_(np_u.__radd__(u) is NotImplemented)
|
| /dports/sysutils/py-salt/salt-3004.1/tests/unit/utils/ |
| H A D | test_immutabletypes.py | 22 __radd__ = lst + imt
23 self.assertEqual(__radd__, [4, 5, 6, 1, 2, 3])
30 __radd__ = lst + imt
31 self.assertEqual(__radd__, [4, 5, 6, 1, 2, 3])
|
| /dports/lang/cython-devel/cython-2b1e743/tests/run/ |
| H A D | binop_reverse_methods_GH2056.pyx | 16 'Base.__radd__(Base(), 2)'
45 def __radd__(self, other): member in Base
47 return "Base.__radd__(%s, %s)" % (self, other)
74 'Base.__radd__(OverloadLeft(), 2)'
110 'OverloadRight.__radd__(OverloadRight(), 2)'
115 'OverloadRight.__radd__(OverloadRight(), Base())'
132 def __radd__(self, other): member in OverloadRight
134 return "OverloadRight.__radd__(%s, %s)" % (self, other)
|
| /dports/databases/py-gdbm/Python-3.8.12/Doc/library/ |
| H A D | numbers.rst | 125 means that :meth:`__add__` and :meth:`__radd__` should be defined as::
137 def __radd__(self, other):
163 that ``B`` defines a more intelligent :meth:`__radd__`, so the
167 3. Then ``B``'s :meth:`__radd__` gets a chance. If it accepts
172 5. If ``B <: A``, Python tries ``B.__radd__`` before
179 in :class:`complex`, and both :meth:`__radd__` s land there, so ``a+b
221 __add__, __radd__ = _operator_fallbacks(_add, operator.add)
|
| /dports/lang/python37/Python-3.7.12/Doc/library/ |
| H A D | numbers.rst | 125 means that :meth:`__add__` and :meth:`__radd__` should be defined as::
137 def __radd__(self, other):
163 that ``B`` defines a more intelligent :meth:`__radd__`, so the
167 3. Then ``B``'s :meth:`__radd__` gets a chance. If it accepts
172 5. If ``B <: A``, Python tries ``B.__radd__`` before
179 in :class:`complex`, and both :meth:`__radd__` s land there, so ``a+b
221 __add__, __radd__ = _operator_fallbacks(_add, operator.add)
|
| /dports/lang/python38/Python-3.8.12/Doc/library/ |
| H A D | numbers.rst | 125 means that :meth:`__add__` and :meth:`__radd__` should be defined as::
137 def __radd__(self, other):
163 that ``B`` defines a more intelligent :meth:`__radd__`, so the
167 3. Then ``B``'s :meth:`__radd__` gets a chance. If it accepts
172 5. If ``B <: A``, Python tries ``B.__radd__`` before
179 in :class:`complex`, and both :meth:`__radd__` s land there, so ``a+b
221 __add__, __radd__ = _operator_fallbacks(_add, operator.add)
|
| /dports/lang/python310/Python-3.10.1/Doc/library/ |
| H A D | numbers.rst | 126 means that :meth:`__add__` and :meth:`__radd__` should be defined as::
138 def __radd__(self, other):
164 that ``B`` defines a more intelligent :meth:`__radd__`, so the
168 3. Then ``B``'s :meth:`__radd__` gets a chance. If it accepts
173 5. If ``B <: A``, Python tries ``B.__radd__`` before
180 in :class:`complex`, and both :meth:`__radd__` s land there, so ``a+b
222 __add__, __radd__ = _operator_fallbacks(_add, operator.add)
|
| /dports/lang/python-tools/Python-3.8.12/Doc/library/ |
| H A D | numbers.rst | 125 means that :meth:`__add__` and :meth:`__radd__` should be defined as::
137 def __radd__(self, other):
163 that ``B`` defines a more intelligent :meth:`__radd__`, so the
167 3. Then ``B``'s :meth:`__radd__` gets a chance. If it accepts
172 5. If ``B <: A``, Python tries ``B.__radd__`` before
179 in :class:`complex`, and both :meth:`__radd__` s land there, so ``a+b
221 __add__, __radd__ = _operator_fallbacks(_add, operator.add)
|
| /dports/lang/python-legacy/Python-2.7.18/Doc/library/ |
| H A D | numbers.rst | 122 means that :meth:`__add__` and :meth:`__radd__` should be defined as::
134 def __radd__(self, other):
160 that ``B`` defines a more intelligent :meth:`__radd__`, so the
164 3. Then ``B``'s :meth:`__radd__` gets a chance. If it accepts
169 5. If ``B <: A``, Python tries ``B.__radd__`` before
176 in :class:`complex`, and both :meth:`__radd__` s land there, so ``a+b
218 __add__, __radd__ = _operator_fallbacks(_add, operator.add)
|
| /dports/lang/python27/Python-2.7.18/Doc/library/ |
| H A D | numbers.rst | 122 means that :meth:`__add__` and :meth:`__radd__` should be defined as::
134 def __radd__(self, other):
160 that ``B`` defines a more intelligent :meth:`__radd__`, so the
164 3. Then ``B``'s :meth:`__radd__` gets a chance. If it accepts
169 5. If ``B <: A``, Python tries ``B.__radd__`` before
176 in :class:`complex`, and both :meth:`__radd__` s land there, so ``a+b
218 __add__, __radd__ = _operator_fallbacks(_add, operator.add)
|
| /dports/lang/python39/Python-3.9.9/Doc/library/ |
| H A D | numbers.rst | 126 means that :meth:`__add__` and :meth:`__radd__` should be defined as::
138 def __radd__(self, other):
164 that ``B`` defines a more intelligent :meth:`__radd__`, so the
168 3. Then ``B``'s :meth:`__radd__` gets a chance. If it accepts
173 5. If ``B <: A``, Python tries ``B.__radd__`` before
180 in :class:`complex`, and both :meth:`__radd__` s land there, so ``a+b
222 __add__, __radd__ = _operator_fallbacks(_add, operator.add)
|
| /dports/x11-toolkits/py-tkinter/Python-3.8.12/Doc/library/ |
| H A D | numbers.rst | 125 means that :meth:`__add__` and :meth:`__radd__` should be defined as::
137 def __radd__(self, other):
163 that ``B`` defines a more intelligent :meth:`__radd__`, so the
167 3. Then ``B``'s :meth:`__radd__` gets a chance. If it accepts
172 5. If ``B <: A``, Python tries ``B.__radd__`` before
179 in :class:`complex`, and both :meth:`__radd__` s land there, so ``a+b
221 __add__, __radd__ = _operator_fallbacks(_add, operator.add)
|
| /dports/databases/py-sqlite3/Python-3.8.12/Doc/library/ |
| H A D | numbers.rst | 125 means that :meth:`__add__` and :meth:`__radd__` should be defined as::
137 def __radd__(self, other):
163 that ``B`` defines a more intelligent :meth:`__radd__`, so the
167 3. Then ``B``'s :meth:`__radd__` gets a chance. If it accepts
172 5. If ``B <: A``, Python tries ``B.__radd__`` before
179 in :class:`complex`, and both :meth:`__radd__` s land there, so ``a+b
221 __add__, __radd__ = _operator_fallbacks(_add, operator.add)
|
| /dports/lang/python311/Python-3.11.0a3/Doc/library/ |
| H A D | numbers.rst | 126 means that :meth:`__add__` and :meth:`__radd__` should be defined as::
138 def __radd__(self, other):
164 that ``B`` defines a more intelligent :meth:`__radd__`, so the
168 3. Then ``B``'s :meth:`__radd__` gets a chance. If it accepts
173 5. If ``B <: A``, Python tries ``B.__radd__`` before
180 in :class:`complex`, and both :meth:`__radd__` s land there, so ``a+b
222 __add__, __radd__ = _operator_fallbacks(_add, operator.add)
|
| /dports/math/adol-c/ADOL-C-2.7.2/ADOL-C/swig/ |
| H A D | adolc-octave.i | 80 adub* __radd__(double a) const { in __radd__() function
86 adub* __radd__(const pdouble& a) const { in __radd__() function
143 adub* __radd__(double a) const { in __radd__() function
|
| /dports/math/py-cvxpy/cvxpy-1.1.17/examples/advanced/ |
| H A D | test.py | 64 def __radd__(self, other): member in Exp
80 def __radd__(self, rhs): return 1 member in Bar1
|
| /dports/devel/pycharm-pro/pycharm-2020.2.3/plugins/python/helpers/typeshed/third_party/2and3/dateutil/ |
| H A D | relativedelta.pyi | 68 def __radd__(self: _SelfT, other: relativedelta) -> _SelfT: ...
70 def __radd__(self: _SelfT, other: timedelta) -> _SelfT: ...
72 def __radd__(self, other: _DateT) -> _DateT: ...
|
| /dports/devel/pytype/pytype-2021.9.9/pytype/typeshed/stubs/python-dateutil/dateutil/ |
| H A D | relativedelta.pyi | 74 def __radd__(self: _SelfT, other: relativedelta) -> _SelfT: ...
76 def __radd__(self: _SelfT, other: timedelta) -> _SelfT: ...
78 def __radd__(self, other: _DateT) -> _DateT: ...
|
| /dports/devel/py-jedi/jedi-0.18.0/jedi/third_party/typeshed/third_party/2and3/dateutil/ |
| H A D | relativedelta.pyi | 68 def __radd__(self: _SelfT, other: relativedelta) -> _SelfT: ...
70 def __radd__(self: _SelfT, other: timedelta) -> _SelfT: ...
72 def __radd__(self, other: _DateT) -> _DateT: ...
|
| /dports/textproc/py-elasticsearch-dsl/elasticsearch-dsl-7.3.0/elasticsearch_dsl/ |
| H A D | query.py | 71 return other.__radd__(self)
98 __and__ = __rand__ = __radd__ = __add__
118 __and__ = __rand__ = __radd__ = __add__
149 __radd__ = __add__ variable in Bool
|
| /dports/textproc/py-elasticsearch-dsl6/elasticsearch-dsl-6.4.0/elasticsearch_dsl/ |
| H A D | query.py | 45 return other.__radd__(self)
70 __and__ = __rand__ = __radd__ = __add__
84 __and__ = __rand__ = __radd__ = __add__
112 __radd__ = __add__ variable in Bool
|
| /dports/devel/py-mypy/mypy-0.910/test-data/unit/fixtures/ |
| H A D | ops.pyi | 40 def __radd__(self, x: 'int') -> 'int': pass
61 def __radd__(self, x: 'float') -> 'float': pass
69 def __radd__(self, x: complex) -> complex: pass
|
| /dports/devel/fbthrift/fbthrift-2021.12.27.00/thrift/compiler/test/fixtures/py3/gen-py3/module/ |
| H A D | types.pyi | 281 def __radd__(self, other: _List__i16T) -> _List__i16T: ...
299 def __radd__(self, other: _List__i32T) -> _List__i32T: ...
317 def __radd__(self, other: _List__i64T) -> _List__i64T: ...
335 def __radd__(self, other: _List__stringT) -> _List__stringT: ...
353 def __radd__(self, other: _List__SimpleStructT) -> _List__SimpleStructT: ...
428 def __radd__(self, other: _List__List__i32T) -> _List__List__i32T: ...
464 def __radd__(self, other: _List__Set__stringT) -> _List__Set__stringT: ...
491 def __radd__(self, other: _List__List__stringT) -> _List__List__stringT: ...
509 def __radd__(self, other: _List__Set__i32T) -> _List__Set__i32T: ...
545 def __radd__(self, other: _List__binaryT) -> _List__binaryT: ...
[all …]
|
| /dports/devel/fbthrift/fbthrift-2021.12.27.00/thrift/compiler/test/fixtures/includes/gen-py3/matching_struct_names/ |
| H A D | types.pyi | 105 def __radd__(self, other: _List__MyStructT) -> _List__MyStructT: ...
123 def __radd__(self, other: _List__List__MyStructT) -> _List__List__MyStructT: ...
141 def __radd__(self, other: _List__module_MyStructT) -> _List__module_MyStructT: ...
159 def __radd__(self, other: _List__List__module_MyStructT) -> _List__List__module_MyStructT: ...
|
| /dports/devel/py-xarray/xarray-0.20.1/xarray/core/ |
| H A D | _typed_ops.pyi | 53 def __radd__(self: T_Dataset, other: DsCompatible) -> T_Dataset: ...
174 def __radd__(self, other: T_Dataset) -> T_Dataset: ...
178 def __radd__(self: T_DataArray, other: DaCompatible) -> T_DataArray: ...
344 def __radd__(self, other: T_Dataset) -> T_Dataset: ...
346 def __radd__(self, other: T_DataArray) -> T_DataArray: ...
348 def __radd__(self: T_Variable, other: VarCompatible) -> T_Variable: ...
514 def __radd__(self, other: T_Dataset) -> T_Dataset: ...
518 def __radd__(self, other: GroupByIncompatible) -> NoReturn: ...
674 def __radd__(self, other: T_Dataset) -> T_Dataset: ...
676 def __radd__(self, other: T_DataArray) -> T_DataArray: ...
[all …]
|