mirror of
https://git.proxmox.com/git/libgit2
synced 2025-05-06 19:37:29 +00:00
4d3f1f9740
Finding a filename in a vector means we need to resort it every time we want to read from it, which includes every time we want to write to it as well, as we want to find duplicate keys. A hash-map fits what we want to do much more accurately, as we do not care about sorting, but just the particular filename. We still keep removed entries around, as the interface let you assume they were going to be around until the treebuilder is cleared or freed, but in this case that involves an append to a vector in the filter case, which can now fail. The only time we care about sorting is when we write out the tree, so let's make that the only time we do any sorting. |
||
|---|---|---|
| .. | ||
| blob | ||
| commit | ||
| raw | ||
| tag | ||
| tree | ||
| cache.c | ||
| lookup.c | ||
| lookupbypath.c | ||
| message.c | ||
| peel.c | ||
| shortid.c | ||