| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| BreadthFirstIterator.h | 62 std::queue<Optional<QueueElement>> VisitQueue;
73 VisitQueue.push(QueueElement(Node, None));
74 VisitQueue.push(None);
80 Optional<QueueElement> Head = VisitQueue.front();
92 VisitQueue.push(QueueElement(Next, None));
94 VisitQueue.pop();
97 if (!VisitQueue.empty()) {
98 Head = VisitQueue.front();
102 VisitQueue.pop();
106 if (!VisitQueue.empty()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| BreadthFirstIterator.h | 61 std::queue<Optional<QueueElement>> VisitQueue;
72 VisitQueue.push(QueueElement(Node, None));
73 VisitQueue.push(None);
79 Optional<QueueElement> Head = VisitQueue.front();
91 VisitQueue.push(QueueElement(Next, None));
93 VisitQueue.pop();
96 if (!VisitQueue.empty()) {
97 Head = VisitQueue.front();
101 VisitQueue.pop();
105 if (!VisitQueue.empty()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| BreadthFirstIterator.h | 61 std::queue<Optional<QueueElement>> VisitQueue;
72 VisitQueue.push(QueueElement(Node, None));
73 VisitQueue.push(None);
79 Optional<QueueElement> Head = VisitQueue.front();
91 VisitQueue.push(QueueElement(Next, None));
93 VisitQueue.pop();
96 if (!VisitQueue.empty()) {
97 Head = VisitQueue.front();
101 VisitQueue.pop();
105 if (!VisitQueue.empty()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| BreadthFirstIterator.h | 61 std::queue<Optional<QueueElement>> VisitQueue;
72 VisitQueue.push(QueueElement(Node, None));
73 VisitQueue.push(None);
79 Optional<QueueElement> Head = VisitQueue.front();
91 VisitQueue.push(QueueElement(Next, None));
93 VisitQueue.pop();
96 if (!VisitQueue.empty()) {
97 Head = VisitQueue.front();
101 VisitQueue.pop();
105 if (!VisitQueue.empty()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| BreadthFirstIterator.h | 61 std::queue<Optional<QueueElement>> VisitQueue;
72 VisitQueue.push(QueueElement(Node, None));
73 VisitQueue.push(None);
79 Optional<QueueElement> Head = VisitQueue.front();
91 VisitQueue.push(QueueElement(Next, None));
93 VisitQueue.pop();
96 if (!VisitQueue.empty()) {
97 Head = VisitQueue.front();
101 VisitQueue.pop();
105 if (!VisitQueue.empty()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| BreadthFirstIterator.h | 61 std::queue<Optional<QueueElement>> VisitQueue;
72 VisitQueue.push(QueueElement(Node, None));
73 VisitQueue.push(None);
79 Optional<QueueElement> Head = VisitQueue.front();
91 VisitQueue.push(QueueElement(Next, None));
93 VisitQueue.pop();
96 if (!VisitQueue.empty()) {
97 Head = VisitQueue.front();
101 VisitQueue.pop();
105 if (!VisitQueue.empty()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| BreadthFirstIterator.h | 61 std::queue<Optional<QueueElement>> VisitQueue;
72 VisitQueue.push(QueueElement(Node, None));
73 VisitQueue.push(None);
79 Optional<QueueElement> Head = VisitQueue.front();
91 VisitQueue.push(QueueElement(Next, None));
93 VisitQueue.pop();
96 if (!VisitQueue.empty()) {
97 Head = VisitQueue.front();
101 VisitQueue.pop();
105 if (!VisitQueue.empty()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| BreadthFirstIterator.h | 62 std::queue<Optional<QueueElement>> VisitQueue;
73 VisitQueue.push(QueueElement(Node, None));
74 VisitQueue.push(None);
80 Optional<QueueElement> Head = VisitQueue.front();
92 VisitQueue.push(QueueElement(Next, None));
94 VisitQueue.pop();
97 if (!VisitQueue.empty()) {
98 Head = VisitQueue.front();
102 VisitQueue.pop();
106 if (!VisitQueue.empty()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| BreadthFirstIterator.h | 61 std::queue<Optional<QueueElement>> VisitQueue;
72 VisitQueue.push(QueueElement(Node, None));
73 VisitQueue.push(None);
79 Optional<QueueElement> Head = VisitQueue.front();
91 VisitQueue.push(QueueElement(Next, None));
93 VisitQueue.pop();
96 if (!VisitQueue.empty()) {
97 Head = VisitQueue.front();
101 VisitQueue.pop();
105 if (!VisitQueue.empty()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| BreadthFirstIterator.h | 61 std::queue<Optional<QueueElement>> VisitQueue;
72 VisitQueue.push(QueueElement(Node, None));
73 VisitQueue.push(None);
79 Optional<QueueElement> Head = VisitQueue.front();
91 VisitQueue.push(QueueElement(Next, None));
93 VisitQueue.pop();
96 if (!VisitQueue.empty()) {
97 Head = VisitQueue.front();
101 VisitQueue.pop();
105 if (!VisitQueue.empty()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| BreadthFirstIterator.h | 61 std::queue<Optional<QueueElement>> VisitQueue;
72 VisitQueue.push(QueueElement(Node, None));
73 VisitQueue.push(None);
79 Optional<QueueElement> Head = VisitQueue.front();
91 VisitQueue.push(QueueElement(Next, None));
93 VisitQueue.pop();
96 if (!VisitQueue.empty()) {
97 Head = VisitQueue.front();
101 VisitQueue.pop();
105 if (!VisitQueue.empty()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| BreadthFirstIterator.h | 61 std::queue<Optional<QueueElement>> VisitQueue;
72 VisitQueue.push(QueueElement(Node, None));
73 VisitQueue.push(None);
79 Optional<QueueElement> Head = VisitQueue.front();
91 VisitQueue.push(QueueElement(Next, None));
93 VisitQueue.pop();
96 if (!VisitQueue.empty()) {
97 Head = VisitQueue.front();
101 VisitQueue.pop();
105 if (!VisitQueue.empty()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| BreadthFirstIterator.h | 61 std::queue<Optional<QueueElement>> VisitQueue;
72 VisitQueue.push(QueueElement(Node, None));
73 VisitQueue.push(None);
79 Optional<QueueElement> Head = VisitQueue.front();
91 VisitQueue.push(QueueElement(Next, None));
93 VisitQueue.pop();
96 if (!VisitQueue.empty()) {
97 Head = VisitQueue.front();
101 VisitQueue.pop();
105 if (!VisitQueue.empty()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| BreadthFirstIterator.h | 61 std::queue<Optional<QueueElement>> VisitQueue;
72 VisitQueue.push(QueueElement(Node, None));
73 VisitQueue.push(None);
79 Optional<QueueElement> Head = VisitQueue.front();
91 VisitQueue.push(QueueElement(Next, None));
93 VisitQueue.pop();
96 if (!VisitQueue.empty()) {
97 Head = VisitQueue.front();
101 VisitQueue.pop();
105 if (!VisitQueue.empty()
[all...] |
