@@ -35,7 +35,7 @@ use rustc_data_structures::sync::{self, par_iter, Lrc, ParallelIterator};
35
35
use rustc_hir as hir;
36
36
use rustc_hir:: def:: { CtorKind , CtorOf , DefKind , Res } ;
37
37
use rustc_hir:: def_id:: { CrateNum , DefId , DefIdMap , LocalDefId , CRATE_DEF_INDEX , LOCAL_CRATE } ;
38
- use rustc_hir:: { Constness , GlobMap , Node , TraitMap } ;
38
+ use rustc_hir:: { Constness , GlobMap , Node } ;
39
39
use rustc_index:: vec:: { Idx , IndexVec } ;
40
40
use rustc_macros:: HashStable ;
41
41
use rustc_serialize:: { self , Encodable , Encoder } ;
@@ -46,6 +46,7 @@ use rustc_target::abi::Align;
46
46
use syntax:: ast:: { self , Ident , Name } ;
47
47
use syntax:: node_id:: { NodeId , NodeMap , NodeSet } ;
48
48
49
+ use smallvec:: SmallVec ;
49
50
use std:: cell:: RefCell ;
50
51
use std:: cmp:: { self , Ordering } ;
51
52
use std:: fmt;
@@ -122,6 +123,23 @@ mod sty;
122
123
123
124
// Data types
124
125
126
+ #[ derive( Clone , Debug ) ]
127
+ pub struct TraitCandidate {
128
+ pub def_id : DefId ,
129
+ pub import_ids : SmallVec < [ NodeId ; 1 ] > ,
130
+ }
131
+
132
+ impl TraitCandidate {
133
+ fn node_to_hir_id ( self , definitions : & hir_map:: Definitions ) -> hir:: TraitCandidate {
134
+ let TraitCandidate { def_id, import_ids } = self ;
135
+ let import_ids =
136
+ import_ids. into_iter ( ) . map ( |node_id| definitions. node_to_hir_id ( node_id) ) . collect ( ) ;
137
+ hir:: TraitCandidate { def_id, import_ids }
138
+ }
139
+ }
140
+
141
+ pub type TraitMap = NodeMap < Vec < TraitCandidate > > ;
142
+
125
143
pub struct ResolverOutputs {
126
144
pub definitions : hir_map:: Definitions ,
127
145
pub cstore : Box < CrateStoreDyn > ,
0 commit comments