快速将阵列分配给等长的n个存储单元

穷人的解决方案 “可能是计算 minimum 在您的阵列之间 norm_data 和 nbins-1 :

norm_data = np.minimum(norm_data,nbins-1)

所以所有 5 4 120.0 也将在箱子4)中结束。

import numpy as np
# Things we know and can pre-calculate
n_bins = 5
minimal = 0.0  
maximal = 10.0
approx = 1.001  # <-- this is new
reciprocal_bin_length = n_bins / (maximal*approx - minimal)

# Let's say the stream gives 1001 numbers every time.
data = np.arange(1001)/100

# can use numexpr for speed.
norm_data = (data - minimal) * reciprocal_bin_length
norm_data = norm_data.astype(int)
print(norm_data.max())
print(norm_data.min())