comparison: src/ucx/iterator.c
src/ucx/iterator.c
- changeset 579
- e10457d74fe1
equal
deleted
inserted
replaced
| 578:eb48f716b31c | 579:e10457d74fe1 |
|---|---|
| 1 /* | |
| 2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. | |
| 3 * | |
| 4 * Copyright 2024 Mike Becker, Olaf Wintermann All rights reserved. | |
| 5 * | |
| 6 * Redistribution and use in source and binary forms, with or without | |
| 7 * modification, are permitted provided that the following conditions are met: | |
| 8 * | |
| 9 * 1. Redistributions of source code must retain the above copyright | |
| 10 * notice, this list of conditions and the following disclaimer. | |
| 11 * | |
| 12 * 2. Redistributions in binary form must reproduce the above copyright | |
| 13 * notice, this list of conditions and the following disclaimer in the | |
| 14 * documentation and/or other materials provided with the distribution. | |
| 15 * | |
| 16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | |
| 17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
| 18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
| 19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE | |
| 20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | |
| 21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | |
| 22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | |
| 23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | |
| 24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | |
| 25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
| 26 * POSSIBILITY OF SUCH DAMAGE. | |
| 27 */ | |
| 28 | |
| 29 #include "cx/iterator.h" | |
| 30 | |
| 31 #include <string.h> | |
| 32 | |
| 33 static bool cx_iter_valid(const void *it) { | |
| 34 const struct cx_iterator_s *iter = it; | |
| 35 return iter->index < iter->elem_count; | |
| 36 } | |
| 37 | |
| 38 static void *cx_iter_current(const void *it) { | |
| 39 const struct cx_iterator_s *iter = it; | |
| 40 return iter->elem_handle; | |
| 41 } | |
| 42 | |
| 43 static void *cx_iter_current_ptr(const void *it) { | |
| 44 const struct cx_iterator_s *iter = it; | |
| 45 return *(void**)iter->elem_handle; | |
| 46 } | |
| 47 | |
| 48 static void cx_iter_next_fast(void *it) { | |
| 49 struct cx_iterator_s *iter = it; | |
| 50 if (iter->base.remove) { | |
| 51 iter->base.remove = false; | |
| 52 iter->elem_count--; | |
| 53 // only move the last element when we are not currently aiming | |
| 54 // at the last element already | |
| 55 if (iter->index < iter->elem_count) { | |
| 56 void *last = ((char *) iter->src_handle.m) | |
| 57 + iter->elem_count * iter->elem_size; | |
| 58 memcpy(iter->elem_handle, last, iter->elem_size); | |
| 59 } | |
| 60 } else { | |
| 61 iter->index++; | |
| 62 iter->elem_handle = ((char *) iter->elem_handle) + iter->elem_size; | |
| 63 } | |
| 64 } | |
| 65 | |
| 66 static void cx_iter_next_slow(void *it) { | |
| 67 struct cx_iterator_s *iter = it; | |
| 68 if (iter->base.remove) { | |
| 69 iter->base.remove = false; | |
| 70 iter->elem_count--; | |
| 71 | |
| 72 // number of elements to move | |
| 73 size_t remaining = iter->elem_count - iter->index; | |
| 74 if (remaining > 0) { | |
| 75 memmove( | |
| 76 iter->elem_handle, | |
| 77 ((char *) iter->elem_handle) + iter->elem_size, | |
| 78 remaining * iter->elem_size | |
| 79 ); | |
| 80 } | |
| 81 } else { | |
| 82 iter->index++; | |
| 83 iter->elem_handle = ((char *) iter->elem_handle) + iter->elem_size; | |
| 84 } | |
| 85 } | |
| 86 | |
| 87 CxIterator cxMutIterator( | |
| 88 void *array, | |
| 89 size_t elem_size, | |
| 90 size_t elem_count, | |
| 91 bool remove_keeps_order | |
| 92 ) { | |
| 93 CxIterator iter; | |
| 94 | |
| 95 iter.index = 0; | |
| 96 iter.src_handle.m = array; | |
| 97 iter.elem_handle = array; | |
| 98 iter.elem_size = elem_size; | |
| 99 iter.elem_count = array == NULL ? 0 : elem_count; | |
| 100 iter.base.valid = cx_iter_valid; | |
| 101 iter.base.current = cx_iter_current; | |
| 102 iter.base.next = remove_keeps_order ? cx_iter_next_slow : cx_iter_next_fast; | |
| 103 iter.base.remove = false; | |
| 104 iter.base.mutating = true; | |
| 105 | |
| 106 return iter; | |
| 107 } | |
| 108 | |
| 109 CxIterator cxIterator( | |
| 110 const void *array, | |
| 111 size_t elem_size, | |
| 112 size_t elem_count | |
| 113 ) { | |
| 114 CxIterator iter = cxMutIterator((void*)array, elem_size, elem_count, false); | |
| 115 iter.base.mutating = false; | |
| 116 return iter; | |
| 117 } | |
| 118 | |
| 119 CxIterator cxMutIteratorPtr( | |
| 120 void *array, | |
| 121 size_t elem_count, | |
| 122 bool remove_keeps_order | |
| 123 ) { | |
| 124 CxIterator iter = cxMutIterator(array, sizeof(void*), elem_count, remove_keeps_order); | |
| 125 iter.base.current = cx_iter_current_ptr; | |
| 126 return iter; | |
| 127 } | |
| 128 | |
| 129 CxIterator cxIteratorPtr( | |
| 130 const void *array, | |
| 131 size_t elem_count | |
| 132 ) { | |
| 133 CxIterator iter = cxMutIteratorPtr((void*) array, elem_count, false); | |
| 134 iter.base.mutating = false; | |
| 135 return iter; | |
| 136 } |
