diff --git a/scopegraphs/src/completeness/implicit.rs b/scopegraphs/src/completeness/implicit.rs index c6c62c8..2b8b8f3 100644 --- a/scopegraphs/src/completeness/implicit.rs +++ b/scopegraphs/src/completeness/implicit.rs @@ -14,7 +14,7 @@ use super::Implicit; /// Unlike [`ExplicitClose`](crate::completeness::ExplicitClose), this implementation will implicitly close edges once traversed. /// This does not require special attention from the type checker writer. /// -/// Returns [`EdgeClosedError`](EdgeClosedError) when an edge is added to a scope in which the label is already +/// Returns [EdgeClosedError] when an edge is added to a scope in which the label is already /// closed (because `get_edges(s, l, ...)` was called earlier. /// /// When edges are retrieved (e.g. during query resolution) the `(src, label)` edge is closed. diff --git a/scopegraphs/src/resolve/lookup.rs b/scopegraphs/src/resolve/lookup.rs index 9bb5d35..ee3a3f4 100644 --- a/scopegraphs/src/resolve/lookup.rs +++ b/scopegraphs/src/resolve/lookup.rs @@ -364,7 +364,7 @@ mod tests { }, future_wrapper::FutureWrapper, query_regex, - resolve::{DataWellformedness, Resolve, ResolvedPath}, + resolve::{Resolve, ResolvedPath}, storage::Storage, Label, ScopeGraph, }; @@ -468,14 +468,7 @@ mod tests { .with_path_wellformedness(query_regex!(Lbl: Lex* Imp? Def)) .with_data_wellformedness(TData::matcher_fut("x")) .with_label_order(label_order!(Lbl: Def < Imp < Lex)); - type DWF = impl for<'sg> DataWellformedness< - 'sg, - TData<'sg>, - Output = FutureWrapper<'sg, bool>, - >; - let env = - crate::resolve::Query::<'_, '_, '_, _, _, _, _, DWF, _, _>::resolve(&query, s_let) - .await; + let env = query.resolve(s_let).await; let env_vec = env.into_iter().collect::>(); assert_eq!(1, env_vec.len());