teh_cmc

6 ms·

1.
by teh_cmc 3y ago
Revy already works with snapshot deltas (see other comments scattered around this section for more details, but basically we only sync components that changed during the previous frame -- Rerun stitches everything back together at runtime).
2.
by teh_cmc 3y ago
Thanks!
3.
by teh_cmc 3y ago
Oh for sure, there's a lot of overlap between traditional relational databases and ECS designs. As always, in the end the hard part is to match the performance requirements. If you squint enough, most ECS out there are pretty much very
4.
by teh_cmc 3y ago
Whether the physics engine is deterministic or not doesn't matter here -- Revy (and more importantly, Rerun) doesn't replay anything: it just stores state, every single frame, and then visualizes that state at every timestamp avai
5.
by teh_cmc 3y ago
Revy is frame-based: it runs as the last system at the end of the frame, with exclusive access to the `World`, and synchronizes the state of the Bevy database with the state of the Rerun database at that point in time (it keeps track of 3 t
6.
by teh_cmc 3y ago
As mentioned in the README, Revy is not meant to be a polished / properly maintained project -- it's just a proof-of-concept. I've talked more about how and why it came to exist in the first place in this thread [1], if you&#
7.
by teh_cmc 3y ago
Author here; we had some fun building this last week. Feel free to ask me anything!
8.
Revy – proof-of-concept time-travel debugger for the Bevy game engine(github.com)
135 points by teh_cmc 3y ago|36 comments
9.
Demystifying Asynchronous Rust(github.com)
1 points by teh_cmc 7y ago|0 comments
10.
Go-internals: Chapter 2, “Interfaces” released(github.com)
252 points by teh_cmc 8y ago|12 comments
11.
“Go Internals” first chapter, a “A Primer on Go Assembly”, released(github.com)
2 points by teh_cmc 9y ago|0 comments
12.
A quick look at some of Go's subtleties regarding interfaces(github.com)
3 points by teh_cmc 10y ago|0 comments
13.
Show HN: Seq – a gentle overview of distributed sequential IDs, gRPC and Contexts(github.com)
3 points by teh_cmc 10y ago|0 comments
14.
by teh_cmc 11y ago
Yes, these benchmarks use forced GC calls (i.e. all phases are STW) because it's the only (good) way I can think of to make theses tests deterministic (maybe you know of a better way? I'd definitely be interested). Of course, I do
15.
by teh_cmc 11y ago
You're certainly right that it's a possible and viable alternative. The reason I didn't go that way is quite simple: I always try and do my best to avoid external dependencies. One of the reason I really love Go is its ease o
16.
by teh_cmc 11y ago
Yes, as I said in this comment [1]; my real issue here is lengthy GC pauses, which cause peaks in response times. Regarding overall performances, I'm not really convinced that the reflect calls affect them that much (there's 2 ref
17.
by teh_cmc 11y ago
I couldn't have said it better. This is almost word for word why I decided to build mmm: I maintain a few high-load RPC services in Go, each of which stores millions, if not tens of millions of items in their cache. In this configurati
18.
Show HN: Mmm – manual memory management for Go(github.com)
72 points by teh_cmc 11y ago|29 comments
19.
[ANN] GAS: tiny, tested, thread-safe library for auto-reconnecting TCP sockets(github.com)
1 points by teh_cmc 11y ago|0 comments
20.
Postmortem: Blizzard's Diablo II (2000)(gamasutra.com)
3 points by teh_cmc 12y ago|0 comments