oot VS rust

https://github.com/zeldaret/oot 100% Ocarina of Time is fully decomped, surprised we haven't seen any developments on Mario here. Also liboot is possible.

Here's the page from the Zelda "Reverse Engineer" GitHub wiki: https://github.com/zeldaret/oot/wiki/Getting-Started

well it is possible to crack a game without the source. in fact, it's possible to decompile source from the binary itself. This has been done with Mario64 and ocarina of time.

That being said, there is a lot of documentation out there on Ocarina of Time specifically. There's even a work-in-progress decompilation. You're going to have to learn a lot to get to the level where you can do the stuff you're wanting to do, but that's part of why you have to try to start smaller. You can even work on Ocarina of Time still, but start by picking a concrete goal and trying to hack it into the game. Build a tool from scratch that replaces text in the game, for example.

Mario 64 and Ocarina of Time were only just decompiled within the last couple of years. Jak and Daxter 1 was decompiled a few months ago. GTA 3 and Vice City have nearly finished decompilations, but TakeTwo took legal action against the developers before they put the finishing touches.

That said, I did my research before talking about source ports made from restoring the (nearly) original code using the compiled data and symbols). That's how SM64 and OoT (as well as other Zeldas in progress) were/are decompiled.

I've watched the video and I'm still convinced it provides false information. What is my source? The official OoT decompilation project: https://github.com/zeldaret/oot

Almost fixed the compiler: https://github.com/rust-lang/rust/pull/123325

Rust: A secure, efficient, and modern programming language (omitting ten thousand words). You can simply follow the installation instructions provided on the official website.

Recently did something similar in Rust but for generating SVGs. We've adopted it for snapshot testing of cargo and rustc's output. Don't have a good PR handy for showing Github's rendering of changes in the SVG (text, side-by-side, swiping) but https://github.com/rust-lang/rust/pull/121877/files has newly added SVGs.

To see what is supported, see the screenshot in the docs: https://docs.rs/anstyle-svg/latest/anstyle_svg/

We strongly believe in Rust as a powerful language for building production-grade software, especially for systems like ours that run alongside Kubernetes.

The above Assert<{N % 2 == 1}> requires #![feature(generic_const_exprs)] and the nightly toolchain. See https://github.com/rust-lang/rust/issues/76560 for more info.

Another week, another dive into Rust. This time, we're delving into structs. Structs bear resemblance to interfaces in TypeScript, enabling the grouping of intricate data sets within an object, much like TypeScript/JavaScript. Rust also accommodates functions within these structs, offering a semblance of classes, albeit with distinctions. Let's delve into this topic.

There’s also other reasons. For example, take binary search:

* prefetch + cmov. These should be part of the STL but languages and compilers struggle to emit the cmov properly (Rust’s been broken for 6 years: https://github.com/rust-lang/rust/issues/53823). Prefetch is an interesting one because while you do optimize the binary search in a micro benchmark, you’re potentially putting extra pressure on the cache with “garbage” data which means it’s a greedy optimization that might hurt surrounding code. Probably should have separate implementations as binary search isn’t necessarily always in the hot path.

* Eytzinger layout has additional limitations that are often not discussed when pointing out “hey this is faster”. Adding elements is non-trivial since you first have to add + sort (as you would for binary search) and then rebuild a new parallel eytzinger layout from scratch (i.e. you’d have it be an index of pointers rather than the values themselves which adds memory overhead + indirection for the comparisons). You can’t find the “insertion” position for non-existent elements which means it can’t be used for std::lower_bound (i.e. if the element doesn’t exist, you just get None back instead of Err(position where it can be slotted in to maintain order).

Basically, optimizations can sometimes rely on changing the problem domain so that you can trade off features of the algorithm against the runtime. These kinds of algorithms can be a bad fit for a standard library which aims to be a toolbox of “good enough” algorithms and data structures for problems that appear very very frequently. Or they could be part of the standard library toolkit just under a different name but you also have to balance that against maintenance concerns.