1 /* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
2 * Use of this file is governed by the BSD 3-clause license that
3 * can be found in the LICENSE.txt file in the project root.
6 #include "Exceptions.h"
8 #include "tree/pattern/ParseTreeMatch.h"
10 using namespace antlr4::tree;
11 using namespace antlr4::tree::pattern;
13 ParseTreeMatch::ParseTreeMatch(ParseTree *tree, const ParseTreePattern &pattern,
14 const std::map<std::string, std::vector<ParseTree *>> &labels,
15 ParseTree *mismatchedNode)
16 : _tree(tree), _pattern(pattern), _labels(labels), _mismatchedNode(mismatchedNode) {
17 if (tree == nullptr) {
18 throw IllegalArgumentException("tree cannot be nul");
22 ParseTreeMatch::~ParseTreeMatch() {
25 ParseTree* ParseTreeMatch::get(const std::string &label) {
26 auto iterator = _labels.find(label);
27 if (iterator == _labels.end() || iterator->second.empty()) {
31 return iterator->second.back(); // return last if multiple
34 std::vector<ParseTree *> ParseTreeMatch::getAll(const std::string &label) {
35 auto iterator = _labels.find(label);
36 if (iterator == _labels.end()) {
40 return iterator->second;
43 std::map<std::string, std::vector<ParseTree *>>& ParseTreeMatch::getLabels() {
47 ParseTree *ParseTreeMatch::getMismatchedNode() {
48 return _mismatchedNode;
51 bool ParseTreeMatch::succeeded() {
52 return _mismatchedNode == nullptr;
55 const ParseTreePattern& ParseTreeMatch::getPattern() {
59 ParseTree * ParseTreeMatch::getTree() {
63 std::string ParseTreeMatch::toString() {
65 return "Match succeeded; found " + std::to_string(_labels.size()) + " labels";
67 return "Match failed; found " + std::to_string(_labels.size()) + " labels";