#computation #query #framework #salsa #key #generic #system

ra_ap_salsa

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

46 releases

new 0.0.248 Dec 9, 2024
0.0.246 Nov 25, 2024
0.0.227 Jul 29, 2024
0.0.207 Mar 25, 2024

#244 in Algorithms

Download history 794/week @ 2024-08-18 813/week @ 2024-08-25 618/week @ 2024-09-01 1908/week @ 2024-09-08 3828/week @ 2024-09-15 2898/week @ 2024-09-22 3774/week @ 2024-09-29 4312/week @ 2024-10-06 3927/week @ 2024-10-13 5198/week @ 2024-10-20 4865/week @ 2024-10-27 3503/week @ 2024-11-03 3069/week @ 2024-11-10 3530/week @ 2024-11-17 3045/week @ 2024-11-24 3283/week @ 2024-12-01

13,123 downloads per month
Used in 27 crates (2 directly)

Apache-2.0 OR MIT

205KB
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.4–8MB
~64K SLoC