jumprope-rs
crop
Our great sponsors
jumprope-rs | crop | |
---|---|---|
8 | 3 | |
129 | 233 | |
- | 3.9% | |
4.0 | 6.5 | |
11 months ago | 27 days ago | |
Rust | Rust | |
GNU General Public License v3.0 or later | 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.
jumprope-rs
-
Text Showdown: Gap Buffers vs. Ropes
Thanks for all the work in bootstrapping this part of the ecosystem! I opened an issue[1] on the memory issue for jumprope. It seems to really come down to the large size of skiplist nodes relative to the text.
I did some testing with JumpRopeBuf, but ultimately did not include it because I was comparing things from an "interactive editor" perspective where edits are applied immediately instead of a collaborative/CRDT use case where edits are async. But it did perform very well as you said! I feel like JumpRopeBuf feels similar to a piece table, where edits are stored separately and then joined reading.
[1] https://github.com/josephg/jumprope-rs/issues/5
-
How to Survive Your Project's First 100k Lines
Every piece of a large program should be tested like this. And if you can, test your whole program like this too. (Doable for most libraries, databases, compilers, etc. This is much harder for graphics engines or UI code.)
I've been doing this for years and I can't remember a single time I set something like this up and didn't find bugs. I'm constantly humbled by how effective fuzzy bois are.
This sounds complex, but code like this will usually be much smaller and easier to maintain than a thorough unit testing suite.
Here's an example from a rope (complex string) library I maintain. The library lets you insert or delete characters in a string at arbitrary locations. The randomizer loop is here[1]. I make Rope and a String, then in a loop make random changes and then call check() to make sure the contents match. And I check and all the expected internal invariants in the rope data structure hold:
[1] https://github.com/josephg/jumprope-rs/blob/ae2a3f3c2bc7fc1f...
When I first ran this test, it found a handful of bugs in my code. I also ran this same code on a few rust rope libraries in cargo, and about half of them fail this test.
-
Announcing crop, the fastest UTF-8 text rope for Rust
Jumprope author here. Thanks for the quick test! I just updated the benchmarks in jumprope/rope_benches to include Crop, and it looks to me like jumprope is about 2x faster than crop:
-
Google's OSS-Fuzz expands fuzz-reward program to $30000
Iād go further and say that writing most software without fuzz testing is insane. Fuzz testing is one of those things they should teach in school. Theyāre a super useful technique - up there with TDD and itās a tragedy they arenāt more wildly used.
Fuzzers are so good because they find so many bugs relative to programmer effort (lines of code). Theyāre some of the most efficient testing you can do. If I had to choose between a full test suite and a fuzzer, Iād choose the fuzzer.
I use fuzzers whenever I have a self contained āmachineā in my code which should have well defined behaviour. For example, a b-tree. I write little custom fuzzers each time. The fuzzing code randomly mutates the data structure and keeps a list of the expected btree content. Then periodically I verify that the list and the btree agree on what should be contained inside the list. In the project Iām working on at the moment, I have about 6 different fuzzers sprinkled throughout my testing code. (Btree fuzzer, rope fuzzer, file serialisation fuzzer, a few crdt fuzzers, and so on).
Writing fuzzers is quite devastating for the ego. Usually the first time I point a fuzzer at my code, even when my code has a lot of tests, the fuzzer throws an assertion failure instantly. āIteration 2 ā¦ the state doesnāt match what was expectedā.
Getting a fuzzer running all night without finding any bugs is a balm for the soul.
The code looks like this, if anyone is curious. Hereās a fuzzer for a rope (fancy string) implementation: https://github.com/josephg/jumprope-rs/blob/master/tests/tes...
-
The case against an alternative to C
Yep. A few years ago I implemented a skip list based rope library in C[1], and after learning rust I eventually ported it over[2].
The rust implementation was much less code than the C version. It generated a bigger assembly but it ran 20% faster or so. (I don't know why it ran faster than the C version - this was before the noalias analysis was turned on in the compiler).
Its now about 3x faster than C, thanks to some use of clever layered data structures. I could implement those optimizations in C, but I find rust easier to work with.
C has advantages, but performance is a bad reason to choose C over rust. In my experience, the runtime bounds checks it adds are remarkably cheap from a performance perspective. And its more than offset by the extra optimizations the rust compiler can do thanks to the extra knowledge the compiler has about your program. If my experience is anything to go by, naively porting C programs to rust would result in faster code a lot of the time.
And I find it easier to optimize rust code compared to C code, thanks to generics and the (excellent) crates ecosystem. If I was optimizing for runtime speed, I'd pick rust over C every time.
[1] https://github.com/josephg/librope
[2] https://github.com/josephg/jumprope-rs
-
Linked lists and Rust
Linked lists are also the basis for skip lists - which are awesome. One of the only data structures I know of which needs a random number generator to work correctly. I have a rope implementation that I tidied up over the last few days which uses a skip list. Its several times faster than the next fastest library I know of (ropey). They're both O(log n), but for some reason jumprope (with skip lists) still ended up several times faster than ropey's b-trees.
crop
-
What's is a rusty way to implement sharable trees?
This is pretty much how copy-on-write ropes work. Check out xi-rope, Ropey or crop, they're all built using B-trees and implement the behavior you described.
-
Announcing crop, the fastest UTF-8 text rope for Rust
It already has that
What are some alternatives?
librope - UTF-8 rope library for C
cloudplow - Automatic rclone remote uploader, with support for multiple remote/folder pairings. UnionFS Cleaner functionality: Deletion of UnionFS whiteout files and their corresponding files on rclone remotes. Automatic remote syncer: Sync between different remotes via a Scaleway server instance, that is created and destroyed at every sync.
Odin - Odin Programming Language
aria2-ariang-docker - š³ Aria2 downloader and AriaNg webui Docker image based on Alpine Linux
EmeraldC - The Ultimate C Preprocessor
Cloudbox - Ansible-based solution for rapidly deploying a Docker containerized cloud media server.
WebKit - Home of the WebKit project, the browser engine used by Safari, Mail, App Store and many other applications on macOS, iOS and Linux.
SponsorBlock - Skip YouTube video sponsors (browser extension)
buffet - All-inclusive Buffer for C
gluetun - VPN client in a thin Docker container for multiple VPN providers, written in Go, and using OpenVPN or Wireguard, DNS over TLS, with a few proxy servers built-in.
fast-check - Property based testing framework for JavaScript (like QuickCheck) written in TypeScript
ropey - A utf8 text rope for manipulating and editing large texts.