riscv/musl - musl - Gitea: Git with a cup of tea

History

Szabolcs Nagy c50985d5c8 new tsearch implementation Rewrote the AVL tree implementation: - It is now non-recursive with fixed stack usage (large enough for worst case tree height). twalk and tdestroy are still recursive as that's smaller/simpler. - Moved unrelated interfaces into separate translation units. - The node structure is changed to use indexed children instead of left/right pointers, this simplifies the balancing logic. - Using void * pointers instead of struct node * in various places, because this better fits the api (node address is passed in a void argument, so it is tempting to incorrectly cast it to struct node ). - As a further performance improvement the rebalancing now stops when it is not needed (subtree height is unchanged). Otherwise the behaviour should be the same as before (checked over generated random inputs that the resulting tree shape is equivalent). - Removed the old copyright notice (including prng related one: it should be licensed under the same terms as the rest of the project). .text size of pic tsearch + tfind + tdelete + twalk: x86_64 i386 aarch64 arm mips powerpc ppc64le sh4 m68k s390x old 941 899 1220 1068 1852 1400 1600 1008 1008 1488 new 857 881 1040 976 1564 1192 1360 736 820 1408		10 years ago
..
hsearch.c	reduce spurious inclusion of libc.h	8 years ago
insque.c	XSI search.h API implementation by Szabolcs Nagy	15 years ago
lsearch.c	fix lsearch and lfind to pass key as first arg to the compar callback	9 years ago
tdelete.c	new tsearch implementation	8 years ago
tdestroy.c	new tsearch implementation	8 years ago
tfind.c	new tsearch implementation	8 years ago
tsearch.c	new tsearch implementation	8 years ago
tsearch.h	new tsearch implementation	8 years ago
twalk.c	new tsearch implementation	8 years ago