#computation #query #framework #salsa #generic #system #incrementalized

ra_ap_salsa

A generic framework for on-demand, incrementalized computation (experimental)

67 releases

new 0.0.269 Mar 10, 2025
0.0.266 Feb 24, 2025
0.0.251 Dec 30, 2024
0.0.246 Nov 25, 2024
0.0.207 Mar 25, 2024

#244 in Algorithms

Download history 3370/week @ 2024-11-19 3094/week @ 2024-11-26 3067/week @ 2024-12-03 3289/week @ 2024-12-10 2408/week @ 2024-12-17 1151/week @ 2024-12-24 1643/week @ 2024-12-31 3774/week @ 2025-01-07 2858/week @ 2025-01-14 2923/week @ 2025-01-21 2798/week @ 2025-01-28 3036/week @ 2025-02-04 3405/week @ 2025-02-11 3085/week @ 2025-02-18 3516/week @ 2025-02-25 2284/week @ 2025-03-04

12,806 downloads per month
Used in 26 crates (2 directly)

Apache-2.0 OR MIT

210KB
4K SLoC

salsa

A generic framework for on-demand, incrementalized computation.

Obligatory warning

This is a fork of https://github.com/salsa-rs/salsa/ adjusted to rust-analyzer's needs.

Credits

This system is heavily inspired by adapton, glimmer, and rustc's query system. So credit goes to Eduard-Mihai Burtescu, Matthew Hammer, Yehuda Katz, and Michael Woerister.

Key idea

The key idea of salsa is that you define your program as a set of queries. Every query is used like function K -> V that maps from some key of type K to a value of type V. Queries come in two basic varieties:

  • Inputs: the base inputs to your system. You can change these whenever you like.
  • Functions: pure functions (no side effects) that transform your inputs into other values. The results of queries is memoized to avoid recomputing them a lot. When you make changes to the inputs, we'll figure out (fairly intelligently) when we can re-use these memoized values and when we have to recompute them.

Want to learn more?

To learn more about Salsa, try one of the following:

Getting in touch

The bulk of the discussion happens in the issues and pull requests, but we have a zulip chat as well.

Dependencies

~2.2–8MB
~59K SLoC