C++ unit_map::get_cookie方法代码示例

void attack_analysis::analyze(const gamemap& map, unit_map& units,
				std::map<std::pair<const unit*, const unit_type*>, battle_context*>& unit_stats_cache,
				const std::vector<std::pair<unit*, int> >& units2,
				const std::multimap<map_location, int>& srcdst2, const std::multimap<int, map_location>& dstsrc2,
				std::map<unit*, std::pair<map_location, unit*>* >& reside_cache,
				double aggression)
{
	target_value = target->cost();
	target_value += 0.5 * (double(target->experience()) / double(target->max_experience())) * target_value;
	target_starting_damage = target->max_hitpoints() - target->hitpoints();

	VALIDATE(!movements.empty(), _("ai::attack_analisis::analyze, movements is empty."));

	std::pair<std::pair<unit*, int>, map_location>& m = movements.back();
	map_location orig_loc = m.first.first->get_location();

	std::pair<map_location, unit*>* up;
	if (m.first.second < 0) {
		// We fix up units map to reflect what this would look like.
		if (m.second == orig_loc) {
			up = units.get_cookie(m.second, !m.first.first->base());
		} else {
			up = units.extract(orig_loc);
			up->first = m.second;
			units.place(up);
		}
	} else {
		// units.add(m.second, m.first.first);
		std::map<unit*, std::pair<map_location, unit*>* >::iterator cache_itor = reside_cache.find(m.first.first);
		if (cache_itor == reside_cache.end()) {
			up = new std::pair<map_location, unit*>(m.second, m.first.first);
			reside_cache[m.first.first] = up;
		} else {
			up = cache_itor->second;
		}
		up->first = m.second;
		units.place(up);
	}

	unit_map::node* base = units.get_cookie(m.second, false);
	bool on_wall = base && base->second->wall();

		int att_weapon = -1, def_weapon = -1;
		bool from_cache = false;
		battle_context *bc;
		const unit* src_ptr = up->second;

		// This cache is only about 99% correct, but speeds up evaluation by about 1000 times.
		// We recalculate when we actually attack.
		const unit_type* src_type;
		if (!src_ptr->packed()) {
			src_type = src_ptr->type();
		} else {
			src_type = unit_types.find(src_ptr->packee_type_id());
		}

		std::map<std::pair<const unit*, const unit_type*>, battle_context*>::iterator usc;
		usc = unit_stats_cache.find(std::pair<const unit*, const unit_type*>(target, src_type));
		// Just check this attack is valid for this attacking unit (may be modified)
		if (usc != unit_stats_cache.end() && usc->second->get_attacker_stats().attack_num < static_cast<int>(src_ptr->attacks().size())) {
			from_cache = true;
			bc = usc->second;
		} else {
			VALIDATE(false, _("ai::attack_analisis::analyze, cannot find unit_type pair in usc."));
		}

		// because save battle_context into usc direct, don't support prev_def.
		const combatant &att = bc->get_attacker_combatant(NULL);
		const combatant &def = bc->get_defender_combatant(NULL);

		// Note we didn't fight at all if defender is already dead.
		double prob_fought = (1.0 - prob_dead_already);

		// @todo 1.8 add combatant.prob_killed
		double prob_killed = def.dead_ - prob_dead_already;
		prob_dead_already = def.dead_;

		double prob_died = att.dead_;
		double prob_survived = (1.0 - prob_died) * prob_fought;

		double cost = up->second->cost();
		const bool on_village = map.is_village(m.second);
		// Up to double the value of a unit based on experience
		cost += 0.5 * (double(up->second->experience())/double(up->second->max_experience())) * cost;
		// We should encourage multi-phase attack.
		cost /= movements.size();

		resources_used += cost;
		avg_losses += cost * prob_died;

		// add half of cost for poisoned unit so it might get chance to heal
		avg_losses += cost * up->second->get_state(unit::STATE_POISONED) /2;

		// Double reward to emphasize getting onto villages if they survive.
		if (on_village) {
			avg_damage_taken -= game_config::poison_amount*2 * prob_survived;
		}

		double quality = (double(bc->get_defender_stats().chance_to_hit)/100.0) * cost * (on_village ? 0.5 : 1.0);
		if (on_wall) {
//.........这里部分代码省略.........