> Instead of a linked list, how about using a dynamic array?
>
> https://en.wikipedia.org/wiki/Dynamic_array
>
> This would give you constant-time lookups, amortized constant time
> insertions and deletions, and better data locality and cache behavior.
>
> What do you think?
It's a good idea, in
>> # Whether we found libgcrypt.
>> HAVE_LIBGCRYPT = @HAVE_LIBGCRYPT@
>>
>> +# Whether we found libgcrypt.
>
> Copy-paste error :)
>
Ops!, yes... you've got a sharp eye!
Justus Winter writes:
> ---
> lwip/Makefile | 4 ++--
> 1 file changed, 2 insertions(+), 2 deletions(-)
>
> diff --git a/lwip/Makefile b/lwip/Makefile
> index e9289b5ae..8d4f45549 100644
> --- a/lwip/Makefile
> +++ b/lwip/Makefile
> @@ -28,7 +28,7 @@ OBJS= $(patsubst %.S,%.o,$(pa
---
lwip/Makefile | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/lwip/Makefile b/lwip/Makefile
index e9289b5ae..8d4f45549 100644
--- a/lwip/Makefile
+++ b/lwip/Makefile
@@ -28,7 +28,7 @@ OBJS = $(patsubst %.S,%.o,$(patsubst %.c,%.o,\
$(SRCS