Home
last modified time | relevance | path

Searched refs:numBoxes (Results 1 – 25 of 104) sorted by relevance

12345

/dports/x11-toolkits/open-motif/motif-2.3.8/lib/Xm/
H A DGeoUtils.c1115 numBoxes = 0 ; in _XmGeoGetDimensions()
1121 ++numBoxes ; in _XmGeoGetDimensions()
1407 unsigned int numBoxes, in _XmGeoCalcFill() argument
1422 { if( numBoxes == 1 ) in _XmGeoCalcFill()
1609 unsigned int numBoxes, in FitBoxesAveraging() argument
1656 if( Index < numBoxes ) in FitBoxesAveraging()
1691 unsigned int numBoxes, in FitBoxesProportional() argument
1748 unsigned int numBoxes, in SegmentFill() argument
1895 numBoxes = 0 ; in _XmGeoLayoutWrap()
1908 numBoxes = 0 ; in _XmGeoLayoutWrap()
[all …]
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/dpm/src/
H A Ddpm_nms.cpp70 int numBoxes = (int) detections.size(); in process() local
72 if (numBoxes <= 0) in process()
75 vector< double > area(numBoxes); in process()
76 vector< double > score(numBoxes); in process()
77 vector< int > indices(numBoxes); in process()
79 for (int i = 0; i < numBoxes; i++) in process()
/dports/x11-toolkits/qwt6/qwt-6.1.6/examples/controls/
H A Dwheeltab.cpp8 const int numBoxes = 4; in WheelTab() local
11 for ( int i = 0; i < numBoxes; i++ ) in WheelTab()
18 for ( int i = 0; i < numBoxes; i++ ) in WheelTab()
20 WheelBox *box = new WheelBox( Qt::Horizontal, i + numBoxes ); in WheelTab()
/dports/misc/mnn/MNN-1.2.0/source/backend/tensorrt/execution/plugin/
H A DDetectionPostProcessPlugin.cu6 …nerEncoding* decodeBoxesPtr, const CenterSizeEncoding& scaleValues, int numBoxes, int boxCoordNum,… in decodeBoxes_kernel() argument
86 …__global__ void nms_kernel(const int count, int numBoxes, float scoreThreshold, float iouThreshold… in nms_kernel() argument
90 for(int i = 0; i < numBoxes; i++){ in nms_kernel()
138 …oid *const * outputs, const void * scaleValues, void * decodeBoxes, int numBoxes, int boxCoordNum,… in decodeBoxes() argument
142 …ecodeBoxes), *reinterpret_cast<const CenterSizeEncoding*>(scaleValues), numBoxes, boxCoordNum, anc… in decodeBoxes()
144 …ecodeBoxes), *reinterpret_cast<const CenterSizeEncoding*>(scaleValues), numBoxes, boxCoordNum, anc… in decodeBoxes()
156 …float iouThreshold, float scoreThreshold, int* selectedPtr, int* selectedSize, int numBoxes, int o… in NMSSingleClasss() argument
157 …copy_candidate<float><<<CAFFE_GET_BLOCKS(numBoxes), CUDA_NUM_THREADS>>>(numBoxes, candidate, score… in NMSSingleClasss()
158 …el<float><<<CAFFE_GET_BLOCKS(outputNum), CUDA_NUM_THREADS>>>(outputNum, numBoxes, scoreThreshold, … in NMSSingleClasss()
/dports/science/axom/axom-0.6.1/src/axom/spin/
H A DBVH.hpp380 IndexType numBoxes,
410 IndexType numBoxes) in initialize() argument
424 if(numBoxes == 0) in initialize()
435 if(numBoxes == 1) in initialize()
437 numBoxes = 2; in initialize()
438 boxesptr = axom::allocate<BoxType>(numBoxes, m_AllocatorID); in initialize()
455 m_bvh->buildImpl(boxesptr, numBoxes, m_scaleFactor, m_AllocatorID); in initialize()
459 m_bvh->buildImpl(boxes, numBoxes, m_scaleFactor, m_AllocatorID); in initialize()
555 IndexType numBoxes, in findBoundingBoxes() argument
582 numBoxes, in findBoundingBoxes()
/dports/audio/vst3sdk/vst3sdk-3.7.1_build_50-1-g8199057/vstgui4/vstgui/lib/
H A Dcshadowviewcontainer.cpp119 template <size_t numBoxes>
120 static std::array<int32_t, numBoxes> boxesForGauss (double sigma) in boxesForGauss()
122 std::array<int32_t, numBoxes> boxes; in boxesForGauss()
123 double ideal = std::sqrt ((12 * sigma * sigma / numBoxes) + 1); in boxesForGauss()
128 …ideal = ((12. * sigma * sigma) - (numBoxes * l * l) - (4. * numBoxes * l) - (3. * numBoxes)) / ((-… in boxesForGauss()
130 for (int32_t i = 0; i < numBoxes; ++i) in boxesForGauss()
/dports/audio/surge-synthesizer-lv2/surge-release_1.9.0/vstgui.surge/vstgui/lib/
H A Dcshadowviewcontainer.cpp119 template <size_t numBoxes>
120 static std::array<int32_t, numBoxes> boxesForGauss (double sigma) in boxesForGauss()
122 std::array<int32_t, numBoxes> boxes; in boxesForGauss()
123 double ideal = std::sqrt ((12 * sigma * sigma / numBoxes) + 1); in boxesForGauss()
128 …ideal = ((12. * sigma * sigma) - (numBoxes * l * l) - (4. * numBoxes * l) - (3. * numBoxes)) / ((-… in boxesForGauss()
130 for (int32_t i = 0; i < numBoxes; ++i) in boxesForGauss()
/dports/devel/newt/newt-0.52.21/
H A Ddialogboxes.c415 int numBoxes = 0; in checkList() local
440 if (allocedBoxes == numBoxes) { in checkList()
454 cbInfo[numBoxes].tag = arg; in checkList()
459 cbInfo[numBoxes].text = arg; in checkList()
463 cbInfo[numBoxes].text = ""; in checkList()
467 cbStates[numBoxes] = '*'; in checkList()
469 cbStates[numBoxes] = ' '; in checkList()
474 numBoxes++; in checkList()
482 if (listHeight < numBoxes) { in checkList()
497 for (i = 0; i < numBoxes; i++) { in checkList()
[all …]
/dports/misc/mnn/MNN-1.2.0/source/backend/cpu/
H A DCPUDetectionPostProcess.cpp19 const int numBoxes = boxesEncoding->length(1); in _decodeBoxes() local
23 …MNN_CHECK(numBoxes == numAnchors, "the number of input boxes should be equal to the number of anch… in _decodeBoxes()
33 for (int idx = 0; idx < numBoxes; ++idx) { in _decodeBoxes()
54 const int numBoxes = decodedBoxes->length(0); in _NonMaxSuppressionMultiClassFastImpl() local
63 maxScores.resize(numBoxes); in _NonMaxSuppressionMultiClassFastImpl()
65 sortedClassIndices.resize(numBoxes * numClasses); in _NonMaxSuppressionMultiClassFastImpl()
68 for (int idx = 0; idx < numBoxes; ++idx) { in _NonMaxSuppressionMultiClassFastImpl()
H A DCPUNonMaxSuppressionV2.cpp54 const int numBoxes = decodedBoxes->length(0); in NonMaxSuppressionSingleClasssImpl() local
57 const int outputNum = std::min(maxDetections, numBoxes); in NonMaxSuppressionSingleClasssImpl()
58 std::vector<float> scoresData(numBoxes); in NonMaxSuppressionSingleClasssImpl()
59 std::copy_n(scores, numBoxes, scoresData.begin()); in NonMaxSuppressionSingleClasssImpl()
/dports/cad/electric/electric-7.00/src/io/
H A Diopsoutcolor.cpp154 INTBIG numBoxes; member
793 INTBIG i, numBoxes = 0; in io_pscolor_makeBoxQuadTree() local
801 if (g->visible) numBoxes++; in io_pscolor_makeBoxQuadTree()
817 io_pscolor_boxQuadTrees[layer]->numBoxes = numBoxes; in io_pscolor_makeBoxQuadTree()
847 INTBIG i, numBoxes; in io_pscolor_recursivelyMakeBoxQuadTree() local
869 numBoxes = 0; in io_pscolor_recursivelyMakeBoxQuadTree()
879 numBoxes++; in io_pscolor_recursivelyMakeBoxQuadTree()
883 q->numBoxes = numBoxes; in io_pscolor_recursivelyMakeBoxQuadTree()
915 q->numBoxes = count; in io_pscolor_splitTree()
1133 if (q1->numBoxes && q2->numBoxes) { in io_pscolor_checkOverlapAfterFlattening()
[all …]
/dports/math/py-matplotlib2/matplotlib-2.2.4/examples/statistics/
H A Dboxplot_demo.py130 numBoxes = numDists*2 variable
131 medians = list(range(numBoxes))
132 for i in range(numBoxes):
159 ax1.set_xlim(0.5, numBoxes + 0.5)
170 pos = np.arange(numBoxes) + 1
173 for tick, label in zip(range(numBoxes), ax1.get_xticklabels()):
/dports/math/py-matplotlib2/matplotlib-2.2.4/lib/mpl_examples/statistics/
H A Dboxplot_demo.py130 numBoxes = numDists*2 variable
131 medians = list(range(numBoxes))
132 for i in range(numBoxes):
159 ax1.set_xlim(0.5, numBoxes + 0.5)
170 pos = np.arange(numBoxes) + 1
173 for tick, label in zip(range(numBoxes), ax1.get_xticklabels()):
/dports/textproc/p5-XML-Mini/XML-Mini-1.38/t/
H A D02parsexml.t13 my $numBoxes = 20;
28 ok($numchildren, $numBoxes);
35 ok(scalar @{$childList}, $numBoxes);
/dports/science/PETSc/petsc-3.14.1/src/vec/vec/utils/tagger/interface/
H A Dtagger.c372 PetscErrorCode VecTaggerComputeBoxes(VecTagger tagger,Vec vec,PetscInt *numBoxes,VecTaggerBox **box… in VecTaggerComputeBoxes() argument
380 PetscValidIntPointer(numBoxes,3); in VecTaggerComputeBoxes()
385 …if (tagger->ops->computeboxes) {ierr = (*tagger->ops->computeboxes) (tagger,vec,numBoxes,boxes);CH… in VecTaggerComputeBoxes()
430 { PetscInt numBoxes; in VecTaggerComputeIS_FromBoxes() local
441 ierr = VecTaggerComputeBoxes(tagger,vec,&numBoxes,&boxes);CHKERRQ(ierr); in VecTaggerComputeIS_FromBoxes()
456 for (k = 0; k < numBoxes; k++) { in VecTaggerComputeIS_FromBoxes()
476 if ((PetscBool)(k < numBoxes) ^ invert) { in VecTaggerComputeIS_FromBoxes()
/dports/math/eigen3/eigen-3.3.9/unsupported/Eigen/src/BVH/
H A DKdBVH.h144 int numBoxes = static_cast<int>(boxes.size());
147 if(children[idx + 1] < numBoxes) { //second index is always bigger
152 else if(children[idx] >= numBoxes) { //if both children are objects
154 outOBegin = &(objects[children[idx] - numBoxes]);
159 outOBegin = &(objects[children[idx + 1] - numBoxes]);
/dports/math/stanmath/math-4.2.0/lib/eigen_3.3.9/unsupported/Eigen/src/BVH/
H A DKdBVH.h144 int numBoxes = static_cast<int>(boxes.size());
147 if(children[idx + 1] < numBoxes) { //second index is always bigger
152 else if(children[idx] >= numBoxes) { //if both children are objects
154 outOBegin = &(objects[children[idx] - numBoxes]);
159 outOBegin = &(objects[children[idx + 1] - numBoxes]);
/dports/math/R-cran-RcppEigen/RcppEigen/inst/include/unsupported/Eigen/src/BVH/
H A DKdBVH.h144 int numBoxes = static_cast<int>(boxes.size());
147 if(children[idx + 1] < numBoxes) { //second index is always bigger
152 else if(children[idx] >= numBoxes) { //if both children are objects
154 outOBegin = &(objects[children[idx] - numBoxes]);
159 outOBegin = &(objects[children[idx + 1] - numBoxes]);
/dports/devel/upp/upp/uppsrc/plugin/Eigen/unsupported/Eigen/src/BVH/
H A DKdBVH.h144 int numBoxes = static_cast<int>(boxes.size());
147 if(children[idx + 1] < numBoxes) { //second index is always bigger
152 else if(children[idx] >= numBoxes) { //if both children are objects
154 outOBegin = &(objects[children[idx] - numBoxes]);
159 outOBegin = &(objects[children[idx + 1] - numBoxes]);
/dports/math/libmesh/libmesh-1.6.2/contrib/eigen/3.2.9/unsupported/Eigen/src/BVH/
H A DKdBVH.h143 int numBoxes = static_cast<int>(boxes.size());
146 if(children[idx + 1] < numBoxes) { //second index is always bigger
151 else if(children[idx] >= numBoxes) { //if both children are objects
153 outOBegin = &(objects[children[idx] - numBoxes]);
158 outOBegin = &(objects[children[idx + 1] - numBoxes]);
/dports/math/libsemigroups/libsemigroups-1.3.7/extern/eigen-3.3.7/unsupported/Eigen/src/BVH/
H A DKdBVH.h144 int numBoxes = static_cast<int>(boxes.size());
147 if(children[idx + 1] < numBoxes) { //second index is always bigger
152 else if(children[idx] >= numBoxes) { //if both children are objects
154 outOBegin = &(objects[children[idx] - numBoxes]);
159 outOBegin = &(objects[children[idx + 1] - numBoxes]);
/dports/science/pcmsolver/pcmsolver-1.3.0/external/eigen3/include/eigen3/unsupported/Eigen/src/BVH/
H A DKdBVH.h143 int numBoxes = static_cast<int>(boxes.size());
146 if(children[idx + 1] < numBoxes) { //second index is always bigger
151 else if(children[idx] >= numBoxes) { //if both children are objects
153 outOBegin = &(objects[children[idx] - numBoxes]);
158 outOBegin = &(objects[children[idx + 1] - numBoxes]);
/dports/graphics/wdune/wdune-1.926/vcglib/eigenlib/unsupported/Eigen/src/BVH/
H A DKdBVH.h143 int numBoxes = static_cast<int>(boxes.size());
146 if(children[idx + 1] < numBoxes) { //second index is always bigger
151 else if(children[idx] >= numBoxes) { //if both children are objects
153 outOBegin = &(objects[children[idx] - numBoxes]);
158 outOBegin = &(objects[children[idx + 1] - numBoxes]);
/dports/misc/opennn/opennn-5.0.5/eigen/unsupported/Eigen/src/BVH/
H A DKdBVH.h144 int numBoxes = static_cast<int>(boxes.size());
147 if(children[idx + 1] < numBoxes) { //second index is always bigger
152 else if(children[idx] >= numBoxes) { //if both children are objects
154 outOBegin = &(objects[children[idx] - numBoxes]);
159 outOBegin = &(objects[children[idx + 1] - numBoxes]);
/dports/misc/openmvg/openMVG-2.0/src/third_party/eigen/unsupported/Eigen/src/BVH/
H A DKdBVH.h144 int numBoxes = static_cast<int>(boxes.size());
147 if(children[idx + 1] < numBoxes) { //second index is always bigger
152 else if(children[idx] >= numBoxes) { //if both children are objects
154 outOBegin = &(objects[children[idx] - numBoxes]);
159 outOBegin = &(objects[children[idx + 1] - numBoxes]);

12345