Lines Matching full:choice_count
1788 int choice_count = alternatives_->length();
1789 for (int i = 0; i < choice_count; i++) {
2173 int choice_count = alternatives_->length();
2174 ASSERT(choice_count > 0);
2179 for (int i = 1; i < choice_count; i++) {
2876 int choice_count = alternatives_->length();
2878 for (int i = 0; i < choice_count - 1; i++) {
2892 int new_flush_budget = trace->flush_budget() / choice_count;
2909 if (choice_count > 1 && text_length != kNodeIsTooComplexForGreedyLoops) {
2945 AlternativeGenerationList alt_gens(choice_count);
2949 for (int i = first_normal_choice; i < choice_count; i++) {
2973 i < choice_count - 1)) {
2980 if (i == choice_count - 1) {
2988 if (i == choice_count - 1 && !greedy_loop) {
3002 if (i < choice_count - 1) {
3031 for (int i = first_normal_choice; i < choice_count - 1; i++) {
