Warp VS fst

I'm trying out Warp for the first time, and an immediate accessibility issue for me is that the text is simply too small to read for a lot of the UI elements (context menu, side bar, tab bar…). The size should be configurable for all of the elements, not just the terminal view. I think I would also be fine with a setting that just scales the whole UI.

I did notice there is an issue for it already: https://github.com/warpdotdev/Warp/issues/1443

Warp is a Rust-based terminal with AI built in. I like it because it has things like autocompletions, history search, click-to-edit, and theming out-of-the-box. Feels super modern. And if you do want to try it out, use my referral link & get a free theme!)

Unless you want to type this every day, I’d recommend creating an alias. In my case, I’m using Warp, so I’ll right-click the command and choose Save as Workflow to save my script as a workflow. Warp AI will even help me autofill the title and description and detect variables.

This makes me wonder about newer terminal emulators on maccOS like Warp[1], and if they're for example taking all input locally, and then sending it over the remote host in a single blob or not? I imagine doing so would possibly break any sort of raw-mode input being done on remote host but I'd also imagine that is a detectable situation in which you could switch into a raw keystroke feed as well.

[1]: https://warp.dev

Warp - GPT in the terminal - very helpful for debugging

You're right, I just found the discussion there (and it's the longest one currently). For now, I just run tmux inside the emulator.

I'd point you towards BurntSushi's fst crate: https://github.com/BurntSushi/fst

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.

You'll love what we're working on if you're interested in the implementation of:- Tantivy- Meilisearch- Finite State Transducers

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

Finite State Transducers

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’s data is currently derived from Wiktionary. The backend is using Rust’s warp with fst for indexing.

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...