slotmap
BLAKE3
Our great sponsors
slotmap | BLAKE3 | |
---|---|---|
14 | 36 | |
1,018 | 4,555 | |
- | 1.7% | |
3.4 | 8.1 | |
about 1 month ago | 11 days ago | |
Rust | Assembly | |
zlib License | GNU General Public License v3.0 or later |
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.
slotmap
-
Tree Borrows - A new aliasing model for Rust
It looks like .get_disjoint_mut() from slotmap failed under stacked borrows, but seems to pass under tree borrows
-
Indexing vs Smart Pointers
I think slotmap is meant to solve this exact issue. Basically when you insert into a collection you get an Id:Version tuple as key. When you reuse a slot, next time the key will be Id:Version+1 and when you try to access the removed value by using Id:Version, it will return None. You can think about it as delayed invalidation.
-
Hey Rustaceans! Got a question? Ask here (5/2023)!
Dunno about existing implementations, but it looks like it's a feature they'd accept: https://github.com/orlp/slotmap/issues/73
-
Unsafe is a bad practice?
It's actually quite easy.
- Rust is more portable than C for pngquant/libimagequant
-
Hey Rustaceans! Got an easy question? Ask here (50/2021)!
You can use either slot map or slab to side step rust borrow checker. Example https://github.com/orlp/slotmap/blob/master/examples/rand_meld_heap.rs
-
Rust data structures with circular references
I don't know, only have some theories.
1. The name isn't particularly catchy or descriptive. It is the correct name for the data structure, but not too many people know the data structure.
2. People don't even know what they're missing. It's not a very Google-able problem to begin with. Slotmap provides an interesting solution to (circular) ownership and safe allocator / weak pointer design problems, but people don't recognize that they're having them or that slotmap could help.
As an example of this, the doubly linked list example (https://github.com/orlp/slotmap/blob/master/examples/doubly_...) can safely remove nodes from the linked list given their handle, in O(1), even from the middle, completely safely and correctly, even in the presence of double deletions or ABA memory re-use. You can't replicate this with just pointers, without introducing heavy refcounting solutions.
-
Is it possible to write anything using 100% safe Rust?
Nope, it's perfectly safe: https://github.com/orlp/slotmap/blob/master/examples/doubly_linked_list.rs.
-
Syncing HashMap values amongst User
I think keeping the relationship between child and parent elements in the node graph might be better accommodating better via a psuedo-ECS system, see https://www.reddit.com/r/rust/comments/cnjhup/idiomatic_way_to_reference_parent_struct/. The https://github.com/orlp/slotmap crate looks promising. I think I'm just going to ditch the global shared HashMap in favor of something that can better accommodate child/parent relations.
-
Beginner question: does it become easier to write datastructures with complex ownership semantics?
I think the slotmap crate is similar to what you're trying to write: https://github.com/orlp/slotmap
BLAKE3
-
Reasons to Prefer Blake3 over Sha256
> might be easier with a public domain license instead of the current ones
There reference implementation is public domain (CC0) or at your choice Apache 2.0
-
Google abandons work to move Assistant smart speakers to Fuchsia
Fyi, blake3 was released in 2019 and should probably be used over blake2 unless you have some strong reason not to. It's basically a reimplementation of blake2 with performance tweaks.
-
Six times faster than C
Many people will argue that today's compilers are so smart/optimized that you'd be a fool to try to outsmart the compiler with asm. I'm not 1 of them, but I know some. IMO it's all a bunch of bullshit, there's a goddamn reason all the cryptocurrency mining CPU/GPU code is all hand-written asm. there's a reason blake3 is written in asm ( https://github.com/BLAKE3-team/BLAKE3/blob/master/c/blake3_sse41_x86-64_windows_msvc.asm ) - but the thing is, 99.99% of the time, life is too short to outsmart the compiler (unless you're Alexander Yee)
-
[QUESTION] Low speeds when creating blake3 checksum?
I have been trying to optimize my code to create a fast hashing function to create and check b3 file integrity but b3sum is way way faster than my aproach, i have been trying to modify my code acordingly to https://github.com/BLAKE3-team/BLAKE3/blob/master/b3sum/src/main.rs with no luck, so if anyone can give me some tips/clues on how to achieve better speeds it would be incredible. Thx!!
-
A good hash function for DEFLATE?
BLAKE3 might be faster than KangarooTwelve and is also an XOF. It doesn't have the benefit of getting a working RFC draft proposal however.
-
PoxHash, a bespoke denovo hashing algorithm implemented dep-free in Rust and 5 other languages. Rust compiled with rustc with -O is faster than GCC-compiled C with -O3!
You're saying the hash speed is 133 kB/s? That's extremely slow, for example BLAKE3 achieves 6.8 GB/s which is over 50000 times faster. Nobody wants to use such a slow hash function.
-
What's everyone working on this week (4/2023)?
Try this one if you want a smaller, and particularly interesting crate: https://github.com/BLAKE3-team/BLAKE3
-
New Ryzens and Chia plotters
blake3 is a cryptographic hashing function, which is used during plotting's "forward propagation" step
-
Image displays its own MD5 hash
BLAKE3 claims to be faster and more secure than both MD5 and SHA1.
-
Good hasher for 256-byte keys?
More information: https://github.com/BLAKE3-team/BLAKE3
What are some alternatives?
rust-typed-arena - The arena, a fast but limited type of allocator
xxHash - Extremely fast non-cryptographic hash algorithm
slab - Slab allocator for Rust
Hashids.java - Hashids algorithm v1.0.0 implementation in Java
multi_mut - Methods on HashMap and BTreeMap for safely getting multiple mutable references to the contained values.
highwayhash - Fast strong hash functions: SipHash/HighwayHash
rust - Rust for the xtensa architecture. Built in targets for the ESP32 and ESP8266
libsodium - A modern, portable, easy to use crypto library.
stdx - The missing batteries of Rust
STM32-Bootloader - STM32 bootloader example that can jump to 2 apps.
nomicon - The Dark Arts of Advanced and Unsafe Rust Programming
meow_hash - Official version of the Meow hash, an extremely fast level 1 hash