On 8/02/19 7:45 PM, Kaka wrote:
for i in range(len(A.hp)):
for j in range(len(run_parameters.bits_Mod)):
req_slots[j] = math.ceil((A.T[i])
for g in Temp[i]["Available_ranges"][j]:
for s in range(g[0], g[-1]):
if (s+req_slots[j]-1) <= g[-1]
On Thursday, February 7, 2019 at 11:45:23 PM UTC-7, Kaka wrote:
> for i in range(len(A.hp)):
>
> for j in range(len(run_parameters.bits_Mod)):
> req_slots[j] = math.ceil((A.T[i])
>
> for g in Temp[i]["Available_ranges"][j]:
> for s in range(g[0], g[-1]):
>
Kaka wrote:
> for i in range(len(A.hp)):
>
> for j in range(len(run_parameters.bits_Mod)):
> req_slots[j] = math.ceil((A.T[i])
>
> for g in Temp[i]["Available_ranges"][j]:
> for s in range(g[0], g[-1]):
> if (s+req_slots[j]-1) <= g[-1]:
>
for i in range(len(A.hp)):
for j in range(len(run_parameters.bits_Mod)):
req_slots[j] = math.ceil((A.T[i])
for g in Temp[i]["Available_ranges"][j]:
for s in range(g[0], g[-1]):
if (s+req_slots[j]-1) <= g[-1]:
if (Temp[i]['cost'][