Lines Matching refs:speaker

43             for (int speaker = 0; speaker < number_of_variables; ++speaker)  in Next()
45 IntVar var = vars_[speaker]; in Next()
50 matching.AddArcWithCost(speaker, value - first_slot_, value); in Next()
54 matching.AddArcWithCost(speaker, value - first_slot_, large); in Next()
70 for (int speaker = 0; speaker < number_of_variables; ++speaker) in Next()
72 vars_[speaker].SetValue(matching.RightMate(speaker) + first_slot_); in Next()
147 for (int speaker = 0; speaker < number_of_speakers; ++speaker) in Solve()
149 int duration = durations[speaker]; in Solve()
152 int availability = speaker_availability[speaker].Length; in Solve()
156 int slot = speaker_availability[speaker][index]; in Solve()
164 speaker_availability[speaker][index + offset] != slot + offset) in Solve()
175 possible_starts[speaker] = filtered_starts.ToArray(); in Solve()
177 starts[speaker] = solver.MakeIntVar(possible_starts[speaker], "start[" + speaker + "]"); in Solve()
185 for (int speaker = 0; speaker < number_of_speakers; ++speaker) in Solve()
187 int duration = durations[speaker]; in Solve()
188 IntVar start_var = starts[speaker]; in Solve()
189 foreach (int start in possible_starts[speaker]) in Solve()
204 for (int speaker = 0; speaker < number_of_speakers; ++speaker) in Solve()
206 solver.Add(starts[speaker] >= first_slot); in Solve()
211 for (int speaker = 0; speaker < number_of_speakers; speaker++) in Solve()
213 end_times[speaker] = (starts[speaker] + (durations[speaker] - 1)).Var(); in Solve()
230 for (int speaker = 0; speaker < number_of_speakers; ++speaker) in Solve()
232 if (durations[speaker] == 1) in Solve()
234 short_talks.Add(starts[speaker]); in Solve()
238 long_talks.Add(starts[speaker]); in Solve()