I’ve indexed all Strange Loop conference talks so you can use semantic search to find relevant videos
https://www.reddit.com/r/programming/comments/1op95wf/ive_indexed_all_strange_loop_conference_talks_so/
submitted by /u/devblogs-sh (https://www.reddit.com/user/devblogs-sh)
[link] (https://devblogs.sh/library/strangeloop) [comments] (https://www.reddit.com/r/programming/comments/1op95wf/ive_indexed_all_strange_loop_conference_talks_so/)
https://www.reddit.com/r/programming/comments/1op95wf/ive_indexed_all_strange_loop_conference_talks_so/
submitted by /u/devblogs-sh (https://www.reddit.com/user/devblogs-sh)
[link] (https://devblogs.sh/library/strangeloop) [comments] (https://www.reddit.com/r/programming/comments/1op95wf/ive_indexed_all_strange_loop_conference_talks_so/)
nyno-lang can mix Python, JavaScript and PHP extensions for high-performing multi-language (AI) workflows - using the best of each language - sharing context via TCP.
https://www.reddit.com/r/programming/comments/1op9aqz/nynolang_can_mix_python_javascript_and_php/
submitted by /u/EveYogaTech (https://www.reddit.com/user/EveYogaTech)
[link] (https://github.com/empowerd-cms/nyno-lang) [comments] (https://www.reddit.com/r/programming/comments/1op9aqz/nynolang_can_mix_python_javascript_and_php/)
https://www.reddit.com/r/programming/comments/1op9aqz/nynolang_can_mix_python_javascript_and_php/
submitted by /u/EveYogaTech (https://www.reddit.com/user/EveYogaTech)
[link] (https://github.com/empowerd-cms/nyno-lang) [comments] (https://www.reddit.com/r/programming/comments/1op9aqz/nynolang_can_mix_python_javascript_and_php/)
Hacking with AI SASTs: An overview of 'AI Security Engineers' / 'LLM Security Scanners' for Penetration Testers and Security Teams
https://www.reddit.com/r/programming/comments/1opasys/hacking_with_ai_sasts_an_overview_of_ai_security/
submitted by /u/alexeyr (https://www.reddit.com/user/alexeyr)
[link] (https://joshua.hu/llm-engineer-review-sast-security-ai-tools-pentesters) [comments] (https://www.reddit.com/r/programming/comments/1opasys/hacking_with_ai_sasts_an_overview_of_ai_security/)
https://www.reddit.com/r/programming/comments/1opasys/hacking_with_ai_sasts_an_overview_of_ai_security/
submitted by /u/alexeyr (https://www.reddit.com/user/alexeyr)
[link] (https://joshua.hu/llm-engineer-review-sast-security-ai-tools-pentesters) [comments] (https://www.reddit.com/r/programming/comments/1opasys/hacking_with_ai_sasts_an_overview_of_ai_security/)
Ruby And Its Neighbors: Smalltalk
https://www.reddit.com/r/programming/comments/1opayac/ruby_and_its_neighbors_smalltalk/
submitted by /u/BrewedDoritos (https://www.reddit.com/user/BrewedDoritos)
[link] (https://noelrappin.com/blog/2025/11/ruby-and-its-neighbors-smalltalk/) [comments] (https://www.reddit.com/r/programming/comments/1opayac/ruby_and_its_neighbors_smalltalk/)
https://www.reddit.com/r/programming/comments/1opayac/ruby_and_its_neighbors_smalltalk/
submitted by /u/BrewedDoritos (https://www.reddit.com/user/BrewedDoritos)
[link] (https://noelrappin.com/blog/2025/11/ruby-and-its-neighbors-smalltalk/) [comments] (https://www.reddit.com/r/programming/comments/1opayac/ruby_and_its_neighbors_smalltalk/)
Cj: a tiny no-deps JIT in C for x86-64 and ARM64
https://www.reddit.com/r/programming/comments/1opbt53/cj_a_tiny_nodeps_jit_in_c_for_x8664_and_arm64/
<!-- SC_OFF -->Hey y’all! About 7 years ago, I had this idea to write a JIT with an autogenerated backend for x86 based on the ISA specs. I sketched something out and then just kinda let it sit. I picked it up again a few weeks ago and made a complete-ish backend for both x86 and ARM64. It has no dependencies, the backends are completely autogenerated (by horrible, horrible JS scripts), and I built a small abstraciton layer for things like functions prologues etc. It’s super duper early and will probably break on your machine, but it’s good enough to compile some cool examples (look at the examples directory (https://github.com/hellerve-pl-experiments/cj/tree/master/examples), my personal favorite is the minimal language implementation (https://github.com/hellerve-pl-experiments/cj/blob/master/examples/minilang.c)). It doesn’t have anything except basically a fancy JIT assembler with some helpers as of yet. No register allocator, a lot of ABI details will still have to be figured out manually (though of course feel free to add anything to the abstraction layer that’s generally useful and submit a PR!). I honestly don’t know where I’m going with this next. I kind of stumbled into the project, and am not sure whether I’ll consider it as “exercise completed” or whether I should pursue it more. Time will tell. Feedback, questions, and bug reports very welcome—especially on the codegen helpers, additional examples or cool things you come up with, or backend rough edges. P.S.: I also wrote a small announcement blog post on it that you can find here (https://blog.veitheller.de/cj:_Making_a_minimal,_complete_JI... (https://blog.veitheller.de/cj:_Making_a_minimal,_complete_JIT.html)), but it honestly doesn’t add all that much interesting info that you can’t find in the repo <!-- SC_ON --> submitted by /u/hellerve (https://www.reddit.com/user/hellerve)
[link] (https://github.com/hellerve-pl-experiments/cj) [comments] (https://www.reddit.com/r/programming/comments/1opbt53/cj_a_tiny_nodeps_jit_in_c_for_x8664_and_arm64/)
https://www.reddit.com/r/programming/comments/1opbt53/cj_a_tiny_nodeps_jit_in_c_for_x8664_and_arm64/
<!-- SC_OFF -->Hey y’all! About 7 years ago, I had this idea to write a JIT with an autogenerated backend for x86 based on the ISA specs. I sketched something out and then just kinda let it sit. I picked it up again a few weeks ago and made a complete-ish backend for both x86 and ARM64. It has no dependencies, the backends are completely autogenerated (by horrible, horrible JS scripts), and I built a small abstraciton layer for things like functions prologues etc. It’s super duper early and will probably break on your machine, but it’s good enough to compile some cool examples (look at the examples directory (https://github.com/hellerve-pl-experiments/cj/tree/master/examples), my personal favorite is the minimal language implementation (https://github.com/hellerve-pl-experiments/cj/blob/master/examples/minilang.c)). It doesn’t have anything except basically a fancy JIT assembler with some helpers as of yet. No register allocator, a lot of ABI details will still have to be figured out manually (though of course feel free to add anything to the abstraction layer that’s generally useful and submit a PR!). I honestly don’t know where I’m going with this next. I kind of stumbled into the project, and am not sure whether I’ll consider it as “exercise completed” or whether I should pursue it more. Time will tell. Feedback, questions, and bug reports very welcome—especially on the codegen helpers, additional examples or cool things you come up with, or backend rough edges. P.S.: I also wrote a small announcement blog post on it that you can find here (https://blog.veitheller.de/cj:_Making_a_minimal,_complete_JI... (https://blog.veitheller.de/cj:_Making_a_minimal,_complete_JIT.html)), but it honestly doesn’t add all that much interesting info that you can’t find in the repo <!-- SC_ON --> submitted by /u/hellerve (https://www.reddit.com/user/hellerve)
[link] (https://github.com/hellerve-pl-experiments/cj) [comments] (https://www.reddit.com/r/programming/comments/1opbt53/cj_a_tiny_nodeps_jit_in_c_for_x8664_and_arm64/)
Please Implement This Simple SLO
https://www.reddit.com/r/programming/comments/1opbziq/please_implement_this_simple_slo/
<!-- SC_OFF -->In all the companies I've worked for, engineers have treated SLOs as a simple and boring task. There are, however, many ways that you could do it, and they all have trade-offs.
I wrote this satirical piece to illustrate the underappreciated art of writing good SLOs. <!-- SC_ON --> submitted by /u/IEavan (https://www.reddit.com/user/IEavan)
[link] (https://eavan.blog/posts/implement-an-slo.html) [comments] (https://www.reddit.com/r/programming/comments/1opbziq/please_implement_this_simple_slo/)
https://www.reddit.com/r/programming/comments/1opbziq/please_implement_this_simple_slo/
<!-- SC_OFF -->In all the companies I've worked for, engineers have treated SLOs as a simple and boring task. There are, however, many ways that you could do it, and they all have trade-offs.
I wrote this satirical piece to illustrate the underappreciated art of writing good SLOs. <!-- SC_ON --> submitted by /u/IEavan (https://www.reddit.com/user/IEavan)
[link] (https://eavan.blog/posts/implement-an-slo.html) [comments] (https://www.reddit.com/r/programming/comments/1opbziq/please_implement_this_simple_slo/)
Predictive Thermal Management On Mobile: 0.27°C Accuracy 30 Seconds in Advance
https://www.reddit.com/r/programming/comments/1oprqnh/predictive_thermal_management_on_mobile_027c/
<!-- SC_OFF -->The hardware properties of modern mobile devices are perfect for modeling with physics. Here is what I have found. Total predictions: 2142 Duration: 60 minutes MAE: 1.51°C RMSE: 2.70°C Bias: -0.95°C Within ±1°C: 58.2% Within ±2°C: 75.6% Per-zone MAE: BATTERY : 0.27°C (357 predictions) CHASSIS : 2.92°C (357 predictions) CPU_BIG : 1.60°C (357 predictions) CPU_LITTLE : 2.50°C (357 predictions) GPU : 0.96°C (357 predictions) MODEM : 0.80°C (357 predictions) 0.27°C on the hardware that matters, 30 seconds in advance. On S25+, throttling decisions are made almost entirely based on battery status. Predictive Modeling > Reactive Throttling. By using Newton's Law of Cooling in combination with measured estimates based on hardware constraints and adaptive damping for your specific device, you can predict thermal events before they happen and defer inexpensive operations, pause expensive operations, and emergency shutdown operations in danger territory. This prevents us from ever reaching the 42°C throttle limit. At this limit, Samsung aggressively throttles performance by about 50%, which can cause performance problems, which can generate more heat, and the spiral can get out of hand quickly. Mathematical Model Core equation (Newton's law of cooling): T(t) = T_amb + (T₀ - T_amb)·exp(-t/τ) + (P·R)·(1 - exp(-t/τ)) Where: - τ = thermal time constant (zone-specific) - R = thermal resistance (°C/W) - P = power dissipation (W) - T_amb = ambient temperature Per-zone constants (measured from S25+ hardware): - Battery: τ=540s, C=45 J/K (massive thermal mass) - CPU cores: τ=6-9s, C=0.025-0.05 J/K (fast response) - GPU/Modem: τ=9s, C=0.02-0.035 J/K Prediction horizon: 30s at 10s sampling intervals Adaptive damping: Prediction error feedback loop damping = f(bias, confidence, sample_count) T_predicted_adjusted = T_predicted - damping·ΔT Maintains per-zone error history with confidence weighting. Damping strength scales inversely with thermal time constant (battery gets minimal damping due to high predictability, CPU gets aggressive damping). Result: 0.27°C MAE on battery. My solution is simple: never reach 42° C. <!-- SC_ON --> submitted by /u/DaSettingsPNGN (https://www.reddit.com/user/DaSettingsPNGN)
[link] (https://github.com/DaSettingsPNGN/S25_THERMAL-) [comments] (https://www.reddit.com/r/programming/comments/1oprqnh/predictive_thermal_management_on_mobile_027c/)
https://www.reddit.com/r/programming/comments/1oprqnh/predictive_thermal_management_on_mobile_027c/
<!-- SC_OFF -->The hardware properties of modern mobile devices are perfect for modeling with physics. Here is what I have found. Total predictions: 2142 Duration: 60 minutes MAE: 1.51°C RMSE: 2.70°C Bias: -0.95°C Within ±1°C: 58.2% Within ±2°C: 75.6% Per-zone MAE: BATTERY : 0.27°C (357 predictions) CHASSIS : 2.92°C (357 predictions) CPU_BIG : 1.60°C (357 predictions) CPU_LITTLE : 2.50°C (357 predictions) GPU : 0.96°C (357 predictions) MODEM : 0.80°C (357 predictions) 0.27°C on the hardware that matters, 30 seconds in advance. On S25+, throttling decisions are made almost entirely based on battery status. Predictive Modeling > Reactive Throttling. By using Newton's Law of Cooling in combination with measured estimates based on hardware constraints and adaptive damping for your specific device, you can predict thermal events before they happen and defer inexpensive operations, pause expensive operations, and emergency shutdown operations in danger territory. This prevents us from ever reaching the 42°C throttle limit. At this limit, Samsung aggressively throttles performance by about 50%, which can cause performance problems, which can generate more heat, and the spiral can get out of hand quickly. Mathematical Model Core equation (Newton's law of cooling): T(t) = T_amb + (T₀ - T_amb)·exp(-t/τ) + (P·R)·(1 - exp(-t/τ)) Where: - τ = thermal time constant (zone-specific) - R = thermal resistance (°C/W) - P = power dissipation (W) - T_amb = ambient temperature Per-zone constants (measured from S25+ hardware): - Battery: τ=540s, C=45 J/K (massive thermal mass) - CPU cores: τ=6-9s, C=0.025-0.05 J/K (fast response) - GPU/Modem: τ=9s, C=0.02-0.035 J/K Prediction horizon: 30s at 10s sampling intervals Adaptive damping: Prediction error feedback loop damping = f(bias, confidence, sample_count) T_predicted_adjusted = T_predicted - damping·ΔT Maintains per-zone error history with confidence weighting. Damping strength scales inversely with thermal time constant (battery gets minimal damping due to high predictability, CPU gets aggressive damping). Result: 0.27°C MAE on battery. My solution is simple: never reach 42° C. <!-- SC_ON --> submitted by /u/DaSettingsPNGN (https://www.reddit.com/user/DaSettingsPNGN)
[link] (https://github.com/DaSettingsPNGN/S25_THERMAL-) [comments] (https://www.reddit.com/r/programming/comments/1oprqnh/predictive_thermal_management_on_mobile_027c/)
Anyone interested in F1?
https://www.reddit.com/r/programming/comments/1ops8jh/anyone_interested_in_f1/
<!-- SC_OFF -->I've created a fully functional F1 website that can scrape race data in real time and update it automatically.
If you're interested, you can take a look at the website I created, and we can discuss it. <!-- SC_ON --> submitted by /u/TravelTownEnergy (https://www.reddit.com/user/TravelTownEnergy)
[link] (https://f1-news-site.lumi.ing/) [comments] (https://www.reddit.com/r/programming/comments/1ops8jh/anyone_interested_in_f1/)
https://www.reddit.com/r/programming/comments/1ops8jh/anyone_interested_in_f1/
<!-- SC_OFF -->I've created a fully functional F1 website that can scrape race data in real time and update it automatically.
If you're interested, you can take a look at the website I created, and we can discuss it. <!-- SC_ON --> submitted by /u/TravelTownEnergy (https://www.reddit.com/user/TravelTownEnergy)
[link] (https://f1-news-site.lumi.ing/) [comments] (https://www.reddit.com/r/programming/comments/1ops8jh/anyone_interested_in_f1/)
The Primeagen was right: Vim motions have made me 10x faster. Here's the data to prove it
https://www.reddit.com/r/programming/comments/1opscy5/the_primeagen_was_right_vim_motions_have_made_me/
<!-- SC_OFF -->After 6 months of forcing myself to use Vim keybindings in VS Code, I tracked my productivity metrics. The results are honestly shocking. Key findings: - 43% reduction in time spent navigating files - 67% fewer mouse movements per hour - Average of 2.3 minutes saved per coding task The vim-be-good plugin was a game changer for building muscle memory. Started at 15 WPM with motions, now consistently hitting 85+ WPM. Anyone else have similar experiences? Would love to hear if others have quantified their productivity gains. <!-- SC_ON --> submitted by /u/Ares2010- (https://www.reddit.com/user/Ares2010-)
[link] (https://github.com/ThePrimeagen/vim-be-good) [comments] (https://www.reddit.com/r/programming/comments/1opscy5/the_primeagen_was_right_vim_motions_have_made_me/)
https://www.reddit.com/r/programming/comments/1opscy5/the_primeagen_was_right_vim_motions_have_made_me/
<!-- SC_OFF -->After 6 months of forcing myself to use Vim keybindings in VS Code, I tracked my productivity metrics. The results are honestly shocking. Key findings: - 43% reduction in time spent navigating files - 67% fewer mouse movements per hour - Average of 2.3 minutes saved per coding task The vim-be-good plugin was a game changer for building muscle memory. Started at 15 WPM with motions, now consistently hitting 85+ WPM. Anyone else have similar experiences? Would love to hear if others have quantified their productivity gains. <!-- SC_ON --> submitted by /u/Ares2010- (https://www.reddit.com/user/Ares2010-)
[link] (https://github.com/ThePrimeagen/vim-be-good) [comments] (https://www.reddit.com/r/programming/comments/1opscy5/the_primeagen_was_right_vim_motions_have_made_me/)
PyCon US 2026 website is live & CFP is open
https://www.reddit.com/r/programming/comments/1opslgj/pycon_us_2026_website_is_live_cfp_is_open/
submitted by /u/clairegiordano (https://www.reddit.com/user/clairegiordano)
[link] (https://us.pycon.org/2026/) [comments] (https://www.reddit.com/r/programming/comments/1opslgj/pycon_us_2026_website_is_live_cfp_is_open/)
https://www.reddit.com/r/programming/comments/1opslgj/pycon_us_2026_website_is_live_cfp_is_open/
submitted by /u/clairegiordano (https://www.reddit.com/user/clairegiordano)
[link] (https://us.pycon.org/2026/) [comments] (https://www.reddit.com/r/programming/comments/1opslgj/pycon_us_2026_website_is_live_cfp_is_open/)
free, open-source file scanner
https://www.reddit.com/r/programming/comments/1opsy9w/free_opensource_file_scanner/
submitted by /u/JustSouochi (https://www.reddit.com/user/JustSouochi)
[link] (https://github.com/pompelmi/pompelmi/) [comments] (https://www.reddit.com/r/programming/comments/1opsy9w/free_opensource_file_scanner/)
https://www.reddit.com/r/programming/comments/1opsy9w/free_opensource_file_scanner/
submitted by /u/JustSouochi (https://www.reddit.com/user/JustSouochi)
[link] (https://github.com/pompelmi/pompelmi/) [comments] (https://www.reddit.com/r/programming/comments/1opsy9w/free_opensource_file_scanner/)
I just launched an open-source tool that lets you build and test MCP servers right in the browser 🚀
https://www.reddit.com/r/programming/comments/1optgli/i_just_launched_an_opensource_tool_that_lets_you/
submitted by /u/ArmyBusiness6047 (https://www.reddit.com/user/ArmyBusiness6047)
[link] (https://www.producthunt.com/products/mcpwhiz?utm_source=linkedin&utm_medium=social) [comments] (https://www.reddit.com/r/programming/comments/1optgli/i_just_launched_an_opensource_tool_that_lets_you/)
https://www.reddit.com/r/programming/comments/1optgli/i_just_launched_an_opensource_tool_that_lets_you/
submitted by /u/ArmyBusiness6047 (https://www.reddit.com/user/ArmyBusiness6047)
[link] (https://www.producthunt.com/products/mcpwhiz?utm_source=linkedin&utm_medium=social) [comments] (https://www.reddit.com/r/programming/comments/1optgli/i_just_launched_an_opensource_tool_that_lets_you/)
Postgres is Enough
https://www.reddit.com/r/programming/comments/1opv75r/postgres_is_enough/
submitted by /u/iamkeyur (https://www.reddit.com/user/iamkeyur)
[link] (https://gist.github.com/cpursley/c8fb81fe8a7e5df038158bdfe0f06dbb) [comments] (https://www.reddit.com/r/programming/comments/1opv75r/postgres_is_enough/)
https://www.reddit.com/r/programming/comments/1opv75r/postgres_is_enough/
submitted by /u/iamkeyur (https://www.reddit.com/user/iamkeyur)
[link] (https://gist.github.com/cpursley/c8fb81fe8a7e5df038158bdfe0f06dbb) [comments] (https://www.reddit.com/r/programming/comments/1opv75r/postgres_is_enough/)
a port of the lockfree skiplist (and list) to C++ from "the art of multiprocessor programming"
https://www.reddit.com/r/programming/comments/1opvglp/a_port_of_the_lockfree_skiplist_and_list_to_c/
<!-- SC_OFF -->this can be optimized further if you remove the java-like abstractions i implemented, and you can get a solid T type instead of the void* data i used if you inline all the abstraction helpers instead of using them but it makes the code less clear as it stands i used void* data for a reason so i could maintain the same abstraction as 'atomicmarkablereference' and behavior as java and result in a working port this can be accounted for if you want to recode the class to have all the CAS and other functions inline either way this is a decentish reference on how to implement something like the book in C++ -- with memory management hinted at (full epochmanager not included in this project so this demo does leak without teh full implementation) Edit: Technical challenges to this port and tips on porting java lock free code to c++: -porting java lock free semantics to C++ and how to do it: Copy the algorithm faithfully -- even if you have to morph the language semantics or do non traditional things ot make it work (i.e. layer base class that is strictly defined and use void* data and casting to mimick javas atomicreference and node behavior rather than using a template which is reusable and modern this method will not work as seen in all other examples on github that tried too slow and double reference cost, also doesnt follow the algorithm faithfully) Make the semantics equivalent (epoch/hazard/markable ptr design) find a way to keep the algorithm teh same while porting and fit in a memory model that works Validate a working baseline -- before making the program a concrete STL nice modern template without the hax make sure the list works -- it likely will need some changes because C++ is faster and less safe so you might need more retry checks in other places or some hardening of the algorithm and debugging still. relax. dont give up. Then inline / optimize / modernize -- this step i have not done you can do it by removing the SNMarkablepointer class and inlining all the cas and pointer operations and slowly finding ways to undo the abstractions now that the algorithm is solid this was a real challenge to port to C++ successfully and actually get the locks to function but if you do this and consider non traditional options you can successfully port java lock free semantics to C++ <!-- SC_ON --> submitted by /u/Slight-Abroad8939 (https://www.reddit.com/user/Slight-Abroad8939)
[link] (https://github.com/jay403894-bit/Lockfree-concurrent-priority-queue-skiplist-prototype/tree/main) [comments] (https://www.reddit.com/r/programming/comments/1opvglp/a_port_of_the_lockfree_skiplist_and_list_to_c/)
https://www.reddit.com/r/programming/comments/1opvglp/a_port_of_the_lockfree_skiplist_and_list_to_c/
<!-- SC_OFF -->this can be optimized further if you remove the java-like abstractions i implemented, and you can get a solid T type instead of the void* data i used if you inline all the abstraction helpers instead of using them but it makes the code less clear as it stands i used void* data for a reason so i could maintain the same abstraction as 'atomicmarkablereference' and behavior as java and result in a working port this can be accounted for if you want to recode the class to have all the CAS and other functions inline either way this is a decentish reference on how to implement something like the book in C++ -- with memory management hinted at (full epochmanager not included in this project so this demo does leak without teh full implementation) Edit: Technical challenges to this port and tips on porting java lock free code to c++: -porting java lock free semantics to C++ and how to do it: Copy the algorithm faithfully -- even if you have to morph the language semantics or do non traditional things ot make it work (i.e. layer base class that is strictly defined and use void* data and casting to mimick javas atomicreference and node behavior rather than using a template which is reusable and modern this method will not work as seen in all other examples on github that tried too slow and double reference cost, also doesnt follow the algorithm faithfully) Make the semantics equivalent (epoch/hazard/markable ptr design) find a way to keep the algorithm teh same while porting and fit in a memory model that works Validate a working baseline -- before making the program a concrete STL nice modern template without the hax make sure the list works -- it likely will need some changes because C++ is faster and less safe so you might need more retry checks in other places or some hardening of the algorithm and debugging still. relax. dont give up. Then inline / optimize / modernize -- this step i have not done you can do it by removing the SNMarkablepointer class and inlining all the cas and pointer operations and slowly finding ways to undo the abstractions now that the algorithm is solid this was a real challenge to port to C++ successfully and actually get the locks to function but if you do this and consider non traditional options you can successfully port java lock free semantics to C++ <!-- SC_ON --> submitted by /u/Slight-Abroad8939 (https://www.reddit.com/user/Slight-Abroad8939)
[link] (https://github.com/jay403894-bit/Lockfree-concurrent-priority-queue-skiplist-prototype/tree/main) [comments] (https://www.reddit.com/r/programming/comments/1opvglp/a_port_of_the_lockfree_skiplist_and_list_to_c/)
Embedding TypeScript
https://www.reddit.com/r/programming/comments/1opvtk4/embedding_typescript/
submitted by /u/AndrewMD5 (https://www.reddit.com/user/AndrewMD5)
[link] (https://andrews.substack.com/p/embedding-typescript) [comments] (https://www.reddit.com/r/programming/comments/1opvtk4/embedding_typescript/)
https://www.reddit.com/r/programming/comments/1opvtk4/embedding_typescript/
submitted by /u/AndrewMD5 (https://www.reddit.com/user/AndrewMD5)
[link] (https://andrews.substack.com/p/embedding-typescript) [comments] (https://www.reddit.com/r/programming/comments/1opvtk4/embedding_typescript/)
Pool allocator in C++23 for simulations / game engines - faster than std::pmr
https://www.reddit.com/r/programming/comments/1oq00bx/pool_allocator_in_c23_for_simulations_game/
<!-- SC_OFF -->metapool is a header-only, pool-based allocator for high-frequency allocations in simulations, game engines, and other real-time systems. It uses compile-time layout configuration with preallocated thread-local arenas and implements both std::allocator and std::pmr::memory_resource interfaces. The repository includes benchmarks against malloc, std::allocator (heap), and std::pmr::unsynchronized_pool_resource (no heap).
The metapool-backed dynamic array mtp::vault reaches up to 1300x faster reserve() than std::vector, and about 3.5x faster than std::pmr::vector. <!-- SC_ON --> submitted by /u/iftoin (https://www.reddit.com/user/iftoin)
[link] (https://github.com/esterlein/metapool) [comments] (https://www.reddit.com/r/programming/comments/1oq00bx/pool_allocator_in_c23_for_simulations_game/)
https://www.reddit.com/r/programming/comments/1oq00bx/pool_allocator_in_c23_for_simulations_game/
<!-- SC_OFF -->metapool is a header-only, pool-based allocator for high-frequency allocations in simulations, game engines, and other real-time systems. It uses compile-time layout configuration with preallocated thread-local arenas and implements both std::allocator and std::pmr::memory_resource interfaces. The repository includes benchmarks against malloc, std::allocator (heap), and std::pmr::unsynchronized_pool_resource (no heap).
The metapool-backed dynamic array mtp::vault reaches up to 1300x faster reserve() than std::vector, and about 3.5x faster than std::pmr::vector. <!-- SC_ON --> submitted by /u/iftoin (https://www.reddit.com/user/iftoin)
[link] (https://github.com/esterlein/metapool) [comments] (https://www.reddit.com/r/programming/comments/1oq00bx/pool_allocator_in_c23_for_simulations_game/)
Understanding the Bridge Design Pattern in Go: A Practical Guide
https://www.reddit.com/r/programming/comments/1oq0v0q/understanding_the_bridge_design_pattern_in_go_a/
<!-- SC_OFF -->Hey folks, I just finished writing a deep-dive blog on the Bridge Design Pattern in Go — one of those patterns that sounds over-engineered at first, but actually keeps your code sane when multiple things in your system start changing independently. The post covers everything from the fundamentals to real-world design tips: How Bridge decouples abstraction (like Shape) from implementation (like Renderer) When to actually use Bridge (and when it’s just unnecessary complexity) Clean Go examples using composition instead of inheritance Common anti-patterns (like “leaky abstraction” or “bridge for the sake of it”) Best practices to keep interfaces minimal and runtime-swappable Real-world extensions — how Bridge evolves naturally into plugin-style designs If you’ve ever refactored a feature and realized one small change breaks five layers of code, Bridge might be your new favorite tool. 🔗 Read here: https://medium.com/design-bootcamp/understanding-the-bridge-design-pattern-in-go-a-practical-guide-734b1ec7194e Curious — do you actually use Bridge in production code, or is it one of those patterns we all learn but rarely apply? <!-- SC_ON --> submitted by /u/priyankchheda15 (https://www.reddit.com/user/priyankchheda15)
[link] (https://medium.com/design-bootcamp/understanding-the-bridge-design-pattern-in-go-a-practical-guide-734b1ec7194e) [comments] (https://www.reddit.com/r/programming/comments/1oq0v0q/understanding_the_bridge_design_pattern_in_go_a/)
https://www.reddit.com/r/programming/comments/1oq0v0q/understanding_the_bridge_design_pattern_in_go_a/
<!-- SC_OFF -->Hey folks, I just finished writing a deep-dive blog on the Bridge Design Pattern in Go — one of those patterns that sounds over-engineered at first, but actually keeps your code sane when multiple things in your system start changing independently. The post covers everything from the fundamentals to real-world design tips: How Bridge decouples abstraction (like Shape) from implementation (like Renderer) When to actually use Bridge (and when it’s just unnecessary complexity) Clean Go examples using composition instead of inheritance Common anti-patterns (like “leaky abstraction” or “bridge for the sake of it”) Best practices to keep interfaces minimal and runtime-swappable Real-world extensions — how Bridge evolves naturally into plugin-style designs If you’ve ever refactored a feature and realized one small change breaks five layers of code, Bridge might be your new favorite tool. 🔗 Read here: https://medium.com/design-bootcamp/understanding-the-bridge-design-pattern-in-go-a-practical-guide-734b1ec7194e Curious — do you actually use Bridge in production code, or is it one of those patterns we all learn but rarely apply? <!-- SC_ON --> submitted by /u/priyankchheda15 (https://www.reddit.com/user/priyankchheda15)
[link] (https://medium.com/design-bootcamp/understanding-the-bridge-design-pattern-in-go-a-practical-guide-734b1ec7194e) [comments] (https://www.reddit.com/r/programming/comments/1oq0v0q/understanding_the_bridge_design_pattern_in_go_a/)
Making the Clang AST Leaner and Faster
https://www.reddit.com/r/programming/comments/1oq1qto/making_the_clang_ast_leaner_and_faster/
submitted by /u/mariuz (https://www.reddit.com/user/mariuz)
[link] (https://cppalliance.org/mizvekov,/clang/2025/10/20/Making-Clang-AST-Leaner-Faster.html) [comments] (https://www.reddit.com/r/programming/comments/1oq1qto/making_the_clang_ast_leaner_and_faster/)
https://www.reddit.com/r/programming/comments/1oq1qto/making_the_clang_ast_leaner_and_faster/
submitted by /u/mariuz (https://www.reddit.com/user/mariuz)
[link] (https://cppalliance.org/mizvekov,/clang/2025/10/20/Making-Clang-AST-Leaner-Faster.html) [comments] (https://www.reddit.com/r/programming/comments/1oq1qto/making_the_clang_ast_leaner_and_faster/)
Midi synth/sequencer for MenuetOS
https://www.reddit.com/r/programming/comments/1oq2bd3/midi_synthsequencer_for_menuetos/
submitted by /u/westernguy323 (https://www.reddit.com/user/westernguy323)
[link] (https://www.reddit.com/r/synthdiy/comments/1opxlwb/midi_synthsequencer_for_menuetos/) [comments] (https://www.reddit.com/r/programming/comments/1oq2bd3/midi_synthsequencer_for_menuetos/)
https://www.reddit.com/r/programming/comments/1oq2bd3/midi_synthsequencer_for_menuetos/
submitted by /u/westernguy323 (https://www.reddit.com/user/westernguy323)
[link] (https://www.reddit.com/r/synthdiy/comments/1opxlwb/midi_synthsequencer_for_menuetos/) [comments] (https://www.reddit.com/r/programming/comments/1oq2bd3/midi_synthsequencer_for_menuetos/)
Decoupling the Critical Path: The Asynchronous Logging Pattern
https://www.reddit.com/r/programming/comments/1oq30kf/decoupling_the_critical_path_the_asynchronous/
<!-- SC_OFF -->A Queue Separates Speed from Durability The core concept is decoupling. When a request thread generates a log message, it shouldn’t write it to disk; it should merely drop it into a non-blocking, fast in-memory queue. This queue acts as a buffer. A separate, dedicated, and less-critical worker thread is the only entity that ever reads from this queue and performs the slow, blocking disk I/O. The trade-off is minimal: a potential, tiny loss of the very latest logs if the application crashes (logs inside the in-memory queue), but the critical, customer-facing service remains lightning-fast and highly available. https://howtech.substack.com/p/decoupling-the-critical-path-the <!-- SC_ON --> submitted by /u/Extra_Ear_10 (https://www.reddit.com/user/Extra_Ear_10)
[link] (https://howtech.substack.com/p/decoupling-the-critical-path-the) [comments] (https://www.reddit.com/r/programming/comments/1oq30kf/decoupling_the_critical_path_the_asynchronous/)
https://www.reddit.com/r/programming/comments/1oq30kf/decoupling_the_critical_path_the_asynchronous/
<!-- SC_OFF -->A Queue Separates Speed from Durability The core concept is decoupling. When a request thread generates a log message, it shouldn’t write it to disk; it should merely drop it into a non-blocking, fast in-memory queue. This queue acts as a buffer. A separate, dedicated, and less-critical worker thread is the only entity that ever reads from this queue and performs the slow, blocking disk I/O. The trade-off is minimal: a potential, tiny loss of the very latest logs if the application crashes (logs inside the in-memory queue), but the critical, customer-facing service remains lightning-fast and highly available. https://howtech.substack.com/p/decoupling-the-critical-path-the <!-- SC_ON --> submitted by /u/Extra_Ear_10 (https://www.reddit.com/user/Extra_Ear_10)
[link] (https://howtech.substack.com/p/decoupling-the-critical-path-the) [comments] (https://www.reddit.com/r/programming/comments/1oq30kf/decoupling_the_critical_path_the_asynchronous/)