comparison: src/ucx/list.c
src/ucx/list.c
- changeset 582
- 82b60a8dd55c
- parent 579
- e10457d74fe1
- child 621
- 956c03c25edd
equal
deleted
inserted
replaced
| 581:4a049e416021 | 582:82b60a8dd55c |
|---|---|
| 60 | 60 |
| 61 static void cx_pl_destructor(struct cx_list_s *list) { | 61 static void cx_pl_destructor(struct cx_list_s *list) { |
| 62 list->climpl->deallocate(list); | 62 list->climpl->deallocate(list); |
| 63 } | 63 } |
| 64 | 64 |
| 65 static int cx_pl_insert_element( | 65 static void *cx_pl_insert_element( |
| 66 struct cx_list_s *list, | 66 struct cx_list_s *list, |
| 67 size_t index, | 67 size_t index, |
| 68 const void *element | 68 const void *element |
| 69 ) { | 69 ) { |
| 70 return list->climpl->insert_element(list, index, &element); | 70 return list->climpl->insert_element(list, index, &element); |
| 280 ) { | 280 ) { |
| 281 size_t elem_size = list->collection.elem_size; | 281 size_t elem_size = list->collection.elem_size; |
| 282 const char *src = data; | 282 const char *src = data; |
| 283 size_t i = 0; | 283 size_t i = 0; |
| 284 for (; i < n; i++) { | 284 for (; i < n; i++) { |
| 285 if (0 != invoke_list_func( | 285 if (NULL == invoke_list_func( |
| 286 insert_element, list, index + i, | 286 insert_element, list, index + i, |
| 287 src + (i * elem_size))) return i; | 287 src + (i * elem_size))) return i; |
| 288 } | 288 } |
| 289 return i; | 289 return i; |
| 290 } | 290 } |
| 327 ins++; | 327 ins++; |
| 328 } | 328 } |
| 329 | 329 |
| 330 // insert the elements at location si | 330 // insert the elements at location si |
| 331 if (ins == 1) { | 331 if (ins == 1) { |
| 332 if (0 != invoke_list_func( | 332 if (NULL == invoke_list_func( |
| 333 insert_element, list, di, src)) return inserted; | 333 insert_element, list, di, src)) return inserted; |
| 334 } else { | 334 } else { |
| 335 size_t r = invoke_list_func(insert_array, list, di, src, ins); | 335 size_t r = invoke_list_func(insert_array, list, di, src, ins); |
| 336 if (r < ins) return inserted + r; | 336 if (r < ins) return inserted + r; |
| 337 } | 337 } |
| 352 } | 352 } |
| 353 | 353 |
| 354 void cx_list_default_sort(struct cx_list_s *list) { | 354 void cx_list_default_sort(struct cx_list_s *list) { |
| 355 size_t elem_size = list->collection.elem_size; | 355 size_t elem_size = list->collection.elem_size; |
| 356 size_t list_size = list->collection.size; | 356 size_t list_size = list->collection.size; |
| 357 void *tmp = malloc(elem_size * list_size); | 357 void *tmp = cxMallocDefault(elem_size * list_size); |
| 358 if (tmp == NULL) abort(); | 358 if (tmp == NULL) abort(); |
| 359 | 359 |
| 360 // copy elements from source array | 360 // copy elements from source array |
| 361 char *loc = tmp; | 361 char *loc = tmp; |
| 362 for (size_t i = 0; i < list_size; i++) { | 362 for (size_t i = 0; i < list_size; i++) { |
| 375 void *dest = invoke_list_func(at, list, i); | 375 void *dest = invoke_list_func(at, list, i); |
| 376 memcpy(dest, loc, elem_size); | 376 memcpy(dest, loc, elem_size); |
| 377 loc += elem_size; | 377 loc += elem_size; |
| 378 } | 378 } |
| 379 | 379 |
| 380 free(tmp); | 380 cxFreeDefault(tmp); |
| 381 } | 381 } |
| 382 | 382 |
| 383 int cx_list_default_swap(struct cx_list_s *list, size_t i, size_t j) { | 383 int cx_list_default_swap(struct cx_list_s *list, size_t i, size_t j) { |
| 384 if (i == j) return 0; | 384 if (i == j) return 0; |
| 385 if (i >= list->collection.size) return 1; | 385 if (i >= list->collection.size) return 1; |
| 386 if (j >= list->collection.size) return 1; | 386 if (j >= list->collection.size) return 1; |
| 387 | 387 |
| 388 size_t elem_size = list->collection.elem_size; | 388 size_t elem_size = list->collection.elem_size; |
| 389 | 389 |
| 390 void *tmp = malloc(elem_size); | 390 void *tmp = cxMallocDefault(elem_size); |
| 391 if (tmp == NULL) return 1; | 391 if (tmp == NULL) return 1; |
| 392 | 392 |
| 393 void *ip = invoke_list_func(at, list, i); | 393 void *ip = invoke_list_func(at, list, i); |
| 394 void *jp = invoke_list_func(at, list, j); | 394 void *jp = invoke_list_func(at, list, j); |
| 395 | 395 |
| 396 memcpy(tmp, ip, elem_size); | 396 memcpy(tmp, ip, elem_size); |
| 397 memcpy(ip, jp, elem_size); | 397 memcpy(ip, jp, elem_size); |
| 398 memcpy(jp, tmp, elem_size); | 398 memcpy(jp, tmp, elem_size); |
| 399 | 399 |
| 400 free(tmp); | 400 cxFreeDefault(tmp); |
| 401 | 401 |
| 402 return 0; | 402 return 0; |
| 403 } | 403 } |
| 404 | 404 |
| 405 void cx_list_init( | 405 void cx_list_init( |
| 492 | 492 |
| 493 void cxListFree(CxList *list) { | 493 void cxListFree(CxList *list) { |
| 494 if (list == NULL) return; | 494 if (list == NULL) return; |
| 495 list->cl->deallocate(list); | 495 list->cl->deallocate(list); |
| 496 } | 496 } |
| 497 | |
| 498 int cxListSet( | |
| 499 CxList *list, | |
| 500 size_t index, | |
| 501 const void *elem | |
| 502 ) { | |
| 503 if (index >= list->collection.size) { | |
| 504 return 1; | |
| 505 } | |
| 506 | |
| 507 if (list->collection.store_pointer) { | |
| 508 // For pointer collections, always use climpl | |
| 509 void **target = list->climpl->at(list, index); | |
| 510 *target = (void *)elem; | |
| 511 } else { | |
| 512 void *target = list->cl->at(list, index); | |
| 513 memcpy(target, elem, list->collection.elem_size); | |
| 514 } | |
| 515 | |
| 516 return 0; | |
| 517 } |
