Rust dependency-solver Projects
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
I initially spend quite some time investigating PubGrub for conda (using the awesome rust implementation) but gave up after some time. The biggest issue was that the primitive used in the pubgrub algorithm is the concept of a range and the mathematical operations you can apply to it. This makes the algorithm very good at reasoning about whether or not a particular spec is worth considering. However, it requires that you can express a set of versions as a continuous range. This is often the case when you talk about things like semver, but in conda there are many more factors to consider, for instance, a spec (matchspec in condas case) might, besides referring to a version also refer to a build string in the form of globs ("*cuda") or build numbers, different platforms, features, hashes and you can even use regular expressions in there. I have not been able to figure out a way to map conda matchspecs into a range primitive that works for pubgrub.
Rust dependency-solver related posts
Index
Project | Stars | |
---|---|---|
1 | pubgrub | 316 |
2 | elm-solve-deps | 4 |
Sponsored