安利框架，原生 Python 的 functional 库，无伤尾递归加模式匹配。

模式匹配用到的类型系统类似 ts。

pattern-matching

• demo1

from pattern_matching.core.match import when, overwrite
from pattern_matching import var, Using
from numpy.random import randint

with Using(scope=locals(), use_tco=True):
    @overwrite((var, *var))
    def qsort(head, tail):
        lowers = [i for i in tail if i < head]
        highers = [i for i in tail if i >= head]
        return qsort(lowers) + [head] + qsort(highers)

@when(var)
def qsort(lst):
    return lst
print(qsort(randint(0, 2000, size=(1200, ))))

• demo2

from pattern_matching import Match, when, var, T, t, match_err, _, overwrite

@overwrite(_ == 1, var[int])
def u_func(res):
    return res

@when(var < 0, _)
def u_func():
  raise varueError('input should be positive.')

@when(var[int] > 1, var) 
def u_func(now, res):
  return u_func(now-1, res*now)

@when(var[int])
def u_func(now):
  return u_func(now, 1)

u_func(10, 1)  # => 3628800

大哥哥们有什么看法吗?