Lines Matching refs:count
66 b_id, count = b_match.groups()
67 b_id_counts[int(b_id)] = int(float(count))
69 from_id, to_id, count = g.groups()
76 count = int(round(float(count)))
77 if count == 0:
80 path_counts[from_id][to_id] = count
81 total_edges += count
185 count = path_counts[j][i]
186 assert path_counts[i].values() == [count]
207 count = min(arc_counts)
209 local_path_counts[i][j] -= count
210 return (count, arc)
231 succs = [k for (k, count) in local_path_counts[node_id].iteritems()
232 if count > 0]
273 arc_heads = dict_list([(arc[0], (count, arc)) for (count, arc) in arcs])
276 for (count, arc) in arcs:
277 print 'Arc (%d iterations): {' % count
280 print_arc_rec(arc, [], count, {})
283 def print_arc_rec(arc, init_ctxt, count, arc_heads):
289 assert count2 % count == 0, (count2, count)
290 print 'Loop (%d iterations) {' % (count2 / count)
340 for (j, count) in path_counts.get(i, {}).iteritems():
341 outgoing[li] += count
347 rev_graph[lj][li] = count
363 def print_backtracks_rec(chunk, count, rev_graph):
365 if count <= 0:
371 opts = [(next_id, count - (sum_opts - c)) for (next_id, c) in rev_opts]
374 return [track for (next_id, count) in opts
376 count, rev_graph)]
382 [(next_id, count)] = opts
440 count = funs_to_count[fun]
441 print "%s: %u instructions / %.2f %%" % (fun, count, float (count) / total_inst_ran * 100)
462 count = b_id_counts[b_id]
463 if count > maxi:
465 maxi = count
466 print 't: max_id b%d, count %d' % (max_id, maxi)
467 print 'max_id b%d, count %d' % (max_id, maxi)