Lines Matching full:choice_count
1770 int choice_count = alternatives_->length();
1771 for (int i = 0; i < choice_count; i++) {
2158 int choice_count = alternatives_->length();
2159 ASSERT(choice_count > 0);
2164 for (int i = 1; i < choice_count; i++) {
2858 int choice_count = alternatives_->length();
2860 for (int i = 0; i < choice_count - 1; i++) {
2874 int new_flush_budget = trace->flush_budget() / choice_count;
2891 if (choice_count > 1 && text_length != kNodeIsTooComplexForGreedyLoops) {
2927 AlternativeGenerationList alt_gens(choice_count);
2931 for (int i = first_normal_choice; i < choice_count; i++) {
2955 i < choice_count - 1)) {
2962 if (i == choice_count - 1) {
2970 if (i == choice_count - 1 && !greedy_loop) {
2984 if (i < choice_count - 1) {
3013 for (int i = first_normal_choice; i < choice_count - 1; i++) {
