@@ -14,12 +14,12 @@ use tt::Subtree;
14
14
/// (appending to and replacing nodes), the information that is needed to
15
15
/// reverse those changes afterwards, and a token map.
16
16
#[ derive( Debug ) ]
17
- pub struct SyntaxFixups {
18
- pub append : FxHashMap < SyntaxNode , Vec < SyntheticToken > > ,
19
- pub replace : FxHashMap < SyntaxNode , Vec < SyntheticToken > > ,
20
- pub undo_info : SyntaxFixupUndoInfo ,
21
- pub token_map : TokenMap ,
22
- pub next_id : u32 ,
17
+ pub ( crate ) struct SyntaxFixups {
18
+ pub ( crate ) append : FxHashMap < SyntaxNode , Vec < SyntheticToken > > ,
19
+ pub ( crate ) replace : FxHashMap < SyntaxNode , Vec < SyntheticToken > > ,
20
+ pub ( crate ) undo_info : SyntaxFixupUndoInfo ,
21
+ pub ( crate ) token_map : TokenMap ,
22
+ pub ( crate ) next_id : u32 ,
23
23
}
24
24
25
25
/// This is the information needed to reverse the fixups.
@@ -30,7 +30,7 @@ pub struct SyntaxFixupUndoInfo {
30
30
31
31
const EMPTY_ID : SyntheticTokenId = SyntheticTokenId ( !0 ) ;
32
32
33
- pub fn fixup_syntax ( node : & SyntaxNode ) -> SyntaxFixups {
33
+ pub ( crate ) fn fixup_syntax ( node : & SyntaxNode ) -> SyntaxFixups {
34
34
let mut append = FxHashMap :: default ( ) ;
35
35
let mut replace = FxHashMap :: default ( ) ;
36
36
let mut preorder = node. preorder ( ) ;
@@ -122,7 +122,7 @@ fn has_error_to_handle(node: &SyntaxNode) -> bool {
122
122
has_error ( node) || node. children ( ) . any ( |c| !can_handle_error ( & c) && has_error_to_handle ( & c) )
123
123
}
124
124
125
- pub fn reverse_fixups ( tt : & mut Subtree , token_map : & TokenMap , undo_info : & SyntaxFixupUndoInfo ) {
125
+ pub ( crate ) fn reverse_fixups ( tt : & mut Subtree , token_map : & TokenMap , undo_info : & SyntaxFixupUndoInfo ) {
126
126
tt. token_trees . retain ( |tt| match tt {
127
127
tt:: TokenTree :: Leaf ( leaf) => {
128
128
token_map. synthetic_token_id ( leaf. id ( ) ) . is_none ( )
0 commit comments