aboutsummaryrefslogtreecommitdiff
path: root/crates/ra_hir/src/ty/utils.rs
diff options
context:
space:
mode:
authorAleksey Kladov <[email protected]>2019-11-26 15:02:50 +0000
committerAleksey Kladov <[email protected]>2019-11-26 15:02:50 +0000
commitb60b26b8abc9d2bed46278c07415b7b39752040c (patch)
treef7a6ee3da31c3a0c01f1afdf86d6825e707d0e56 /crates/ra_hir/src/ty/utils.rs
parent72d8e7e69abca9f27fb3ea386a6879324741e152 (diff)
Reduce visibility
Diffstat (limited to 'crates/ra_hir/src/ty/utils.rs')
-rw-r--r--crates/ra_hir/src/ty/utils.rs4
1 files changed, 2 insertions, 2 deletions
diff --git a/crates/ra_hir/src/ty/utils.rs b/crates/ra_hir/src/ty/utils.rs
index 52994b9e3..80ffceb4b 100644
--- a/crates/ra_hir/src/ty/utils.rs
+++ b/crates/ra_hir/src/ty/utils.rs
@@ -33,7 +33,7 @@ fn direct_super_traits(db: &impl DefDatabase, trait_: TraitId) -> Vec<TraitId> {
33 33
34/// Returns an iterator over the whole super trait hierarchy (including the 34/// Returns an iterator over the whole super trait hierarchy (including the
35/// trait itself). 35/// trait itself).
36pub(crate) fn all_super_traits(db: &impl DefDatabase, trait_: TraitId) -> Vec<TraitId> { 36pub(super) fn all_super_traits(db: &impl DefDatabase, trait_: TraitId) -> Vec<TraitId> {
37 // we need to take care a bit here to avoid infinite loops in case of cycles 37 // we need to take care a bit here to avoid infinite loops in case of cycles
38 // (i.e. if we have `trait A: B; trait B: A;`) 38 // (i.e. if we have `trait A: B; trait B: A;`)
39 let mut result = vec![trait_]; 39 let mut result = vec![trait_];
@@ -52,7 +52,7 @@ pub(crate) fn all_super_traits(db: &impl DefDatabase, trait_: TraitId) -> Vec<Tr
52 result 52 result
53} 53}
54 54
55pub(crate) fn associated_type_by_name_including_super_traits( 55pub(super) fn associated_type_by_name_including_super_traits(
56 db: &impl DefDatabase, 56 db: &impl DefDatabase,
57 trait_: TraitId, 57 trait_: TraitId,
58 name: &Name, 58 name: &Name,