338 	TimeRegionPtr ptrR = m_ptrMBR[index];  in deleteEntry()  local
360 	else if (m_pTree->m_bTightMBRs && m_nodeMBR.touchesShape(*ptrR))  in deleteEntry()
479 				NodePtr ptrR = m_pTree->m_indexPool.acquire();  in insertData()  local
480 …if (ptrR.get() == 0) ptrR = NodePtr(new Index(m_pTree, -1, ptrCopy->m_level + 1), &(m_pTree->m_ind…  in insertData()
485 					ptrR->m_level = ptrCopy->m_level + 1;  in insertData()
486 					ptrR->m_nodeMBR = m_pTree->m_infiniteRegion;  in insertData()
489 				ptrR->insertEntry(0, 0, n->m_nodeMBR, n->m_identifier);  in insertData()
490 				ptrR->insertEntry(0, 0, nn->m_nodeMBR, nn->m_identifier);  in insertData()
494 					ptrR->m_identifier = m_identifier;  in insertData()
495 					m_pTree->writeNode(ptrR.get());  in insertData()
496 					m_pTree->m_stats.m_treeHeight[m_pTree->m_stats.m_treeHeight.size() - 1] = ptrR->m_level + 1;  in insertData()
504 					m_pTree->writeNode(ptrR.get());  in insertData()
509 …m_pTree->m_roots.push_back(MVRTree::RootEntry(ptrR->m_identifier, ptrR->m_nodeMBR.m_startTime, ptr…  in insertData()
510 					m_pTree->m_stats.m_treeHeight.push_back(ptrR->m_level + 1);  in insertData()
516 …if (ptrR->m_level >= m_pTree->m_stats.m_nodesInLevel.size()) m_pTree->m_stats.m_nodesInLevel.push_…  in insertData()
517 …else m_pTree->m_stats.m_nodesInLevel.at(ptrR->m_level) = m_pTree->m_stats.m_nodesInLevel[ptrR->m_l…  in insertData()
647 	TimeRegionPtr ptrR = m_pTree->m_regionPool.acquire();  in insertData()  local
648 	*ptrR = m_nodeMBR;  in insertData()
666 …if ((! pathBuffer.empty()) && (bAdjust || ! (ptrR->containsShape(mbr1) && ptrR->containsShape(mbr2…  in insertData()