1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
//! [`Repository`] backed by the live Packagist HTTP API.
//!
//! Wraps the existing [`crate::packagist::fetch_package_versions`] so the
//! resolver sees the same data either through this trait or via the legacy
//! direct call. Construction takes ownership of the [`Cache`] handle so
//! callers no longer thread it through `ResolveRequest` / `LockFileGenerationRequest`.
use super::{LoadResult, NamedPackagistVersion, PackageQuery, Repository};
use crate::cache::Cache;
use crate::packagist;
pub struct PackagistRepository {
id: String,
cache: Cache,
}
impl PackagistRepository {
pub fn new(cache: Cache) -> Self {
Self {
id: "packagist.org".to_string(),
cache,
}
}
}
#[async_trait::async_trait]
impl Repository for PackagistRepository {
fn id(&self) -> &str {
&self.id
}
async fn load_packages(&self, queries: &[PackageQuery<'_>]) -> anyhow::Result<LoadResult> {
let mut result = LoadResult::default();
for query in queries {
// Mirror the existing transitive-loop tolerance: a 404 / network
// failure for one name is not fatal — it just means this repo
// contributes nothing for that name. `RepositorySet` falls
// through, and the solver fails later if no repo knows it.
let versions =
match packagist::fetch_package_versions(query.name, &self.cache).await {
Ok(v) => v,
Err(_) => continue,
};
// `fetch_package_versions` returning Ok counts as "this repo
// authoritatively knows the name", even if the version list is
// empty (matches Composer `ArrayRepository::loadPackages` which
// adds the name to `namesFound` regardless of constraint match).
result.names_found.push(query.name.to_string());
for version in versions {
result.packages.push(NamedPackagistVersion {
name: query.name.to_string(),
version,
});
}
}
Ok(result)
}
}
|
