|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/ADT/STLExtras.h 1002 std::is_same<T, U>::value || is_one_of<T, Ts...>::value;
1002 std::is_same<T, U>::value || is_one_of<T, Ts...>::value;
include/llvm/Support/FormatVariadic.h 253 inline auto formatv(const char *Fmt, Ts &&... Vals) -> formatv_object<decltype(
include/llvm/Support/FormatVariadicDetails.h 48 explicit stream_operator_format_adapter(T &&Item)
145 build_format_adapter(T &&Item) {
include/llvm/Support/ScopedPrinter.h 61 template <class T> const std::string to_string(const T &Value) {
tools/clang/tools/extra/clangd/Logger.h 40 template <typename T> T &&wrap(T &&V) { return std::forward<T>(V); }
40 template <typename T> T &&wrap(T &&V) { return std::forward<T>(V); }
45 void log(Logger::Level L, const char *Fmt, Ts &&... Vals) {
tools/clang/tools/extra/clangd/Selection.cpp 30 using Node = SelectionTree::Node;
53 S.Selected = SelectionTree::Complete;
55 S.Selected = SelectionTree::Partial;
57 S.Selected = SelectionTree::Unselected;
65 void claim(unsigned Begin, unsigned End, SelectionTree::Selection &Result) {
93 PartialSelection |= (It->Selected == SelectionTree::Partial);
105 Result = std::max(Result, PartialSelection ? SelectionTree::Partial
106 : SelectionTree::Complete);
114 SelectionTree::Selection Selected;
169 SelectionTree::Selection UnclaimedTokens = SelectionTree::Unselected;
169 SelectionTree::Selection UnclaimedTokens = SelectionTree::Unselected;
176 SelectedAll ? SelectionTree::Complete : SelectionTree::Partial;
176 SelectedAll ? SelectionTree::Complete : SelectionTree::Partial;
272 Nodes.back().Selected = SelectionTree::Unselected;
346 Nodes.back().Selected = SelectionTree::Partial;
385 void claimRange(SourceRange S, SelectionTree::Selection &Result) {
440 void SelectionTree::print(llvm::raw_ostream &OS, const SelectionTree::Node &N,
443 OS.indent(Indent - 1) << (N.Selected == SelectionTree::Complete ? '*'
528 const SelectionTree::Node &SelectionTree::Node::ignoreImplicit() const {
535 const SelectionTree::Node &SelectionTree::Node::outerImplicit() const {
tools/clang/tools/extra/clangd/Selection.h 130 const SelectionTree &T) {
tools/clang/tools/extra/clangd/SemanticSelection.cpp 42 SelectionTree ST(AST.getASTContext(), AST.getTokens(), *Offset);
tools/clang/tools/extra/clangd/refactor/Tweak.h 66 SelectionTree ASTSelection;
tools/clang/tools/extra/clangd/refactor/tweaks/DefineInline.cpp 85 const FunctionDecl *getSelectedFunction(const SelectionTree::Node *SelNode) {
90 SelNode->Selected == SelectionTree::Complete) {
91 if (const SelectionTree::Node *P = SelNode->Parent)
286 const SelectionTree::Node *SelNode = Sel.ASTSelection.commonAncestor();
tools/clang/tools/extra/clangd/refactor/tweaks/ExtractFunction.cpp 78 using Node = SelectionTree::Node;
97 if (N->Selected == SelectionTree::Partial)
101 if (N->Selected == SelectionTree::Unselected && !N->ASTNode.get<DeclStmt>())
121 case SelectionTree::Selection::Unselected:
126 case SelectionTree::Selection::Partial:
129 case SelectionTree::Selection::Complete:
tools/clang/tools/extra/clangd/refactor/tweaks/ExtractVariable.cpp 38 ExtractionContext(const SelectionTree::Node *Node, const SourceManager &SM,
41 const SelectionTree::Node *getExprNode() const { return ExprNode; }
55 const SelectionTree::Node *ExprNode;
86 ExtractionContext::ExtractionContext(const SelectionTree::Node *Node,
142 for (const SelectionTree::Node *CurNode = getExprNode();
205 llvm::SmallVector<const SelectionTree::Node*, 8> SelectedOperands;
208 bool parse(const SelectionTree::Node &N) {
256 for (const SelectionTree::Node *Child : SelectedOperands)
275 const SourceRange getBinaryOperatorRange(const SelectionTree::Node &N,
289 const SelectionTree::Node *Start = Op.SelectedOperands.front(); // LHS
290 const SelectionTree::Node *End = Op.SelectedOperands.back(); // RHS
323 const SelectionTree::Node *getCallExpr(const SelectionTree::Node *DeclRef) {
323 const SelectionTree::Node *getCallExpr(const SelectionTree::Node *DeclRef) {
324 const SelectionTree::Node &MaybeCallee = DeclRef->outerImplicit();
325 const SelectionTree::Node *MaybeCall = MaybeCallee.Parent;
364 bool eligibleForExtraction(const SelectionTree::Node *N) {
389 const SelectionTree::Node &OuterImplicit = N->outerImplicit();
403 const SelectionTree::Node *computeExtractedExpr(const SelectionTree::Node *N) {
403 const SelectionTree::Node *computeExtractedExpr(const SelectionTree::Node *N) {
406 const SelectionTree::Node *TargetNode = N;
413 if (const SelectionTree::Node *Call = getCallExpr(N))
454 if (const SelectionTree::Node *N =
tools/clang/tools/extra/clangd/refactor/tweaks/RawStringLiteral.cpp 81 const SelectionTree::Node *N = Inputs.ASTSelection.commonAncestor();
tools/clang/tools/extra/clangd/refactor/tweaks/RemoveUsingNamespace.cpp 87 bool isTopLevelDecl(const SelectionTree::Node *Node) {
tools/clang/tools/extra/clangd/refactor/tweaks/SwapIfBranches.cpp 51 for (const SelectionTree::Node *N = Inputs.ASTSelection.commonAncestor();
tools/clang/tools/extra/clangd/unittests/FindTargetTests.cpp 80 SelectionTree Selection(AST.getASTContext(), AST.getTokens(), R.Begin,
82 const SelectionTree::Node *N = Selection.commonAncestor();
tools/clang/tools/extra/clangd/unittests/SelectionTests.cpp 22 SelectionTree makeSelectionTree(const StringRef MarkedCode, ParsedAST &AST) {
39 Range nodeRange(const SelectionTree::Node *N, ParsedAST &AST) {
55 std::string nodeKind(const SelectionTree::Node *N) {
59 std::vector<const SelectionTree::Node *> allNodes(const SelectionTree &T) {
59 std::vector<const SelectionTree::Node *> allNodes(const SelectionTree &T) {
60 std::vector<const SelectionTree::Node *> Result = {&T.root()};
62 const SelectionTree::Node *N = Result[I];
70 bool verifyCommonAncestor(const SelectionTree::Node &Root,
71 const SelectionTree::Node *Common,
78 for (const SelectionTree::Node *Child : Root.Children)
301 auto T = makeSelectionTree(C.Code, AST);
330 auto T = makeSelectionTree(Code, AST);
371 auto T = makeSelectionTree(C, AST);
374 for (const SelectionTree::Node *N : allNodes(T))
375 if (N->Selected == SelectionTree::Complete)
377 else if (N->Selected == SelectionTree::Partial)
397 auto T = makeSelectionTree(Case, AST);
410 auto T = makeSelectionTree(Test, AST);
412 const SelectionTree::Node *Str = T.commonAncestor();
usr/include/c++/7.4.0/bits/move.h 72 constexpr _Tp&&
83 constexpr _Tp&&
usr/include/c++/7.4.0/type_traits 215 : public __is_void_helper<typename remove_cv<_Tp>::type>::type
354 : public __is_floating_point_helper<typename remove_cv<_Tp>::type>::type
381 : public __is_pointer_helper<typename remove_cv<_Tp>::type>::type
581 : public __or_<is_lvalue_reference<_Tp>,
582 is_rvalue_reference<_Tp>>::type
601 : public __not_<__or_<is_function<_Tp>, is_reference<_Tp>,
601 : public __not_<__or_<is_function<_Tp>, is_reference<_Tp>,
602 is_void<_Tp>>>::type
638 : public __or_<is_object<_Tp>, is_reference<_Tp>>::type
638 : public __or_<is_object<_Tp>, is_reference<_Tp>>::type
762 typename add_rvalue_reference<_Tp>::type declval() noexcept;
1538 typedef decltype(__test<_From, _To>(0)) type;
1545 : public __is_convertible_helper<_From, _To>::type
1554 { typedef _Tp type; };
1563 { typedef _Tp type; };
1574 remove_const<typename remove_volatile<_Tp>::type>::type type;
1633 { typedef _Tp type; };
1659 { typedef _Tp&& type; };
1664 : public __add_rvalue_reference_helper<_Tp>
2104 { typedef typename remove_cv<_Up>::type __type; };
utils/unittest/googletest/include/gtest/gtest-message.h 116 inline Message& operator <<(const T& val) {
utils/unittest/googletest/include/gtest/internal/custom/raw-ostream.h 35 auto printable(const T &V) -> decltype(StreamSwitch<T>::printable(V)) {
35 auto printable(const T &V) -> decltype(StreamSwitch<T>::printable(V)) {
37 return StreamSwitch<T>::printable(V);
54 const T& V;
55 friend std::ostream &operator<<(std::ostream &S, const RawStreamProxy<T> &V) {
69 static const RawStreamProxy<T> printable(const T &V) { return {V}; }
69 static const RawStreamProxy<T> printable(const T &V) { return {V}; }