mirror of
https://github.com/wesnoth/wesnoth
synced 2025-05-15 17:25:32 +00:00
87 lines
2.1 KiB
C++
87 lines
2.1 KiB
C++
#include "race.hpp"
|
|
#include "replay.hpp"
|
|
|
|
#include <cstdlib>
|
|
|
|
namespace {
|
|
|
|
void add_prefixes(const std::string& str, size_t length, markov_prefix_map& res)
|
|
{
|
|
for(size_t i = 0; i <= str.size(); ++i) {
|
|
const size_t start = i > length ? i - length : 0;
|
|
const std::string key = str.substr(start,i-start);
|
|
const char c = i != str.size() ? str[i] : 0;
|
|
res[key].push_back(c);
|
|
}
|
|
}
|
|
|
|
markov_prefix_map markov_prefixes(const std::vector<std::string>& items, size_t length)
|
|
{
|
|
markov_prefix_map res;
|
|
|
|
for(std::vector<std::string>::const_iterator i = items.begin(); i != items.end(); ++i) {
|
|
add_prefixes(*i,length,res);
|
|
}
|
|
|
|
return res;
|
|
}
|
|
|
|
std::string markov_generate_name(const markov_prefix_map& prefixes, size_t chain_size, size_t max_len)
|
|
{
|
|
if(chain_size == 0)
|
|
return "";
|
|
|
|
std::string prefix, res;
|
|
|
|
while(res.size() < max_len) {
|
|
const markov_prefix_map::const_iterator i = prefixes.find(prefix);
|
|
if(i == prefixes.end() || i->second.empty())
|
|
return res;
|
|
|
|
const char c = i->second[get_random()%i->second.size()];
|
|
if(c == 0) {
|
|
return res;
|
|
}
|
|
|
|
res.resize(res.size()+1);
|
|
res[res.size()-1] = c;
|
|
prefix.resize(prefix.size()+1);
|
|
prefix[prefix.size()-1] = c;
|
|
while(prefix.size() > chain_size) {
|
|
prefix.erase(prefix.begin());
|
|
}
|
|
}
|
|
|
|
return res;
|
|
}
|
|
|
|
}
|
|
|
|
unit_race::unit_race() : ntraits_(0), chain_size_(0), not_living_(false)
|
|
{
|
|
}
|
|
|
|
unit_race::unit_race(const config& cfg) : name_(cfg["name"]), ntraits_(atoi(cfg["num_traits"].c_str())),
|
|
not_living_(cfg["not_living"] == "yes")
|
|
{
|
|
names_[MALE] = config::split(cfg["male_names"]);
|
|
names_[FEMALE] = config::split(cfg["female_names"]);
|
|
|
|
chain_size_ = atoi(cfg["markov_chain_size"].c_str());
|
|
if(chain_size_ <= 0)
|
|
chain_size_ = 2;
|
|
|
|
next_[MALE] = markov_prefixes(names_[MALE],chain_size_);
|
|
next_[FEMALE] = markov_prefixes(names_[FEMALE],chain_size_);
|
|
}
|
|
|
|
const std::string& unit_race::name() const { return name_; }
|
|
|
|
std::string unit_race::generate_name(unit_race::GENDER gender) const
|
|
{
|
|
return markov_generate_name(next_[gender],chain_size_,12);
|
|
}
|
|
|
|
int unit_race::num_traits() const { return ntraits_; }
|
|
|
|
bool unit_race::not_living() const { return not_living_; } |