support MATCH_RECOGNIZE
This commit is contained in:
File diff suppressed because it is too large
Load Diff
@ -776,6 +776,72 @@ sqlListener.prototype.enterTableValuedFunction = function (ctx) {
|
||||
// Exit a parse tree produced by sqlParser#tableValuedFunction.
|
||||
sqlListener.prototype.exitTableValuedFunction = function (ctx) {
|
||||
};
|
||||
// Enter a parse tree produced by sqlParser#matchRecognize.
|
||||
sqlListener.prototype.enterMatchRecognize = function (ctx) {
|
||||
};
|
||||
// Exit a parse tree produced by sqlParser#matchRecognize.
|
||||
sqlListener.prototype.exitMatchRecognize = function (ctx) {
|
||||
};
|
||||
// Enter a parse tree produced by sqlParser#measureColumn.
|
||||
sqlListener.prototype.enterMeasureColumn = function (ctx) {
|
||||
};
|
||||
// Exit a parse tree produced by sqlParser#measureColumn.
|
||||
sqlListener.prototype.exitMeasureColumn = function (ctx) {
|
||||
};
|
||||
// Enter a parse tree produced by sqlParser#condition1.
|
||||
sqlListener.prototype.enterCondition1 = function (ctx) {
|
||||
};
|
||||
// Exit a parse tree produced by sqlParser#condition1.
|
||||
sqlListener.prototype.exitCondition1 = function (ctx) {
|
||||
};
|
||||
// Enter a parse tree produced by sqlParser#variable.
|
||||
sqlListener.prototype.enterVariable = function (ctx) {
|
||||
};
|
||||
// Exit a parse tree produced by sqlParser#variable.
|
||||
sqlListener.prototype.exitVariable = function (ctx) {
|
||||
};
|
||||
// Enter a parse tree produced by sqlParser#pattern1.
|
||||
sqlListener.prototype.enterPattern1 = function (ctx) {
|
||||
};
|
||||
// Exit a parse tree produced by sqlParser#pattern1.
|
||||
sqlListener.prototype.exitPattern1 = function (ctx) {
|
||||
};
|
||||
// Enter a parse tree produced by sqlParser#patternTerm.
|
||||
sqlListener.prototype.enterPatternTerm = function (ctx) {
|
||||
};
|
||||
// Exit a parse tree produced by sqlParser#patternTerm.
|
||||
sqlListener.prototype.exitPatternTerm = function (ctx) {
|
||||
};
|
||||
// Enter a parse tree produced by sqlParser#patternFactor.
|
||||
sqlListener.prototype.enterPatternFactor = function (ctx) {
|
||||
};
|
||||
// Exit a parse tree produced by sqlParser#patternFactor.
|
||||
sqlListener.prototype.exitPatternFactor = function (ctx) {
|
||||
};
|
||||
// Enter a parse tree produced by sqlParser#patternQuantifier.
|
||||
sqlListener.prototype.enterPatternQuantifier = function (ctx) {
|
||||
};
|
||||
// Exit a parse tree produced by sqlParser#patternQuantifier.
|
||||
sqlListener.prototype.exitPatternQuantifier = function (ctx) {
|
||||
};
|
||||
// Enter a parse tree produced by sqlParser#minRepeat.
|
||||
sqlListener.prototype.enterMinRepeat = function (ctx) {
|
||||
};
|
||||
// Exit a parse tree produced by sqlParser#minRepeat.
|
||||
sqlListener.prototype.exitMinRepeat = function (ctx) {
|
||||
};
|
||||
// Enter a parse tree produced by sqlParser#maxRepeat.
|
||||
sqlListener.prototype.enterMaxRepeat = function (ctx) {
|
||||
};
|
||||
// Exit a parse tree produced by sqlParser#maxRepeat.
|
||||
sqlListener.prototype.exitMaxRepeat = function (ctx) {
|
||||
};
|
||||
// Enter a parse tree produced by sqlParser#repeat.
|
||||
sqlListener.prototype.enterRepeat = function (ctx) {
|
||||
};
|
||||
// Exit a parse tree produced by sqlParser#repeat.
|
||||
sqlListener.prototype.exitRepeat = function (ctx) {
|
||||
};
|
||||
// Enter a parse tree produced by sqlParser#inlineTable.
|
||||
sqlListener.prototype.enterInlineTable = function (ctx) {
|
||||
};
|
||||
|
File diff suppressed because one or more lines are too long
@ -520,6 +520,50 @@ sqlVisitor.prototype.visitInlineTableDefault2 = function (ctx) {
|
||||
sqlVisitor.prototype.visitTableValuedFunction = function (ctx) {
|
||||
return this.visitChildren(ctx);
|
||||
};
|
||||
// Visit a parse tree produced by sqlParser#matchRecognize.
|
||||
sqlVisitor.prototype.visitMatchRecognize = function (ctx) {
|
||||
return this.visitChildren(ctx);
|
||||
};
|
||||
// Visit a parse tree produced by sqlParser#measureColumn.
|
||||
sqlVisitor.prototype.visitMeasureColumn = function (ctx) {
|
||||
return this.visitChildren(ctx);
|
||||
};
|
||||
// Visit a parse tree produced by sqlParser#condition1.
|
||||
sqlVisitor.prototype.visitCondition1 = function (ctx) {
|
||||
return this.visitChildren(ctx);
|
||||
};
|
||||
// Visit a parse tree produced by sqlParser#variable.
|
||||
sqlVisitor.prototype.visitVariable = function (ctx) {
|
||||
return this.visitChildren(ctx);
|
||||
};
|
||||
// Visit a parse tree produced by sqlParser#pattern1.
|
||||
sqlVisitor.prototype.visitPattern1 = function (ctx) {
|
||||
return this.visitChildren(ctx);
|
||||
};
|
||||
// Visit a parse tree produced by sqlParser#patternTerm.
|
||||
sqlVisitor.prototype.visitPatternTerm = function (ctx) {
|
||||
return this.visitChildren(ctx);
|
||||
};
|
||||
// Visit a parse tree produced by sqlParser#patternFactor.
|
||||
sqlVisitor.prototype.visitPatternFactor = function (ctx) {
|
||||
return this.visitChildren(ctx);
|
||||
};
|
||||
// Visit a parse tree produced by sqlParser#patternQuantifier.
|
||||
sqlVisitor.prototype.visitPatternQuantifier = function (ctx) {
|
||||
return this.visitChildren(ctx);
|
||||
};
|
||||
// Visit a parse tree produced by sqlParser#minRepeat.
|
||||
sqlVisitor.prototype.visitMinRepeat = function (ctx) {
|
||||
return this.visitChildren(ctx);
|
||||
};
|
||||
// Visit a parse tree produced by sqlParser#maxRepeat.
|
||||
sqlVisitor.prototype.visitMaxRepeat = function (ctx) {
|
||||
return this.visitChildren(ctx);
|
||||
};
|
||||
// Visit a parse tree produced by sqlParser#repeat.
|
||||
sqlVisitor.prototype.visitRepeat = function (ctx) {
|
||||
return this.visitChildren(ctx);
|
||||
};
|
||||
// Visit a parse tree produced by sqlParser#inlineTable.
|
||||
sqlVisitor.prototype.visitInlineTable = function (ctx) {
|
||||
return this.visitChildren(ctx);
|
||||
|
Reference in New Issue
Block a user