lbug 0.15.4

An in-process property graph database management system built for query speed and scalability
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

#include "binder/rewriter/match_clause_pattern_label_rewriter.h"

#include "binder/query/reading_clause/bound_match_clause.h"

using namespace lbug::common;

namespace lbug {
namespace binder {

void MatchClausePatternLabelRewriter::visitMatchUnsafe(BoundReadingClause& readingClause) {
    auto& matchClause = readingClause.cast<BoundMatchClause>();
    if (matchClause.getMatchClauseType() == MatchClauseType::OPTIONAL_MATCH) {
        return;
    }
    auto collection = matchClause.getQueryGraphCollectionUnsafe();
    for (auto i = 0u; i < collection->getNumQueryGraphs(); ++i) {
        analyzer.pruneLabel(*collection->getQueryGraphUnsafe(i));
    }
}

} // namespace binder
} // namespace lbug