The Cost of a Closure in C: The Rest

(thephd.dev)

21 points | by ingve 2 days ago

4 comments

  • userbinator 2 hours ago
    Those graph axes units are... perplexing, to say the least.

    So, we need to swap to the logarithmic graphs to get a better picture

    I wish more people would know about decibels.

  • andsoitis 2 hours ago
    > Cost of a Closure in C

    C does not have closures. You could simulate closures, but it is neither robust not automatic compared to languages tha truly support them.

    • skavi 35 minutes ago
      I think maybe this post would make more sense if you were familiar to its antecedent [0] which compares existing closure extensions to C. IIRC the comparison was in the context of considering designs for standardization.

      [0]: https://thephd.dev/the-cost-of-a-closure-in-c-c2y

    • aragilar 2 hours ago
      C does not currently have closures, the post it looking at their performance properties with an eye for what form closures should be added to the standard.
  • Panzerschrek 1 hour ago
    Why struggling using qsort? std::sort from C++ is much better in terms of usability and performance.
  • djaouen 1 hour ago
    Lisp solves the performance hit of closures with macros. However, given what macros look like in C, I hope it never amounts to that!
    • skavi 29 minutes ago
      There’s no necessary performance hit for closures. The performance cost here is caused by these closures needing to conform to a function pointer looking interface in order to be generally useful in C.