| /dports/graphics/dcmtk/dcmtk-DCMTK-3.6.6/dcmsr/libcmr/ |
| H A D | tid1001.cc | 58 DSRDocumentSubTree *subTree = new DSRDocumentSubTree; in addPersonObserver() local
59 if (subTree != NULL) in addPersonObserver()
93 const size_t lastNode = subTree->getNodeID(); in addPersonObserver()
98 STORE_RESULT(insertSubTree(subTree, AM_afterCurrent)); in addPersonObserver()
103 STORE_RESULT(insertSubTree(subTree, AM_beforeCurrent)); in addPersonObserver()
109 BAD_RESULT(delete subTree); in addPersonObserver()
127 DSRDocumentSubTree *subTree = new DSRDocumentSubTree; in addDeviceObserver() local
128 if (subTree != NULL) in addDeviceObserver()
197 const size_t lastNode = subTree->getNodeID(); in addDeviceObserver()
201 STORE_RESULT(insertSubTree(subTree, AM_afterCurrent)); in addDeviceObserver()
[all …]
|
| H A D | tid300.cc | 209 if (subTree != NULL) in addFindingSite()
215 const size_t lastNode = subTree->getNodeID(); in addFindingSite()
222 GOOD_RESULT(subTree->gotoParent()); in addFindingSite()
230 GOOD_RESULT(subTree->gotoParent()); in addFindingSite()
233 if (result.good() && !subTree->isEmpty()) in addFindingSite()
247 BAD_RESULT(delete subTree); in addFindingSite()
250 delete subTree; in addFindingSite()
355 if (subTree != NULL) in addSpatialCoordinates()
367 if (result.good() && !subTree->isEmpty()) in addSpatialCoordinates()
381 BAD_RESULT(delete subTree); in addSpatialCoordinates()
[all …]
|
| H A D | tid1204.cc | 49 DSRDocumentSubTree subTree; in setLanguage() local
51 …STORE_RESULT(subTree.addContentItem(RT_hasConceptMod, VT_Code, CODE_DCM_LanguageOfContentItemAndDe… in setLanguage()
52 CHECK_RESULT(subTree.getCurrentContentItem().setCodeValue(language, check)); in setLanguage()
53 CHECK_RESULT(subTree.getCurrentContentItem().setAnnotationText("TID 1204 - Row 1")); in setLanguage()
57 …CHECK_RESULT(subTree.addChildContentItem(RT_hasConceptMod, VT_Code, CODE_DCM_CountryOfLanguage, ch… in setLanguage()
58 CHECK_RESULT(subTree.getCurrentContentItem().setCodeValue(country, check)); in setLanguage()
59 CHECK_RESULT(subTree.getCurrentContentItem().setAnnotationText("TID 1204 - Row 2")); in setLanguage()
62 GOOD_RESULT(swap(subTree)); in setLanguage()
|
| H A D | tid4019.cc | 49 DSRDocumentSubTree subTree; in setIdentification() local
51 STORE_RESULT(subTree.addContentItem(RT_unknown, VT_Text, CODE_DCM_AlgorithmName, check)); in setIdentification()
52 CHECK_RESULT(subTree.getCurrentContentItem().setStringValue(algorithmName, check)); in setIdentification()
53 CHECK_RESULT(subTree.getCurrentContentItem().setAnnotationText("TID 4019 - Row 1")); in setIdentification()
55 CHECK_RESULT(subTree.addContentItem(RT_unknown, VT_Text, CODE_DCM_AlgorithmVersion, check)); in setIdentification()
56 CHECK_RESULT(subTree.getCurrentContentItem().setStringValue(algorithmVersion, check)); in setIdentification()
57 CHECK_RESULT(subTree.getCurrentContentItem().setAnnotationText("TID 4019 - Row 2")); in setIdentification()
59 GOOD_RESULT(swap(subTree)); in setIdentification()
|
| H A D | tid1419m.cc | 211 DSRDocumentSubTree *subTree = new DSRDocumentSubTree; in addFindingSite() local
212 if (subTree != NULL) in addFindingSite()
216 CHECK_RESULT(subTree->getCurrentContentItem().setCodeValue(site, check)); in addFindingSite()
218 const size_t lastNode = subTree->getNodeID(); in addFindingSite()
225 GOOD_RESULT(subTree->gotoParent()); in addFindingSite()
233 GOOD_RESULT(subTree->gotoParent()); in addFindingSite()
236 if (result.good() && !subTree->isEmpty()) in addFindingSite()
242 STORE_RESULT(insertSubTree(subTree, AM_belowCurrent)); in addFindingSite()
245 STORE_RESULT(insertSubTree(subTree, AM_afterCurrent)); in addFindingSite()
250 BAD_RESULT(delete subTree); in addFindingSite()
[all …]
|
| H A D | tid1501.cc | 300 DSRDocumentSubTree *subTree = new DSRDocumentSubTree; in addFindingSite() local
301 if (subTree != NULL) in addFindingSite()
305 CHECK_RESULT(subTree->getCurrentContentItem().setCodeValue(site, check)); in addFindingSite()
307 const size_t lastNode = subTree->getNodeID(); in addFindingSite()
312 CHECK_RESULT(subTree->getCurrentContentItem().setCodeValue(laterality, check)); in addFindingSite()
314 GOOD_RESULT(subTree->gotoParent()); in addFindingSite()
322 GOOD_RESULT(subTree->gotoParent()); in addFindingSite()
325 if (result.good() && !subTree->isEmpty()) in addFindingSite()
331 STORE_RESULT(insertSubTree(subTree, AM_afterCurrent)); in addFindingSite()
339 BAD_RESULT(delete subTree); in addFindingSite()
[all …]
|
| H A D | tid1411.cc | 486 DSRDocumentSubTree *subTree = new DSRDocumentSubTree; in addFindingSite() local
487 if (subTree != NULL) in addFindingSite()
491 CHECK_RESULT(subTree->getCurrentContentItem().setCodeValue(site, check)); in addFindingSite()
493 const size_t lastNode = subTree->getNodeID(); in addFindingSite()
500 GOOD_RESULT(subTree->gotoParent()); in addFindingSite()
508 GOOD_RESULT(subTree->gotoParent()); in addFindingSite()
511 if (result.good() && !subTree->isEmpty()) in addFindingSite()
517 STORE_RESULT(insertSubTree(subTree, AM_belowCurrent)); in addFindingSite()
520 STORE_RESULT(insertSubTree(subTree, AM_afterCurrent)); in addFindingSite()
525 BAD_RESULT(delete subTree); in addFindingSite()
[all …]
|
| H A D | tid1600.cc | 227 if (subTree != NULL) in addImageGroupDescriptors()
232 if (result.good() && !subTree->isEmpty()) in addImageGroupDescriptors()
252 BAD_RESULT(delete subTree); in addImageGroupDescriptors()
256 delete subTree; in addImageGroupDescriptors()
313 DSRDocumentSubTree *subTree = NULL; in moveCommonImageDescriptorsToImageGroups() local
319 if (subTree != NULL) in moveCommonImageDescriptorsToImageGroups()
344 if (subTree != NULL) in moveCommonImageDescriptorsToImageGroups()
345 subTree->clear(); in moveCommonImageDescriptorsToImageGroups()
350 if (subTree != NULL) in moveCommonImageDescriptorsToImageGroups()
353 if (!subTree->isEmpty()) in moveCommonImageDescriptorsToImageGroups()
[all …]
|
| /dports/math/alps/CHiPPS-ALPS-releases-2.0.1/Alps/src/ |
| H A D | AlpsSearchStrategy.cpp | 35 AlpsTreeNode *node = subTree->activeNode(); in selectNextNode()
39 subTree->nodePool()->popKnowledge(); in selectNextNode()
51 subTree->createChildren(node, children); in createNewNodes()
94 AlpsTreeNode *node = subTree->activeNode(); in selectNextNode()
98 subTree->reset(); in selectNextNode()
104 subTree->diveNodePool()->popKnowledge(); in selectNextNode()
106 else if (subTree->nodePool()->hasKnowledge()) { in selectNextNode()
109 subTree->nodePool()->popKnowledge(); in selectNextNode()
138 subTree->diveNodePool()->popKnowledge(); in createNewNodes()
145 subTree->createChildren(node, children, subTree->diveNodePool()); in createNewNodes()
[all …]
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.ui/bundles/org.eclipse.jface/src/org/eclipse/jface/viewers/deferred/ |
| H A D | LazySortedCollection.java | 269 return subTree; in addUnsorted()
272 if (subTree == -1) { in addUnsorted()
317 treeSize[subTree]++; in addUnsorted()
318 return subTree; in addUnsorted()
370 if (subTree == -1) { in partition()
375 subTree = removeNode(subTree); in partition()
376 if (subTree == -1) { in partition()
396 return subTree; in partition()
400 if (subTree == -1) { in getSubtreeSize()
1035 return subTree; in lazyRemoveNode()
[all …]
|
| /dports/graphics/opendx/dx-4.4.4/src/exec/dxmods/ |
| H A D | _compputils.c | 182 PTreeNode *subTree; in _dxfComputeFreeTree() local
191 subTree = tree->args; in _dxfComputeFreeTree()
192 while (subTree != NULL) { in _dxfComputeFreeTree()
193 nextSubTree = subTree->next; in _dxfComputeFreeTree()
195 subTree = nextSubTree; in _dxfComputeFreeTree()
203 PTreeNode *subTree; in _dxfComputeCopyTree() local
217 subTree = tree->args; in _dxfComputeCopyTree()
226 subTree = subTree->next; in _dxfComputeCopyTree()
309 PTreeNode *subTree; in _dxfComputeDumpParseTree() local
315 for (subTree = tree->args; subTree != NULL; in _dxfComputeDumpParseTree()
[all …]
|
| H A D | _compoper.c | 710 subTree = subTree->next; in CheckConstruct()
1737 ++count, subTree = subTree->next) in _dxfComputeCheckSame()
1764 subTree = subTree->next; in _dxfComputeCheckSame()
1820 subTree = subTree->next; in _dxfComputeCheckSameAs()
1870 subTree = subTree->next; in _dxfComputeCheckSameSpecReturn()
1922 subTree = subTree->next; in _dxfComputeCheckSameTypeSpecReturn()
3516 subTree = subTree->next; in TypeCheckLeaf()
3566 subTree = subTree->next; in TypeCheckLeaf()
3613 subTree = subTree->next; in TypeCheckLeaf()
3661 subTree = subTree->next; in TypeCheckLeaf()
[all …]
|
| /dports/multimedia/navidrome/navidrome-0.40.0/vendor/github.com/astaxie/beego/ |
| H A D | tree.go | 156 subTree := NewTree()
157 subTree.prefix = seg
158 t.fixrouters = append(t.fixrouters, subTree)
268 var subTree *Tree
271 subTree = sub
275 if subTree == nil {
276 subTree = NewTree()
277 subTree.prefix = seg
328 for _, subTree := range t.fixrouters {
329 if subTree.prefix == seg {
[all …]
|
| /dports/net-p2p/go-ethereum/go-ethereum-1.10.14/vendor/github.com/consensys/gnark-crypto/accumulator/merkletree/ |
| H A D | tree.go | 44 head *subTree
67 type subTree struct { struct
68 next *subTree argument
103 func joinSubTrees(h hash.Hash, a, b *subTree) *subTree { argument
113 return &subTree{
212 t.head = &subTree{
265 t.head = &subTree{
|
| /dports/finance/prestashop/prestashop/vendor/greenlion/php-sql-parser/src/PHPSQLParser/processors/ |
| H A D | DropProcessor.php | 58 $subTree = array();
101 $subTree[] = array('expr_type' => ExpressionType::EXPRESSION,
131 $subTree[] = array('expr_type' => ExpressionType::RESERVED, 'base_expr' => $trim);
135 … $subTree[] = array('expr_type' => ExpressionType::EXPRESSION, 'base_expr' => trim($base_expr),
139 …y('expr_type' => $objectType, 'option' => $option, 'if-exists' => $exists, 'sub_tree' => $subTree);
|
| /dports/www/thirtybees/thirtybees-1.1.0/vendor/greenlion/php-sql-parser/src/PHPSQLParser/processors/ |
| H A D | DropProcessor.php | 58 $subTree = array();
101 $subTree[] = array('expr_type' => ExpressionType::EXPRESSION,
131 $subTree[] = array('expr_type' => ExpressionType::RESERVED, 'base_expr' => $trim);
135 … $subTree[] = array('expr_type' => ExpressionType::EXPRESSION, 'base_expr' => trim($base_expr),
139 …y('expr_type' => $objectType, 'option' => $option, 'if-exists' => $exists, 'sub_tree' => $subTree);
|
| /dports/games/uqm/uqm-0.8.0/src/libs/uio/ |
| H A D | mounttree.c | 212 uio_MountTree *subTree; in uio_mountTreeAddMountInfoLocAll() local
220 for (subTree = tree->subTrees; subTree != NULL; in uio_mountTreeAddMountInfoLocAll()
221 subTree = subTree->next) { in uio_mountTreeAddMountInfoLocAll()
455 uio_MountTree *subTree; in uio_mountTreeRemoveMountInfoRec() local
459 for (subTree = mountTree->subTrees; subTree != NULL; in uio_mountTreeRemoveMountInfoRec()
460 subTree = subTree->next) in uio_mountTreeRemoveMountInfoRec()
696 subTree = tree->subTrees; in uio_MountTree_delete()
697 while (subTree != NULL) { in uio_MountTree_delete()
698 nextTree = subTree->next; in uio_MountTree_delete()
699 uio_MountTree_delete(subTree); in uio_MountTree_delete()
[all …]
|
| /dports/graphics/digikam/digikam-7.4.0/core/libs/facesengine/facedb/ |
| H A D | facedb_dnn_spatial.cpp | 259 double FaceDb::getClosestNeighborsTreeDb(const DataNode& subTree, in getClosestNeighborsTreeDb() argument
266 if (subTree.isNull()) in getClosestNeighborsTreeDb()
273 …const float sqrdistanceToCurrentNode = KDNode::sqrDistance(position.ptr<float>(), subTree.position… in getClosestNeighborsTreeDb()
276 … (KDNode::cosDistance(position.ptr<float>(), subTree.position.ptr<float>(), 128) > cosThreshold)) in getClosestNeighborsTreeDb()
278 neighborList[sqrdistanceToCurrentNode].append(subTree.label); in getClosestNeighborsTreeDb()
319 if (subTree.left <= 0) in getClosestNeighborsTreeDb()
326 bindingValues << subTree.left; in getClosestNeighborsTreeDb()
336 leftNode.nodeID = subTree.left; in getClosestNeighborsTreeDb()
367 if (subTree.right <= 0) in getClosestNeighborsTreeDb()
374 bindingValues << subTree.right; in getClosestNeighborsTreeDb()
[all …]
|
| /dports/net-mgmt/py-pysnmp/pysnmp-4.4.9/pysnmp/entity/ |
| H A D | config.py | 500 def __cookVacmViewInfo(snmpEngine, viewName, subTree): argument
525 def delVacmView(snmpEngine, viewName, subTree): argument
587 subTree, contextName=null): argument
589 subTree, contextName=contextName)
593 subTree, contextName=null): argument
595 subTree, contextName=contextName)
599 subTree, contextName=null): argument
601 subTree, subTree, contextName=contextName)
605 subTree, contextName=null): argument
607 subTree, subTree, contextName=contextName)
[all …]
|
| /dports/lang/gcc6-aux/gcc-6-20180516/libjava/classpath/java/util/zip/ |
| H A D | InflaterHuffmanTree.java | 154 int subTree = tree[revcode & 511]; in buildTree() local
155 int treeLen = 1 << (subTree & 15); in buildTree()
156 subTree = -(subTree >> 4); in buildTree()
159 tree[subTree | (revcode >> 9)] = (short) ((i << 4) | bits); in buildTree()
|
| /dports/lang/gcc48/gcc-4.8.5/libjava/classpath/java/util/zip/ |
| H A D | InflaterHuffmanTree.java | 154 int subTree = tree[revcode & 511]; in buildTree() local
155 int treeLen = 1 << (subTree & 15); in buildTree()
156 subTree = -(subTree >> 4); in buildTree()
159 tree[subTree | (revcode >> 9)] = (short) ((i << 4) | bits); in buildTree()
|
| /dports/lang/mono/mono-5.10.1.57/mcs/class/ICSharpCode.SharpZipLib/ICSharpCode.SharpZipLib/Zip/Compression/ |
| H A D | InflaterHuffmanTree.cs | 164 int subTree = tree[revcode & 511]; in BuildTree()
165 int treeLen = 1 << (subTree & 15); in BuildTree()
166 subTree = -(subTree >> 4); in BuildTree()
168 tree[subTree | (revcode >> 9)] = (short) ((i << 4) | bits); in BuildTree()
|
| /dports/lang/gnat_util/gcc-6-20180516/libjava/classpath/java/util/zip/ |
| H A D | InflaterHuffmanTree.java | 154 int subTree = tree[revcode & 511]; in buildTree() local
155 int treeLen = 1 << (subTree & 15); in buildTree()
156 subTree = -(subTree >> 4); in buildTree()
159 tree[subTree | (revcode >> 9)] = (short) ((i << 4) | bits); in buildTree()
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libjava/classpath/java/util/zip/ |
| H A D | InflaterHuffmanTree.java | 154 int subTree = tree[revcode & 511]; in buildTree() local
155 int treeLen = 1 << (subTree & 15); in buildTree()
156 subTree = -(subTree >> 4); in buildTree()
159 tree[subTree | (revcode >> 9)] = (short) ((i << 4) | bits); in buildTree()
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/libjava/classpath/java/util/zip/ |
| H A D | InflaterHuffmanTree.java | 154 int subTree = tree[revcode & 511]; in buildTree() local
155 int treeLen = 1 << (subTree & 15); in buildTree()
156 subTree = -(subTree >> 4); in buildTree()
159 tree[subTree | (revcode >> 9)] = (short) ((i << 4) | bits); in buildTree()
|