ua_list.c 5.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239
  1. #include "ua_list.h"
  2. #include "ua_util.h"
  3. void UA_list_defaultFreer(void* payload){
  4. if(payload){
  5. UA_free(payload);
  6. }
  7. }
  8. UA_Int32 UA_list_initElement(UA_list_Element* element){
  9. if(element==UA_NULL) return UA_ERROR;
  10. element->next=UA_NULL;
  11. element->prev=UA_NULL;
  12. element->father=UA_NULL;
  13. element->payload=UA_NULL;
  14. return UA_NO_ERROR;
  15. }
  16. UA_Int32 UA_list_init(UA_list_List* list){
  17. if(list==UA_NULL) return UA_ERROR;
  18. list->first = UA_NULL;
  19. list->last = UA_NULL;
  20. list->size = 0;
  21. return UA_NO_ERROR;
  22. }
  23. UA_Int32 UA_list_addElementToFront(UA_list_List* list, UA_list_Element* element){
  24. if(list==UA_NULL || element==UA_NULL) return UA_ERROR;
  25. UA_list_Element* second = UA_NULL;
  26. second = list->first;
  27. list->first = element;
  28. element->prev = UA_NULL;
  29. element->next = second;
  30. element->father = list;
  31. if(second){
  32. second->prev=element;
  33. }
  34. list->size++;
  35. if(list->size==1){
  36. list->last=element;
  37. }
  38. return UA_NO_ERROR;
  39. }
  40. UA_Int32 UA_list_addPayloadToFront(UA_list_List* list, void* const payload){
  41. if(list==UA_NULL)return UA_ERROR;
  42. UA_list_Element* elem;
  43. UA_alloc((void**)&elem, sizeof(*elem));
  44. UA_list_initElement(elem);
  45. elem->payload = payload;
  46. UA_list_addElementToFront(list, elem);
  47. return UA_NO_ERROR;
  48. }
  49. UA_Int32 UA_list_addElementToBack(UA_list_List* list, UA_list_Element* element){
  50. if(list==UA_NULL || element == UA_NULL)return UA_ERROR;
  51. UA_list_Element* secondLast = UA_NULL;
  52. secondLast = list->last;
  53. list->last = element;
  54. element->prev = secondLast;
  55. element->next = UA_NULL;
  56. element->father = list;
  57. if(secondLast){
  58. secondLast->next = element;
  59. }
  60. list->size++;
  61. if(list->size==1){
  62. list->first=element;
  63. }
  64. return UA_NO_ERROR;
  65. }
  66. UA_Int32 UA_list_addPayloadToBack(UA_list_List* list, void* const payload){
  67. if(list==UA_NULL)return UA_ERROR;
  68. UA_list_Element* elem;
  69. UA_alloc((void**)&elem, sizeof(*elem));
  70. UA_list_initElement(elem);
  71. elem->payload = payload;
  72. UA_list_addElementToBack(list, elem);
  73. return UA_NO_ERROR;
  74. }
  75. UA_Int32 UA_list_removeFirst(UA_list_List* list, UA_list_PayloadVisitor visitor){
  76. if(list==UA_NULL)return UA_ERROR;
  77. UA_list_Element* temp = UA_NULL;
  78. if(list->first){
  79. temp = list->first->next;
  80. if(visitor){
  81. (*visitor)(list->first->payload);
  82. }
  83. UA_free(list->first);
  84. list->first = temp;
  85. if(temp){
  86. temp->prev = UA_NULL;
  87. }
  88. list->size--;
  89. if(list->size == 1){
  90. list->last = temp;
  91. }else if(list->size==0){
  92. list->last = UA_NULL;
  93. }
  94. }
  95. return UA_NO_ERROR;
  96. }
  97. UA_Int32 UA_list_removeLast(UA_list_List* list, UA_list_PayloadVisitor visitor){
  98. if(list==UA_NULL)return UA_ERROR;
  99. UA_list_Element* temp = UA_NULL;
  100. if(list->last){
  101. temp = list->last->prev;
  102. if(visitor){
  103. (*visitor)(list->last->payload);
  104. }
  105. UA_free(list->last);
  106. list->last = temp;
  107. if(temp){
  108. temp->next = UA_NULL;
  109. }
  110. list->size--;
  111. if(list->size == 1){
  112. list->first = temp;
  113. }else if(list->size==0){
  114. list->first = UA_NULL;
  115. }
  116. }
  117. return UA_NO_ERROR;
  118. }
  119. UA_Int32 UA_list_removeElement(UA_list_Element* const elem, UA_list_PayloadVisitor visitor){
  120. if(elem==UA_NULL)return UA_ERROR;
  121. if(elem==elem->father->first){
  122. return UA_list_removeFirst(elem->father, visitor);
  123. }else if(elem==elem->father->last){
  124. return UA_list_removeLast(elem->father, visitor);
  125. }else{
  126. UA_list_Element* prev = elem->prev;
  127. UA_list_Element* next = elem->next;
  128. prev->next = next;
  129. next->prev = prev;
  130. if(visitor){
  131. (*visitor)(elem->payload);
  132. }
  133. (elem->father)->size--;
  134. UA_free(elem);
  135. }
  136. return UA_NO_ERROR;
  137. }
  138. UA_Int32 UA_list_destroy(UA_list_List* list, UA_list_PayloadVisitor visitor){
  139. if(list==UA_NULL)return UA_ERROR;
  140. UA_list_Element* current = UA_NULL;
  141. current=list->first;
  142. while(current){
  143. UA_list_Element* next = current->next;
  144. if(visitor){
  145. (*visitor)(current->payload);
  146. }
  147. UA_free(current);
  148. current = next;
  149. }
  150. UA_list_init(list);
  151. return UA_NO_ERROR;
  152. }
  153. UA_Int32 UA_list_iterateElement(UA_list_List* const list, UA_list_ElementVisitor visitor){
  154. if(list==UA_NULL)return UA_ERROR;
  155. UA_list_Element* current = list->first;
  156. while(current){
  157. if(visitor){
  158. (*visitor)(current);
  159. }
  160. current=current->next;
  161. }
  162. return UA_NO_ERROR;
  163. }
  164. /*Int32 UA_list_iteratePayload(UA_list_list* const list, UA_payloadVisitor visitor){
  165. void visitorTemp(UA_list_element* element){
  166. if(visitor){
  167. (*visitor)(element->payload);
  168. }
  169. }
  170. if(list==NULL)return UA_ERROR;
  171. UA_list_iterateElement(list, visitorTemp);
  172. return UA_NO_ERROR;
  173. }*/
  174. /** ANSI C forbids function nesting - reworked ugly version **/
  175. UA_Int32 UA_list_iteratePayload(UA_list_List* const list, UA_list_PayloadVisitor visitor){
  176. if(list==UA_NULL)return UA_ERROR;
  177. UA_list_Element* current = list->first;
  178. while(current){
  179. if(visitor){
  180. (*visitor)(current->payload);
  181. }
  182. current=current->next;
  183. }
  184. return UA_NO_ERROR;
  185. }
  186. UA_list_Element* UA_list_find(UA_list_List* const list, UA_list_PayloadMatcher matcher){
  187. if(list==UA_NULL)return UA_NULL;
  188. if(matcher){
  189. UA_list_Element* current = list->first;
  190. while(current){
  191. if(matcher && (*matcher)(current->payload)==TRUE){
  192. return current;
  193. }
  194. current=current->next;
  195. }
  196. }
  197. /* nothing found */
  198. return UA_NULL;
  199. }
  200. UA_list_Element* UA_list_search(UA_list_List* const list, UA_list_PayloadComparer compare, void* payload){
  201. if(list==UA_NULL)return UA_NULL;
  202. if(compare){
  203. UA_list_Element* current = list->first;
  204. while(current){
  205. if(compare && (*compare)(current->payload, payload)==TRUE){
  206. return current;
  207. }
  208. current=current->next;
  209. }
  210. }
  211. /* nothing found */
  212. return UA_NULL;
  213. }
  214. UA_list_Element* UA_list_getFirst(UA_list_List* const list){
  215. if(list==UA_NULL)return UA_NULL;
  216. return list->first;
  217. }
  218. UA_list_Element* UA_list_getLast(UA_list_List* const list){
  219. if(list==UA_NULL)return UA_NULL;
  220. return list->last;
  221. }