Lines Matching refs:len
166 index = random.randint(0, len(self.table) - 1)
172 for i in range(len(self.table[pos])):
176 if len(samples) == sample_size:
179 pos = pos % len(self.table)
180 if pos == index or len(samples) == sample_size:
182 assert len(samples) <= sample_size
187 for i in range(len(self.table)):
190 for j in range(len(self.table[i])):
197 for i in range(len(self.table)):
200 for j in range(len(self.table[i])):
215 index = hash % len(self.table)
219 for i in range(len(self.table[index])):
228 for i in range(len(self.table[index])):
238 if new_size == len(self.table):
246 for i in range(len(self.table)):
250 for j in range(len(entries)):
264 if self.elements < 4 * len(self.table):
266 new_size = int(len(self.table) * 1.5)
270 index = hash % len(self.table)
275 for i in range(len(self.table[index])):
291 if self.elements * 2 >= len(self.table):
293 new_size = int(len(self.table) * 0.7)
297 index = hash % len(self.table)
300 for i in range(len(self.table[index])):
347 for i in range(len(miss_bytes)):
348 avg_miss_bytes += float(miss_bytes[i]) / float(len(miss_bytes))
350 p95_index = min(int(0.95 * float(len(miss_bytes))), len(miss_bytes) - 1)
416 for i in range(len(policies)):
589 assert len(auxilliary_info) == 3
642 assert len(auxilliary_info) == 3
940 assert policy_index < len(self.policies) and policy_index >= 0
1023 for _i in range(len(policies)):
1024 self._as = [init_a] * len(self.policies)
1025 self._bs = [init_b] * len(self.policies)
1028 if len(self.policies) == 1:
1031 np.random.beta(self._as[x], self._bs[x]) for x in range(len(self.policies))
1033 selected_policy = max(range(len(self.policies)), key=lambda x: samples[x])
1064 self.th = np.zeros((len(self.policies), self.nfeatures))
1067 self.A = np.zeros((len(self.policies), self.nfeatures, self.nfeatures))
1068 self.A_inv = np.zeros((len(self.policies), self.nfeatures, self.nfeatures))
1069 for i in range(len(self.policies)):
1072 self.p = np.zeros(len(self.policies))
1076 if len(self.policies) == 1:
1082 p = np.zeros(len(self.policies))
1083 for a in range(len(self.policies)):
1089 p = p + (np.random.random(len(p)) * 0.000001)
1177 return len(self.table)
1334 return len(self.od)
1377 if self.t1 and ((key in self.b2) or (len(self.t1) > self.p)):
1408 self.p = min(self.c, self.p + max(len(self.b2) / len(self.b1), 1))
1417 self.p = max(0, self.p - max(len(self.b1) / len(self.b2), 1))
1425 while len(self.t1) + len(self.b1) >= self.c and self.b1:
1428 total = len(self.t1) + len(self.b1) + len(self.t2) + len(self.b2)
1529 return int(cs[: len(cs) - 1]) * 1024 * 1024
1531 return int(cs[: len(cs) - 1]) * 1024 * 1024 * 1024
1533 return int(cs[: len(cs) - 1]) * 1024 * 1024 * 1024 * 1024
1647 if self.current_access_index == len(self.accesses):
1741 len(block_access_timelines),
1743 percent(num_blocks_with_no_size, len(block_access_timelines)),
1890 for i in range(len(cache_stats)):
1934 for i in range(len(policy_stats)):
1954 if len(sys.argv) <= 8: