rust-bindgen
CC
Our great sponsors
rust-bindgen | CC | |
---|---|---|
50 | 21 | |
4,070 | 100 | |
2.6% | - | |
8.9 | 5.1 | |
9 days ago | 12 days ago | |
Rust | C | |
BSD 3-clause "New" or "Revised" License | MIT License |
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.
rust-bindgen
- Rust Bindgen
-
ffizz: Build a Beautiful C API in Rust
Rust supports two kinds of FFI: calling into Rust from another language; and calling into another language from Rust. Most of the thought and tooling that exists right now is organized around the second kind. For example, bindgen is a popular tool that generates useful Rust wrappers from a C or C++ header file.
-
Best practices in creating a Rust API for a C++ library? Seeking advice from those who've done it before.
I have looked into bindgen, but found that it would not be feasible due to OMPL not having a C API, just C++.
-
the graphics driver doesn't work on gentoo.
Yes! Are you running LLVM version 16.0.0 or newer, by any chance? I believe this is an issue with some builds of bindgen with newer versions of LLVM. See https://github.com/rust-lang/rust-bindgen/issues/2488
-
Any sort of plugin engine with dynamic load ability and any limitations?
On native, you have to define a C API, probably using a header file. Even if both sides are implemented in Rust, they have to speak that C API (documentation).
-
How can I use rust libraries in C++
Bindgen has some functionality for direct talk to C++ https://github.com/rust-lang/rust-bindgen
-
Issue resolving dependencies when linking C libraries
I am trying to use rust-bindgen (https://github.com/rust-lang/rust-bindgen) to link a static C library (say `libexample.a`) which is compiled in a separate project with CMake. The `libexample.a` depends on other libraries (for example `libcurl.a`) installed on the system.
-
I implemented a NASA image compression algorithm
It looks like the guy you're replying too was kind of an ass, but I do want to point out for anyone else reading that that's not actually that much of a technical limitation: rust code can natively call C code. The main thing you need is a translation of the C library's header file so rustc knows what C functions and structs exist, and that can be automatically generated with bindgen.
-
Hey Rustaceans! Got a question? Ask here (5/2023)!
It's quite the different approach, but you could consider using bindgen instead.
-
Control hardware using c# or c++ API (dll)
Use bindgen or CXX to create Rust bindings for the C or C++ libraries.
CC
-
preprocessor stuff - compile time pasting into other files
With extendible macros, you could achieve the following:
-
Factor is faster than Zig
In my example the table stores the hash codes themselves instead of the keys (because the hash function is invertible)
Oh, I see, right. If determining the home bucket is trivial, then the back-shifting method is great. The issue is just that it’s not as much of a general-purpose solution as it may initially seem.
“With a different algorithm (Robin Hood or bidirectional linear probing), the load factor can be kept well over 90% with good performance, as the benchmarks in the same repo demonstrate.”
I’ve seen the 90% claim made several times in literature on Robin Hood hash tables. In my experience, the claim is a bit exaggerated, although I suppose it depends on what our idea of “good performance” is. See these benchmarks, which again go up to a maximum load factor of 0.95 (Although boost and Absl forcibly grow/rehash at 0.85-0.9):
https://strong-starlight-4ea0ed.netlify.app/
Tsl, Martinus, and CC are all Robin Hood tables (https://github.com/Tessil/robin-map, https://github.com/martinus/robin-hood-hashing, and https://github.com/JacksonAllan/CC, respectively). Absl and Boost are the well-known SIMD-based hash tables. Khash (https://github.com/attractivechaos/klib/blob/master/khash.h) is, I think, an ordinary open-addressing table using quadratic probing. Fastmap is a new, yet-to-be-published design that is fundamentally similar to bytell (https://www.youtube.com/watch?v=M2fKMP47slQ) but also incorporates some aspects of the aforementioned SIMD maps (it caches a 4-bit fragment of the hash code to avoid most key comparisons).
As you can see, all the Robin Hood maps spike upwards dramatically as the load factor gets high, becoming as much as 5-6 times slower at 0.95 vs 0.5 in one of the benchmarks (uint64_t key, 256-bit struct value: Total time to erase 1000 existing elements with N elements in map). Only the SIMD maps (with Boost being the better performer) and Fastmap appear mostly immune to load factor in all benchmarks, although the SIMD maps do - I believe - use tombstones for deletion.
I’ve only read briefly about bi-directional linear probing – never experimented with it.
-
If this isn't the perfect data structure, why?
From your other comments, it seems like your knowledge of hash tables might be limited to closed-addressing/separate-chaining hash tables. The current frontrunners in high-performance, memory-efficient hash table design all use some form of open addressing, largely to avoid pointer chasing and limit cache misses. In this regard, you want to check our SSE-powered hash tables (such as Abseil, Boost, and Folly/F14), Robin Hood hash tables (such as Martinus and Tessil), or Skarupke (I've recently had a lot of success with a similar design that I will publish here soon and is destined to replace my own Robin Hood hash tables). Also check out existing research/benchmarks here and here. But we a little bit wary of any benchmarks you look at or perform because there are a lot of factors that influence the result (e.g. benchmarking hash tables at a maximum load factor of 0.5 will produce wildly different result to benchmarking them at a load factor of 0.95, just as benchmarking them with integer keys-value pairs will produce different results to benchmarking them with 256-byte key-value pairs). And you need to familiarize yourself with open addressing and different probing strategies (e.g. linear, quadratic) first.
- Convenient Containers: A usability-oriented generic container library
-
[Noob Question] How do C programmers get around not having hash maps?
CC (Full disclosure: I authored this one)
-
New C features in GCC 13
If you're using C23 or have typeof (so GCC or Clang), then yet another approach is to define a type that aliases the specified type if it is unique or otherwise becomes a "dummy" type. Here's what that looks like in CC:
-
Convenient Containers v1.0.3: Better compile speed, faster maps and sets
I’d like to share version 1.0.3 of Convenient Containers (CC), my generic container library. The library was previously discussed here and here. As explained elsewhere,
-
Popular Data Structure Libraries in C ?
Convenient Containers (CC) - I'm the author of this one.
-
So what's the best data structures and algorithms library for C?
"Using macros" is a broad description that covers multiple paradigms. There are libraries that use macros in combination with typed pointers and functions that take void* parameters to provide some degree of API genericity and type safety at the same time (e.g. stb_ds and, as you mentioned, my own CC). There are libraries that use macros (or #include directives) to manually instantiate templates (e.g. STC, M*LIB, and Pottery). And then there are libraries that are implemented entirely or almost entirely as macros (e.g. uthash).
-
How do you deal with the extra verbosity of C?
Shameless plug: Take a look a my library Convenient Containers, which solves this exact problem within the (narrow) domain of data structures.
What are some alternatives?
Introducing .NET Multi-platform App UI (MAUI) - .NET MAUI is the .NET Multi-platform App UI, a framework for building native device applications spanning mobile, tablet, and desktop.
mlib - Library of generic and type safe containers in pure C language (C99 or C11) for a wide collection of container (comparable to the C++ STL).
cxx - Safe interop between Rust and C++
stent - Completely avoid dangling pointers in C.
autocxx - Tool for safe ergonomic Rust/C++ interop driven from existing C++ headers
SDS - Simple Dynamic Strings library for C
JNA - Java Native Access
Generic-Data-Structures - A set of Data Structures for the C programming language
vulkano - Safe and rich Rust wrapper around the Vulkan API
stb - stb single-file public domain libraries for C/C++
cc - Command line crypto currency value converter.
Klib - A standalone and lightweight C library