Home
last modified time | relevance | path

Searched refs:totalChildren (Results 1 – 25 of 36) sorted by relevance

12

/dports/net/ss5/ss5-3.8.9/src/
H A DSS5Main.c39 UINT totalChildren = 0; in main() local
303 totalChildren = SS5SocksOpt.PreforkProcesses; in main()
363 totalChildren--; in main()
364 if( totalChildren <= (SS5SocksOpt.PreforkProcesses/2) ) { in main()
366 totalChildren = SS5SocksOpt.PreforkProcesses; in main()
/dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/webkit/Source/WebCore/rendering/
H A DRenderFlexibleBox.cpp572 int totalChildren = 0; in layoutHorizontalBox() local
579 totalChildren++; in layoutHorizontalBox()
585 if (totalChildren > 1) { in layoutHorizontalBox()
586 totalChildren--; in layoutHorizontalBox()
601 offset += remainingSpace/totalChildren; in layoutHorizontalBox()
603 totalChildren--; in layoutHorizontalBox()
841 int totalChildren = 0; in layoutVerticalBox() local
848 totalChildren++; in layoutVerticalBox()
854 if (totalChildren > 1) { in layoutVerticalBox()
855 totalChildren--; in layoutVerticalBox()
[all …]
/dports/math/vtk8/VTK-8.2.0/Infovis/Layout/
H A DvtkTreeOrbitLayoutStrategy.cxx72 double totalChildren = leaf_count->GetValue(parent); in OrbitChildren() local
85 double myAngle = subChildren/totalChildren; in OrbitChildren()
99 radiusFactor = log(static_cast<double>(immediateChildren)) / log(totalChildren); in OrbitChildren()
/dports/math/vtk9/VTK-9.1.0/Infovis/Layout/
H A DvtkTreeOrbitLayoutStrategy.cxx72 double totalChildren = leaf_count->GetValue(parent); in OrbitChildren() local
85 double myAngle = subChildren / totalChildren; in OrbitChildren()
99 radiusFactor = log(static_cast<double>(immediateChildren)) / log(totalChildren); in OrbitChildren()
/dports/math/vtk6/VTK-6.2.0/Infovis/Layout/
H A DvtkTreeOrbitLayoutStrategy.cxx75 double totalChildren = leaf_count->GetValue(parent); in OrbitChildren() local
88 double myAngle = subChildren/totalChildren; in OrbitChildren()
102 radiusFactor = log(static_cast<double>(immediateChildren)) / log(totalChildren); in OrbitChildren()
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/nomad/ui/app/templates/components/job-page/parts/
H A Dsummary.hbs8 {{a.item.summary.totalChildren}}
22 {{#if (gt a.item.totalChildren 0)}}
/dports/sysutils/nomad/nomad-1.1.0/ui/app/templates/components/job-page/parts/
H A Dsummary.hbs8 {{a.item.summary.totalChildren}}
22 {{#if (gt a.item.totalChildren 0)}}
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/acro/packages/pebbl/src/pbb/pebbl/
H A DpbPack.cpp74 outBuffer << totalChildren; in packGeneric()
113 inBuffer >> totalChildren; in unpackGeneric()
/dports/games/gcompris-qt/gcompris-qt-2.0/src/activities/share/
H A DShare.qml53 property int totalChildren: totalBoys + totalGirls
95 if (listModel.count >= items.totalChildren) {
99 … else if (listModel.get(i).countS === Math.floor(items.totalCandies/items.totalChildren))
104 if (rest == 0 && ok == items.totalChildren) {
109 else if (rest == okRest && ok == items.totalChildren) {
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/nomad/ui/app/templates/components/
H A Djob-row.hbs17 {{#if (gt job.totalChildren 0)}}
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/test/jdk/java/lang/ProcessHandle/
H A DTreeTest.java450 long totalChildren = factor * factor * factor + factor * factor + factor; in test5() local
451 Assert.assertTrue(count >= totalChildren, in test5()
452 "expected at least " + totalChildren + ", actual: " + count); in test5()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/test/jdk/java/lang/ProcessHandle/
H A DTreeTest.java450 long totalChildren = factor * factor * factor + factor * factor + factor; in test5() local
451 Assert.assertTrue(count >= totalChildren, in test5()
452 "expected at least " + totalChildren + ", actual: " + count); in test5()
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/test/jdk/java/lang/ProcessHandle/
H A DTreeTest.java450 long totalChildren = factor * factor * factor + factor * factor + factor; in test5() local
451 Assert.assertTrue(count >= totalChildren, in test5()
452 "expected at least " + totalChildren + ", actual: " + count); in test5()
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/test/jdk/java/lang/ProcessHandle/
H A DTreeTest.java450 long totalChildren = factor * factor * factor + factor * factor + factor; in test5() local
451 Assert.assertTrue(count >= totalChildren, in test5()
452 "expected at least " + totalChildren + ", actual: " + count); in test5()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/test/jdk/java/lang/ProcessHandle/
H A DTreeTest.java450 long totalChildren = factor * factor * factor + factor * factor + factor; in test5() local
451 Assert.assertTrue(count >= totalChildren, in test5()
452 "expected at least " + totalChildren + ", actual: " + count); in test5()
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/test/jdk/java/lang/ProcessHandle/
H A DTreeTest.java450 long totalChildren = factor * factor * factor + factor * factor + factor; in test5() local
451 Assert.assertTrue(count >= totalChildren, in test5()
452 "expected at least " + totalChildren + ", actual: " + count); in test5()
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/test/jdk/java/lang/ProcessHandle/
H A DTreeTest.java450 long totalChildren = factor * factor * factor + factor * factor + factor; in test5() local
451 Assert.assertTrue(count >= totalChildren, in test5()
452 "expected at least " + totalChildren + ", actual: " + count); in test5()
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/test/jdk/java/lang/ProcessHandle/
H A DTreeTest.java450 long totalChildren = factor * factor * factor + factor * factor + factor; in test5() local
451 Assert.assertTrue(count >= totalChildren, in test5()
452 "expected at least " + totalChildren + ", actual: " + count); in test5()
/dports/sysutils/nomad/nomad-1.1.0/ui/app/templates/components/
H A Djob-row.hbs23 {{#if (gt this.job.totalChildren 0)}}
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/acro/packages/pebbl/src/bb/pebbl/
H A Dbranching.h1239 int totalChildren; variable
1267 if ((desired >= 0) && (desired < totalChildren)) in chooseChild()
1272 return totalChildren - childrenLeft; in chooseChild()
1360 totalChildren = childrenLeft = 0;
H A Dbranching.cpp865 childrenLeft = totalChildren = 0; in splitProblem()
873 childrenLeft = totalChildren = n; in splitProblem()
875 << " has " << totalChildren << " children.\n"); in splitProblem()
880 return totalChildren; in splitProblem()
901 << totalChildren - childrenLeft in child()
1935 *vout << totalChildren << ' '; in valLogSplitPrint()
/dports/emulators/sameboy/SameBoy-0.14.7/HexFiend/
H A DHFBTree.m573 ChildIndex_t totalChildren = (childCount + neighborCount);
575 …if (totalChildren <= 2 * BTREE_LEAF_ORDER && totalChildren >= 2 * BTREE_LEAF_MINIMUM_VALUE_COUNT) {
576 ChildIndex_t finalMyCount = totalChildren / 2;
577 ChildIndex_t finalNeighborCount = totalChildren - finalMyCount;
/dports/shells/ksh93-devel/ast-cc1bca27/src/lib/libtk/generic/
H A DtkTextBTree.c2898 int totalChildren, firstChildren, i; local
2951 totalChildren = nodePtr->numChildren + otherPtr->numChildren;
2952 firstChildren = totalChildren/2;
2998 if (totalChildren <= MAX_CHILDREN) {
/dports/shells/ksh93/ast-93u/src/lib/libtk/generic/
H A DtkTextBTree.c2898 int totalChildren, firstChildren, i; local
2951 totalChildren = nodePtr->numChildren + otherPtr->numChildren;
2952 firstChildren = totalChildren/2;
2998 if (totalChildren <= MAX_CHILDREN) {
/dports/shells/ast-ksh/ast-ksh93v/src/lib/libtk/generic/
H A DtkTextBTree.c2898 int totalChildren, firstChildren, i; local
2951 totalChildren = nodePtr->numChildren + otherPtr->numChildren;
2952 firstChildren = totalChildren/2;
2998 if (totalChildren <= MAX_CHILDREN) {

12