unicode-xid
fst
| unicode-xid | fst | |
|---|---|---|
| 1 | 11 | |
| 42 | 1,712 | |
| - | - | |
| 5.5 | 3.5 | |
| 3 months ago | 4 months ago | |
| Rust | Rust | |
| GNU General Public License v3.0 or later | The Unlicense |
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.
unicode-xid
-
Debian discusses vendoring again
Another is unicode-xid. The entire package is literally a constant lookup table. Again, I've embedded Unicode tables in my own programs a number of time. The original tables are machine-readable, and transforming them into code is so simple I usually don't even bother writing a script to do it, just an on-the-fly editor macro.
fst
- fst: Represent large sets and maps compactly with finite state transducers
-
Creating a perfect HashMap from string keys known in advance
I'd point you towards BurntSushi's fst crate: https://github.com/BurntSushi/fst
-
How to use mmap safely in Rust?
The fst crate effectively relies on mmap for it to work right. The folks here suggesting you just use the heap might be right, but only if using the heap is actually plausible. If your dictionary is GBs big (an FST might be bigger than available memory), then copying it the heap first would be disastrous.
-
Official /r/rust "Who's Hiring" thread for job-seekers and job-offerers [Rust 1.64]
You'll love what we're working on if you're interested in the implementation of:- Tantivy- Meilisearch- Finite State Transducers
-
rustc is unacceptably slow compiling long lists of constant slices
Here's an example of longest prefix matching using a FST which I based my approach on: https://github.com/BurntSushi/fst/pull/104/files
-
Official /r/rust "Who's Hiring" thread for job-seekers and job-offerers [Rust 1.63]
Finite State Transducers
-
Wikit Desktop - A dictionary application using tauri GUI framework
As a result, I have a plan to implement a desktop version from then and I finished today with a beta version. The desktop is based on tauri, and the dictionary index algorithm is FST (it is an awesome index algorithm).
-
WordBueno.com online dictionary. Fast, no frills, mobile friendly.
WordBueno’s data is currently derived from Wiktionary. The backend is using Rust’s warp with fst for indexing.
- Show HN: WordBueno: sleek dictionary built with Rust and Svelte
-
Speed of Rust vs. C
No you don't. I've written multiple programs that load things instantly off the file system via memory maps. See the fst crate[1], for example, which is designed to work with memory maps.
Rust "works badly with memory mapped files" doesn't mean, "Rust can't use memory mapped files." It means, "it is difficult to reconcile Rust's safety story with memory maps." ripgrep for example uses memory maps because they are faster sometimes, and its safety contract[2] is a bit strained. But it works.
[1] - https://github.com/BurntSushi/fst/
[2] - https://docs.rs/grep-searcher/0.1.7/grep_searcher/struct.Mma...
What are some alternatives?
rust-base64 - base64, in rust
smartstring - Compact inlined strings for Rust.
perl5 - 🐪 The Perl programming language
libskry_r - Lucky imaging library
itoa - Fast integer to ascii / integer to string conversion
rust-fnv - Fowler–Noll–Vo hash function
itoa - Fast function for printing integer primitives to a decimal string
ucd-generate - A command line tool to generate Unicode tables as source code.
redgrep - ♥ Janusz Brzozowski
getopt - POSIX getopt() as a portable header library
tao - The TAO of cross-platform windowing. A library in Rust built for Tauri.