ResourceSet.cpp 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122
  1. /*
  2. * ResourceSet.cpp, part of VCMI engine
  3. *
  4. * Authors: listed in file AUTHORS in main folder
  5. *
  6. * License: GNU General Public License v2.0 or later
  7. * Full text of license available in license.txt file, in main folder
  8. *
  9. */
  10. #include "StdInc.h"
  11. #include "ResourceSet.h"
  12. #include "StringConstants.h"
  13. #include "JsonNode.h"
  14. Res::ResourceSet::ResourceSet()
  15. {
  16. resize(GameConstants::RESOURCE_QUANTITY, 0);
  17. }
  18. Res::ResourceSet::ResourceSet(const JsonNode & node)
  19. {
  20. reserve(GameConstants::RESOURCE_QUANTITY);
  21. for(std::string name : GameConstants::RESOURCE_NAMES)
  22. push_back(node[name].Float());
  23. }
  24. bool Res::ResourceSet::nonZero() const
  25. {
  26. for(auto & elem : *this)
  27. if(elem)
  28. return true;
  29. return false;
  30. }
  31. void Res::ResourceSet::amax(const TResourceCap &val)
  32. {
  33. for(auto & elem : *this)
  34. ::vstd::amax(elem, val);
  35. }
  36. void Res::ResourceSet::amin(const TResourceCap &val)
  37. {
  38. for(auto & elem : *this)
  39. ::vstd::amin(elem, val);
  40. }
  41. void Res::ResourceSet::positive()
  42. {
  43. for(auto & elem : *this)
  44. ::vstd::amax(elem, 0);
  45. }
  46. bool Res::ResourceSet::canBeAfforded(const ResourceSet &res) const
  47. {
  48. return Res::canAfford(res, *this);
  49. }
  50. bool Res::ResourceSet::canAfford(const ResourceSet &price) const
  51. {
  52. return Res::canAfford(*this, price);
  53. }
  54. bool Res::canAfford(const ResourceSet &res, const ResourceSet &price)
  55. {
  56. assert(res.size() == price.size() && price.size() == GameConstants::RESOURCE_QUANTITY);
  57. for(int i = 0; i < GameConstants::RESOURCE_QUANTITY; i++)
  58. if(price[i] > res[i])
  59. return false;
  60. return true;
  61. }
  62. bool Res::ResourceSet::nziterator::valid()
  63. {
  64. return cur.resType < GameConstants::RESOURCE_QUANTITY && cur.resVal;
  65. }
  66. Res::ResourceSet::nziterator Res::ResourceSet::nziterator::operator++()
  67. {
  68. advance();
  69. return *this;
  70. }
  71. Res::ResourceSet::nziterator Res::ResourceSet::nziterator::operator++(int)
  72. {
  73. nziterator ret = *this;
  74. advance();
  75. return ret;
  76. }
  77. const Res::ResourceSet::nziterator::ResEntry& Res::ResourceSet::nziterator::operator*() const
  78. {
  79. return cur;
  80. }
  81. const Res::ResourceSet::nziterator::ResEntry * Res::ResourceSet::nziterator::operator->() const
  82. {
  83. return &cur;
  84. }
  85. void Res::ResourceSet::nziterator::advance()
  86. {
  87. do
  88. {
  89. vstd::advance(cur.resType, +1);
  90. } while(cur.resType < GameConstants::RESOURCE_QUANTITY && !(cur.resVal=rs[cur.resType]));
  91. if(cur.resType >= GameConstants::RESOURCE_QUANTITY)
  92. cur.resVal = -1;
  93. }
  94. Res::ResourceSet::nziterator::nziterator(const ResourceSet &RS)
  95. : rs(RS)
  96. {
  97. cur.resType = WOOD;
  98. cur.resVal = rs[WOOD];
  99. if(!valid())
  100. advance();
  101. }