mirror of
https://github.com/mariadb-corporation/mariadb-columnstore-engine.git
synced 2025-04-18 21:44:02 +03:00
This patch introduces an internal aggregate operator SELECT_SOME that is automatically added to columns that are not in GROUP BY. It "computes" some plausible value of the column (actually, last one passed). Along the way it fixes incorrect handling of HAVING being transferred into WHERE, window function handling and a bit of other inconsistencies.
681 lines
16 KiB
C++
681 lines
16 KiB
C++
/* Copyright (C) 2014 InfiniDB, Inc.
|
|
Copyright (C) 2019 MariaDB Corporation
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU General Public License
|
|
as published by the Free Software Foundation; version 2 of
|
|
the License.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
|
|
MA 02110-1301, USA. */
|
|
|
|
/***********************************************************************
|
|
* $Id: aggregatecolumn.cpp 9679 2013-07-11 22:32:03Z zzhu $
|
|
*
|
|
*
|
|
***********************************************************************/
|
|
#include <sstream>
|
|
#include <cstring>
|
|
using namespace std;
|
|
|
|
#include <boost/algorithm/string/case_conv.hpp>
|
|
using namespace boost;
|
|
|
|
#include "bytestream.h"
|
|
using namespace messageqcpp;
|
|
|
|
#include "rowgroup.h"
|
|
using namespace rowgroup;
|
|
|
|
#include "joblisttypes.h"
|
|
using namespace joblist;
|
|
|
|
#include "aggregatecolumn.h"
|
|
#include "simplefilter.h"
|
|
#include "constantfilter.h"
|
|
#include "arithmeticcolumn.h"
|
|
#include "functioncolumn.h"
|
|
#include "objectreader.h"
|
|
|
|
namespace execplan
|
|
{
|
|
|
|
void getAggCols(execplan::ParseTree* n, void* obj)
|
|
{
|
|
vector<AggregateColumn*>* list = reinterpret_cast<vector<AggregateColumn*>*>(obj);
|
|
TreeNode* tn = n->data();
|
|
AggregateColumn* sc = dynamic_cast<AggregateColumn*>(tn);
|
|
FunctionColumn* fc = dynamic_cast<FunctionColumn*>(tn);
|
|
ArithmeticColumn* ac = dynamic_cast<ArithmeticColumn*>(tn);
|
|
SimpleFilter* sf = dynamic_cast<SimpleFilter*>(tn);
|
|
ConstantFilter* cf = dynamic_cast<ConstantFilter*>(tn);
|
|
|
|
if (sc)
|
|
{
|
|
list->push_back(sc);
|
|
}
|
|
else if (fc)
|
|
{
|
|
fc->hasAggregate();
|
|
list->insert(list->end(), fc->aggColumnList().begin(), fc->aggColumnList().end());
|
|
}
|
|
else if (ac)
|
|
{
|
|
ac->hasAggregate();
|
|
list->insert(list->end(), ac->aggColumnList().begin(), ac->aggColumnList().end());
|
|
}
|
|
else if (sf)
|
|
{
|
|
sf->hasAggregate();
|
|
list->insert(list->end(), sf->aggColumnList().begin(), sf->aggColumnList().end());
|
|
}
|
|
else if (cf)
|
|
{
|
|
cf->hasAggregate();
|
|
list->insert(list->end(), cf->aggColumnList().begin(), cf->aggColumnList().end());
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Constructors/Destructors
|
|
*/
|
|
AggregateColumn::AggregateColumn() : fAggOp(NOOP), fAsc(false)
|
|
{
|
|
}
|
|
|
|
AggregateColumn::AggregateColumn(const uint32_t sessionID)
|
|
: ReturnedColumn(sessionID), fAggOp(NOOP), fAsc(false)
|
|
{
|
|
}
|
|
|
|
// deprecated constructor. use function name as string
|
|
AggregateColumn::AggregateColumn(const string& functionName, const string& content, const uint32_t sessionID)
|
|
: ReturnedColumn(sessionID)
|
|
, fFunctionName(functionName)
|
|
, fAggOp(NOOP)
|
|
, fAsc(false)
|
|
, fData(functionName + "(" + content + ")")
|
|
{
|
|
// TODO: need to handle distinct
|
|
SRCP srcp(new ArithmeticColumn(content));
|
|
fAggParms.push_back(srcp);
|
|
}
|
|
|
|
AggregateColumn::AggregateColumn(const AggregateColumn& rhs, const uint32_t sessionID)
|
|
: ReturnedColumn(rhs, sessionID)
|
|
, fFunctionName(rhs.fFunctionName)
|
|
, fAggOp(rhs.fAggOp)
|
|
, fTableAlias(rhs.tableAlias())
|
|
, fAsc(rhs.asc())
|
|
, fData(rhs.data())
|
|
, fConstCol(rhs.fConstCol)
|
|
, fTimeZone(rhs.timeZone())
|
|
{
|
|
fAlias = rhs.alias();
|
|
fAggParms = rhs.fAggParms;
|
|
}
|
|
|
|
/**
|
|
* Methods
|
|
*/
|
|
|
|
const string AggregateColumn::toString() const
|
|
{
|
|
ostringstream output;
|
|
output << "AggregateColumn " << data() << endl;
|
|
output << "func/distinct: " << (int)fAggOp << "/" << fDistinct << endl;
|
|
output << "expressionId=" << fExpressionId << endl;
|
|
|
|
if (fAlias.length() > 0)
|
|
output << "/Alias: " << fAlias << endl;
|
|
|
|
if (fAggParms.size() == 0)
|
|
output << "No arguments";
|
|
else
|
|
for (uint32_t i = 0; i < fAggParms.size(); ++i)
|
|
{
|
|
output << *(fAggParms[i]) << " ";
|
|
}
|
|
|
|
output << endl;
|
|
|
|
if (fConstCol)
|
|
output << *fConstCol;
|
|
|
|
return output.str();
|
|
}
|
|
|
|
string AggregateColumn::toCppCode(IncludeSet& includes) const
|
|
{
|
|
includes.insert("aggregatecolumn.h");
|
|
stringstream ss;
|
|
auto fContent = fData.substr(fFunctionName.size() + 1, fData.size() - fFunctionName.size() - 2);
|
|
|
|
ss << "AggregateColumn(" << std::quoted(fFunctionName) << ", " << std::quoted(fContent) << ", " << sessionID() << ")";
|
|
|
|
return ss.str();
|
|
}
|
|
|
|
ostream& operator<<(ostream& output, const AggregateColumn& rhs)
|
|
{
|
|
output << rhs.toString();
|
|
return output;
|
|
}
|
|
|
|
void AggregateColumn::serialize(messageqcpp::ByteStream& b) const
|
|
{
|
|
CalpontSelectExecutionPlan::ReturnedColumnList::const_iterator rcit;
|
|
b << (uint8_t)ObjectReader::AGGREGATECOLUMN;
|
|
ReturnedColumn::serialize(b);
|
|
b << fFunctionName;
|
|
b << static_cast<uint8_t>(fAggOp);
|
|
|
|
b << static_cast<uint32_t>(fAggParms.size());
|
|
|
|
for (uint32_t i = 0; i < fAggParms.size(); ++i)
|
|
{
|
|
fAggParms[i]->serialize(b);
|
|
}
|
|
|
|
b << static_cast<uint32_t>(fGroupByColList.size());
|
|
|
|
for (rcit = fGroupByColList.begin(); rcit != fGroupByColList.end(); ++rcit)
|
|
(*rcit)->serialize(b);
|
|
|
|
b << static_cast<uint32_t>(fProjectColList.size());
|
|
|
|
for (rcit = fProjectColList.begin(); rcit != fProjectColList.end(); ++rcit)
|
|
(*rcit)->serialize(b);
|
|
|
|
b << fData;
|
|
messageqcpp::ByteStream::octbyte timeZone = fTimeZone;
|
|
b << timeZone;
|
|
// b << fAlias;
|
|
b << fTableAlias;
|
|
b << static_cast<ByteStream::doublebyte>(fAsc);
|
|
|
|
if (fConstCol.get() == 0)
|
|
b << (uint8_t)ObjectReader::NULL_CLASS;
|
|
else
|
|
fConstCol->serialize(b);
|
|
}
|
|
|
|
void AggregateColumn::unserialize(messageqcpp::ByteStream& b)
|
|
{
|
|
messageqcpp::ByteStream::quadbyte size;
|
|
messageqcpp::ByteStream::quadbyte i;
|
|
ReturnedColumn* rc;
|
|
|
|
ObjectReader::checkType(b, ObjectReader::AGGREGATECOLUMN);
|
|
fGroupByColList.erase(fGroupByColList.begin(), fGroupByColList.end());
|
|
fProjectColList.erase(fProjectColList.begin(), fProjectColList.end());
|
|
fAggParms.erase(fAggParms.begin(), fAggParms.end());
|
|
ReturnedColumn::unserialize(b);
|
|
b >> fFunctionName;
|
|
b >> fAggOp;
|
|
|
|
b >> size;
|
|
|
|
for (i = 0; i < size; i++)
|
|
{
|
|
rc = dynamic_cast<ReturnedColumn*>(ObjectReader::createTreeNode(b));
|
|
SRCP srcp(rc);
|
|
fAggParms.push_back(srcp);
|
|
}
|
|
|
|
b >> size;
|
|
|
|
for (i = 0; i < size; i++)
|
|
{
|
|
rc = dynamic_cast<ReturnedColumn*>(ObjectReader::createTreeNode(b));
|
|
SRCP srcp(rc);
|
|
fGroupByColList.push_back(srcp);
|
|
}
|
|
|
|
b >> size;
|
|
|
|
for (i = 0; i < size; i++)
|
|
{
|
|
rc = dynamic_cast<ReturnedColumn*>(ObjectReader::createTreeNode(b));
|
|
SRCP srcp(rc);
|
|
fProjectColList.push_back(srcp);
|
|
}
|
|
|
|
b >> fData;
|
|
messageqcpp::ByteStream::octbyte timeZone;
|
|
b >> timeZone;
|
|
fTimeZone = timeZone;
|
|
// b >> fAlias;
|
|
b >> fTableAlias;
|
|
b >> reinterpret_cast<ByteStream::doublebyte&>(fAsc);
|
|
fConstCol.reset(dynamic_cast<ReturnedColumn*>(ObjectReader::createTreeNode(b)));
|
|
}
|
|
|
|
bool AggregateColumn::operator==(const AggregateColumn& t) const
|
|
{
|
|
const ReturnedColumn *rc1, *rc2;
|
|
AggParms::const_iterator it, it2;
|
|
|
|
rc1 = static_cast<const ReturnedColumn*>(this);
|
|
rc2 = static_cast<const ReturnedColumn*>(&t);
|
|
|
|
if (*rc1 != *rc2)
|
|
return false;
|
|
|
|
if (fFunctionName != t.fFunctionName)
|
|
return false;
|
|
|
|
if (fAggOp == COUNT_ASTERISK && t.fAggOp == COUNT_ASTERISK)
|
|
return true;
|
|
|
|
if (fAggOp != t.fAggOp)
|
|
return false;
|
|
|
|
if (aggParms().size() != t.aggParms().size())
|
|
{
|
|
return false;
|
|
}
|
|
|
|
for (it = fAggParms.begin(), it2 = t.fAggParms.begin(); it != fAggParms.end(); ++it, ++it2)
|
|
{
|
|
if (**it != **it2)
|
|
return false;
|
|
}
|
|
|
|
if (fTableAlias != t.fTableAlias)
|
|
return false;
|
|
|
|
if (fData != t.fData)
|
|
return false;
|
|
|
|
if (fAsc != t.fAsc)
|
|
return false;
|
|
|
|
if ((fConstCol.get() != NULL && t.fConstCol.get() == NULL) ||
|
|
(fConstCol.get() == NULL && t.fConstCol.get() != NULL) ||
|
|
(fConstCol.get() != NULL && t.fConstCol.get() != NULL && *(fConstCol.get()) != t.fConstCol.get()))
|
|
return false;
|
|
|
|
if (fTimeZone != t.fTimeZone)
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
|
|
bool AggregateColumn::operator==(const TreeNode* t) const
|
|
{
|
|
const AggregateColumn* ac;
|
|
|
|
ac = dynamic_cast<const AggregateColumn*>(t);
|
|
|
|
if (ac == NULL)
|
|
return false;
|
|
|
|
return *this == *ac;
|
|
}
|
|
|
|
bool AggregateColumn::operator!=(const AggregateColumn& t) const
|
|
{
|
|
return !(*this == t);
|
|
}
|
|
|
|
bool AggregateColumn::operator!=(const TreeNode* t) const
|
|
{
|
|
return !(*this == t);
|
|
}
|
|
|
|
bool AggregateColumn::hasAggregate()
|
|
{
|
|
fAggColumnList.push_back(this);
|
|
return true;
|
|
}
|
|
|
|
void AggregateColumn::evaluate(Row& row, bool& isNull)
|
|
{
|
|
switch (fResultType.colDataType)
|
|
{
|
|
case CalpontSystemCatalog::DATE:
|
|
if (row.equals<4>(DATENULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.intVal = row.getUintField<4>(fInputIndex);
|
|
|
|
break;
|
|
|
|
case CalpontSystemCatalog::DATETIME:
|
|
if (row.equals<8>(DATETIMENULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.intVal = row.getUintField<8>(fInputIndex);
|
|
|
|
break;
|
|
|
|
case CalpontSystemCatalog::TIMESTAMP:
|
|
if (row.equals<8>(TIMESTAMPNULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.intVal = row.getUintField<8>(fInputIndex);
|
|
|
|
break;
|
|
|
|
case CalpontSystemCatalog::TIME:
|
|
if (row.equals<8>(TIMENULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.intVal = row.getIntField<8>(fInputIndex);
|
|
|
|
break;
|
|
|
|
case CalpontSystemCatalog::CHAR:
|
|
case CalpontSystemCatalog::VARCHAR:
|
|
case CalpontSystemCatalog::STRINT:
|
|
case CalpontSystemCatalog::TEXT:
|
|
switch (row.getColumnWidth(fInputIndex))
|
|
{
|
|
case 1:
|
|
if (row.equals<1>(CHAR1NULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.origIntVal = row.getUintField<1>(fInputIndex);
|
|
|
|
break;
|
|
|
|
case 2:
|
|
if (row.equals<2>(CHAR2NULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.origIntVal = row.getUintField<2>(fInputIndex);
|
|
|
|
break;
|
|
|
|
case 3:
|
|
case 4:
|
|
if (row.equals<4>(CHAR4NULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.origIntVal = row.getUintField<4>(fInputIndex);
|
|
|
|
break;
|
|
|
|
case 5:
|
|
case 6:
|
|
case 7:
|
|
case 8:
|
|
if (row.equals<8>(CHAR8NULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.origIntVal = row.getUintField<8>(fInputIndex);
|
|
|
|
break;
|
|
|
|
default:
|
|
{
|
|
auto const str = row.getConstString(fInputIndex);
|
|
fResult.strVal.dropString();
|
|
if (!str.isNull())
|
|
fResult.strVal.assign((const uint8_t*)str.str(), str.length());
|
|
|
|
isNull = isNull || fResult.strVal.isNull();
|
|
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (fResultType.colDataType == CalpontSystemCatalog::STRINT)
|
|
fResult.intVal = uint64ToStr(fResult.origIntVal);
|
|
else
|
|
fResult.intVal = atoll((char*)&fResult.origIntVal);
|
|
|
|
fResult.uintVal = fResult.intVal;
|
|
|
|
break;
|
|
|
|
case CalpontSystemCatalog::BIGINT:
|
|
if (row.equals<8>(BIGINTNULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.intVal = row.getIntField<8>(fInputIndex);
|
|
|
|
break;
|
|
|
|
case CalpontSystemCatalog::UBIGINT:
|
|
if (row.equals<8>(UBIGINTNULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.uintVal = row.getUintField<8>(fInputIndex);
|
|
|
|
break;
|
|
|
|
case CalpontSystemCatalog::INT:
|
|
case CalpontSystemCatalog::MEDINT:
|
|
if (row.equals<4>(INTNULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.intVal = row.getIntField<4>(fInputIndex);
|
|
|
|
break;
|
|
|
|
case CalpontSystemCatalog::UINT:
|
|
case CalpontSystemCatalog::UMEDINT:
|
|
if (row.equals<4>(UINTNULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.uintVal = row.getUintField<4>(fInputIndex);
|
|
|
|
break;
|
|
|
|
case CalpontSystemCatalog::SMALLINT:
|
|
if (row.equals<2>(SMALLINTNULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.intVal = row.getIntField<2>(fInputIndex);
|
|
|
|
break;
|
|
|
|
case CalpontSystemCatalog::USMALLINT:
|
|
if (row.equals<2>(USMALLINTNULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.uintVal = row.getUintField<2>(fInputIndex);
|
|
|
|
break;
|
|
|
|
case CalpontSystemCatalog::TINYINT:
|
|
if (row.equals<1>(TINYINTNULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.intVal = row.getIntField<1>(fInputIndex);
|
|
|
|
break;
|
|
|
|
case CalpontSystemCatalog::UTINYINT:
|
|
if (row.equals<1>(UTINYINTNULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.uintVal = row.getUintField<1>(fInputIndex);
|
|
|
|
break;
|
|
|
|
// In this case, we're trying to load a double output column with float data. This is the
|
|
// case when you do sum(floatcol), e.g.
|
|
case CalpontSystemCatalog::FLOAT:
|
|
case CalpontSystemCatalog::UFLOAT:
|
|
if (row.equals<4>(FLOATNULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.floatVal = row.getFloatField(fInputIndex);
|
|
|
|
break;
|
|
|
|
case CalpontSystemCatalog::DOUBLE:
|
|
case CalpontSystemCatalog::UDOUBLE:
|
|
if (row.equals<8>(DOUBLENULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.doubleVal = row.getDoubleField(fInputIndex);
|
|
|
|
break;
|
|
|
|
case CalpontSystemCatalog::LONGDOUBLE:
|
|
if (row.equals(LONGDOUBLENULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.longDoubleVal = row.getLongDoubleField(fInputIndex);
|
|
|
|
break;
|
|
|
|
case CalpontSystemCatalog::DECIMAL:
|
|
case CalpontSystemCatalog::UDECIMAL:
|
|
switch (fResultType.colWidth)
|
|
{
|
|
case 16:
|
|
{
|
|
datatypes::TSInt128 val = row.getTSInt128Field(fInputIndex);
|
|
|
|
if (val.isNull())
|
|
isNull = true;
|
|
else
|
|
fResult.decimalVal = IDB_Decimal(val, fResultType.scale, fResultType.precision);
|
|
|
|
break;
|
|
}
|
|
|
|
case 1:
|
|
if (row.equals<1>(TINYINTNULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.decimalVal =
|
|
IDB_Decimal(row.getIntField<1>(fInputIndex), fResultType.scale, fResultType.precision);
|
|
|
|
break;
|
|
|
|
case 2:
|
|
if (row.equals<2>(SMALLINTNULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.decimalVal =
|
|
IDB_Decimal(row.getIntField<2>(fInputIndex), fResultType.scale, fResultType.precision);
|
|
|
|
break;
|
|
|
|
case 4:
|
|
if (row.equals<4>(INTNULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.decimalVal =
|
|
IDB_Decimal(row.getIntField<4>(fInputIndex), fResultType.scale, fResultType.precision);
|
|
|
|
break;
|
|
|
|
default:
|
|
if (row.equals<8>(BIGINTNULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.decimalVal = IDB_Decimal((int64_t)row.getUintField<8>(fInputIndex), fResultType.scale,
|
|
fResultType.precision);
|
|
|
|
break;
|
|
}
|
|
|
|
break;
|
|
|
|
case CalpontSystemCatalog::VARBINARY:
|
|
case CalpontSystemCatalog::BLOB:
|
|
{
|
|
auto const str = row.getConstString(fInputIndex);
|
|
fResult.strVal.dropString();
|
|
if (!str.isNull())
|
|
fResult.strVal.assign((const uint8_t*)str.str(), str.length());
|
|
|
|
isNull = isNull || fResult.strVal.isNull();
|
|
}
|
|
break;
|
|
|
|
default: // treat as int64
|
|
if (row.equals<8>(BIGINTNULL, fInputIndex))
|
|
isNull = true;
|
|
else
|
|
fResult.intVal = row.getUintField<8>(fInputIndex);
|
|
|
|
break;
|
|
}
|
|
}
|
|
|
|
/*static*/
|
|
AggregateColumn::AggOp AggregateColumn::agname2num(const string& agname)
|
|
{
|
|
/*
|
|
NOOP = 0,
|
|
COUNT_ASTERISK,
|
|
COUNT,
|
|
SUM,
|
|
AVG,
|
|
MIN,
|
|
MAX,
|
|
CONSTANT,
|
|
DISTINCT_COUNT,
|
|
DISTINCT_SUM,
|
|
DISTINCT_AVG,
|
|
STDDEV_POP,
|
|
STDDEV_SAMP,
|
|
VAR_POP,
|
|
VAR_SAMP,
|
|
BIT_AND,
|
|
BIT_OR,
|
|
BIT_XOR,
|
|
GROUP_CONCAT
|
|
*/
|
|
string lfn(agname);
|
|
algorithm::to_lower(lfn);
|
|
|
|
if (lfn == "count(*)")
|
|
return COUNT_ASTERISK;
|
|
|
|
if (lfn == "count")
|
|
return COUNT;
|
|
|
|
if (lfn == "sum")
|
|
return SUM;
|
|
|
|
if (lfn == "avg")
|
|
return AVG;
|
|
|
|
if (lfn == "min")
|
|
return MIN;
|
|
|
|
if (lfn == "max")
|
|
return MAX;
|
|
|
|
if (lfn == "std")
|
|
return STDDEV_POP;
|
|
|
|
if (lfn == "stddev_pop")
|
|
return STDDEV_POP;
|
|
|
|
if (lfn == "stddev_samp")
|
|
return STDDEV_SAMP;
|
|
|
|
if (lfn == "stddev")
|
|
return STDDEV_POP;
|
|
|
|
if (lfn == "var_pop")
|
|
return VAR_POP;
|
|
|
|
if (lfn == "var_samp")
|
|
return VAR_SAMP;
|
|
|
|
if (lfn == "variance")
|
|
return VAR_POP;
|
|
|
|
return NOOP;
|
|
}
|
|
|
|
} // namespace execplan
|