code: def fpbspl(t, n, k, x, l, h, hh):
      
      h[0] = 1.0
      for j in range(1, k + 1):
          hh[0:j] = h[0:j]
          h[0] = 0.0
          for i in range(j):
              li = l+i
              f = hh[i]/(t[li] - t[li - j])
              h[i] = h[i] + f*(t[li] - x)
              h[i + 1] = f*(x - t[li - j])
docs: subroutine fpbspl evaluates the (k+1) non-zero b-splines of
      degree k at t(l) <= x < t(l+1) using the stable recurrence
      relation of de boor and cox.
      
      All arrays are 1d!
      Optimized the assignment and order and so on.