88     input_cs(),  in MIP_Problem()
118     input_cs(),  in MIP_Problem()
503   const dimension_type cs_num_rows = input_cs.size();  in parse_constraints()
555     const Constraint& cs_i = *(input_cs[i]);  in parse_constraints()
810        i = input_cs.size() - first_pending_constraint; i-- > 0; ) {  in process_pending_constraints()
818     const Constraint& c = *(input_cs[i + first_pending_constraint]);  in process_pending_constraints()
2002       x.first_pending_constraint = input_cs.size();  in is_lp_satisfiable()
2142   const std::vector<Constraint*>& input_cs = mip.input_cs;  in choose_branching_variable()  local
2167   const dimension_type input_cs_num_rows = input_cs.size();  in choose_branching_variable()
2172     if (input_cs[i]->is_equality()  in choose_branching_variable()
2173         || is_saturated(*(input_cs[i]), last_generator)) {  in choose_branching_variable()
2194       if (*v_it >= input_cs[i]->space_dimension()) {  in choose_branching_variable()
2197       if (input_cs[i]->coefficient(Variable(*v_it)) != 0) {  in choose_branching_variable()
2319   const dimension_type input_cs_num_rows = input_cs.size();  in OK()
2349     if (input_cs[i]->is_strict_inequality()) {  in OK()
2412       if (!is_satisfied(*(input_cs[i]), last_generator)) {  in OK()
2550   const dimension_type input_cs_size = input_cs.size();  in ascii_dump()
2554     input_cs[i]->ascii_dump(s);  in ascii_dump()
2664   input_cs.reserve(input_cs_size);  in PPL_OUTPUT_DEFINITIONS()