LoadProgress.cpp 2.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135
  1. /*
  2. * LoadProgress.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 "LoadProgress.h"
  12. using namespace Load;
  13. Progress::Progress(): _progress(std::numeric_limits<Type>::min())
  14. {
  15. setupSteps(100);
  16. }
  17. Progress::Progress(int steps): _progress(std::numeric_limits<Type>::min())
  18. {
  19. setupSteps(steps);
  20. }
  21. Type Progress::get() const
  22. {
  23. if(_step >= _maxSteps)
  24. return _target;
  25. if(!_maxSteps)
  26. return _progress;
  27. return static_cast<int>(_progress) + _step * static_cast<int>(_target - _progress) / _maxSteps;
  28. }
  29. void Progress::set(Type p)
  30. {
  31. _progress = p;
  32. }
  33. bool Progress::finished() const
  34. {
  35. return get() == std::numeric_limits<Type>::max();
  36. }
  37. void Progress::reset(int s)
  38. {
  39. _progress = std::numeric_limits<Type>::min();
  40. setupSteps(s);
  41. }
  42. void Progress::finish()
  43. {
  44. _progress = _target = std::numeric_limits<Type>::max();
  45. _step = std::numeric_limits<Type>::min();
  46. _maxSteps = std::numeric_limits<Type>::min();
  47. }
  48. void Progress::setupSteps(int s)
  49. {
  50. setupStepsTill(s, std::numeric_limits<Type>::max());
  51. }
  52. void Progress::setupStepsTill(int s, Type p)
  53. {
  54. if(finished())
  55. return;
  56. if(_step > std::numeric_limits<Type>::min())
  57. _progress = get();
  58. _step = std::numeric_limits<Type>::min();
  59. _maxSteps = s;
  60. _target = p;
  61. }
  62. void Progress::step(int count)
  63. {
  64. if(_step + count > _maxSteps)
  65. {
  66. _step = _maxSteps.load();
  67. }
  68. else
  69. {
  70. _step += count;
  71. }
  72. }
  73. void ProgressAccumulator::include(const Progress & p)
  74. {
  75. boost::unique_lock<boost::mutex> guard(_mx);
  76. _progress.emplace_back(p);
  77. }
  78. void ProgressAccumulator::exclude(const Progress & p)
  79. {
  80. boost::unique_lock<boost::mutex> guard(_mx);
  81. for(auto i = _progress.begin(); i != _progress.end(); ++i)
  82. {
  83. if(&i->get() == &p)
  84. {
  85. _accumulated += static_cast<long long>(p.get()) * p._maxSteps;
  86. _steps += p._maxSteps;
  87. _progress.erase(i);
  88. return;
  89. }
  90. }
  91. }
  92. bool ProgressAccumulator::finished() const
  93. {
  94. boost::unique_lock<boost::mutex> guard(_mx);
  95. for(auto i : _progress)
  96. if(!i.get().finished())
  97. return false;
  98. return true;
  99. }
  100. Type ProgressAccumulator::get() const
  101. {
  102. boost::unique_lock<boost::mutex> guard(_mx);
  103. auto sum = _accumulated;
  104. auto totalSteps = _steps;
  105. for(auto p : _progress)
  106. {
  107. sum += static_cast<long long>(p.get().get()) * p.get()._maxSteps;
  108. totalSteps += p.get()._maxSteps;
  109. }
  110. if(totalSteps)
  111. sum /= totalSteps;
  112. return static_cast<Type>(sum);
  113. }