/dports/math/ogdf/OGDF/src/coin/Clp/ |
H A D | ClpNetworkBasis.cpp | 701 iDepth--; in updateColumn() 892 iDepth--; in updateColumn() 954 int iDepth = depth_[j]; in updateColumnTranspose() local 958 stack2_[iDepth] = j; in updateColumnTranspose() 972 int iDepth; in updateColumnTranspose() local 973 for (iDepth = smallestDepth; iDepth <= greatestDepth; iDepth++) { in updateColumnTranspose() 975 stack2_[iDepth] = -1; in updateColumnTranspose() 1062 int iDepth; in updateColumnTranspose() local 1063 for (iDepth = smallestDepth; iDepth <= greatestDepth; iDepth++) { in updateColumnTranspose() 1145 int iDepth; in updateColumnTranspose() local [all …]
|
/dports/math/clp/Clp-1.17.3/Clp/src/ |
H A D | ClpNetworkBasis.cpp | 698 iDepth--; in updateColumn() 816 iDepth--; in updateColumn() 888 iDepth--; in updateColumn() 953 stack2_[iDepth] = j; in updateColumnTranspose() 967 int iDepth; in updateColumnTranspose() local 968 for (iDepth = smallestDepth; iDepth <= greatestDepth; iDepth++) { in updateColumnTranspose() 970 stack2_[iDepth] = -1; in updateColumnTranspose() 1056 int iDepth; in updateColumnTranspose() local 1057 for (iDepth = smallestDepth; iDepth <= greatestDepth; iDepth++) { in updateColumnTranspose() 1139 int iDepth; in updateColumnTranspose() local [all …]
|
/dports/databases/pgbackrest/pgbackrest-release-2.35/doc/lib/pgBackRestDoc/Latex/ |
H A D | DocLatexSection.pm | 101 $iDepth 125 if ($iDepth <= 3 && $oSection->paramTest('toc', 'n')) 133 if ($iDepth <= 3) 135 $strLatex .= ($iDepth > 1 ? ('sub' x ($iDepth - 1)) : '') . "section"; 137 elsif ($iDepth == 4) 143 confess &log(ASSERT, "section depth of ${iDepth} exceeds maximum"); 149 if ($iDepth <= 3 && $oSection->paramTest('toc', 'n')) 176 {iIndent => $iDepth + 3, bShow => $bShow && $bExeShow}); 394 $strLatex .= $self->configProcess($oSection, $oChild, $iDepth + 3); 412 $self->sectionChildProcess($oSection, $oChild, $iDepth + 1); [all …]
|
/dports/databases/pgbackrest/pgbackrest-release-2.35/doc/lib/pgBackRestDoc/Html/ |
H A D | DocHtmlPage.pm | 207 $iDepth 223 if ($iDepth > 3) 225 confess &log(ASSERT, "section depth of ${iDepth} exceeds maximum"); 244 my $oSectionHeaderElement = $oSectionElement->addNew(HTML_DIV, "section${iDepth}-header"); 281 &log(DEBUG, (' ' x ($iDepth + 2)) . 'process child ' . $oChild->nameGet()); 533 addNew(HTML_DIV, "section${iDepth}-subtitle", 540 addNew(HTML_DIV, "section${iDepth}-subsubtitle", 569 $self->sectionChildProcess($oSection, $oChild, $iDepth + 1); 595 $iDepth 607 my ($strFile, $strConfig, $bShow) = $self->backrestConfig($oSection, $oConfig, $iDepth); [all …]
|
H A D | DocHtmlBuilder.pm | 73 my $iDepth = shift; 75 return $self->{bPretty} ? (' ' x $iDepth) : ''; 115 $iDepth 143 $self->indent($iDepth) . "<$oElement->{strType}" . 169 $strHtml .= "\n" . $self->indent($iDepth); 181 $strHtml .= $self->htmlRender($oChildElement, $iDepth + 1); 186 $strHtml .= $self->indent($iDepth);
|
/dports/lang/gambit-c/gambit-4.9.3/bench/src/ |
H A D | gcbench.scm | 86 (define (Populate iDepth thisNode) 87 (if (<= iDepth 0) 89 (let ((iDepth (- iDepth 1))) 92 (Populate iDepth (node.left thisNode)) 93 (Populate iDepth (node.right thisNode))))) 96 (define (MakeTree iDepth) 97 (if (<= iDepth 0) 99 (make-node (MakeTree (- iDepth 1)) 100 (MakeTree (- iDepth 1)))))
|
/dports/lang/sagittarius-scheme/sagittarius-0.9.8/bench/gambit-benchmarks/ |
H A D | gcbench.scm | 86 (define (Populate iDepth thisNode) 87 (if (<= iDepth 0) 89 (let ((iDepth (- iDepth 1))) 92 (Populate iDepth (node.left thisNode)) 93 (Populate iDepth (node.right thisNode))))) 96 (define (MakeTree iDepth) 97 (if (<= iDepth 0) 99 (make-node (MakeTree (- iDepth 1)) 100 (MakeTree (- iDepth 1)))))
|
/dports/lang/guile2/guile-2.2.7/gc-benchmarks/ |
H A D | gcbench.scm | 109 (define (Populate iDepth thisNode) 110 (if (<= iDepth 0) 112 (let ((iDepth (- iDepth 1))) 115 (Populate iDepth (node.left thisNode)) 116 (Populate iDepth (node.right thisNode))))) 119 (define (MakeTree iDepth) 120 (if (<= iDepth 0) 122 (make-node (MakeTree (- iDepth 1)) 123 (MakeTree (- iDepth 1)))))
|
/dports/lang/guile/guile-3.0.7/gc-benchmarks/ |
H A D | gcbench.scm | 109 (define (Populate iDepth thisNode) 110 (if (<= iDepth 0) 112 (let ((iDepth (- iDepth 1))) 115 (Populate iDepth (node.left thisNode)) 116 (Populate iDepth (node.right thisNode))))) 119 (define (MakeTree iDepth) 120 (if (<= iDepth 0) 122 (make-node (MakeTree (- iDepth 1)) 123 (MakeTree (- iDepth 1)))))
|
/dports/databases/pgbackrest/pgbackrest-release-2.35/doc/lib/pgBackRestDoc/Markdown/ |
H A D | DocMarkdownRender.pm | 169 $iDepth 180 &log(INFO, (' ' x ($iDepth + 1)) . 'process section: ' . $oSection->paramGet('path')); 183 if ($iDepth > 3) 185 confess &log(ASSERT, "section depth of ${iDepth} exceeds maximum"); 188 …my $strMarkdown = '#' . ('#' x $iDepth) . ' ' . $self->processText($oSection->nodeGet('title')->te… 194 &log(DEBUG, (' ' x ($iDepth + 2)) . 'process child ' . $oChild->nameGet()); 222 … $oSection, $strHostName, $oExecute, {iIndent => $iDepth + 3, bShow => $bShow && $bExeShow}); 353 … $strMarkdown = trim($strMarkdown) . "\n\n" . $self->sectionProcess($oChild, $iDepth + 1); 437 $self->sectionChildProcess($oSection, $oChild, $iDepth + 1); 464 $iDepth
|
/dports/math/ogdf/OGDF/src/coin/Osi/ |
H A D | OsiSolverInterface.cpp | 2302 int iDepth; in solveBranches() local 2303 for (iDepth=0;iDepth<depth;iDepth++) { in solveBranches() 2312 for (iDepth=0;iDepth<depth;iDepth++) { in solveBranches() 2316 seq[iDepth]=branch[iDepth].which()[0]; in solveBranches() 2317 val[iDepth]=branch[iDepth].bounds()[0]; in solveBranches() 2318 printf("depth %d seq %d nominal value %g\n",iDepth,seq[iDepth],val[iDepth]+0.5); in solveBranches() 2324 iDepth=0; in solveBranches() 2352 branch[iDepth].applyBounds(*this,stack[iDepth]); in solveBranches() 2358 branch[iDepth].applyBounds(*this,stack[iDepth]); in solveBranches() 2395 iDepth++; in solveBranches() [all …]
|
/dports/devel/codeworker/CodeWorker4_5_3/WebSite/tutorials/DesignSpecificModeling/utils/ |
H A D | DevCom2CW.cwp | 6 => local iDepth; 9 "<div class=\"TitreSection" #continue #readInteger:iDepth "\">" 12 => {@<h@$iDepth + 2$@>@} 18 => {@</h@$iDepth + 2$@>@}
|
/dports/games/openclonk/openclonk-release-8.1-src/src/lib/ |
H A D | StdCompiler.cpp | 227 iDepth++; in Name() 243 assert(iDepth); in NameEnd() 247 iDepth--; in NameEnd() 361 iDepth = 0; in Begin() 369 assert(!iDepth); in End() 379 assert(iDepth > 1); in PrepareForValue() 459 iDepth++; in Name() 490 assert(iDepth > 0); in NameEnd() 513 iDepth--; in NameEnd() 521 if (iDepth > iRealDepth) in FollowName() [all …]
|
/dports/math/osi/Osi-0.108.6/Osi/src/Osi/ |
H A D | OsiSolverInterface.cpp | 2332 int iDepth; in solveBranches() local 2333 for (iDepth = 0; iDepth < depth; iDepth++) { in solveBranches() 2342 for (iDepth = 0; iDepth < depth; iDepth++) { in solveBranches() 2346 seq[iDepth] = branch[iDepth].which()[0]; in solveBranches() 2347 val[iDepth] = branch[iDepth].bounds()[0]; in solveBranches() 2348 printf("depth %d seq %d nominal value %g\n", iDepth, seq[iDepth], val[iDepth] + 0.5); in solveBranches() 2354 iDepth = 0; in solveBranches() 2382 branch[iDepth].applyBounds(*this, stack[iDepth]); in solveBranches() 2388 branch[iDepth].applyBounds(*this, stack[iDepth]); in solveBranches() 2425 iDepth++; in solveBranches() [all …]
|
/dports/math/clp/Clp-1.17.3/Osi/src/Osi/ |
H A D | OsiSolverInterface.cpp | 2326 int iDepth; in solveBranches() local 2327 for (iDepth = 0; iDepth < depth; iDepth++) { in solveBranches() 2336 for (iDepth = 0; iDepth < depth; iDepth++) { in solveBranches() 2340 seq[iDepth] = branch[iDepth].which()[0]; in solveBranches() 2341 val[iDepth] = branch[iDepth].bounds()[0]; in solveBranches() 2342 printf("depth %d seq %d nominal value %g\n", iDepth, seq[iDepth], val[iDepth] + 0.5); in solveBranches() 2348 iDepth = 0; in solveBranches() 2376 branch[iDepth].applyBounds(*this, stack[iDepth]); in solveBranches() 2382 branch[iDepth].applyBounds(*this, stack[iDepth]); in solveBranches() 2419 iDepth++; in solveBranches() [all …]
|
/dports/databases/sqlite3/sqlite-src-3350500/ext/rtree/ |
H A D | rtree_util.tcl | 35 set iDepth [rtree_depth $db $zTab] 41 incr iDepth -1 44 return $iDepth 108 proc rtree_node_check {db zTab iNode iDepth} { argument 127 if {$iDepth > 0} { 176 proc rtree_nodetreedump {db zTab zIndent iDepth iNode} {
|
/dports/databases/sqlcipher/sqlcipher-3.4.2/ext/rtree/ |
H A D | rtree_util.tcl | 35 set iDepth [rtree_depth $db $zTab] 41 incr iDepth -1 44 return $iDepth 108 proc rtree_node_check {db zTab iNode iDepth} { argument 127 if {$iDepth > 0} { 176 proc rtree_nodetreedump {db zTab zIndent iDepth iNode} {
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/sqlite/src/ext/rtree/ |
H A D | rtree_util.tcl | 35 set iDepth [rtree_depth $db $zTab] 41 incr iDepth -1 44 return $iDepth 108 proc rtree_node_check {db zTab iNode iDepth} { argument 127 if {$iDepth > 0} { 176 proc rtree_nodetreedump {db zTab zIndent iDepth iNode} {
|
/dports/databases/db5/db-5.3.28/lang/sql/sqlite/ext/rtree/ |
H A D | rtree_util.tcl | 35 set iDepth [rtree_depth $db $zTab] 41 incr iDepth -1 44 return $iDepth 108 proc rtree_node_check {db zTab iNode iDepth} { argument 127 if {$iDepth > 0} { 176 proc rtree_nodetreedump {db zTab zIndent iDepth iNode} {
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/sqlite/src/ext/rtree/ |
H A D | rtree_util.tcl | 35 set iDepth [rtree_depth $db $zTab] 41 incr iDepth -1 44 return $iDepth 108 proc rtree_node_check {db zTab iNode iDepth} { argument 127 if {$iDepth > 0} { 176 proc rtree_nodetreedump {db zTab zIndent iDepth iNode} {
|
/dports/graphics/libbpg/libbpg-0.9.8/jctvc/TLibEncoder/ |
H A D | TEncTop.cpp | 127 for ( Int iDepth = 0; iDepth < g_uiMaxCUDepth+1; iDepth++ ) in create() local 129 m_pppcRDSbacCoder[iDepth] = new TEncSbac* [CI_NUM]; in create() 138 m_pppcRDSbacCoder[iDepth][iCIIdx] = new TEncSbac; in create() 144 m_pppcRDSbacCoder [iDepth][iCIIdx]->init( m_pppcBinCoderCABAC [iDepth][iCIIdx] ); in create() 162 Int iDepth; in destroy() local 163 for ( iDepth = 0; iDepth < g_uiMaxCUDepth+1; iDepth++ ) in destroy() 167 delete m_pppcRDSbacCoder[iDepth][iCIIdx]; in destroy() 168 delete m_pppcBinCoderCABAC[iDepth][iCIIdx]; in destroy() 172 for ( iDepth = 0; iDepth < g_uiMaxCUDepth+1; iDepth++ ) in destroy() 174 delete [] m_pppcRDSbacCoder[iDepth]; in destroy() [all …]
|
/dports/games/openclonk/openclonk-release-8.1-src/src/platform/ |
H A D | StdRegistry.cpp | 261 assert(!iDepth); in ~StdCompilerConfigWrite() 283 iDepth++; in Name() 290 assert(iDepth); in NameEnd() 298 iDepth--; in NameEnd() 381 assert(!iDepth); in Begin() 386 assert(!iDepth); in End() 440 assert(!iDepth); in ~StdCompilerConfigRead() 478 iDepth++; in Name() 485 assert(iDepth); in NameEnd() 493 iDepth--; in NameEnd() [all …]
|
/dports/databases/db5/db-5.3.28/lang/sql/sqlite/src/ |
H A D | rowset.c | 310 int iDepth in rowSetNDeepTree() argument 317 if( iDepth==1 ){ in rowSetNDeepTree() 323 pLeft = rowSetNDeepTree(ppList, iDepth-1); in rowSetNDeepTree() 330 p->pRight = rowSetNDeepTree(ppList, iDepth-1); in rowSetNDeepTree() 339 int iDepth; /* Depth of the tree so far */ in rowSetListToTree() local 347 for(iDepth=1; pList; iDepth++){ in rowSetListToTree() 352 p->pRight = rowSetNDeepTree(&pList, iDepth); in rowSetListToTree()
|
/dports/databases/sqlite3/sqlite-src-3350500/src/ |
H A D | rowset.c | 342 int iDepth in rowSetNDeepTree() argument 350 if( iDepth>1 ){ /*OPTIMIZATION-IF-TRUE*/ in rowSetNDeepTree() 354 pLeft = rowSetNDeepTree(ppList, iDepth-1); in rowSetNDeepTree() 363 p->pRight = rowSetNDeepTree(ppList, iDepth-1); in rowSetNDeepTree() 377 int iDepth; /* Depth of the tree so far */ in rowSetListToTree() local 385 for(iDepth=1; pList; iDepth++){ in rowSetListToTree() 390 p->pRight = rowSetNDeepTree(&pList, iDepth); in rowSetListToTree()
|
/dports/databases/sqlcipher/sqlcipher-3.4.2/src/ |
H A D | rowset.c | 338 int iDepth in rowSetNDeepTree() argument 346 if( iDepth>1 ){ /*OPTIMIZATION-IF-TRUE*/ in rowSetNDeepTree() 350 pLeft = rowSetNDeepTree(ppList, iDepth-1); in rowSetNDeepTree() 359 p->pRight = rowSetNDeepTree(ppList, iDepth-1); in rowSetNDeepTree() 373 int iDepth; /* Depth of the tree so far */ in rowSetListToTree() local 381 for(iDepth=1; pList; iDepth++){ in rowSetListToTree() 386 p->pRight = rowSetNDeepTree(&pList, iDepth); in rowSetListToTree()
|