@@ -5,7 +5,7 @@ use salsa::Setter;
5
5
use smol_str:: SmolStr ;
6
6
use url:: Url ;
7
7
8
- use crate :: config:: IngotArguments ;
8
+ use crate :: config:: DependencyArguments ;
9
9
use crate :: InputDb ;
10
10
use crate :: { file:: File , indexmap:: IndexMap } ;
11
11
@@ -19,7 +19,7 @@ pub enum InputIndexError {
19
19
pub struct Workspace {
20
20
files : StringTrie < Url , File > ,
21
21
paths : IndexMap < File , Url > ,
22
- graph : DiGraph < Url , ( SmolStr , IngotArguments ) > ,
22
+ graph : DiGraph < Url , ( SmolStr , DependencyArguments ) > ,
23
23
graph_nodes : IndexMap < Url , NodeIndex > ,
24
24
}
25
25
@@ -116,8 +116,8 @@ impl Workspace {
116
116
pub fn join_graph (
117
117
& self ,
118
118
db : & mut dyn InputDb ,
119
- graph : DiGraph < Url , ( SmolStr , IngotArguments ) > ,
120
- join_edges : Vec < ( Url , Url , ( SmolStr , IngotArguments ) ) > ,
119
+ graph : DiGraph < Url , ( SmolStr , DependencyArguments ) > ,
120
+ join_edges : Vec < ( Url , Url , ( SmolStr , DependencyArguments ) ) > ,
121
121
) {
122
122
let old_graph = self . graph ( db) ;
123
123
let combined_graph = join_graphs ( & old_graph, & graph, & join_edges) ;
@@ -128,7 +128,7 @@ impl Workspace {
128
128
self . set_graph ( db) . to ( combined_graph) ;
129
129
}
130
130
131
- pub fn get_graph ( & self , db : & dyn InputDb ) -> DiGraph < Url , ( SmolStr , IngotArguments ) > {
131
+ pub fn get_graph ( & self , db : & dyn InputDb ) -> DiGraph < Url , ( SmolStr , DependencyArguments ) > {
132
132
self . graph ( db) . clone ( )
133
133
}
134
134
@@ -151,10 +151,10 @@ use petgraph::graph::NodeIndex;
151
151
use std:: collections:: HashMap ;
152
152
153
153
fn join_graphs (
154
- g1 : & DiGraph < Url , ( SmolStr , IngotArguments ) > ,
155
- g2 : & DiGraph < Url , ( SmolStr , IngotArguments ) > ,
156
- join_edges : & [ ( Url , Url , ( SmolStr , IngotArguments ) ) ] ,
157
- ) -> DiGraph < Url , ( SmolStr , IngotArguments ) > {
154
+ g1 : & DiGraph < Url , ( SmolStr , DependencyArguments ) > ,
155
+ g2 : & DiGraph < Url , ( SmolStr , DependencyArguments ) > ,
156
+ join_edges : & [ ( Url , Url , ( SmolStr , DependencyArguments ) ) ] ,
157
+ ) -> DiGraph < Url , ( SmolStr , DependencyArguments ) > {
158
158
let mut combined = DiGraph :: new ( ) ;
159
159
160
160
let mut node_map = HashMap :: < Url , NodeIndex > :: new ( ) ;
0 commit comments