ua_list.c 5.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236
  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. temp->prev = UA_NULL;
  86. list->size--;
  87. if(list->size == 1){
  88. list->last = temp;
  89. }else if(list->size==0){
  90. list->last = UA_NULL;
  91. }
  92. }
  93. return UA_NO_ERROR;
  94. }
  95. UA_Int32 UA_list_removeLast(UA_list_List* list, UA_list_PayloadVisitor visitor){
  96. if(list==UA_NULL)return UA_ERROR;
  97. UA_list_Element* temp = UA_NULL;
  98. if(list->last){
  99. temp = list->last->prev;
  100. if(visitor){
  101. (*visitor)(list->last->payload);
  102. }
  103. UA_free(list->last);
  104. list->last = temp;
  105. temp->next = UA_NULL;
  106. list->size--;
  107. if(list->size == 1){
  108. list->first = temp;
  109. list->first->next = UA_NULL;
  110. }else if(list->size==0){
  111. list->first = UA_NULL;
  112. }
  113. }
  114. return UA_NO_ERROR;
  115. }
  116. UA_Int32 UA_list_removeElement(UA_list_Element* const elem, UA_list_PayloadVisitor visitor){
  117. if(elem==UA_NULL)return UA_ERROR;
  118. if(elem==elem->father->first){
  119. return UA_list_removeFirst(elem->father, visitor);
  120. }else if(elem==elem->father->last){
  121. return UA_list_removeLast(elem->father, visitor);
  122. }else{
  123. UA_list_Element* prev = elem->prev;
  124. UA_list_Element* next = elem->next;
  125. prev->next = next;
  126. next->prev = prev;
  127. if(visitor){
  128. (*visitor)(elem->payload);
  129. }
  130. (elem->father)->size--;
  131. UA_free(elem);
  132. }
  133. return UA_NO_ERROR;
  134. }
  135. UA_Int32 UA_list_destroy(UA_list_List* list, UA_list_PayloadVisitor visitor){
  136. if(list==UA_NULL)return UA_ERROR;
  137. UA_list_Element* current = UA_NULL;
  138. current=list->first;
  139. while(current){
  140. UA_list_Element* next = current->next;
  141. if(visitor){
  142. (*visitor)(current->payload);
  143. }
  144. UA_free(current);
  145. current = next;
  146. }
  147. UA_list_init(list);
  148. return UA_NO_ERROR;
  149. }
  150. UA_Int32 UA_list_iterateElement(UA_list_List* const list, UA_list_ElementVisitor visitor){
  151. if(list==UA_NULL)return UA_ERROR;
  152. UA_list_Element* current = list->first;
  153. while(current){
  154. if(visitor){
  155. (*visitor)(current);
  156. }
  157. current=current->next;
  158. }
  159. return UA_NO_ERROR;
  160. }
  161. /*Int32 UA_list_iteratePayload(UA_list_list* const list, UA_payloadVisitor visitor){
  162. void visitorTemp(UA_list_element* element){
  163. if(visitor){
  164. (*visitor)(element->payload);
  165. }
  166. }
  167. if(list==NULL)return UA_ERROR;
  168. UA_list_iterateElement(list, visitorTemp);
  169. return UA_NO_ERROR;
  170. }*/
  171. /** ANSI C forbids function nesting - reworked ugly version **/
  172. UA_Int32 UA_list_iteratePayload(UA_list_List* const list, UA_list_PayloadVisitor visitor){
  173. if(list==UA_NULL)return UA_ERROR;
  174. UA_list_Element* current = list->first;
  175. while(current){
  176. if(visitor){
  177. (*visitor)(current->payload);
  178. }
  179. current=current->next;
  180. }
  181. return UA_NO_ERROR;
  182. }
  183. UA_list_Element* UA_list_find(UA_list_List* const list, UA_list_PayloadMatcher matcher){
  184. if(list==UA_NULL)return UA_NULL;
  185. if(matcher){
  186. UA_list_Element* current = list->first;
  187. while(current){
  188. if(matcher && (*matcher)(current->payload)==TRUE){
  189. return current;
  190. }
  191. current=current->next;
  192. }
  193. }
  194. /* nothing found */
  195. return UA_NULL;
  196. }
  197. UA_list_Element* UA_list_search(UA_list_List* const list, UA_list_PayloadComparer compare, void* payload){
  198. if(list==UA_NULL)return UA_NULL;
  199. if(compare){
  200. UA_list_Element* current = list->first;
  201. while(current){
  202. if(compare && (*compare)(current->payload, payload)==TRUE){
  203. return current;
  204. }
  205. current=current->next;
  206. }
  207. }
  208. /* nothing found */
  209. return UA_NULL;
  210. }
  211. UA_list_Element* UA_list_getFirst(UA_list_List* const list){
  212. if(list==UA_NULL)return UA_NULL;
  213. return list->first;
  214. }
  215. UA_list_Element* UA_list_getLast(UA_list_List* const list){
  216. if(list==UA_NULL)return UA_NULL;
  217. return list->last;
  218. }