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

ra_ap_salsa

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

42 releases

new 0.0.244 Nov 11, 2024
0.0.237 Sep 30, 2024
0.0.227 Jul 29, 2024
0.0.207 Mar 25, 2024

#253 in Algorithms

Download history 799/week @ 2024-07-22 830/week @ 2024-07-29 712/week @ 2024-08-05 655/week @ 2024-08-12 768/week @ 2024-08-19 891/week @ 2024-08-26 498/week @ 2024-09-02 1996/week @ 2024-09-09 3802/week @ 2024-09-16 2902/week @ 2024-09-23 3980/week @ 2024-09-30 4257/week @ 2024-10-07 3860/week @ 2024-10-14 5203/week @ 2024-10-21 4939/week @ 2024-10-28 3404/week @ 2024-11-04

17,658 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–7.5MB
~64K SLoC