mirror of
https://github.com/NixOS/nix
synced 2025-07-07 01:51:47 +02:00
Merge remote-tracking branch 'origin/master' into flakes
This commit is contained in:
commit
6208d24c38
7 changed files with 13 additions and 16 deletions
|
@ -64,12 +64,12 @@ public:
|
|||
return end();
|
||||
}
|
||||
|
||||
std::optional<Attr *> get(const Symbol & name)
|
||||
Attr * get(const Symbol & name)
|
||||
{
|
||||
Attr key(name, 0);
|
||||
iterator i = std::lower_bound(begin(), end(), key);
|
||||
if (i != end() && i->name == name) return &*i;
|
||||
return {};
|
||||
return nullptr;
|
||||
}
|
||||
|
||||
Attr & need(const Symbol & name, const Pos & pos = noPos)
|
||||
|
@ -77,7 +77,7 @@ public:
|
|||
auto a = get(name);
|
||||
if (!a)
|
||||
throw Error("attribute '%s' missing, at %s", name, pos);
|
||||
return **a;
|
||||
return *a;
|
||||
}
|
||||
|
||||
iterator begin() { return &attrs[0]; }
|
||||
|
|
|
@ -18,6 +18,8 @@ extern "C" {
|
|||
|
||||
struct StorePath : rust::Value<3 * sizeof(void *) + 24, ffi_StorePath_drop>
|
||||
{
|
||||
StorePath() = delete;
|
||||
|
||||
static StorePath make(std::string_view path, std::string_view storeDir);
|
||||
|
||||
static StorePath make(unsigned char hash[20], std::string_view name);
|
||||
|
|
|
@ -113,6 +113,8 @@ extern "C" {
|
|||
|
||||
struct String : Vec<char, ffi_String_drop>
|
||||
{
|
||||
String() = delete;
|
||||
|
||||
String(std::string_view s)
|
||||
{
|
||||
ffi_String_new(StringSlice(s), this);
|
||||
|
|
|
@ -103,7 +103,7 @@ struct CmdWhyDepends : SourceExprCommand
|
|||
std::map<StorePath, Node> graph;
|
||||
|
||||
for (auto & path : closure)
|
||||
graph.emplace(path.clone(), Node{path.clone(), cloneStorePathSet(store->queryPathInfo(path)->references)});
|
||||
graph.emplace(path.clone(), Node { .path = path.clone(), .refs = cloneStorePathSet(store->queryPathInfo(path)->references) });
|
||||
|
||||
// Transpose the graph.
|
||||
for (auto & node : graph)
|
||||
|
@ -112,7 +112,7 @@ struct CmdWhyDepends : SourceExprCommand
|
|||
|
||||
/* Run Dijkstra's shortest path algorithm to get the distance
|
||||
of every path in the closure to 'dependency'. */
|
||||
graph[dependencyPath.clone()].dist = 0;
|
||||
graph.emplace(dependencyPath.clone(), Node { .path = dependencyPath.clone(), .dist = 0 });
|
||||
|
||||
std::priority_queue<Node *> queue;
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue