ua_list.c 5.5 KB

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