/dports/devel/spatialindex/spatialindex-src-1.8.5/src/tprtree/ |
H A D | Index.cc | 86 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in findLeaf() local 147 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in findLeastEnlargement() local 183 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in findLeastOverlap() local 196 entries[cChild]->m_index = cChild; in findLeastOverlap() 202 entries[cChild]->m_enlargement = entries[cChild]->m_ca - entries[cChild]->m_oa; in findLeastOverlap() 240 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in findLeastOverlap() local 272 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in findLeastOverlap() local 313 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in adjustTree() local 326 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in adjustTree() local 374 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in adjustTree() local [all …]
|
H A D | Node.cc | 83 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in loadFromByteArray() local 155 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in storeToByteArray() local 312 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in ~Node() local 354 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in insertEntry() local 391 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in insertEntry() local 437 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in deleteEntry() local 449 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in deleteEntry() local 923 for (cChild = 0; cChild <= m_capacity; ++cChild) in rstarSplit() 1013 for (cChild = 0; cChild <= m_capacity; ++cChild) in rstarSplit() 1019 for (cChild = 0; cChild <= m_capacity; ++cChild) in rstarSplit() [all …]
|
H A D | Leaf.cc | 58 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in findLeaf() local 62 …if (m_pIdentifier[cChild] == id /*&& mbr == *(m_ptrMBR[cChild])*/) return NodePtr(this, &(m_pTree-… in findLeaf() 132 for (uint32_t cChild = 0; cChild < n->m_children; ++cChild) in deleteData() local 137 …ree->insertData_impl(n->m_pDataLength[cChild], n->m_pData[cChild], *(n->m_ptrMBR[cChild]), n->m_pI… in deleteData() 138 n->m_pData[cChild] = 0; in deleteData()
|
H A D | PointerPoolNode.h | 96 for (uint32_t cChild = 0; cChild < p->m_children; ++cChild) in release() local 98 if (p->m_pData[cChild] != 0) delete[] p->m_pData[cChild]; in release()
|
H A D | TPRTree.cc | 520 for (uint32_t cChild = 0; cChild < e.m_pNode->m_children; ++cChild) in isIndexValid() local 524 …tmpRegion.m_pVLow[cDim] = std::min(tmpRegion.m_pVLow[cDim], e.m_pNode->m_ptrMBR[cChild]->m_pVLow[c… in isIndexValid() 544 for (uint32_t cChild = 0; cChild < e.m_pNode->m_children; ++cChild) in isIndexValid() local 546 NodePtr ptrN = readNode(e.m_pNode->m_pIdentifier[cChild]); in isIndexValid() 547 ValidateEntry tmpEntry(*(e.m_pNode->m_ptrMBR[cChild]), ptrN); in isIndexValid() 1230 for (uint32_t cChild = 0; cChild < n->m_children; ++cChild) in rangeQuery() local 1233 if (type == ContainmentQuery) b = mr->containsRegionInTime(*(n->m_ptrMBR[cChild])); in rangeQuery() 1234 else b = mr->intersectsRegionInTime(*(n->m_ptrMBR[cChild])); in rangeQuery() 1238 …Data data = Data(n->m_pDataLength[cChild], n->m_pData[cChild], *(n->m_ptrMBR[cChild]), n->m_pIdent… in rangeQuery() 1248 for (uint32_t cChild = 0; cChild < n->m_children; ++cChild) in rangeQuery() local [all …]
|
/dports/devel/spatialindex/spatialindex-src-1.8.5/src/rtree/ |
H A D | Index.cc | 89 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in findLeaf() local 153 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in findLeastEnlargement() local 163 best = cChild; in findLeastEnlargement() 185 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in findLeastOverlap() local 198 entries[cChild]->m_index = cChild; in findLeastOverlap() 199 entries[cChild]->m_original = m_ptrMBR[cChild]; in findLeastOverlap() 204 entries[cChild]->m_enlargement = entries[cChild]->m_ca - entries[cChild]->m_oa; in findLeastOverlap() 242 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in findLeastOverlap() local 274 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in findLeastOverlap() local 310 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in adjustTree() local [all …]
|
H A D | Leaf.cc | 57 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in findLeaf() local 61 …if (m_pIdentifier[cChild] == id && mbr == *(m_ptrMBR[cChild])) return NodePtr(this, &(m_pTree->m_l… in findLeaf() 135 for (uint32_t cChild = 0; cChild < n->m_children; ++cChild) in deleteData() local 140 …ree->insertData_impl(n->m_pDataLength[cChild], n->m_pData[cChild], *(n->m_ptrMBR[cChild]), n->m_pI… in deleteData() 141 n->m_pData[cChild] = 0; in deleteData()
|
H A D | RTree.cc | 473 for (uint32_t cChild = 0; cChild < n->m_children; ++cChild) in containsWhatQuery() local 477 …Data data = Data(n->m_pDataLength[cChild], n->m_pData[cChild], *(n->m_ptrMBR[cChild]), n->m_pIdent… in containsWhatQuery() 493 for (uint32_t cChild = 0; cChild < n->m_children; ++cChild) in containsWhatQuery() local 551 for (uint32_t cChild = 0; cChild < n->m_children; ++cChild) in nearestNeighborQuery() local 555 …Data* e = new Data(n->m_pDataLength[cChild], n->m_pData[cChild], *(n->m_ptrMBR[cChild]), n->m_pIde… in nearestNeighborQuery() 740 for (uint32_t cChild = 0; cChild < e.m_pNode->m_children; ++cChild) in isIndexValid() local 760 for (uint32_t cChild = 0; cChild < e.m_pNode->m_children; ++cChild) in isIndexValid() local 1410 for (uint32_t cChild = 0; cChild < n->m_children; ++cChild) in rangeQuery() local 1428 for (uint32_t cChild = 0; cChild < n->m_children; ++cChild) in rangeQuery() local 1490 for (uint32_t cChild = 0; cChild < n->m_children; ++cChild) in visitSubTree() local [all …]
|
H A D | PointerPoolNode.h | 97 for (uint32_t cChild = 0; cChild < p->m_children; ++cChild) in release() local 102 if (p->m_pData[cChild] != 0) delete[] p->m_pData[cChild]; in release()
|
H A D | BulkLoader.cc | 458 for (size_t cChild = 0; cChild < e.size(); ++cChild) in createNode() local 460 n->insertEntry(e[cChild]->m_len, e[cChild]->m_pData, e[cChild]->m_r, e[cChild]->m_id); in createNode() 461 e[cChild]->m_pData = 0; in createNode() 462 delete e[cChild]; in createNode()
|
/dports/devel/spatialindex/spatialindex-src-1.8.5/src/mvrtree/ |
H A D | Node.cc | 84 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in loadFromByteArray() local 150 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in storeToByteArray() local 299 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in ~Node() local 1114 for (cChild = 0; cChild < cTotal; ++cChild) in rtreeSplit() 1127 for (cChild = 0; cChild < cTotal; ++cChild) in rtreeSplit() 1152 for (cChild = 0; cChild < cTotal; ++cChild) in rtreeSplit() 1266 for (cChild = 0; cChild < cTotal; ++cChild) in rstarSplit() 1343 for (cChild = 0; cChild < cTotal; ++cChild) in rstarSplit() 1349 for (cChild = 0; cChild < cTotal; ++cChild) in rstarSplit() 1440 for (cChild = 1; cChild < total; ++cChild) in pickSeeds() [all …]
|
H A D | Index.cc | 90 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in findLeaf() local 161 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in findLeastEnlargement() local 168 double a = m_ptrMBR[cChild]->getArea(); in findLeastEnlargement() 174 best = cChild; in findLeastEnlargement() 206 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in findLeastOverlap() local 275 for (uint32_t cChild = 0; cChild < cLiveEntries; ++cChild) in findLeastOverlap() local 277 if (cIndex != cChild) in findLeastOverlap() 307 for (uint32_t cChild = 0; cChild < cLiveEntries; ++cChild) in findLeastOverlap() local 309 delete entries[cChild]; in findLeastOverlap() 350 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in adjustTree() local [all …]
|
H A D | PointerPoolNode.h | 95 for (uint32_t cChild = 0; cChild < p->m_children; ++cChild) in release() local 97 if (p->m_pData[cChild] != 0) delete[] p->m_pData[cChild]; in release()
|
H A D | Leaf.cc | 54 for (uint32_t cChild = 0; cChild < m_children; ++cChild) in findLeaf() local 58 …if (m_pIdentifier[cChild] == id && static_cast<Region>(mbr) == static_cast<Region>(*(m_ptrMBR[cChi… in findLeaf()
|
H A D | MVRTree.cc | 512 for (uint32_t cChild = 0; cChild < e.m_pNode->m_children; ++cChild) in isIndexValid() local 540 for (uint32_t cChild = 0; cChild < e.m_pNode->m_children; ++cChild) in isIndexValid() local 1266 for (uint32_t cChild = 0; cChild < n->m_children; ++cChild) in rangeQuery() local 1271 …== ContainmentQuery) b = (n->m_ptrMBR[cChild])->intersectsInterval(*ti) && query.containsShape(*(n… in rangeQuery() 1272 …else b = (n->m_ptrMBR[cChild])->intersectsInterval(*ti) && query.intersectsShape(*(n->m_ptrMBR[cCh… in rangeQuery() 1276 visitedData.insert(n->m_pIdentifier[cChild]); in rangeQuery() 1277 …Data data = Data(n->m_pDataLength[cChild], n->m_pData[cChild], *(n->m_ptrMBR[cChild]), n->m_pIdent… in rangeQuery() 1287 for (uint32_t cChild = 0; cChild < n->m_children; ++cChild) in rangeQuery() local 1291 n->m_ptrMBR[cChild]->intersectsInterval(*ti) && in rangeQuery() 1292 query.intersectsShape(*(n->m_ptrMBR[cChild]))) in rangeQuery() [all …]
|
/dports/textproc/libxml++26/libxml++-2.40.1/libxml++/nodes/ |
H A D | entityreference.cc | 27 auto cChild = cobj()->children; in get_resolved_text() local 28 if(cChild && cChild->type == XML_ENTITY_DECL) in get_resolved_text() 30 auto cEntity = (xmlEntity*)cChild; in get_resolved_text() 44 auto cChild = cobj()->children; in get_original_text() local 45 if(cChild && cChild->type == XML_ENTITY_DECL) in get_original_text() 47 auto cEntity = (xmlEntity*)cChild; in get_original_text()
|
/dports/devel/spatialindex/spatialindex-src-1.8.5/src/capi/ |
H A D | LeafQuery.cc | 44 for (uint32_t cChild = 0; cChild < n->getChildrenCount(); cChild++) in get_results() local 46 ids.push_back(n->getChildIdentifier(cChild)); in get_results() 65 for (uint32_t cChild = 0; cChild < n->getChildrenCount(); cChild++) in getNextEntry() local 67 m_ids.push(n->getChildIdentifier(cChild)); in getNextEntry()
|
/dports/graphics/pixie/Pixie/src/ri/ |
H A D | trace.cpp | 391 CObject *cChild; in trace() local 392 for (cChild=object->children;cChild!=NULL;cChild=cChild->sibling) { in trace() 403 const float tmin = nearestBox(cChild->bmin,cChild->bmax,ray->from,ray->invDir,ray->tmin,ray->t); in trace() 415 heap[child].object = cChild; in trace()
|
/dports/editors/libreoffice/libreoffice-7.2.6.2/lotuswordpro/source/filter/ |
H A D | lwptblcell.cxx | 78 LwpDLVListHeadTail cChild; in Read() local 79 cChild.Read(m_pObjStrm.get()); in Read() 138 cChild.Read(m_pObjStrm.get()); in Read() 195 cChild.Read(m_pObjStrm.get()); in Read()
|
H A D | lwptblcell.hxx | 107 LwpObjectID const & GetChildHeadID(){return cChild.GetHead();} in GetChildHeadID() 114 LwpDLVListHeadTail cChild; member in LwpRowList 183 LwpObjectID const & GetChildHeadID(){ return cChild.GetHead();} in GetChildHeadID() 188 LwpDLVListHeadTail cChild; member in LwpFolder
|
/dports/editors/libreoffice6/libreoffice-6.4.7.2/lotuswordpro/source/filter/ |
H A D | lwptblcell.cxx | 79 LwpDLVListHeadTail cChild; in Read() local 80 cChild.Read(m_pObjStrm.get()); in Read() 145 cChild.Read(m_pObjStrm.get()); in Read() 206 cChild.Read(m_pObjStrm.get()); in Read()
|
H A D | lwptblcell.hxx | 108 LwpObjectID const & GetChildHeadID(){return cChild.GetHead();} in GetChildHeadID() 115 LwpDLVListHeadTail cChild; member in LwpRowList 184 LwpObjectID const & GetChildHeadID(){ return cChild.GetHead();} in GetChildHeadID() 189 LwpDLVListHeadTail cChild; member in LwpFolder
|
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.ui/tests/org.eclipse.ui.tests.navigator/src/org/eclipse/ui/tests/navigator/cdt/ |
H A D | CNavigatorContentProvider.java | 192 for (Object cChild : cChildren) { in customizeCElements() 193 if (cChild instanceof CElement) { in customizeCElements() 194 IResource resource = ((CElement) cChild).getResource(); in customizeCElements() 198 proposedChildren.add(cChild); in customizeCElements() 199 } else if (cChild != null) { in customizeCElements() 200 proposedChildren.add(cChild); in customizeCElements()
|
/dports/devel/spatialindex/spatialindex-src-1.8.5/test/mvrtree/ |
H A D | MVRTreeQuery.cc | 111 for (size_t cChild = 0; cChild < n->getChildrenCount(); cChild++) in getNextEntry() local 113 ids.push(n->getChildIdentifier(cChild)); in getNextEntry()
|
/dports/devel/spatialindex/spatialindex-src-1.8.5/test/rtree/ |
H A D | RTreeQuery.cc | 114 for (uint32_t cChild = 0; cChild < n->getChildrenCount(); cChild++) in getNextEntry() local 116 ids.push(n->getChildIdentifier(cChild)); in getNextEntry()
|