diff options
| author | Sam McCall <sam.mccall@gmail.com> | 2021-02-10 00:11:35 +0100 |
|---|---|---|
| committer | Sam McCall <sam.mccall@gmail.com> | 2021-02-11 11:03:40 +0100 |
| commit | 5c55d3747b0cab17aaa07729cf90a49dbda71bbe (patch) | |
| tree | 7c5b4ed4b5a7dbe09ebd59f6f776074f51b5ea4b /llvm/lib/Analysis/CodeMetrics.cpp | |
| parent | a874d182c61c7f8e5291c718b40be0e133bf21f0 (diff) | |
| download | llvm-5c55d3747b0cab17aaa07729cf90a49dbda71bbe.zip llvm-5c55d3747b0cab17aaa07729cf90a49dbda71bbe.tar.gz llvm-5c55d3747b0cab17aaa07729cf90a49dbda71bbe.tar.bz2 | |
[CodeComplete] Member completion: heuristically resolve some dependent base exprs
Today, inside a template, you can get completion for:
Foo<T> t;
t.^
t has dependent type Foo<T>, and we use the primary template to find its members.
However we also want this to work:
t.foo.bar().^
The type of t.foo.bar() is DependentTy, so we attempt to resolve using similar
heuristics (e.g. primary template).
Differential Revision: https://reviews.llvm.org/D96376
Diffstat (limited to 'llvm/lib/Analysis/CodeMetrics.cpp')
0 files changed, 0 insertions, 0 deletions