pdxx
/
libfastcommon
mirror of https://github.com/happyfish100/libfastcommon.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

fast path for sorted_array_insert

pull/37/merge
YuQing 2021-12-14 21:18:30 +08:00
parent 0c437d3799
commit f6c5256264
1 changed files with 26 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

45
src/sorted_array.c
View File

@ -59,31 +59,38 @@ static char *sorted_array_bsearch(SortedArrayContext *ctx, char *base,
int sorted_array_insert(SortedArrayContext *ctx, int sorted_array_insert(SortedArrayContext *ctx,
void *base, int *count, const void *elt) void *base, int *count, const void *elt)
{ {
int insert_pos;
int move_count;
char *current; char *current;
char *found;
char *end;
found = sorted_array_bsearch(ctx, base, *count, elt, &insert_pos); if (*count == 0 || ctx->compare_func((char *)base +
if (found != NULL) { ctx->element_size * (*count - 1), elt) < 0)
if (!ctx->allow_duplication) { { //fast path
return EEXIST; current = (char *)base + ctx->element_size * (*count);
} } else {
int insert_pos;
int move_count;
char *found;
char *end;
found = sorted_array_bsearch(ctx, base, *count, elt, &insert_pos);
if (found != NULL) {
if (!ctx->allow_duplication) {
return EEXIST;
}
found += ctx->element_size;
end = (char *)base + ctx->element_size * (*count);
while (found < end && ctx->compare_func(found, elt) == 0) {
insert_pos++;
found += ctx->element_size; found += ctx->element_size;
end = (char *)base + ctx->element_size * (*count);
while (found < end && ctx->compare_func(found, elt) == 0) {
insert_pos++;
found += ctx->element_size;
}
} }
}
current = (char *)base + ctx->element_size * insert_pos; current = (char *)base + ctx->element_size * insert_pos;
move_count = *count - insert_pos; move_count = *count - insert_pos;
if (move_count > 0) { if (move_count > 0) {
memmove((char *)base + ctx->element_size * (insert_pos + 1), memmove((char *)base + ctx->element_size * (insert_pos + 1),
current, ctx->element_size * move_count); current, ctx->element_size * move_count);
}
} }
switch (ctx->element_size) { switch (ctx->element_size) {