Hawkin
/
arangodb
mirror of https://gitee.com/bigwinds/arangodb
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

moving function

This commit is contained in:
James 2014-11-23 14:16:40 +00:00
parent 7e51c27b95
commit 703cfa3a16
1 changed files with 47 additions and 46 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

93
arangod/Aql/RangeInfo.cpp
View File

@ -537,6 +537,53 @@ std::unordered_set<std::string> RangeInfoMapVec::attributes (std::string const&
return _rangeInfoMapVec[0]->attributes(var); return _rangeInfoMapVec[0]->attributes(var);
} }
////////////////////////////////////////////////////////////////////////////////
/// @brief orCombineRangeInfoMapVecs: return a new RangeInfoMapVec appending
/// those RIMs in the right arg (which are not identical to an existing RIM) in
/// a copy of the left arg.
///
/// The return RIMV is new unless one of the arguments is empty.
////////////////////////////////////////////////////////////////////////////////
RangeInfoMapVec* triagens::aql::orCombineRangeInfoMapVecs (RangeInfoMapVec* lhs,
RangeInfoMapVec* rhs) {
if (lhs->empty()) {
return rhs;
}
if (rhs->empty()) {
return lhs;
}
auto rimv = new RangeInfoMapVec();
// this lhs already doesn't contain duplicate conditions
for (size_t i = 0; i < lhs->size(); i++) {
rimv->emplace_back((*lhs)[i]->clone());
}
//avoid inserting identical conditions
for (size_t i = 0; i < rhs->size(); i++) {
auto rim = new RangeInfoMap();
for (auto x: (*rhs)[i]->_ranges) {
for (auto y: x.second) {
// take the difference of
RangeInfo* ri = rimv->differenceRangeInfo(&y.second);
if (ri != nullptr) {
// if ri is nullptr, then y.second is contained in an existing ri
rim->insert(*ri);
}
}
}
if (! rim->empty()) {
rimv->emplace_back(rim);
}
}
return rimv;
}
//////////////////////////////////////////////////////////////////////////////// ////////////////////////////////////////////////////////////////////////////////
/// @brief andCombineRangeInfoMaps: insert every RangeInfo in the right argument /// @brief andCombineRangeInfoMaps: insert every RangeInfo in the right argument
/// in a new copy of the left argument /// in a new copy of the left argument
@ -666,52 +713,6 @@ RangeInfo* RangeInfoMapVec::differenceRangeInfo (RangeInfo* newRi) {
return newRi; return newRi;
} }
////////////////////////////////////////////////////////////////////////////////
/// @brief orCombineRangeInfoMapVecs: return a new RangeInfoMapVec appending
/// those RIMs in the right arg (which are not identical to an existing RIM) in
/// a copy of the left arg.
///
/// The return RIMV is new unless one of the arguments is empty.
////////////////////////////////////////////////////////////////////////////////
RangeInfoMapVec* triagens::aql::orCombineRangeInfoMapVecs (RangeInfoMapVec* lhs,
RangeInfoMapVec* rhs) {
if (lhs->empty()) {
return rhs;
}
if (rhs->empty()) {
return lhs;
}
auto rimv = new RangeInfoMapVec();
// this lhs already doesn't contain duplicate conditions
for (size_t i = 0; i < lhs->size(); i++) {
rimv->emplace_back((*lhs)[i]->clone());
}
//avoid inserting identical conditions
for (size_t i = 0; i < rhs->size(); i++) {
auto rim = new RangeInfoMap();
for (auto x: (*rhs)[i]->_ranges) {
for (auto y: x.second) {
// take the difference of
RangeInfo* ri = rimv->differenceRangeInfo(&y.second);
if (ri != nullptr) {
// if ri is nullptr, then y.second is contained in an existing ri
rim->insert(*ri);
}
}
}
if (! rim->empty()) {
rimv->emplace_back(rim);
}
}
return rimv;
}
//////////////////////////////////////////////////////////////////////////////// ////////////////////////////////////////////////////////////////////////////////
/// @brief differenceIndexOrAndRangeInfo: analogue of differenceRangeInfo /// @brief differenceIndexOrAndRangeInfo: analogue of differenceRangeInfo