hacdCircularList.inl 3.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163
  1. #pragma once
  2. #ifndef HACD_CIRCULAR_LIST_INL
  3. #define HACD_CIRCULAR_LIST_INL
  4. #include<stdlib.h>
  5. #include "hacdVersion.h"
  6. namespace HACD
  7. {
  8. template < typename T >
  9. inline bool CircularList<T>::Delete(CircularListElement<T> * element)
  10. {
  11. if (!element)
  12. {
  13. return false;
  14. }
  15. if (m_size > 1)
  16. {
  17. CircularListElement<T> * next = element->GetNext();
  18. CircularListElement<T> * prev = element->GetPrev();
  19. delete element;
  20. m_size--;
  21. if (element == m_head)
  22. {
  23. m_head = next;
  24. }
  25. next->GetPrev() = prev;
  26. prev->GetNext() = next;
  27. return true;
  28. }
  29. else if (m_size == 1)
  30. {
  31. delete m_head;
  32. m_size--;
  33. m_head = 0;
  34. return true;
  35. }
  36. else
  37. {
  38. return false;
  39. }
  40. }
  41. template < typename T >
  42. inline bool CircularList<T>::Delete()
  43. {
  44. if (m_size > 1)
  45. {
  46. CircularListElement<T> * next = m_head->GetNext();
  47. CircularListElement<T> * prev = m_head->GetPrev();
  48. delete m_head;
  49. m_size--;
  50. m_head = next;
  51. next->GetPrev() = prev;
  52. prev->GetNext() = next;
  53. return true;
  54. }
  55. else if (m_size == 1)
  56. {
  57. delete m_head;
  58. m_size--;
  59. m_head = 0;
  60. return true;
  61. }
  62. else
  63. {
  64. return false;
  65. }
  66. }
  67. template < typename T >
  68. inline CircularListElement<T> * CircularList<T>::Add(const T * data)
  69. {
  70. if (m_size == 0)
  71. {
  72. if (data)
  73. {
  74. m_head = new CircularListElement<T>(*data);
  75. }
  76. else
  77. {
  78. m_head = new CircularListElement<T>();
  79. }
  80. m_head->GetNext() = m_head->GetPrev() = m_head;
  81. }
  82. else
  83. {
  84. CircularListElement<T> * next = m_head->GetNext();
  85. CircularListElement<T> * element = m_head;
  86. if (data)
  87. {
  88. m_head = new CircularListElement<T>(*data);
  89. }
  90. else
  91. {
  92. m_head = new CircularListElement<T>;
  93. }
  94. m_head->GetNext() = next;
  95. m_head->GetPrev() = element;
  96. element->GetNext() = m_head;
  97. next->GetPrev() = m_head;
  98. }
  99. m_size++;
  100. return m_head;
  101. }
  102. template < typename T >
  103. inline CircularListElement<T> * CircularList<T>::Add(const T & data)
  104. {
  105. const T * pData = &data;
  106. return Add(pData);
  107. }
  108. template < typename T >
  109. inline bool CircularList<T>::Next()
  110. {
  111. if (m_size == 0)
  112. {
  113. return false;
  114. }
  115. m_head = m_head->GetNext();
  116. return true;
  117. }
  118. template < typename T >
  119. inline bool CircularList<T>::Prev()
  120. {
  121. if (m_size == 0)
  122. {
  123. return false;
  124. }
  125. m_head = m_head->GetPrev();
  126. return true;
  127. }
  128. template < typename T >
  129. inline CircularList<T>::CircularList(const CircularList& rhs)
  130. {
  131. if (rhs.m_size > 0)
  132. {
  133. CircularListElement<T> * current = rhs.m_head;
  134. do
  135. {
  136. current = current->GetNext();
  137. Add(current->GetData());
  138. }
  139. while ( current != rhs.m_head );
  140. }
  141. }
  142. template < typename T >
  143. inline const CircularList<T>& CircularList<T>::operator=(const CircularList& rhs)
  144. {
  145. if (&rhs != this)
  146. {
  147. Clear();
  148. if (rhs.m_size > 0)
  149. {
  150. CircularListElement<T> * current = rhs.m_head;
  151. do
  152. {
  153. current = current->GetNext();
  154. Add(current->GetData());
  155. }
  156. while ( current != rhs.m_head );
  157. }
  158. }
  159. return (*this);
  160. }
  161. }
  162. #endif