int BlockMgr::findBlockedOverlaps(RecordKeyVector &keyList, RecordKeyVector &hitList, RecordKeyVector &resultList)
{
bool deleteKeyBlocks = false;
if (keyList.empty()) {
//get all the blocks for the query record, put them in it's list.
getBlocks(keyList, deleteKeyBlocks);
}
_overlapBases.clear();
int keyBlocksSumLength = getTotalBlockLength(keyList);
//Loop through every database record the query intersected with
for (RecordKeyVector::const_iterator_type hitListIter = hitList.begin(); hitListIter != hitList.end(); hitListIter = hitList.next()) {
RecordKeyVector hitBlocks(*hitListIter);
bool deleteHitBlocks = false;
getBlocks(hitBlocks, deleteHitBlocks); //get all blocks for the hit record.
int hitBlockSumLength = getTotalBlockLength(hitBlocks); //get total length of the bocks for the hitRecord.
int totalHitOverlap = 0;
bool hitHasOverlap = false;
//loop through every block of the database record.
for (RecordKeyVector::const_iterator_type hitBlockIter = hitBlocks.begin(); hitBlockIter != hitBlocks.end(); hitBlockIter = hitBlocks.next()) {
//loop through every block of the query record.
for (RecordKeyVector::const_iterator_type keyListIter = keyList.begin(); keyListIter != keyList.end(); keyListIter = keyList.next()) {
const Record *keyBlock = *keyListIter;
const Record *hitBlock = *hitBlockIter;
int maxStart = max(keyBlock->getStartPos(), hitBlock->getStartPos());
int minEnd = min(keyBlock->getEndPos(), hitBlock->getEndPos());
int overlap = minEnd - maxStart;
if (overlap > 0) {
hitHasOverlap = true;
totalHitOverlap += overlap;
}
}
}
if (hitHasOverlap) {
if ((float) totalHitOverlap / (float)keyBlocksSumLength >= _overlapFraction) {
if (_hasReciprocal &&
((float)totalHitOverlap / (float)hitBlockSumLength >= _overlapFraction)) {
_overlapBases.push_back(totalHitOverlap);
resultList.push_back(*hitListIter);
} else if (!_hasReciprocal) {
_overlapBases.push_back(totalHitOverlap);
resultList.push_back(*hitListIter);
}
}
}
if (deleteHitBlocks) {
deleteBlocks(hitBlocks);
}
}
if (deleteKeyBlocks) {
deleteBlocks(keyList);
}
resultList.setKey(keyList.getKey());
return (int)resultList.size();
}
int BlockMgr::findBlockedOverlaps(RecordKeyVector &hitList, bool useOverlappingSubBlocks)
{
RecordKeyVector keyList(hitList.getKey());
bool deleteKeyBlocks = true;
getBlocks(keyList, deleteKeyBlocks);
_overlapBases.clear();
int keyBlocksSumLength = getTotalBlockLength(keyList);
//Loop through every database record the query intersected with
RecordKeyVector::iterator_type hitListIter = hitList.begin();
for (; hitListIter != hitList.end();)
{
RecordKeyVector hitBlocks(*hitListIter);
bool deleteHitBlocks = false;
getBlocks(hitBlocks, deleteHitBlocks); //get all blocks for the hit record.
int hitBlockSumLength = getTotalBlockLength(hitBlocks); //get total length of the bocks for the hitRecord.
int totalHitOverlap = 0;
bool hitHasOverlap = false;
//loop through every block of the database record.
RecordKeyVector::iterator_type hitBlockIter = hitBlocks.begin();
for (; hitBlockIter != hitBlocks.end(); hitBlockIter = hitBlocks.next())
{
//loop through every block of the query record.
RecordKeyVector::iterator_type keyListIter = keyList.begin();
for (; keyListIter != keyList.end(); keyListIter = keyList.next())
{
const Record *keyBlock = *keyListIter;
const Record *hitBlock = *hitBlockIter;
int maxStart = max(keyBlock->getStartPos(), hitBlock->getStartPos());
int minEnd = min(keyBlock->getEndPos(), hitBlock->getEndPos());
int overlap = minEnd - maxStart;
if (overlap > 0)
{
hitHasOverlap = true;
totalHitOverlap += overlap;
if (useOverlappingSubBlocks == true)
{
(*hitListIter)->block_starts.push_back(maxStart);
(*hitListIter)->block_ends.push_back(minEnd);
}
}
}
}
if (hitHasOverlap && useOverlappingSubBlocks == false)
{
bool enoughKeyOverlap = (float) totalHitOverlap / (float) keyBlocksSumLength >= _overlapFraction;
bool enoughHitOverlap = (float) totalHitOverlap / (float) hitBlockSumLength >= _overlapFraction;
if (enoughKeyOverlap)
{
if (_hasReciprocal && enoughHitOverlap)
{
//(*hitListIter)->setValid(true);
_overlapBases.push_back(totalHitOverlap);
hitListIter = hitList.next();
}
else if (_hasReciprocal && !enoughHitOverlap)
{
hitList.erase();
//(*hitListIter)->setValid(false);
}
else if (!_hasReciprocal)
{
//(*hitListIter)->setValid(true);
_overlapBases.push_back(totalHitOverlap);
hitListIter = hitList.next();
}
}
else
{
hitList.erase();
//(*hitListIter)->setValid(false);
}
}
else if (!hitHasOverlap && useOverlappingSubBlocks == false)
{
hitList.erase();
//(*hitListIter)->setValid(false);
}
else {
hitListIter = hitList.next();
}
if (deleteHitBlocks)
{
deleteBlocks(hitBlocks);
}
} // end for loop through main hits
if (deleteKeyBlocks)
{
deleteBlocks(keyList);
}
return (int)hitList.size();
}
