aboutsummaryrefslogtreecommitdiff
path: root/src/link/Dwarf.zig
diff options
context:
space:
mode:
authorAndrew Kelley <andrew@ziglang.org>2023-11-24 22:30:38 -0700
committerAndrew Kelley <andrew@ziglang.org>2023-11-24 22:33:50 -0700
commite834e95d718fe3eacaec54034462c90fd10bfe76 (patch)
tree8592deca9862274ce41d9b6b2ca356ad25b757b5 /src/link/Dwarf.zig
parent8b10970836480a43a3bbb1276cb258c2a8b613f2 (diff)
downloadzig-e834e95d718fe3eacaec54034462c90fd10bfe76.tar.gz
zig-e834e95d718fe3eacaec54034462c90fd10bfe76.zip
Revert "std.SinglyLinkedList: add sort function"
This reverts commit 8b10970836480a43a3bbb1276cb258c2a8b613f2. This implementation has the following problems: * It does not provide context to the less than function. This will be an API break in order to fix. * It uses recursion, causing unbounded stack memory usage - likely depending on user input, which is extra problematic. * Sorting linked lists is generally an inefficient operation; encouraging it by having a standard library function for it may lead to suboptimal software being written in Zig. Furthermore, there is almost no benefit to providing a sort function as a method, when a third party implementation can easily be passed a linked list to then be sorted.
Diffstat (limited to 'src/link/Dwarf.zig')
0 files changed, 0 insertions, 0 deletions