snap.py 文件源码

def __call__(self, t, d=0):
        for m in range(len(self.T)):
            if t > self.T[m] and m != len(self.T) - 1:
                t -= self.T[m]
            else: break
        P = 0
        for n in range(d, self.order + 1):
            P += self.p[m][n] * (factorial(n) / factorial(n - d)) * t**(n - d)
        return P