| paul@6 | 1 | #!/usr/bin/env python |
| paul@6 | 2 | |
| paul@6 | 3 | """ |
| paul@6 | 4 | Operator support. |
| paul@6 | 5 | |
| paul@762 | 6 | Copyright (C) 2010, 2013, 2015, 2016, 2017 Paul Boddie <paul@boddie.org.uk> |
| paul@6 | 7 | |
| paul@6 | 8 | This program is free software; you can redistribute it and/or modify it under |
| paul@6 | 9 | the terms of the GNU General Public License as published by the Free Software |
| paul@6 | 10 | Foundation; either version 3 of the License, or (at your option) any later |
| paul@6 | 11 | version. |
| paul@6 | 12 | |
| paul@6 | 13 | This program is distributed in the hope that it will be useful, but WITHOUT |
| paul@6 | 14 | ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS |
| paul@6 | 15 | FOR A PARTICULAR PURPOSE. See the GNU General Public License for more |
| paul@6 | 16 | details. |
| paul@6 | 17 | |
| paul@6 | 18 | You should have received a copy of the GNU General Public License along with |
| paul@6 | 19 | this program. If not, see <http://www.gnu.org/licenses/>. |
| paul@6 | 20 | """ |
| paul@6 | 21 | |
| paul@6 | 22 | from operator.core import binary_op, is_, is_not |
| paul@762 | 23 | from native import int_add, int_div, int_mod, int_mul, int_pow, int_sub, \ |
| paul@798 | 24 | int_lshift, int_rshift, \ |
| paul@762 | 25 | int_and, int_not, int_or, int_xor, \ |
| paul@762 | 26 | is_int |
| paul@6 | 27 | |
| paul@6 | 28 | # These functions defer method lookup by wrapping the attribute access in |
| paul@6 | 29 | # lambda functions. Thus, the appropriate methods are defined locally, but no |
| paul@6 | 30 | # attempt to obtain them is made until the generic function is called. |
| paul@6 | 31 | |
| paul@6 | 32 | # Binary operator functions. |
| paul@6 | 33 | |
| paul@6 | 34 | def add(a, b): |
| paul@762 | 35 | if is_int(a) and is_int(b): |
| paul@762 | 36 | return int_add(a, b) |
| paul@6 | 37 | return binary_op(a, b, lambda a: a.__add__, lambda b: b.__radd__) |
| paul@6 | 38 | |
| paul@6 | 39 | def and_(a, b): |
| paul@762 | 40 | if is_int(a) and is_int(b): |
| paul@762 | 41 | return int_and(a, b) |
| paul@6 | 42 | return binary_op(a, b, lambda a: a.__and__, lambda b: b.__rand__) |
| paul@6 | 43 | |
| paul@6 | 44 | def contains(a, b): |
| paul@6 | 45 | return in_(b, a) |
| paul@6 | 46 | |
| paul@6 | 47 | def div(a, b): |
| paul@762 | 48 | if is_int(a) and is_int(b): |
| paul@762 | 49 | return int_div(a, b) |
| paul@6 | 50 | return binary_op(a, b, lambda a: a.__div__, lambda b: b.__rdiv__) |
| paul@6 | 51 | |
| paul@6 | 52 | def floordiv(a, b): |
| paul@6 | 53 | return binary_op(a, b, lambda a: a.__floordiv__, lambda b: b.__rfloordiv__) |
| paul@6 | 54 | |
| paul@6 | 55 | def in_(a, b): |
| paul@277 | 56 | return b.__contains__(a) |
| paul@6 | 57 | |
| paul@6 | 58 | def not_in(a, b): |
| paul@277 | 59 | return not b.__contains__(a) |
| paul@6 | 60 | |
| paul@6 | 61 | def lshift(a, b): |
| paul@798 | 62 | if is_int(a) and is_int(b): |
| paul@798 | 63 | return int_lshift(a, b) |
| paul@6 | 64 | return binary_op(a, b, lambda a: a.__lshift__, lambda b: b.__rlshift__) |
| paul@6 | 65 | |
| paul@6 | 66 | def mod(a, b): |
| paul@762 | 67 | if is_int(a) and is_int(b): |
| paul@762 | 68 | return int_mod(a, b) |
| paul@6 | 69 | return binary_op(a, b, lambda a: a.__mod__, lambda b: b.__rmod__) |
| paul@6 | 70 | |
| paul@6 | 71 | def mul(a, b): |
| paul@762 | 72 | if is_int(a) and is_int(b): |
| paul@762 | 73 | return int_mul(a, b) |
| paul@6 | 74 | return binary_op(a, b, lambda a: a.__mul__, lambda b: b.__rmul__) |
| paul@6 | 75 | |
| paul@6 | 76 | def or_(a, b): |
| paul@762 | 77 | if is_int(a) and is_int(b): |
| paul@762 | 78 | return int_or(a, b) |
| paul@6 | 79 | return binary_op(a, b, lambda a: a.__or__, lambda b: b.__ror__) |
| paul@6 | 80 | |
| paul@6 | 81 | def pow(a, b): |
| paul@762 | 82 | if is_int(a) and is_int(b): |
| paul@762 | 83 | return int_pow(a, b) |
| paul@6 | 84 | return binary_op(a, b, lambda a: a.__pow__, lambda b: b.__rpow__) |
| paul@6 | 85 | |
| paul@6 | 86 | def rshift(a, b): |
| paul@798 | 87 | if is_int(a) and is_int(b): |
| paul@798 | 88 | return int_rshift(a, b) |
| paul@6 | 89 | return binary_op(a, b, lambda a: a.__rshift__, lambda b: b.__rrshift__) |
| paul@6 | 90 | |
| paul@6 | 91 | def sub(a, b): |
| paul@762 | 92 | if is_int(a) and is_int(b): |
| paul@762 | 93 | return int_sub(a, b) |
| paul@6 | 94 | return binary_op(a, b, lambda a: a.__sub__, lambda b: b.__rsub__) |
| paul@6 | 95 | |
| paul@6 | 96 | def xor(a, b): |
| paul@762 | 97 | if is_int(a) and is_int(b): |
| paul@762 | 98 | return int_xor(a, b) |
| paul@6 | 99 | return binary_op(a, b, lambda a: a.__xor__, lambda b: b.__rxor__) |
| paul@6 | 100 | |
| paul@6 | 101 | # vim: tabstop=4 expandtab shiftwidth=4 |
