{"author":"Stefan Eissing","author_email":"stefan@eissing.org","author_time":1739715560,"commit_time":1739798603,"committer":"Daniel Stenberg","committer_email":"daniel@haxx.se","hash":"069f9d066e5ef45eca848e121159ebb9613f8bcf","message":"hash: use single linked list for entries\n\nCurl's double linked list is proven code, but it comes with some\nadditional memory overhead. Since hash's internal list of elements needs\nonly forward traversals, it seems worthwhile to use a single linked list\ninternally.\n\nThis saves 3 pointers per entry plus 3 pointers per slot.\n\nCloses #16351\n","parents":["0064708f3f1879e0982f5486ebae25e28bee27d8"],"tree_hash":"74a23cfab90077aa92e294991771b21575889226"}