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