Oh man! I hate CF! The scummy gatekeepers.
Oh man! I hate CF! The scummy gatekeepers.
This is clearly intended as an alternative to submodules.
An alternative, not a replacement. Vdm is specifically designed to track code dependencies. There are use cases like monorepos where vdm won’t work.
Neither does Git though. I’m not really sure I follow your point.
Git does track submodule history unlike vdm.
By default, vdm sync also removes the local .git directories for each git remote, so as to not upset your local Git tree.
Git submodules don’t delete those .git directories. It uses them.
If you want to change the version/revision of a remote, just update your spec file and run vdm sync again.
This is not how git submodules or subtrees work.
vdm does depends on git being installed if you specify any git remote types
Support more than just git and file types, and make file better
Git submodules and subtrees don’t support anything other than git remotes.
Yes. I saw that. I was giving you my assessment based on the rest of the technical details in that readme. It doesn’t look like vdm is dealing with any part of the dependency repos (.git directories) other than to download them. In fact, they even mention deleting those .git directories. Please let me know if you think I misinterpreted any of those details.
That makes me wonder! All these new GPU uses are enormous energy hogs. Is gaming like that too?
Arch guide expanded in scope IMO. The choices are way more than in the past. However, it’s good quality and easy to read. I implore you to skim it, even if you don’t try it out.
While I understand your point, there’s a mistake that I see far too often in the industry. Using Relational DBs where the data model is better suited to other sorts of DBs. For example, JSON documents are better stored in document DBs like mongo. I realize that your use case doesn’t involve querying json - in which it can be simply stored as text. Similar mistakes are made for time series data, key-value data and directory type data.
I’m not particularly angry at such (ab)uses of RDB. But you’ll probably get better results with NoSQL DBs. Even in cases that involve multiple data models, you could combine multiple DB software to achieve the best results. Or even better, there are adaptors for RDBMS that make it behave like different types at the same time. For example, ferretdb makes it behave like mongodb, postgis for geographic db, etc.
Nvidia is a mess on Linux in general, though it’s gradually improving. They decided to neglect everything that the other GPU manufacturers and the community were doing and roll out their own buggy concepts.
This really isn’t the fault of Mint. PopOS works with it just because its developers System76 also has a line of nvidia based hardware. However, as I said before, nvidia is slowly starting to implement the standards and situation on other distros like Mint will gradually improve.
Meanwhile, I’m curious. What hardware did you try Mint on?
It didn’t look like a submodule reimplementation to me. Subtree is more of a submodule reimplementation. This is more like a language-agnostic package manager (like cargo, npm, etc) that downloads and caches source packages.
I wonder what happened to Tails - the one that started it all.
I do recommend Gentoo (haven’t tried Funtoo) for the academically inclined. It’s a beast to maintain, but you’ll soon find yourself at ease with configuring and compiling your own kernel, configuring your packages and even making some yourself.
It isn’t as hard as people make it out to be - if you gradually push your boundaries. In particular, it’s good if you already use Arch.
Nobody ever learned from the solarwinds attack. If a massive amount of your infrastructure is backed by some obscure software, bad actors will either try to insert a backdoor or find a zero-day exploit. If people are going to neglect what just happened, crowdstrike will fall heals up, faster than solarwinds did.
I don’t think that rust would have prevented this one, since this isn’t a compile time error (for the code loader).The address dereferencing would have been inside an unsafe block. What was missing was a validity check of the CI build artifacts and payload check on the client side.
I do however, think that the ‘fingers-crossed’ approach to memory safety in C and C++ must stop. Rust is a great fit for this use case.
I wish there was something more interesting to do there.
You are not expected to remember a v6 address - or even v4 for that matter. They are designed for machines. DNS is designed for humans.
What do you do on the yggdrasil network?
Python decided to use a single convention (semantic whitespace) instead of two separate ones for machine decodeable scoping and manual/visual scoping. That’s part of Python’s design principle. The program should behave exactly like what people expect it to (without strenuous reasoning exercises).
But some people treat it as the original sin. Not surprised though. I’ve seen developers and engineers nurture weird irrational hatred towards all sorts of conventions. It’s like a phobia.
Similar views about yaml. It may not be the most elegant - it had to be the superset of JSON, after all. But Yaml is a semi-configuration language while JSON is a pure serialization language. Try writing a kubernetes manifest or a compose file in pure JSON without whitespace alignment or comments (which pure JSON doesn’t support anyway). Let’s see how pleasant you find it.
I think assembly was easier back then. Some architectures still are. But many architectures like x86 got incredibly complicated.
I looked at the post again and they do talk about recursion for looping (my other reply talks about map over an iterator). Languages that use recursion for looping (like scheme) use an optimization trick called ‘Tail Call Optimization’ (TCO). The idea is that if the last operation in a function is a recursive call (call to itself), you can skip all the complexities of a regular function call - like pushing variables to the stack and creating a new stack frame. This way, recursion becomes as performant as iteration and avoids problems like stack overflow.
They aren’t talking about using recursion instead of loops. They are talking about the map method for iterators. For each element yielded by the iterator, map applies a specified function/closure and collects the results in a new iterator (usually a list). This is a functional programming pattern that’s common in many languages including Python and Rust.
This pattern has no risk of stack overflow since each invocation of the function is completed before the next invocation. The construct does expand to some sort of loop during execution. The only possible overhead is a single function call within the loop (whereas you could have written it as the loop body). However, that won’t be a problem if the compiler can inline the function.
The fact that this is functional programming creates additional avenues to optimize the program. For example, a chain of maps (or other iterator adaptors) can be intelligently combined into a single loop. In practice, this pattern is as fast as hand written loops.
Solid state physics.