aboutsummaryrefslogtreecommitdiff
path: root/crates/parser/src/grammar/items/adt.rs
diff options
context:
space:
mode:
authorbors[bot] <26634292+bors[bot]@users.noreply.github.com>2021-03-23 10:20:47 +0000
committerGitHub <[email protected]>2021-03-23 10:20:47 +0000
commit1efd220f2f844596dd22bfd73a8a0c596354be38 (patch)
treeeeba1d8e0e89d6d40ad4802f32dc72af0dfa3e15 /crates/parser/src/grammar/items/adt.rs
parentbf3a8eb40a1c684ffc9cb40477558ec276253c3b (diff)
parentfa9c6eb4560c3c72a726dba4210af2edbb3dd4bb (diff)
Merge #8162
8162: Compute more mathematically well-rounded notion of transitive deps r=Veykril a=matklad By including the crate itself, we make the resulting set closed with respect to `transitve_reveres_dependencies` operation, as it becomes a proper transitive closure. This just feels more proper and mathy. And, indeed, this actually allows us to simplify call sites somewhat. Co-authored-by: Aleksey Kladov <[email protected]>
Diffstat (limited to 'crates/parser/src/grammar/items/adt.rs')
0 files changed, 0 insertions, 0 deletions