bstr
rust-semverver
bstr | rust-semverver | |
---|---|---|
10 | 8 | |
744 | 641 | |
- | - | |
6.7 | 1.7 | |
2 months ago | 10 months ago | |
Rust | Rust | |
GNU General Public License v3.0 or later | BSD 3-clause "New" or "Revised" 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.
bstr
-
We're building a browser when it's supposed to be impossible
Libraries for a lot of this stuff exist (albeit in many cases not very mature yet):
- https://github.com/pop-os/cosmic-text does text layout (which Taffy explicitly considers out of scope)
- https://github.com/AccessKit/accesskit does accessibility
- https://github.com/servo/rust-cssparser does value-agnostic CSS parsing (it will parse the general syntax but leaves value parsing up to the user, meaning you can easily add support for whatever properties you what). Libraries like https://github.com/parcel-bundler/lightningcss implement parsing for the standard css properties.
- There are crates like https://github.com/BurntSushi/bstr and https://docs.rs/wtf8/latest/wtf8/ for working with non-unicode text
We are planning to add a C API to Taffy, but tbh I feel like C is not very good for this kind of modularised approach. You really want to be able to expose complex APIs with enforced type safety and this isn't possible with C.
-
Chunking strings in Elixir: how difficult can it be?
As the author of bstr and also the regex implementation that bstr uses to implement word breaking, it is linear time.
NSFL: https://github.com/BurntSushi/bstr/blob/86947727666d7b21c97e...
-
A byte string library for Rust
OsStr uses WTF-8 on Windows, and just represents the raw underlying bytes on Unix.
Byte strings can be WTF-8. They can be anything. The problem is that there is no real way to (easily) get the underlying WTF-8 bytes of an OsStr on Windows. So there's no free conversion to and from byte strings.
I wrote more about this in the bstr docs (and don't miss the link to os_str_bytes): https://docs.rs/bstr/latest/bstr/#file-paths-and-os-strings
I'd be happy to answer more questions if you have them. :-) https://github.com/BurntSushi/bstr/discussions
-
Where is the `str` struct/primitive defined ? I am learning Rust, so don't shoot please :).
Check out bstr, which does this exact thing for its BString and BStr types.
-
Tips when porting C++ programs to Rust
Currently slated for next Monday: https://github.com/BurntSushi/bstr/issues/40
- bstr 1.0 request for comments
-
Let's Stop Ascribing Meaning to Code Points (2017)
This is just an FYI. I don't mean to say much to your overall point, although, as someone else who has spent a lot of time doing Unicode-y things, I do tend to agree with you. I had a very similar discussion a bit ago.[1]
Putting that aside, at least with respect to grapheme segmentation, it might be a little simpler than you think. But maybe only a little. The unicode-segmentation crate also does word segmentation, which is quite a bit more complicated than grapheme segmentation. For example, you can write a regex to parse graphemes without too much fuss[2]. (Compare that with the word segmentation regex, much to my chagrin.[3]) Once you build the regex, actually using it is basically as simple as running the regex.[4]
Sadly, not all regex engines will be able to parse that regex due to its use of somewhat obscure Unicode properties. But the Rust regex crate can. :-)
And of course, this somewhat shifts code size to heap size. So there's that too. But bottom line is, if you have a nice regex engine available to you, you can whip up a grapheme segmenter pretty quickly. And some regex engines even have grapheme segmentation built in via \X.
[1]: https://github.com/BurntSushi/aho-corasick/issues/72
[2]: https://github.com/BurntSushi/bstr/blob/e38e7a7ca986f9499b30...
[3]: https://github.com/BurntSushi/bstr/blob/e38e7a7ca986f9499b30...
[4]: https://github.com/BurntSushi/bstr/blob/e38e7a7ca986f9499b30...
-
os_str_bytes now has string types!
This is a great idea. I realize the find implementation is not ideal and have considered bringing in an optional dependency to improve performance. I remembered bstr using two-way search, so I was wondering if depending on the full crate for searching would be worthwhile, but I see that changed. Thanks for the tip!
-
What you don't like about Rust?
Fun little nit-pick that does not detract from your overall point: you can actually count graphemes with a regex and that's exactly what bstr does. :-)
rust-semverver
-
A byte string library for Rust
1) No. I think semver is just fine for its intended purpose. I mean, I'm sure its spec could be improved in various ways, but its fundamental idea seems fine to me. I think it's just important to remember that semver is a means to an end, and not an end itself. It is a tool of communication most useful in a decentralized context.
2) No.
3) See: https://github.com/rust-lang/rust-semverver --- But also, this is only ever going to be a "best effort" sort of thing. Semver isn't just about method additions or deletions, but also behavior.
-
Toward fearless `cargo update`
How does this compare to cargo-semverver?
-
Are crate versions numbers all low because Rust just works?
Found this: https://github.com/rust-lang/rust-semverver but it doesn't seem to act on git log/diffs... just FYI.
-
Implied bounds and perfect derive
Enter rust-semverver!
-
my company refuses to use rust because it changes to much
Rust type system on the other hand does not allow this. Traits are monotonic logic: adding trait-impls / most qualifiers does't influence already existing and compiling code (note: for code that doesn't rely on disambiguation to compile). There's rules that clarify this disambiguations and breaking/non-breaking changes according to the type system. There's SemVerVer to automatically verify those guidelines.
-
Would you want crates.io/cargo publish to enforce strictly correct SemVer conventions?
In my case it wasn't so bad and an easy fix was fast to write, but it got me thinking of how much of a problem this is for the wider ecosystem. Some searching showed me, that of course there is a tool rust-semverver to do exactly that. Sadly it errors on my system (or maybe im just using it wrong). Would've been interesting to see how often this actually happens on crates.io and how much of a problem this really is.
-
Semantic Versioning Will Not Save You
There's been an attempt at this for the Rust ecosystem: https://stackoverflow.com/questions/41185023/what-exactly-is...
There's also a library that attempts to automatically check sermver adherence of a crate: https://github.com/rust-lang/rust-semverver
And there has been quite a bit of effort into preventing semver requirements from fracturing the ecosystem. This revolves around the compiler working with multiple major versions of a single library: https://github.com/dtolnay/semver-trick
-
cargo-incversion, a command line utility to update Cargo.toml version
Turns out it already exists: https://github.com/rust-lang/rust-semverver
What are some alternatives?
miniserve - 🌟 For when you really just want to serve some files over HTTP right now!
wg - Coordination repository of the embedded devices Working Group
tonic - A native gRPC client & server implementation with async/await support.
cargo-semver-checks-action - A GitHub Action for running cargo-semver-checks
rust-memchr - Optimized string search routines for Rust.
cargo-semver-checks - Scan your Rust crate for semver violations.
cargo-geiger - Detects usage of unsafe Rust in a Rust crate and its dependencies.
blog - My blog.
rust - Empowering everyone to build reliable and efficient software.
imgref-iter - A small crate for iterating over the rows or columns of `imgref` buffers
tokio - A runtime for writing reliable asynchronous applications with Rust. Provides I/O, networking, scheduling, timers, ...
really-small-backpack-example - A really small example of the Backpack module system for Haskell