1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442
|
#include "recipe_dictionary.h"
#include <algorithm>
#include "cata_utility.h"
#include "crafting.h"
#include "generic_factory.h"
#include "init.h"
#include "item.h"
#include "item_factory.h"
#include "itype.h"
#include "output.h"
#include "skill.h"
#include "uistate.h"
recipe_dictionary recipe_dict;
namespace
{
void delete_if( std::map<recipe_id, recipe> &data,
const std::function<bool( const recipe & )> &pred )
{
for( auto it = data.begin(); it != data.end(); ) {
if( pred( it->second ) ) {
it = data.erase( it );
} else {
++it;
}
}
}
}
static recipe null_recipe;
static std::set<const recipe *> null_match;
static DynamicDataLoader::deferred_json deferred;
template<>
const recipe &string_id<recipe>::obj() const
{
const auto iter = recipe_dict.recipes.find( *this );
if( iter != recipe_dict.recipes.end() ) {
if( iter->second.obsolete ) {
return null_recipe;
}
return iter->second;
}
if( *this != NULL_ID() ) {
debugmsg( "invalid recipe id \"%s\"", c_str() );
}
return null_recipe;
}
template<>
bool string_id<recipe>::is_valid() const
{
return recipe_dict.recipes.find( *this ) != recipe_dict.recipes.end();
}
const recipe &recipe_dictionary::get_uncraft( const itype_id &id )
{
auto iter = recipe_dict.uncraft.find( recipe_id( id ) );
return iter != recipe_dict.uncraft.end() ? iter->second : null_recipe;
}
// searches for left-anchored partial match in the relevant recipe requirements set
template <class group>
bool search_reqs( group gp, const std::string &txt )
{
return std::any_of( gp.begin(), gp.end(), [&]( const typename group::value_type & opts ) {
return std::any_of( opts.begin(),
opts.end(), [&]( const typename group::value_type::value_type & e ) {
return lcmatch( e.to_string(), txt );
} );
} );
}
// template specialization to make component searches easier
template<>
bool search_reqs( std::vector<std::vector<item_comp> > gp,
const std::string &txt )
{
return std::any_of( gp.begin(), gp.end(), [&]( const std::vector<item_comp> &opts ) {
return std::any_of( opts.begin(), opts.end(), [&]( const item_comp & ic ) {
return lcmatch( item::nname( ic.type ), txt );
} );
} );
}
std::vector<const recipe *> recipe_subset::favorite() const
{
std::vector<const recipe *> res;
std::copy_if( recipes.begin(), recipes.end(), std::back_inserter( res ), [&]( const recipe * r ) {
if( !*r ) {
return false;
}
return uistate.favorite_recipes.find( r->ident() ) != uistate.favorite_recipes.end();
} );
return res;
}
std::vector<const recipe *> recipe_subset::recent() const
{
std::vector<const recipe *> res;
for( auto rec_id = uistate.recent_recipes.rbegin(); rec_id != uistate.recent_recipes.rend();
++rec_id ) {
std::find_if( recipes.begin(), recipes.end(), [&rec_id, &res]( const recipe * r ) {
if( !*r || *rec_id != r->ident() ) {
return false;
}
res.push_back( r );
return true;
} );
}
return res;
}
std::vector<const recipe *> recipe_subset::search( const std::string &txt,
const search_type key ) const
{
std::vector<const recipe *> res;
std::copy_if( recipes.begin(), recipes.end(), std::back_inserter( res ), [&]( const recipe * r ) {
if( !*r ) {
return false;
}
switch( key ) {
case search_type::name:
return lcmatch( r->result_name(), txt );
case search_type::skill:
return lcmatch( r->required_skills_string( nullptr ), txt ) ||
lcmatch( r->skill_used->name(), txt );
case search_type::primary_skill:
return lcmatch( r->skill_used->name(), txt );
case search_type::component:
return search_reqs( r->requirements().get_components(), txt );
case search_type::tool:
return search_reqs( r->requirements().get_tools(), txt );
case search_type::quality:
return search_reqs( r->requirements().get_qualities(), txt );
case search_type::quality_result: {
const auto &quals = item::find_type( r->result() )->qualities;
return std::any_of( quals.begin(), quals.end(), [&]( const std::pair<quality_id, int> &e ) {
return lcmatch( e.first->name, txt );
} );
}
case search_type::description_result: {
const item result = r->create_result();
return lcmatch( remove_color_tags( result.info( true ) ), txt );
}
default:
return false;
}
} );
return res;
}
recipe_subset::recipe_subset( const recipe_subset &src, const std::vector<const recipe *> &recipes )
{
for( const auto elem : recipes ) {
include( elem, src.get_custom_difficulty( elem ) );
}
}
recipe_subset recipe_subset::reduce( const std::string &txt, const search_type key ) const
{
return recipe_subset( *this, search( txt, key ) );
}
recipe_subset recipe_subset::intersection( const recipe_subset &subset ) const
{
std::vector<const recipe *> intersection_result;
std::set_intersection( this->begin(), this->end(), subset.begin(), subset.end(),
std::back_inserter( intersection_result ) );
return recipe_subset( *this, intersection_result );
}
recipe_subset recipe_subset::difference( const recipe_subset &subset ) const
{
std::vector<const recipe *> difference_result;
std::set_difference( this->begin(), this->end(), subset.begin(), subset.end(),
std::back_inserter( difference_result ) );
return recipe_subset( *this, difference_result );
}
std::vector<const recipe *> recipe_subset::search_result( const itype_id &item ) const
{
std::vector<const recipe *> res;
std::copy_if( recipes.begin(), recipes.end(), std::back_inserter( res ), [&]( const recipe * r ) {
return item == r->result() ||
( r->has_byproducts() && r->byproducts.find( item ) != r->byproducts.end() );
} );
return res;
}
bool recipe_subset::empty_category( const std::string &cat, const std::string &subcat ) const
{
if( subcat == "CSC_*_FAVORITE" ) {
return uistate.favorite_recipes.empty();
} else if( subcat == "CSC_*_RECENT" ) {
return uistate.recent_recipes.empty();
} else if( subcat == "CSC_*_HIDDEN" ) {
return uistate.hidden_recipes.empty();
}
auto iter = category.find( cat );
if( iter != category.end() ) {
if( subcat.empty() ) {
return false;
} else {
for( auto &e : iter->second ) {
if( e->subcategory == subcat ) {
return false;
}
}
}
}
return true;
}
std::vector<const recipe *> recipe_subset::in_category( const std::string &cat,
const std::string &subcat ) const
{
std::vector<const recipe *> res;
auto iter = category.find( cat );
if( iter != category.end() ) {
if( subcat.empty() ) {
res.insert( res.begin(), iter->second.begin(), iter->second.end() );
} else {
std::copy_if( iter->second.begin(), iter->second.end(),
std::back_inserter( res ), [&subcat]( const recipe * e ) {
return e->subcategory == subcat;
} );
}
}
return res;
}
const std::set<const recipe *> &recipe_subset::of_component( const itype_id &id ) const
{
auto iter = component.find( id );
return iter != component.end() ? iter->second : null_match;
}
void recipe_dictionary::load_recipe( JsonObject &jo, const std::string &src )
{
load( jo, src, recipe_dict.recipes );
}
void recipe_dictionary::load_uncraft( JsonObject &jo, const std::string &src )
{
load( jo, src, recipe_dict.uncraft );
}
recipe &recipe_dictionary::load( JsonObject &jo, const std::string &src,
std::map<recipe_id, recipe> &out )
{
recipe r;
// defer entries dependent upon as-yet unparsed definitions
if( jo.has_string( "copy-from" ) ) {
auto base = recipe_id( jo.get_string( "copy-from" ) );
if( !out.count( base ) ) {
deferred.emplace_back( jo.str(), src );
return null_recipe;
}
r = out[ base ];
}
r.load( jo, src );
out[ r.ident() ] = std::move( r );
return out[ r.ident() ];
}
size_t recipe_dictionary::size() const
{
return recipes.size();
}
std::map<recipe_id, recipe>::const_iterator recipe_dictionary::begin() const
{
return recipes.begin();
}
std::map<recipe_id, recipe>::const_iterator recipe_dictionary::end() const
{
return recipes.end();
}
void recipe_dictionary::finalize_internal( std::map<recipe_id, recipe> &obj )
{
for( auto &elem : obj ) {
elem.second.finalize();
}
// remove any blacklisted or invalid recipes...
delete_if( []( const recipe & elem ) {
if( elem.is_blacklisted() || elem.obsolete ) {
return true;
}
const std::string error = elem.get_consistency_error();
if( !error.empty() ) {
debugmsg( "Recipe %s %s.", elem.ident().c_str(), error.c_str() );
}
return !error.empty();
} );
}
void recipe_dictionary::finalize()
{
DynamicDataLoader::get_instance().load_deferred( deferred );
// remove abstract recipes
delete_if( []( const recipe & element ) {
return element.abstract;
} );
finalize_internal( recipe_dict.recipes );
finalize_internal( recipe_dict.uncraft );
for( auto &e : recipe_dict.recipes ) {
auto &r = e.second;
for( const auto &bk : r.booksets ) {
const itype *booktype = item::find_type( bk.first );
int req = bk.second > 0 ? bk.second : std::max( booktype->book->req, r.difficulty );
islot_book::recipe_with_description_t desc{ &r, req, r.result_name(), false };
const_cast<islot_book &>( *booktype->book ).recipes.insert( desc );
}
// if reversible and no specific uncraft recipe exists use this recipe
if( r.is_reversible() && !recipe_dict.uncraft.count( recipe_id( r.result() ) ) ) {
recipe_dict.uncraft[ recipe_id( r.result() ) ] = r;
}
}
// add pseudo uncrafting recipes
for( const itype *e : item_controller->all() ) {
const itype_id id = e->get_id();
const recipe_id rid = recipe_id( id );
// books that don't already have an uncrafting recipe
if( e->book && !recipe_dict.uncraft.count( rid ) && e->volume > 0_ml ) {
int pages = e->volume / units::from_milliliter( 12.5 );
auto &bk = recipe_dict.uncraft[rid];
bk.ident_ = rid;
bk.result_ = id;
bk.reversible = true;
bk.requirements_ = *requirement_id( "uncraft_book" ) * pages;
bk.time = pages * 10; // @todo: allow specifying time in requirement_data
}
}
// Cache auto-learn recipes
for( const auto &e : recipe_dict.recipes ) {
if( e.second.autolearn ) {
recipe_dict.autolearn.insert( &e.second );
}
}
}
void recipe_dictionary::reset()
{
recipe_dict.autolearn.clear();
recipe_dict.recipes.clear();
recipe_dict.uncraft.clear();
}
void recipe_dictionary::delete_if( const std::function<bool( const recipe & )> &pred )
{
::delete_if( recipe_dict.recipes, pred );
::delete_if( recipe_dict.uncraft, pred );
}
void recipe_subset::include( const recipe *r, int custom_difficulty )
{
if( custom_difficulty < 0 ) {
custom_difficulty = r->difficulty;
}
// We always prefer lower difficulty for the subset, but we save it only if it's not default
if( recipes.count( r ) > 0 ) {
const auto iter = difficulties.find( r );
// See if we need to lower the difficulty of the existing recipe
if( iter != difficulties.end() && custom_difficulty < iter->second ) {
if( custom_difficulty != r->difficulty ) {
iter->second = custom_difficulty; // Added again with lower difficulty
} else {
difficulties.erase( iter ); // No need to keep the default difficulty. Free some memory
}
} else if( custom_difficulty < r->difficulty ) {
difficulties[r] = custom_difficulty; // Added again with lower difficulty
}
} else {
// add recipe to category and component caches
for( const auto &opts : r->requirements().get_components() ) {
for( const item_comp &comp : opts ) {
component[comp.type].insert( r );
}
}
category[r->category].insert( r );
// Set the difficulty is it's not the default
if( custom_difficulty != r->difficulty ) {
difficulties[r] = custom_difficulty;
}
// insert the recipe
recipes.insert( r );
}
}
void recipe_subset::include( const recipe_subset &subset )
{
for( const auto &elem : subset ) {
include( elem, subset.get_custom_difficulty( elem ) );
}
}
int recipe_subset::get_custom_difficulty( const recipe *r ) const
{
const auto iter = difficulties.find( r );
if( iter != difficulties.end() ) {
return iter->second;
}
return r->difficulty;
}
|