ObjectLists.cpp 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228
  1. /*
  2. * ObjectLists.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 "ObjectLists.h"
  12. #include "../gui/CGuiHandler.h"
  13. #include "Buttons.h"
  14. CObjectList::CObjectList(CreateFunc create)
  15. : createObject(create)
  16. {
  17. }
  18. void CObjectList::deleteItem(std::shared_ptr<CIntObject> item)
  19. {
  20. if(!item)
  21. return;
  22. item->deactivate();
  23. removeChild(item.get());
  24. }
  25. std::shared_ptr<CIntObject> CObjectList::createItem(size_t index)
  26. {
  27. OBJECT_CONSTRUCTION_CUSTOM_CAPTURING(255-DISPOSE);
  28. std::shared_ptr<CIntObject> item = createObject(index);
  29. if(!item)
  30. item = std::make_shared<CIntObject>();
  31. item->recActions = defActions;
  32. addChild(item.get());
  33. item->activate();
  34. return item;
  35. }
  36. CTabbedInt::CTabbedInt(CreateFunc create, Point position, size_t ActiveID)
  37. : CObjectList(create),
  38. activeTab(nullptr),
  39. activeID(ActiveID)
  40. {
  41. defActions &= ~DISPOSE;
  42. pos += position;
  43. reset();
  44. }
  45. void CTabbedInt::setActive(size_t which)
  46. {
  47. if(which != activeID)
  48. {
  49. activeID = which;
  50. reset();
  51. }
  52. }
  53. void CTabbedInt::reset()
  54. {
  55. deleteItem(activeTab);
  56. activeTab = createItem(activeID);
  57. activeTab->moveTo(pos.topLeft());
  58. if(active)
  59. redraw();
  60. }
  61. std::shared_ptr<CIntObject> CTabbedInt::getItem()
  62. {
  63. return activeTab;
  64. }
  65. CListBox::CListBox(CreateFunc create, Point Pos, Point ItemOffset, size_t VisibleSize,
  66. size_t TotalSize, size_t InitialPos, int Slider, Rect SliderPos)
  67. : CObjectList(create),
  68. first(InitialPos),
  69. totalSize(TotalSize),
  70. itemOffset(ItemOffset)
  71. {
  72. pos += Pos;
  73. items.resize(VisibleSize, nullptr);
  74. if(Slider & 1)
  75. {
  76. OBJECT_CONSTRUCTION_CAPTURING(255-DISPOSE);
  77. slider = std::make_shared<CSlider>(SliderPos.topLeft(), SliderPos.w, std::bind(&CListBox::moveToPos, this, _1),
  78. (int)VisibleSize, (int)TotalSize, (int)InitialPos, Slider & 2, Slider & 4 ? CSlider::BLUE : CSlider::BROWN);
  79. }
  80. reset();
  81. }
  82. // Used to move active items after changing list position
  83. void CListBox::updatePositions()
  84. {
  85. Point itemPos = pos.topLeft();
  86. for (auto & elem : items)
  87. {
  88. (elem)->moveTo(itemPos);
  89. itemPos += itemOffset;
  90. }
  91. if (active)
  92. {
  93. redraw();
  94. if (slider)
  95. slider->moveTo((int)first);
  96. }
  97. }
  98. void CListBox::reset()
  99. {
  100. size_t current = first;
  101. for (auto & elem : items)
  102. {
  103. deleteItem(elem);
  104. elem = createItem(current++);
  105. }
  106. updatePositions();
  107. }
  108. void CListBox::resize(size_t newSize)
  109. {
  110. totalSize = newSize;
  111. if (slider)
  112. slider->setAmount((int)totalSize);
  113. reset();
  114. }
  115. size_t CListBox::size()
  116. {
  117. return totalSize;
  118. }
  119. std::shared_ptr<CIntObject> CListBox::getItem(size_t which)
  120. {
  121. if(which < first || which > first + items.size() || which > totalSize)
  122. return std::shared_ptr<CIntObject>();
  123. size_t i=first;
  124. for (auto iter = items.begin(); iter != items.end(); iter++, i++)
  125. if( i == which)
  126. return *iter;
  127. return std::shared_ptr<CIntObject>();
  128. }
  129. size_t CListBox::getIndexOf(std::shared_ptr<CIntObject> item)
  130. {
  131. size_t i=first;
  132. for(auto iter = items.begin(); iter != items.end(); iter++, i++)
  133. if(*iter == item)
  134. return i;
  135. return size_t(-1);
  136. }
  137. void CListBox::scrollTo(size_t which)
  138. {
  139. //scroll up
  140. if(first > which)
  141. moveToPos(which);
  142. //scroll down
  143. else if (first + items.size() <= which && which < totalSize)
  144. moveToPos(which - items.size() + 1);
  145. }
  146. void CListBox::moveToPos(size_t which)
  147. {
  148. //Calculate new position
  149. size_t maxPossible;
  150. if(totalSize > items.size())
  151. maxPossible = totalSize - items.size();
  152. else
  153. maxPossible = 0;
  154. size_t newPos = std::min(which, maxPossible);
  155. //If move distance is 1 (most of calls from Slider) - use faster shifts instead of resetting all items
  156. if(first - newPos == 1)
  157. {
  158. moveToPrev();
  159. }
  160. else if(newPos - first == 1)
  161. {
  162. moveToNext();
  163. }
  164. else if(newPos != first)
  165. {
  166. first = newPos;
  167. reset();
  168. }
  169. }
  170. void CListBox::moveToNext()
  171. {
  172. //Remove front item and insert new one to end
  173. if(first + items.size() < totalSize)
  174. {
  175. first++;
  176. deleteItem(items.front());
  177. items.pop_front();
  178. items.push_back(createItem(first+items.size()));
  179. updatePositions();
  180. }
  181. }
  182. void CListBox::moveToPrev()
  183. {
  184. //Remove last item and insert new one at start
  185. if(first)
  186. {
  187. first--;
  188. deleteItem(items.back());
  189. items.pop_back();
  190. items.push_front(createItem(first));
  191. updatePositions();
  192. }
  193. }
  194. size_t CListBox::getPos()
  195. {
  196. return first;
  197. }
  198. const std::list<std::shared_ptr<CIntObject>> & CListBox::getItems()
  199. {
  200. return items;
  201. }