markov_generator.cpp

Go to the documentation of this file.

/*
    Copyright (C) 2003 - 2025
    by David White <dave@whitevine.net>
    Part of the Battle for Wesnoth Project https://www.wesnoth.org/
 
    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.
    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY.
 
    See the COPYING file for more details.
*/
 
/**
 *  @file
 *  Generate race-specific unit-names.
 */
 
#include "utils/markov_generator.hpp"
 
#include "serialization/unicode_cast.hpp"
#include "random.hpp"
#include "utils/general.hpp"
 
static void add_prefixes(const std::u32string& str, std::size_t length, markov_prefix_map& res)
{
    for(std::size_t i = 0; i <= str.size(); ++i) {
        const std::size_t start = i > length ? i - length : 0;
        const std::u32string key(str.begin() + start, str.begin() + i);
        const char32_t c = i != str.size() ? str[i] : 0;
        res[key].push_back(c);
    }
}
 
static markov_prefix_map markov_prefixes(const std::vector<std::string>& items, std::size_t length)
{
    markov_prefix_map res;
 
    for(std::vector<std::string>::const_iterator i = items.begin(); i != items.end(); ++i) {
        add_prefixes(unicode_cast<std::u32string>(*i),length,res);
    }
 
    return res;
}
 
static std::u32string markov_generate_name(const markov_prefix_map& prefixes,
    std::size_t chain_size, std::size_t max_len)
{
    if(prefixes.empty() || chain_size == 0) {
        return std::u32string();
    }
 
    std::u32string prefix, res;
 
    // Since this function is called in the name description in a MP game it
    // uses the local locale. The locale between players can be different and
    // thus the markov_prefix_map can be different. This resulted in
    // get_random() getting called a different number of times for the
    // generation in different locales (due to the bail out at 'if(c == 0)').
    //
    // This causes a problem since the random state is no longer in sync. The
    // following calls to get_random() return different results, which caused
    // traits to be different. To avoid that problem we call get_random()
    // the maximum number of times and store the result in a lookup table.
    std::vector<int> random(max_len);
    std::size_t j = 0;
    for(; j < max_len; ++j) {
        random[j] = randomness::generator->next_random();
    }
 
    j = 0;
    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 char32_t c = i->second[random[j++]%i->second.size()];
        if(c == 0) {
            return res;
        }
 
        res.resize(res.size()+1);
        res.back() = c;
        prefix.resize(prefix.size()+1);
        prefix.back() = c;
        while(prefix.size() > chain_size) {
            prefix.erase(prefix.begin());
        }
    }
 
    // Getting here means that the maximum length was reached when
    // generating the name, hence the ending of the name has to be
    // made valid. Otherwise weird names like Unárierini- and
    // Thramboril-G may occur.
 
    // Strip characters from the end until the last prefix of the
    // name has end-of-string as a possible next character in the
    // markov prefix map. If no valid ending is found, use the
    // originally generated name.
    std::u32string originalRes = res;
    while(!res.empty()) {
        const int prefixLen = chain_size < res.size() ? chain_size : res.size();
        prefix = std::u32string(res.end() - prefixLen, res.end());
 
        const markov_prefix_map::const_iterator i = prefixes.find(prefix);
        if (i == prefixes.end() || i->second.empty()) {
            return res;
        }
        if (utils::contains(i->second, static_cast<char32_t>(0))) {
            // This ending is valid.
            return res;
        }
        // The current ending is invalid, remove the last character
        // and retry.
        res.pop_back();
    }
    // No valid ending at all could be found. This generally should
    // not happen, unless the chain length is very long or the
    // maximum length is very small. Return the originally generated
    // name, it's not much we can do about it.
    return originalRes;
}
 
markov_generator::markov_generator(const std::vector<std::string>& items, std::size_t chain_size, std::size_t max_len)
    : prefixes_(markov_prefixes(items, chain_size))
    , chain_size_(chain_size)
    , max_len_(max_len)
{
}
 
std::string markov_generator::generate() const
{
    std::u32string name = markov_generate_name(prefixes_, chain_size_, max_len_);
    return unicode_cast<std::string>(name);
}