gameroy
hashbrown
gameroy | hashbrown | |
---|---|---|
6 | 22 | |
257 | 2,270 | |
- | 1.4% | |
8.5 | 8.2 | |
2 months ago | 1 day ago | |
Rust | Rust | |
Apache License 2.0 | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
gameroy
-
When Zig Outshines Rust – Memory Efficient Enum Arrays
I recently found https://github.com/Rodrigodd/gameroy to be a very complete implementation
-
Gameboy Doctor: debug and fix your gameboy emulator
Hey there! I've been working on a Game Boy emulator since last year and found the GameRoy project, which translated the PPU's logic from SameBoy, the (AFAIK) most accurate GB emulator around. I basically copied the PPU logic into my emulator and replaced the "state" property (an integer) with enums for some extra clarity.
https://github.com/nicolas-siplis/feboy
https://github.com/rodrigodd/gameroy
https://github.com/LIJI32/SameBoy/
- GameRoy: a cross platform and highly accurate Game Boy emulator
- Gameroy: A gameboy emulator, dissasembler and debugger written in rust
-
GameRoy: a highly accurate Game Boy emulator and debugger written in Rust
What I did was isolate the logic of every component apart from the CPU (video, sound, timer, etc.) behind a correspondent fn update(cycle_count: u64) method (like in the sound controller or in the timer). Currently, I am calling these methods every 4 cycles, but the idea is that I would only need to call it before a read or write to a component register, or before a possible interrupt (I would need to figure out if it is possible to efficiently predict the next interrupt).
hashbrown
-
OpenD, a D language fork that is open to your contributions
That's because you're looking at a wrapper around the actual implementation (which lives in an external package). Notice "use hashbrown::hash_map as base;" at the top.
There's far more unsafe there: https://github.com/rust-lang/hashbrown/blob/f2e62124cd947b5e...
-
I just published my first crate: `identified_vec` - I would love some input! PR's are most welcome.
You might want to check out how popular ecosystem crates do some of these things. Particularly relevant to you are probably crates providing collections, such as smallvec, hashbrown, or indexmap.
-
GDlog: A GPU-Accelerated Deductive Engine
https://github.com/topics/swisstable
rust-lang/hashbrown: https://github.com/rust-lang/hashbrown
CuPy has array but not yet hashmaps, or (GPU) SIMD FWICS?
NumPy does SIMD:
-
When Zig Outshines Rust – Memory Efficient Enum Arrays
Thanks, great point indeed. I am looking into this https://github.com/rust-lang/hashbrown
The way I think about it -- rather naively, I suppose -- is that I care more about the references cells make to each other than the actual grid of cells displayed on a table. The latter feels more like a "view" of the data than an actual data structure?
This also seems to align with the relative priority of (sorted from highest to lowest): figuring out the order of evaluation, calculating those evaluations, and finally displaying the results of the evaluation
-
This Week in Rust # 500!!
updated std's hashbrown dependency to 0.14 which contains some optimizations
-
Crust of Rust: std::collections [video]
The std hashmap is actually very fast and uses state of the art hashmap design, namely because it's implemented by hashbrown
-
Deduplicating a Slice in Go
I believe Rust uses hashbrown as the underlying implementation now. This just calculates the number of buckets based on the number of items requested:
https://github.com/rust-lang/hashbrown/blob/009969a860290849...
Is it really the case that rehashing can guarantee that the number of buckets allocated will be sufficient for any given set of keys? In principle you could fail to rehash in a way that reduces collisions after k attempted rehashings.
-
Blog Post: Rust Is a Scalable Language
For example, since the hashbrown crate is marked with #![no_std], it can be used as a dependency for the standard library.
-
Hey Rustaceans! Got a question? Ask here (6/2023)!
To implement something that cannot be expressed in safe Rust, or at least cannot be expressed succinctly in safe Rust, like fundamental datastructures. The hashbrown crate contains a lot of unsafe code, but it's such high quality that it's now the backing implementation for std::collections::HashMap.
- Data-driven performance optimization with Rust and Miri
What are some alternatives?
IronBoy - A Gameboy emulator written in Rust as both a learning exercise and a love letter to the console that got me into gaming.
dashmap - Blazing fast concurrent HashMap for Rust.
exotracker-cpp
meow_hash - Official version of the Meow hash, an extremely fast level 1 hash
SameBoy - Game Boy and Game Boy Color emulator written in C
flamegraph - Easy flamegraphs for Rust projects and everything else, without Perl or pipes <3
sprite-render-rs - A Rust Crate for Sprite Rendering (WIP)
bumpalo - A fast bump allocation arena for Rust
raw-gl-context - cross-platform OpenGL context creation
moonfire-nvr - Moonfire NVR, a security camera network video recorder
Dn-FamiTracker - modifications and improvements for 0CC-FamiTracker (based on j0CC-FamiTracker 0.6.3)
aoc - 🎄 My solutions and walkthroughs for Advent of Code and more related stuff.