| Index: pkg/analysis_server/lib/src/services/completion/completion_target.dart
|
| diff --git a/pkg/analysis_server/lib/src/services/completion/completion_target.dart b/pkg/analysis_server/lib/src/services/completion/completion_target.dart
|
| index f58e1c3922ba13f724335d35e95c5e0c1a6d508b..3ae98ba26d45eade0e3e4f17ca7191804e079cef 100644
|
| --- a/pkg/analysis_server/lib/src/services/completion/completion_target.dart
|
| +++ b/pkg/analysis_server/lib/src/services/completion/completion_target.dart
|
| @@ -82,8 +82,8 @@ class CompletionTarget {
|
| * Compute the appropriate [CompletionTarget] for the given [offset] within
|
| * the [compilationUnit].
|
| */
|
| - factory CompletionTarget.forOffset(CompilationUnit compilationUnit,
|
| - int offset) {
|
| + factory CompletionTarget.forOffset(
|
| + CompilationUnit compilationUnit, int offset) {
|
| // The precise algorithm is as follows. We perform a depth-first search of
|
| // all edges in the parse tree (both those that point to AST nodes and
|
| // those that point to tokens), visiting parents before children. The
|
|
|