* Find the next unique oid in the array after position "cur". * The array must be sorted for this to work. You can iterate * over unique elements like this: * * size_t i; * oid_array_sort(array); * for (i = 0; i < array->nr; i = oid_array_next_unique(array, i)) * printf("%s", oid_to_hex(array->oids[i]); * * Non-unique iteration can just increment with "i++" to visit each element. *
| 126 | * Non-unique iteration can just increment with "i++" to visit each element. |
| 127 | */ |
| 128 | static inline size_t oid_array_next_unique(struct oid_array *array, size_t cur) |
| 129 | { |
| 130 | do { |
| 131 | cur++; |
| 132 | } while (cur < array->nr && |
| 133 | oideq(array->oid + cur, array->oid + cur - 1)); |
| 134 | return cur; |
| 135 | } |
| 136 | |
| 137 | #endif /* OID_ARRAY_H */ |
no test coverage detected