Home
last modified time | relevance | path

Searched refs:m_nodesInLevel (Results 1 – 13 of 13) sorted by relevance

/dports/devel/spatialindex/spatialindex-src-1.8.5/src/mvrtree/
H A DStatistics.cc54 m_nodesInLevel = s.m_nodesInLevel; in Statistics()
78 m_nodesInLevel = s.m_nodesInLevel; in operator =()
145 return m_nodesInLevel.at(l); in getNumberOfNodesInLevel()
168 m_nodesInLevel.clear(); in reset()
188 for (size_t cLevel = 0; cLevel < s.m_nodesInLevel.size(); ++cLevel) in operator <<()
190 os << "Level " << cLevel << " pages: " << s.m_nodesInLevel[cLevel] << std::endl; in operator <<()
H A DNode.cc497 … m_pTree->m_stats.m_nodesInLevel.at(n->m_level) = m_pTree->m_stats.m_nodesInLevel[n->m_level] + 1; in insertData()
511 … m_pTree->m_stats.m_nodesInLevel.at(n->m_level) = m_pTree->m_stats.m_nodesInLevel[n->m_level] + 2; 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()
543 … m_pTree->m_stats.m_nodesInLevel.at(n->m_level) = m_pTree->m_stats.m_nodesInLevel[n->m_level] + 2; in insertData()
592 …m_pTree->m_stats.m_nodesInLevel.at(ptrCopy->m_level) = m_pTree->m_stats.m_nodesInLevel[ptrCopy->m_… in insertData()
603 …m_pTree->m_stats.m_nodesInLevel.at(ptrCopy->m_level) = m_pTree->m_stats.m_nodesInLevel[ptrCopy->m_… in insertData()
1009 … if (m_pTree->m_stats.m_nodesInLevel.at(m_level) == 1) m_pTree->m_stats.m_nodesInLevel.pop_back(); in deleteData()
1010 … else m_pTree->m_stats.m_nodesInLevel.at(m_level) = m_pTree->m_stats.m_nodesInLevel[m_level] - 1; in deleteData()
1011 m_pTree->m_stats.m_nodesInLevel.at(0) = m_pTree->m_stats.m_nodesInLevel[0] + 1; in deleteData()
[all …]
H A DStatistics.h92 std::vector<uint32_t> m_nodesInLevel; variable
H A DMVRTree.cc738 m_stats.m_nodesInLevel.push_back(1); in initNew()
874 static_cast<uint32_t>(m_stats.m_nodesInLevel.size()) in storeHeader()
945 u32I = static_cast<uint32_t>(m_stats.m_nodesInLevel.size()); in storeHeader()
949 for (size_t cLevel = 0; cLevel < m_stats.m_nodesInLevel.size(); ++cLevel) in storeHeader()
951 u32I = m_stats.m_nodesInLevel[cLevel]; in storeHeader()
1046 m_stats.m_nodesInLevel.push_back(u32I); in loadHeader()
/dports/devel/spatialindex/spatialindex-src-1.8.5/src/rtree/
H A DStatistics.cc51 m_nodesInLevel = s.m_nodesInLevel; in Statistics()
72 m_nodesInLevel = s.m_nodesInLevel; in operator =()
133 u32Nodes = m_nodesInLevel.at(l); in getNumberOfNodesInLevel()
155 m_nodesInLevel.clear(); in reset()
170 os << "Level " << u32Level << " pages: " << s.m_nodesInLevel[u32Level] << std::endl; in operator <<()
H A DRTree.cc784 if (nodesInLevel[cLevel] != m_stats.m_nodesInLevel[cLevel]) in isIndexValid()
790 nodes += m_stats.m_nodesInLevel[cLevel]; in isIndexValid()
971 m_stats.m_nodesInLevel.push_back(0); in initNew()
1135 memcpy(ptr, &(m_stats.m_nodesInLevel[cLevel]), sizeof(uint32_t)); in storeHeader()
1186 m_stats.m_nodesInLevel.push_back(cNodes); in loadHeader()
1296 m_stats.m_nodesInLevel[n->m_level] = m_stats.m_nodesInLevel.at(n->m_level) + 1; in writeNode()
1303 m_stats.m_nodesInLevel[n->m_level] = m_stats.m_nodesInLevel[n->m_level] + 1; in writeNode()
1383 m_stats.m_nodesInLevel[n->m_level] = m_stats.m_nodesInLevel[n->m_level] - 1; in deleteNode()
H A DStatistics.h86 std::vector<uint32_t> m_nodesInLevel; variable
H A DNode.cc524 m_pTree->m_stats.m_nodesInLevel[m_level] = 2; in insertData()
525 m_pTree->m_stats.m_nodesInLevel.push_back(1); in insertData()
1026 m_pTree->m_stats.m_nodesInLevel.pop_back(); in condenseTree()
1029 m_pTree->m_stats.m_nodesInLevel[m_pTree->m_stats.m_u32TreeHeight - 1] = 2; in condenseTree()
H A DBulkLoader.cc369 pTree->m_stats.m_nodesInLevel.push_back(0); in bulkLoadUsingSTR()
/dports/devel/spatialindex/spatialindex-src-1.8.5/src/tprtree/
H A DStatistics.cc51 m_nodesInLevel = s.m_nodesInLevel; in Statistics()
72 m_nodesInLevel = s.m_nodesInLevel; in operator =()
133 cNodes = m_nodesInLevel.at(l); in getNumberOfNodesInLevel()
155 m_nodesInLevel.clear(); in reset()
170 os << "Level " << cLevel << " pages: " << s.m_nodesInLevel[cLevel] << std::endl; in operator <<()
H A DTPRTree.cc568 if (nodesInLevel[cLevel] != m_stats.m_nodesInLevel[cLevel]) in isIndexValid()
574 nodes += m_stats.m_nodesInLevel[cLevel]; in isIndexValid()
760 m_stats.m_nodesInLevel.push_back(0); in initNew()
941 memcpy(ptr, &(m_stats.m_nodesInLevel[cLevel]), sizeof(uint32_t)); in storeHeader()
996 m_stats.m_nodesInLevel.push_back(cNodes); in loadHeader()
1109 m_stats.m_nodesInLevel[n->m_level] = m_stats.m_nodesInLevel.at(n->m_level) + 1; in writeNode()
1116 m_stats.m_nodesInLevel[n->m_level] = m_stats.m_nodesInLevel[n->m_level] + 1; in writeNode()
1198 m_stats.m_nodesInLevel[n->m_level] = m_stats.m_nodesInLevel[n->m_level] - 1; in deleteNode()
H A DStatistics.h86 std::vector<uint32_t> m_nodesInLevel; variable
H A DNode.cc647 m_pTree->m_stats.m_nodesInLevel[m_level] = 2; in insertData()
648 m_pTree->m_stats.m_nodesInLevel.push_back(1); in insertData()
1190 m_pTree->m_stats.m_nodesInLevel.pop_back(); in condenseTree()
1193 m_pTree->m_stats.m_nodesInLevel[m_pTree->m_stats.m_treeHeight - 1] = 2; in condenseTree()