Diggsey

45 ms·

421.
by Diggsey 7y ago
I can't speak to every issue which the author might have encountered, but there is a better solution to the lifetime management problem than the two mentioned in the article. Instead of this: fn some_wlroots_callback(output_handl
422.
by Diggsey 8y ago
An impulse is just a "want" over a shorter timescale. When someone says "I want to quite X, but can't", what they usually mean is that most of the time they want to quit, but for short periods of time they want X mo
423.
by Diggsey 8y ago
This seems to assume that all information needed to determine if two keys are equal is incorporated into the resulting hash value. It's premised on the idea that you can dynamically change the hash function such that eventually you w
424.
by Diggsey 8y ago
I definitely value ease of use and zero-setup solutions - the issue for me here is that the situations where I would consider running a service mesh are the same situations where predictability and reproducibility would trump ease of use -
425.
by Diggsey 8y ago
That sounds horrific for whoever is going to be supporting that system... The last thing I would want in a production environment is to have some 3rd party software monkey-patching the code at runtime. What happens when: - a bug only occurs
426.
by Diggsey 8y ago
Interesting, but surely snapshots are only needed for connections with active transactions? My understanding was that the difficulty here was Postgres's currently very simple forked-process-per-connection model. In order for idle conne
427.
by Diggsey 8y ago
Frustratingly "solutions" like pgBouncer and similar do not properly maintain session state in transaction pooling mode and so commonly used features like prepared statements cannot be used, which is a non-starter in many cases. M
428.
by Diggsey 8y ago
Slamming on the gas at 60mph probably will freak out everyone in the car, but not because of the balloon :) I'm assuming you meant slam on the brake, in which case the answer below is correct.
429.
by Diggsey 8y ago
I would say that is somewhat outside the jurisdiction of the VCS. Sure you can have post-commit or CI hooks that ensure your code always compiles, but it doesn't need deep support from the VCS to do that. However, the fact the pijul do
430.
by Diggsey 8y ago
You can simply incorporate both patches A and B, you don't need a separate "merge" step. If A and B have conflicts, then the resulting repo will have conflicts (but that's allowed in pijul) and you can resolve those conf
431.
by Diggsey 8y ago
Yep, but even reference counting doesn't really help: the basic building block of many lock free algorithms is the ability to read/write a reference to/from a shared location atomically. With a reference counted pointer, you
432.
by Diggsey 8y ago
The main reason it's required in the EU is because it's so easy to cross land borders without leaving a trace. In the UK, there's no need because it's an island, so passports can be more easily screened at the borders.
433.
by Diggsey 8y ago
What is a jet supposed to do against a drone? Best option would be to send up another drone and fly into it / follow it if it tries to escape. I'm sure the police or army must have their own drones for other purposes which would b
434.
by Diggsey 8y ago
I think it means specifically for compile-to-WASM languages. In that sense it's probably true, certainly the tooling is better than any I've seen elsewhere.
435.
by Diggsey 8y ago
No, Kafka is one of the few messages queues which supports ordering, so for a more advanced solution it could be the right choice, but we don't use anything more than postgres. We have workers "take locks" on the queues they
436.
by Diggsey 8y ago
The article doesn't mention anything about in-order delivery, which adds an extra bit of challenge because most message queues don't have any support for strict ordering. I implemented a simple solution for the company I work for,
437.
by Diggsey 8y ago
First person views typically only use two axes of rotation, so of course gimbal lock will not be a problem. You are not dealing with general 3D rotations. However, as soon as you want a 3D rotation (eg. in a flight sim) then you really need
438.
by Diggsey 8y ago
Nice timing :)
439.
by Diggsey 8y ago
A pixel shader cannot choose where to draw, it is simply given a pixel and asked what colour it should be. In order to reduce the overdraw to something manageable, you need to generate geometry (via the CPU, geometry shader or vertex shad
440.
by Diggsey 8y ago
Local hidden variable theories were disproved by violations of Bell's inequality, not by a thought experiment. https://en.wikipedia.org/wiki/Bell_test_experiments Are you saying that all of these experiments were
441.
by Diggsey 8y ago
Pretty sure local hidden variable theories were ruled out as an explanation of quantum mechanics a long time ago. What's new here?
442.
by Diggsey 8y ago
That's not quite true: the reference counts for `Rc` and `shared_ptr` are not stored adjacent to the pointer. In rust these types are guaranteed to be pointer-sized (when the target is Sized) or fat-pointer-sized otherwise. The refer
443.
by Diggsey 8y ago
No, you shouldn't use a code first, or a database first design. The article explains the problems with the code-first approach very well, but there are just as many problems with the database-first approach: - There is never just one
444.
by Diggsey 8y ago
And what is compression but borrowing from the past?
445.
by Diggsey 8y ago
Actors are generally a very powerful abstraction. To give a specific example: they can be used to mediate access to a resource without requiring complex synchronisation: instead of sharing a piece of mutable state (like a cache) and protect
446.
by Diggsey 8y ago
You could have an initial code segment which generates the dynamic mappings and then performs a system call. The system call would map in a new non-shared page which the kernel has dynamically generated from the supplied mappings. The user-
447.
by Diggsey 8y ago
Each component should generate a random seed on construction, and use that same seed for its entire lifetime.
448.
by Diggsey 8y ago
Yes, that's a reasonable solution and how ElasticSearch handles partitions. It still would "require an index scan per partition." though, which the OP wanted to avoid.
449.
by Diggsey 8y ago
That seems inherently impossible - either you need to include the date in the lookup, include the ID in the partition, or look at all the partitions.
450.
by Diggsey 9y ago
My guess would be that it's some aspect of measuring the text that is causing the crash: when you click in an editable text box, there is code to track down where the cursor should be placed. This is done by measuring various sub-str

More ›