OpenVehicleDiag VS grenad

BTW I have a few automotive projects if you wish to check them out! https://github.com/rnd-ash/ecu\_diagnostics https://github.com/rnd-ash/openvehiclediag https://github.com/rnd-ash/canviewer-rs

Currently, there are no other tools other than my own that utilize this crate, but I hope that can soon change! * OpenVehicleDiag - A front-end for the ECU_Diagnostic crate, allowing for CAN manipulation and tracing, and KWP/OBD/UDS ECU diagnostics and custom payload sending

The tool I am using to reverse engineer the car is my beta version of OpenVehicleDiag (Source code available here https://github.com/rnd-ash/openvehiclediag/tree/egui_ecu_diag).

Author of OpenVehicleDiag here. I already kinda had something like this in mind, so set up this JSON Schema my application uses: https://github.com/rnd-ash/OpenVehicleDiag/blob/main/SCHEMA.md

Working on my vehicle/ECU diagnostics platform. https://github.com/rnd-ash/openvehiclediag/

Macchina-J2534: https://github.com/rnd-ash/Macchina-J2534 OpenVehicleDiag: https://github.com/rnd-ash/OpenVehicleDiag/

This is the next major milestone of OVD (https://github.com/rnd-ash/OpenVehicleDiag/), in which I have been able to write a binary file parser to extract ECU information from Daimler's CBF files in Rust. The parser can be found in the CBFParser directory of the main repository.

Source code: https://github.com/rnd-ash/OpenVehicleDiag/

I tried new inserting algorithms on the sorter to reduce the amount of time spent sorting but didn’t find anything better than that, would you have any idea? I gave up trying better inserting algorithms by declaring that doing one final in-memory sort was more effective that doing a lot of comparison to try inserting keys in the right order…

I have finalized the latest release of grenad which introduce a lookup struct called a Cursor. Grenad is a library that provides tools to sort, merge, write, and read immutable key-value pairs.

I worked on my grenad library: a library used to sort, merge, write, and read key-value pairs, used in MeiliSearch for the new indexing system. I added a lot of documentation to the crate and done a lot of improvement by reducing the amount of copied memory when merging key-value pairs.

I was wondering if you could maybe point me to any blog post regarding the segment merging? I am using my grenad library, which is a simplification of my MTBL Rust port. This is a key-value store with some useful sorter helping functions, using a merge function, some compression parameters... Works great but could maybe be improved.

I also wanted to develop an immutable key-value store with some interesting properties like compression and multi-database (like for LMDB), it is much easier to develop than LMDB, I just need to base this on something like my grenad lib plus a wrapper to support multi-databases.