| /external/javaparser/javaparser-core/src/main/javacc-support/com/github/javaparser/ |
| TokenBase.java | 3 import static com.github.javaparser.GeneratedJavaParserConstants.GT;
12 int realKind = GT;
|
| /external/llvm/include/llvm/ADT/ |
| SCCIterator.h | 39 template <class GraphT, class GT = GraphTraits<GraphT>>
42 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
43 const std::vector<typename GT::NodeType *>, ptrdiff_t> {
44 typedef typename GT::NodeType NodeType;
45 typedef typename GT::ChildIteratorType ChildItTy;
101 return scc_iterator(GT::getEntryNode(G));
141 template <class GraphT, class GT>
142 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeType *N) {
146 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
153 template <class GraphT, class GT>
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| SCCIterator.h | 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 typedef typename GT::NodeRef NodeRef;
47 typedef typename GT::ChildIteratorType ChildItTy;
103 return scc_iterator(GT::getEntryNode(G));
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 template <class GraphT, class GT>
[all...] |
| BreadthFirstIterator.h | 48 class GT = GraphTraits<GraphT>>
50 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
52 typedef std::iterator<std::forward_iterator_tag, typename GT::NodeRef> super;
54 typedef typename GT::NodeRef NodeRef;
55 typedef typename GT::ChildIteratorType ChildItTy;
86 ChildIt.emplace(GT::child_begin(Node));
87 while (*ChildIt != GT::child_end(Node)) {
116 return bf_iterator(GT::getEntryNode(G));
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| SCCIterator.h | 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 using NodeRef = typename GT::NodeRef;
47 using ChildItTy = typename GT::ChildIteratorType;
103 return scc_iterator(GT::getEntryNode(G));
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 template <class GraphT, class GT>
[all...] |
| BreadthFirstIterator.h | 47 class GT = GraphTraits<GraphT>>
49 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
51 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>;
53 using NodeRef = typename GT::NodeRef;
54 using ChildItTy = typename GT::ChildIteratorType;
85 ChildIt.emplace(GT::child_begin(Node));
86 while (*ChildIt != GT::child_end(Node)) {
115 return bf_iterator(GT::getEntryNode(G));
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| SCCIterator.h | 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 using NodeRef = typename GT::NodeRef;
47 using ChildItTy = typename GT::ChildIteratorType;
103 return scc_iterator(GT::getEntryNode(G));
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 template <class GraphT, class GT>
[all...] |
| BreadthFirstIterator.h | 47 class GT = GraphTraits<GraphT>>
49 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
51 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>;
53 using NodeRef = typename GT::NodeRef;
54 using ChildItTy = typename GT::ChildIteratorType;
85 ChildIt.emplace(GT::child_begin(Node));
86 while (*ChildIt != GT::child_end(Node)) {
115 return bf_iterator(GT::getEntryNode(G));
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| SCCIterator.h | 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 using NodeRef = typename GT::NodeRef;
47 using ChildItTy = typename GT::ChildIteratorType;
103 return scc_iterator(GT::getEntryNode(G));
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 template <class GraphT, class GT>
[all...] |
| BreadthFirstIterator.h | 47 class GT = GraphTraits<GraphT>>
49 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
51 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>;
53 using NodeRef = typename GT::NodeRef;
54 using ChildItTy = typename GT::ChildIteratorType;
85 ChildIt.emplace(GT::child_begin(Node));
86 while (*ChildIt != GT::child_end(Node)) {
115 return bf_iterator(GT::getEntryNode(G));
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| SCCIterator.h | 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 using NodeRef = typename GT::NodeRef;
47 using ChildItTy = typename GT::ChildIteratorType;
103 return scc_iterator(GT::getEntryNode(G));
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 template <class GraphT, class GT>
[all...] |
| BreadthFirstIterator.h | 47 class GT = GraphTraits<GraphT>>
49 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
51 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>;
53 using NodeRef = typename GT::NodeRef;
54 using ChildItTy = typename GT::ChildIteratorType;
85 ChildIt.emplace(GT::child_begin(Node));
86 while (*ChildIt != GT::child_end(Node)) {
115 return bf_iterator(GT::getEntryNode(G));
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| SCCIterator.h | 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 using NodeRef = typename GT::NodeRef;
47 using ChildItTy = typename GT::ChildIteratorType;
103 return scc_iterator(GT::getEntryNode(G));
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 template <class GraphT, class GT>
[all...] |
| BreadthFirstIterator.h | 47 class GT = GraphTraits<GraphT>>
49 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
51 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>;
53 using NodeRef = typename GT::NodeRef;
54 using ChildItTy = typename GT::ChildIteratorType;
85 ChildIt.emplace(GT::child_begin(Node));
86 while (*ChildIt != GT::child_end(Node)) {
115 return bf_iterator(GT::getEntryNode(G));
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| SCCIterator.h | 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 using NodeRef = typename GT::NodeRef;
47 using ChildItTy = typename GT::ChildIteratorType;
103 return scc_iterator(GT::getEntryNode(G));
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 template <class GraphT, class GT>
[all...] |
| BreadthFirstIterator.h | 47 class GT = GraphTraits<GraphT>>
49 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
51 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>;
53 using NodeRef = typename GT::NodeRef;
54 using ChildItTy = typename GT::ChildIteratorType;
85 ChildIt.emplace(GT::child_begin(Node));
86 while (*ChildIt != GT::child_end(Node)) {
115 return bf_iterator(GT::getEntryNode(G));
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| SCCIterator.h | 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 typedef typename GT::NodeRef NodeRef;
47 typedef typename GT::ChildIteratorType ChildItTy;
103 return scc_iterator(GT::getEntryNode(G));
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 template <class GraphT, class GT>
[all...] |
| BreadthFirstIterator.h | 48 class GT = GraphTraits<GraphT>>
50 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
52 typedef std::iterator<std::forward_iterator_tag, typename GT::NodeRef> super;
54 typedef typename GT::NodeRef NodeRef;
55 typedef typename GT::ChildIteratorType ChildItTy;
86 ChildIt.emplace(GT::child_begin(Node));
87 while (*ChildIt != GT::child_end(Node)) {
116 return bf_iterator(GT::getEntryNode(G));
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| SCCIterator.h | 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 using NodeRef = typename GT::NodeRef;
47 using ChildItTy = typename GT::ChildIteratorType;
103 return scc_iterator(GT::getEntryNode(G));
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 template <class GraphT, class GT>
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| SCCIterator.h | 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 using NodeRef = typename GT::NodeRef;
47 using ChildItTy = typename GT::ChildIteratorType;
103 return scc_iterator(GT::getEntryNode(G));
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 template <class GraphT, class GT>
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| SCCIterator.h | 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 using NodeRef = typename GT::NodeRef;
47 using ChildItTy = typename GT::ChildIteratorType;
103 return scc_iterator(GT::getEntryNode(G));
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 template <class GraphT, class GT>
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| SCCIterator.h | 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 using NodeRef = typename GT::NodeRef;
47 using ChildItTy = typename GT::ChildIteratorType;
103 return scc_iterator(GT::getEntryNode(G));
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 template <class GraphT, class GT>
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| SCCIterator.h | 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 using NodeRef = typename GT::NodeRef;
47 using ChildItTy = typename GT::ChildIteratorType;
103 return scc_iterator(GT::getEntryNode(G));
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 template <class GraphT, class GT>
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| SCCIterator.h | 42 template <class GraphT, class GT = GraphTraits<GraphT>>
44 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 using NodeRef = typename GT::NodeRef;
47 using ChildItTy = typename GT::ChildIteratorType;
103 return scc_iterator(GT::getEntryNode(G));
143 template <class GraphT, class GT>
144 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) {
148 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 template <class GraphT, class GT>
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| SCCIterator.h | 35 template<class GraphT, class GT = GraphTraits<GraphT> >
38 std::vector<typename GT::NodeType>, ptrdiff_t> {
39 typedef typename GT::NodeType NodeType;
40 typedef typename GT::ChildIteratorType ChildItTy;
43 std::vector<typename GT::NodeType>, ptrdiff_t> super;
74 VisitStack.push_back(std::make_pair(N, GT::child_begin(N)));
82 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
103 assert(VisitStack.back().second ==GT::child_end(VisitStack.back().first));
138 typedef scc_iterator<GraphT, GT> _Self;
141 static inline _Self begin(const GraphT &G){return _Self(GT::getEntryNode(G));
[all...] |
