![]() |
Freeciv21
Develop your civilization from humble roots to a global empire
|
State of the search. More...
Collaboration diagram for cm_state:Public Attributes | |
| struct cm_parameter | parameter |
| struct city * | pcity |
| struct tile_type_vector | lattice |
| struct tile_type_vector | lattice_by_prod [O_LAST] |
| std::array< int, O_LAST > | city_center_output = {0} |
| std::vector< std::array< int, O_LAST > > | specialist_outputs = {} |
| std::vector< city * > | gov_centers |
| std::array< cached_waste, O_LAST > | waste |
| struct partial_solution | best |
| struct cm_fitness | best_value |
| int | min_production [O_LAST] |
| int | min_luxury |
| struct partial_solution | current |
| struct { | |
| int * stack | |
| int size | |
| } | choice |
| bool * | workers_map |
State of the search.
This holds all the information needed to do the search, all in one struct, in order to clean up the function calls.
| struct partial_solution cm_state::best |
Definition at line 212 of file cm.cpp.
Referenced by bb_next(), choice_is_promising(), cm_find_best_solution(), and cm_state_free().
| struct cm_fitness cm_state::best_value |
Definition at line 212 of file cm.cpp.
Referenced by bb_next(), and begin_search().
| struct { ... } cm_state::choice |
Referenced by begin_search(), choice_stack_empty(), cm_state_free(), last_choice(), pop_choice(), take_child_choice(), and take_sibling_choice().
| std::array<int, O_LAST> cm_state::city_center_output = {0} |
Definition at line 203 of file cm.cpp.
Referenced by compute_max_stats_heuristic(), and init_tile_lattice().
| struct partial_solution cm_state::current |
Definition at line 225 of file cm.cpp.
Referenced by bb_next(), begin_search(), choice_is_promising(), cm_state_free(), next_choice(), pop_choice(), take_child_choice(), and take_sibling_choice().
| std::vector<city *> cm_state::gov_centers |
Definition at line 209 of file cm.cpp.
Referenced by apply_solution(), cm_query_result(), and compute_max_stats_heuristic().
| struct tile_type_vector cm_state::lattice |
Definition at line 196 of file cm.cpp.
Referenced by begin_search(), cm_state_free(), init_specialist_lattice_nodes(), init_tile_lattice(), num_types(), and tile_type_get().
| struct tile_type_vector cm_state::lattice_by_prod[O_LAST] |
Definition at line 196 of file cm.cpp.
Referenced by cm_state_free(), compute_max_stats_heuristic(), and min_food_surplus_for_fastest_growth().
| int cm_state::min_luxury |
Definition at line 225 of file cm.cpp.
Referenced by choice_is_promising().
| int cm_state::min_production[O_LAST] |
Definition at line 222 of file cm.cpp.
Referenced by choice_is_promising(), and init_min_production().
| struct cm_parameter cm_state::parameter |
Definition at line 185 of file cm.cpp.
Referenced by begin_search(), choice_is_promising(), convert_solution_to_result(), estimate_fitness(), init_min_production(), and init_tile_lattice().
| struct city* cm_state::pcity |
Definition at line 196 of file cm.cpp.
Referenced by add_workers(), apply_solution(), begin_search(), choice_is_promising(), cm_find_best_solution(), cm_query_result(), cm_result_from_main_map(), compute_max_stats_heuristic(), convert_solution_to_result(), estimate_fitness(), init_min_production(), and min_food_surplus_for_fastest_growth().
| int cm_state::size |
Definition at line 236 of file cm.cpp.
Referenced by begin_search(), choice_stack_empty(), last_choice(), pop_choice(), take_child_choice(), and take_sibling_choice().
| std::vector<std::array<int, O_LAST> > cm_state::specialist_outputs = {} |
Definition at line 206 of file cm.cpp.
Referenced by apply_solution(), and init_specialist_lattice_nodes().
| int* cm_state::stack |
Definition at line 235 of file cm.cpp.
Referenced by cm_state_free(), last_choice(), take_child_choice(), and take_sibling_choice().
| std::array<cached_waste, O_LAST> cm_state::waste |
Definition at line 212 of file cm.cpp.
Referenced by apply_solution(), and compute_max_stats_heuristic().
| bool* cm_state::workers_map |
Definition at line 239 of file cm.cpp.
Referenced by apply_solution(), cm_state_free(), and convert_solution_to_result().