Home
last modified time | relevance | path

Searched refs:numberOfChildren (Results 1 – 25 of 126) sorted by relevance

123456

/dports/www/grafana8/grafana-8.3.6/packages/grafana-ui/src/utils/
H A Dsquares.ts14 numberOfChildren: number
16 const vertical = calculateSizeOfChild(parentWidth, parentHeight, numberOfChildren);
17 const horizontal = calculateSizeOfChild(parentHeight, parentWidth, numberOfChildren);
20 let yCount = Math.ceil(numberOfChildren / xCount);
23 xCount = Math.ceil(numberOfChildren / yCount);
25 const itemsOnLastRow = xCount - (xCount * yCount - numberOfChildren);
37 function calculateSizeOfChild(parentWidth: number, parentHeight: number, numberOfChildren: number):…
38 const parts = Math.ceil(Math.sqrt((numberOfChildren * parentWidth) / parentHeight));
40 if (Math.floor((parts * parentHeight) / parentWidth) * parts < numberOfChildren) {
/dports/www/pear-Services_GeoNames/Services_GeoNames-1.0.1/tests/data/
H A Dtest_children.dat12 "numberOfChildren": 4,
28 "numberOfChildren": 1,
44 "numberOfChildren": 5,
60 "numberOfChildren": 2,
76 "numberOfChildren": 5,
92 "numberOfChildren": 5,
108 "numberOfChildren": 4,
124 "numberOfChildren": 5,
140 "numberOfChildren": 4,
172 "numberOfChildren": 8,
[all …]
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Core/Common/include/
H A DitkTreeNode.hxx38 const auto numberOfChildren = static_cast< ChildIdentifier >( m_Children.size() ); in ~TreeNode() local
40 for ( ChildIdentifier i = numberOfChildren; i > 0; i-- ) in ~TreeNode()
64 const auto numberOfChildren = static_cast< ChildIdentifier >( m_Children.size() ); in GetChild() local
66 if ( number < numberOfChildren ) in GetChild()
165 const auto numberOfChildren = static_cast< ChildIdentifier >( m_Children.size() ); in ReplaceChild() local
167 for ( ChildIdentifier i = 0; i < numberOfChildren; i++ ) in ReplaceChild()
184 const auto numberOfChildren = static_cast< ChildIdentifier >( m_Children.size() ); in ChildPosition() local
186 for ( ChildIdentifier i = 0; i < numberOfChildren; i++ ) in ChildPosition()
204 for ( ChildIdentifier i = 0; i < numberOfChildren; i++ ) in ChildPosition()
235 if ( childId > numberOfChildren ) in AddChild()
[all …]
/dports/www/pear-Services_GeoNames/Services_GeoNames-1.0.1/tests/
H A Dtest_children.phpt28 [numberOfChildren] => 4
46 [numberOfChildren] => 1
64 [numberOfChildren] => 5
82 [numberOfChildren] => 2
100 [numberOfChildren] => 5
118 [numberOfChildren] => 5
136 [numberOfChildren] => 4
154 [numberOfChildren] => 5
172 [numberOfChildren] => 4
208 [numberOfChildren] => 8
[all …]
/dports/math/stp/stp-2.3.3/lib/Simplifier/constantBitP/
H A DConstantBitP_Arithmetic.cpp93 unsigned maximumCarryInForAddition(int numberOfChildren, int index) in maximumCarryInForAddition() argument
95 assert(numberOfChildren > 1); in maximumCarryInForAddition()
101 if (numberOfChildren == 2) in maximumCarryInForAddition()
109 result = (result + numberOfChildren) >> 1; in maximumCarryInForAddition()
212 const int numberOfChildren, in initialiseColumnCounts() argument
219 columnH[i] = numberOfChildren; in initialiseColumnCounts()
225 for (int j = 0; j < numberOfChildren; j++) in initialiseColumnCounts()
344 const size_t numberOfChildren = children.size(); in bvAddBothWays() local
345 if (numberOfChildren == 2) in bvAddBothWays()
352 for (size_t i = 0; i < numberOfChildren; i++) in bvAddBothWays()
[all …]
H A DConstantBitP_Boolean.cpp134 const int numberOfChildren = children.size(); in bvOrBothWays() local
148 for (int j = 0; j < numberOfChildren; j++) in bvOrBothWays()
172 else if (zeroes == numberOfChildren) // all zeroes. in bvOrBothWays()
188 for (int j = 0; j < numberOfChildren; j++) in bvOrBothWays()
199 (zeroes == (numberOfChildren - 1))) in bvOrBothWays()
204 for (int j = 0; j < numberOfChildren; j++) in bvOrBothWays()
H A DConstantBitP_MaxPrecision.cpp203 const int numberOfChildren = children.size(); in maxBoundsPrecision() local
215 for (int i = 0; i < numberOfChildren; i++) in maxBoundsPrecision()
321 for (int i = 0; i < numberOfChildren; i++) in maxBoundsPrecision()
336 for (int i = 0; i < numberOfChildren; i++) in maxBoundsPrecision()
372 for (int i = 0; i < numberOfChildren; i++) in maxBoundsPrecision()
400 const int numberOfChildren = children.size(); in maxPrecision() local
414 for (int i = 0; i < numberOfChildren; i++) in maxPrecision()
509 for (int i = 0; i < numberOfChildren; i++) in maxPrecision()
525 for (int i = 0; i < numberOfChildren; i++) in maxPrecision()
/dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/util/
H A DMDD.java642 int numberOfChildren = -1; in reduce() local
646 numberOfChildren++; in reduce()
650 numberOfChildren++; in reduce()
654 if (same[level][numberOfChildren] != null) in reduce()
655 for (int j = same[level][numberOfChildren].size() - 1; j >= 0; j--) { in reduce()
656 int[] currentNode = same[level][numberOfChildren].get(j); in reduce()
664 return id[level][numberOfChildren].get(j); in reduce()
669 same[level][numberOfChildren] = new ArrayList<int[]>(); in reduce()
670 id[level][numberOfChildren] = new ArrayList<Integer>(); in reduce()
674 id[level][numberOfChildren].add(node); in reduce()
[all …]
/dports/science/InsightToolkit/ITK-5.0.1/Modules/IO/SpatialObjects/test/
H A DitkReadVesselTubeSpatialObjectTest.cxx52 const unsigned int numberOfChildren = group->GetNumberOfChildren(); in itkReadVesselTubeSpatialObjectTest() local
53 std::cout << "Number of children: " << numberOfChildren << std::endl; in itkReadVesselTubeSpatialObjectTest()
54 if( numberOfChildren != 1 ) in itkReadVesselTubeSpatialObjectTest()
/dports/math/stp/stp-2.3.3/lib/Simplifier/
H A DRemoveUnconstrained.cpp244 const size_t numberOfChildren = children.size(); in topLevel_other() local
252 if (numberOfChildren == 2) in topLevel_other()
276 for (size_t i = 0; i < numberOfChildren; i++) in topLevel_other()
300 assert(numberOfChildren == 2); in topLevel_other()
335 assert(numberOfChildren == 1); in topLevel_other()
524 for (size_t i = 0; i < numberOfChildren; i++) in topLevel_other()
585 assert(numberOfChildren == 2); in topLevel_other()
599 assert(numberOfChildren == 2); in topLevel_other()
614 assert(numberOfChildren == 2); in topLevel_other()
627 assert(numberOfChildren == 2); in topLevel_other()
[all …]
/dports/astro/celestia-gtk/celestia-1.6.1/macosx/
H A DCelestiaFavorites.m16 NSMutableArray* children = [NSMutableArray arrayWithCapacity:[self numberOfChildren]];
38 …eturn [NSString stringWithFormat:@"<CelestiaFavorites numberOfChildren=%d>",[self numberOfChildren…
/dports/astro/celestia/celestia-1.6.1/macosx/
H A DCelestiaFavorites.m16 NSMutableArray* children = [NSMutableArray arrayWithCapacity:[self numberOfChildren]];
38 …eturn [NSString stringWithFormat:@"<CelestiaFavorites numberOfChildren=%d>",[self numberOfChildren…
/dports/games/lizzie/lizzie-0.6-105-gd0e7040/src/main/java/featurecat/lizzie/rules/
H A DBoardHistoryNode.java155 public int numberOfChildren() { in numberOfChildren() method in BoardHistoryNode
160 return numberOfChildren() > 1; in hasVariations()
249 if (idx < numberOfChildren()) { in deleteChild()
374 for (int i = 0; i < numberOfChildren(); i++) { in indexOfNode()
391 for (int i = 0; i < numberOfChildren(); i++) { in findIndexOfNode()
412 for (int i = 0; i < numberOfChildren(); i++) { in depthOfNode()
/dports/math/vtk9/VTK-9.1.0/IO/PIO/
H A DBHTree.cxx163 this->numberOfChildren = numChild; in BHTree()
184 new BHNode(this->dimension, this->numberOfChildren, this->minRange, this->maxRange); in BHTree()
246 new BHNode(this->dimension, this->numberOfChildren, this->bhNode[tindx], oindx); in insertLeaf()
285 for (j = 0; j < this->numberOfChildren; j++) in print()
/dports/graphics/opencollada/OpenCOLLADA-1.6.68/COLLADAMax/src/
H A DCOLLADAMaxGeometriesExporter.cpp78 size_t numberOfChildren = exportNode->getNumberOfChildren(); in doExport() local
80 for ( size_t i = 0; i < numberOfChildren; ++i ) in doExport()
H A DCOLLADAMaxExportSceneGraph.cpp140 int numberOfChildren = iNode->NumberOfChildren(); in create() local
142 for ( int i = 0; i < numberOfChildren; ++i ) in create()
292 size_t numberOfChildren = exportNode->getNumberOfChildren(); in findReferencedObjects() local
294 for ( size_t i = 0; i < numberOfChildren; ++i ) in findReferencedObjects()
/dports/biology/canu/canu-2.2/src/correction/
H A Dfalconsense.C118 layout->tigID(), layout->length(), estlen, layout->numberOfChildren(), estmem >> 20); in generateFalconConsensus()
125 falconInput *evidence = new falconInput [layout->numberOfChildren() + 1]; in generateFalconConsensus()
137 for (uint32 cc=0; cc<layout->numberOfChildren(); cc++) { in generateFalconConsensus()
171 falconData *fd = fc->generateConsensus(evidence, layout->numberOfChildren() + 1); in generateFalconConsensus()
522 … fprintf(stdout, "%8u %7u %8u", layout->tigID(), layout->length(), layout->numberOfChildren()); in main()
609 for (uint32 cc=0; cc<layout->numberOfChildren(); cc++) { in main()
669 for (uint32 cc=0; cc<layout->numberOfChildren(); cc++) in main()
/dports/lang/fpc-source/fpc-3.2.2/packages/cocoaint/src/pdfkit/
H A DPDFOutline.inc31 function numberOfChildren: NSUInteger; message 'numberOfChildren';
/dports/math/vtk8/VTK-8.2.0/Infovis/Layout/
H A DvtkCosmicTreeLayoutStrategy.cxx421 vtkIdType numberOfChildren = tree->GetNumberOfChildren( root ); in LayoutChildren() local
431 for ( childIdx = 0; childIdx < numberOfChildren; ++ childIdx ) in LayoutChildren()
444 for ( childIdx = 0; childIdx < numberOfChildren; ++ childIdx ) in LayoutChildren()
454 if ( numberOfChildren <= 0 ) in LayoutChildren()
461 vtkCosmicTreeLayoutStrategyComputeCentersQuick( numberOfChildren, circles, Rext ); in LayoutChildren()
/dports/math/vtk9/VTK-9.1.0/Infovis/Layout/
H A DvtkCosmicTreeLayoutStrategy.cxx427 vtkIdType numberOfChildren = tree->GetNumberOfChildren(root); in LayoutChildren() local
439 for (childIdx = 0; childIdx < numberOfChildren; ++childIdx) in LayoutChildren()
453 for (childIdx = 0; childIdx < numberOfChildren; ++childIdx) in LayoutChildren()
463 if (numberOfChildren <= 0) in LayoutChildren()
470 vtkCosmicTreeLayoutStrategyComputeCentersQuick(numberOfChildren, circles, Rext); in LayoutChildren()
/dports/math/vtk6/VTK-6.2.0/Infovis/Layout/
H A DvtkCosmicTreeLayoutStrategy.cxx421 vtkIdType numberOfChildren = tree->GetNumberOfChildren( root ); in LayoutChildren() local
431 for ( childIdx = 0; childIdx < numberOfChildren; ++ childIdx ) in LayoutChildren()
444 for ( childIdx = 0; childIdx < numberOfChildren; ++ childIdx ) in LayoutChildren()
454 if ( numberOfChildren <= 0 ) in LayoutChildren()
461 vtkCosmicTreeLayoutStrategyComputeCentersQuick( numberOfChildren, circles, Rext ); in LayoutChildren()
/dports/biology/canu/canu-2.2/src/stores/
H A DtgStoreDump.C107 return((tig->numberOfChildren() < minNreads) || in ignoreNreads()
108 (maxNreads < tig->numberOfChildren())); in ignoreNreads()
125 for (uint32 i=0; i<tig->numberOfChildren(); i++) { in ignoreCoverage()
215 tig->numberOfChildren()); in dumpTig()
334 for (uint32 ci=0; ci<tig->numberOfChildren(); ci++) in dumpInfo()
537 for (uint32 ci=0; ci<tig->numberOfChildren(); ci++) { in dumpDepthHistogram()
607 for (uint32 ci=0; ci<tig->numberOfChildren(); ci++) { in dumpCoverage()
766 for (uint32 ri=0; ri<tig->numberOfChildren(); ri++) { in dumpThinOverlap()
793 for (uint32 ri=0; ri<tig->numberOfChildren(); ri++) { in dumpThinOverlap()
844 int32 tn = tig->numberOfChildren(); in dumpOverlapHistogram()
/dports/cad/ldview/ldview-4.4/MacOSX/LDView/
H A DErrorsAndWarnings.mm135 int count = (int)[item numberOfChildren];
231 NSInteger numChildren = [item numberOfChildren];
344 NSInteger retValue = [item numberOfChildren];
358 return [item numberOfChildren] != -1;
387 int count = (int)[unfilteredRoot numberOfChildren];
/dports/devel/sope2/SOPE/sope-appserver/NGObjWeb/
H A DWOWatchDogApplicationMain.m151 int numberOfChildren; field
475 numberOfChildren = 0;
625 if (currentNumber < numberOfChildren) {
626 delta = numberOfChildren - currentNumber;
635 else if (currentNumber > numberOfChildren) {
636 delta = currentNumber - numberOfChildren;
799 for (count = 0; !child && count < numberOfChildren; count++) {
843 numberOfChildren = newNumberOfChildren;
853 for (count = 0; count < numberOfChildren; count++) {
860 if ([downChildren count] == numberOfChildren) {
[all …]
/dports/devel/sope/SOPE/sope-appserver/NGObjWeb/
H A DWOWatchDogApplicationMain.m151 int numberOfChildren; field
475 numberOfChildren = 0;
625 if (currentNumber < numberOfChildren) {
626 delta = numberOfChildren - currentNumber;
635 else if (currentNumber > numberOfChildren) {
636 delta = currentNumber - numberOfChildren;
799 for (count = 0; !child && count < numberOfChildren; count++) {
843 numberOfChildren = newNumberOfChildren;
853 for (count = 0; count < numberOfChildren; count++) {
860 if ([downChildren count] == numberOfChildren) {
[all …]

123456