カリー化演算子(lambdaの仕様理解の旅)

0.curriedope.py

import operator as ope 
from functools import partial

lt, le, eq, ne, ge, gt = [(lambda x: partial(o, x)) for o in [ope.lt, ope.le, ope.eq, ope.ne, ope.ge, ope.gt]]

test = [f for f in [lt(1), le(1), eq(1), ne(1), ge(1), gt(1)]]
print(*test, sep="\n")

1.wtf.(why are all "gt"(the operator of last element)?)

functools.partial(<built-in function gt>, 1)
functools.partial(<built-in function gt>, 1)
functools.partial(<built-in function gt>, 1)
functools.partial(<built-in function gt>, 1)
functools.partial(<built-in function gt>, 1)
functools.partial(<built-in function gt>, 1)

3.solved.py

import operator as ope 
from functools import partial

def currying(o):
    def f(x):
        return partial(o, x)
    return f

lt, le, eq, ne, gt, ge = [currying(o) for o in [ope.lt, ope.le, ope.eq, ope.ne, ope.gt, ope.ge]]

test = [f for f in [lt(1), le(1), eq(1), ne(1), ge(1), gt(1)]]
print(*test, sep="\n")

4.awesomepythonlambda.py

f = lambda x: x + i

i = 1

print(f(10))

i = 9990

print(f(10))

5.omg

11
10000