Reddit Programming – Telegram
Reddit Programming
212 subscribers
1.22K photos
125K links
I will send you newest post from subreddit /r/programming
Download Telegram
Mock data is always a pain… so I made a tool to automate it
https://www.reddit.com/r/programming/comments/1n0kt0b/mock_data_is_always_a_pain_so_i_made_a_tool_to/

<!-- SC_OFF -->Every project I start, I waste hours hand-crafting seed data or JSON mocks.
So I built Mockilo — a schema-aware mock data generator. You point it to your Prisma schema, run one command, and boom: realistic data with relations filled in.
I’m curious — how do you handle mock data in your projects today? Repo here if anyone wants to poke around: [github.com/mockilo/mocktail-cli](#) <!-- SC_ON --> submitted by /u/Latter_Mechanic1690 (https://www.reddit.com/user/Latter_Mechanic1690)
[link] (http://github.com/mockilo/mocktail-cli) [comments] (https://www.reddit.com/r/programming/comments/1n0kt0b/mock_data_is_always_a_pain_so_i_made_a_tool_to/)
Many hate on Object-Oriented Programming. But some junior programmers seem to mostly echo what they've heard experienced programmers say. In this blog post I try to give a "less extreme" perspective, and encourage people to think for themselves.
https://www.reddit.com/r/programming/comments/1n11tps/many_hate_on_objectoriented_programming_but_some/

submitted by /u/KarlZylinski (https://www.reddit.com/user/KarlZylinski)
[link] (https://zylinski.se/posts/know-why-you-dont-like-oop/) [comments] (https://www.reddit.com/r/programming/comments/1n11tps/many_hate_on_objectoriented_programming_but_some/)
New algorithm outperforms Dijkstra after 40 years!
https://www.reddit.com/r/programming/comments/1n13gpp/new_algorithm_outperforms_dijkstra_after_40_years/

<!-- SC_OFF -->EDIT: link to the article https://arxiv.org/abs/2504.17033 For 40+ years, the shortest-path problem (think Google Maps, routing, networks) was dominated by Dijkstra-style algorithms, always hitting the sorting bottleneck. A research team at Tsinghua University just published a breakthrough:
They built a new shortest-path algorithm that avoids sorting altogether, breaking a theoretical barrier thought impossible since the 1980s. Key ideas: - Work in layers instead of strict ordering
- Pick representative pivots (clusters) instead of sorting every node
- Use a few Bellman–Ford–style relaxations to propagate distances
- Runs in O(m log2/3 n) — faster than any sorting-based method It just won Best Paper @ STOC (one of the top CS theory conferences).
Link to article: 36Kr coverage (https://eu.36kr.com/en/p/3419098143837833) What do you think:
- Will this change how we teach algorithms? - Or is it more of a “theory-only” milestone for now? <!-- SC_ON --> submitted by /u/Ambitious-Page-5737 (https://www.reddit.com/user/Ambitious-Page-5737)
[link] (https://arxiv.org/abs/2307.04139) [comments] (https://www.reddit.com/r/programming/comments/1n13gpp/new_algorithm_outperforms_dijkstra_after_40_years/)
nx Build System Compromised in Supply Chain Attack
https://www.reddit.com/r/programming/comments/1n17fsz/nx_build_system_compromised_in_supply_chain_attack/

<!-- SC_OFF -->nx Build System compromised in supply chain attack. Targeting developers by exfiltrating credentials and system information. Report: https://github.com/nrwl/nx/issues/32522 <!-- SC_ON --> submitted by /u/N1ghtCod3r (https://www.reddit.com/user/N1ghtCod3r)
[link] (https://github.com/nrwl/nx/issues/32522) [comments] (https://www.reddit.com/r/programming/comments/1n17fsz/nx_build_system_compromised_in_supply_chain_attack/)