/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/convex/operators/ |
H A D | conv-exprSinCos.cpp | 116 int ncuts = 0, in trigEnvelope() local 138 return ncuts; in trigEnvelope() 164 int ncuts = 0, in bayEnvelope() local 184 ncuts += cg -> addTangent (cs, wi, xi, x0, sin (rx0), cos (rx0), -up); in bayEnvelope() 197 ncuts += cg -> addSegment (cs, wi, xi, x0, sin (rx0), base+tpt, sin (tpt), up); in bayEnvelope() 209 ncuts += cg -> addTangent (cs, wi, xi, x0, sinrx0, cosrx0, -up); in bayEnvelope() 218 ncuts += cg->addSegment (cs, wi, xi, x0, sin(rx0), base+tpt, sin(tpt), -up); in bayEnvelope() 235 ncuts += cg -> addSegment (cs, wi, xi, x0, sin (rx0), base + tpt, sin (tpt), up); in bayEnvelope() 238 return ncuts; in bayEnvelope() 257 int ncuts = 0, in addHexagon() local [all …]
|
/dports/math/cgl/Cgl-releases-0.60.3/Cgl/examples/ |
H A D | cgl_data_test.cpp | 83 int ncuts = cuts.sizeRowCuts(); in main() local 85 const OsiRowCut **newRowCuts = new const OsiRowCut * [ncuts]; in main() 86 for(i=0; i<ncuts; i++) { in main() 89 clp->applyRowCuts(ncuts, newRowCuts); in main() 93 round, ncuts, clp->getObjValue()); in main() 155 int ncuts = cuts.sizeRowCuts(); in main() local 157 const OsiRowCut **newRowCuts = new const OsiRowCut * [ncuts]; in main() 158 for(i=0; i<ncuts; i++) { in main() 161 clp->applyRowCuts(ncuts, newRowCuts); in main() 165 round, ncuts, clp->getObjValue()); in main()
|
/dports/math/SCIP/scip-7.0.3/src/scip/ |
H A D | sepa_impliedbounds.c | 87 assert(ncuts != NULL); in addCut() 118 (*ncuts)++; in addCut() 150 assert(ncuts != NULL); in separateCuts() 153 *ncuts = 0; in separateCuts() 213 ub, cutoff, ncuts) ); in separateCuts() 351 rhs, cutoff, ncuts) ); in separateCuts() 414 int ncuts; in SCIP_DECL_SEPAEXECLP() local 442 else if ( ncuts > 0 ) in SCIP_DECL_SEPAEXECLP() 466 int ncuts; in SCIP_DECL_SEPAEXECSOL() local 498 ncuts = 0; in SCIP_DECL_SEPAEXECSOL() [all …]
|
H A D | cutpool.c | 439 (*cutpool)->ncuts = 0; in SCIPcutpoolCreate() 504 cutpool->ncuts = 0; in SCIPcutpoolClear() 561 --cutpool->ncuts; in cutpoolDelCut() 566 if( pos < cutpool->ncuts ) in cutpoolDelCut() 750 cut->pos = cutpool->ncuts; in SCIPcutpoolAddNewRow() 754 cutpool->cuts[cutpool->ncuts] = cut; in SCIPcutpoolAddNewRow() 755 cutpool->ncuts++; in SCIPcutpoolAddNewRow() 1005 cutpool->ncutsfound += ncuts; in SCIPcutpoolSeparate() 1007 if( ncuts > (0.5 * maxncuts) ) in SCIPcutpoolSeparate() 1011 else if( ncuts == 0 || (ncuts < (0.05 * maxncuts)) ) in SCIPcutpoolSeparate() [all …]
|
H A D | sepastore.c | 89 (*sepastore)->ncuts = 0; in SCIPsepastoreCreate() 110 assert((*sepastore)->ncuts == 0); in SCIPsepastoreFree() 126 assert(sepastore->ncuts == 0); in SCIPsepastoreStartInitialLP() 138 assert(sepastore->ncuts == 0); in SCIPsepastoreEndInitialLP() 395 sepastore->ncuts--; in sepastoreDelCut() 472 sepastore->ncuts = 0; in SCIPsepastoreAddCut() 506 pos = sepastore->ncuts; in SCIPsepastoreAddCut() 509 sepastore->ncuts++; in SCIPsepastoreAddCut() 1000 sepastore->ncuts = 0; in SCIPsepastoreClearCuts() 1034 while( c < sepastore->ncuts ) in SCIPsepastoreRemoveInefficaciousCuts() [all …]
|
/dports/devel/R-cran-Hmisc/Hmisc/R/ |
H A D | curveRep.s | 24 ncuts <- sort(unique(c(1:2, ncuts))) 28 names(res) <- as.character(ncuts[-length(ncuts)]) 50 if(pr) cat('Processing sample size [',ncuts[i],',',ncuts[i+1], 100 ncuts=ncuts, kn=kn, kxdist=kxdist, k=k, p=p, 107 ncuts <- x$ncuts 134 z <- if(is.infinite(ncuts[i+1])) ncuts[i] else 135 paste('[', ncuts[i], ',', ncuts[i+1], brack, sep='') 150 ncuts <- x$ncuts 170 z <- if(is.infinite(ncuts[which+1])) ncuts[which] else 171 paste('[',ncuts[which],',',ncuts[which+1],brack,sep='') [all …]
|
/dports/lang/yorick/yorick-y_2_2_04/drat/ |
H A D | track.c | 358 path->ncuts= i; in RayTrack() 362 path->ncuts= 0; in RayTrack() 450 long i,j1,j2,ncuts; in RayTrackS() local 467 ncuts= 0; in RayTrackS() 481 path->ncuts= 0; in RayTrackS() 496 if (j1<ncuts) in RayTrackS() 512 if (j2<ncuts) in RayTrackS() 539 i= ncuts-1-j1; in RayTrackS() 540 ncuts= j2-j1+1; in RayTrackS() 541 if (ncuts < 2) ncuts= 0; in RayTrackS() [all …]
|
H A D | ydrat.c | 244 long ncuts, i; in Y__raw_track() local 269 ncuts= path.ncuts; in Y__raw_track() 270 if (ncuts>1) { in Y__raw_track() 281 for (i=0 ; i<ncuts ; i++) { in Y__raw_track() 402 long ncuts, i; in raw2_worker() local 431 ncuts= array->type.number; in raw2_worker() 433 ncuts= 0; in raw2_worker() 436 if (ncuts) { in raw2_worker() 437 if (ncuts>path.maxcuts) in raw2_worker() 439 path.ncuts= ncuts; in raw2_worker() [all …]
|
H A D | drat.c | 102 double *IntegWorkspace(long ncuts) in IntegWorkspace() argument 104 if (lwork<3*(ncuts-1)) { /* enough workspace? */ in IntegWorkspace() 105 long l= 3*(ncuts-1 + 100); in IntegWorkspace() 129 path.maxcuts= path.ncuts= 0; in IntegFlat() 141 work= IntegWorkspace(path.ncuts); in IntegFlat() 159 path.maxcuts= path.ncuts= 0; in IntegLinear() 171 work= IntegWorkspace(path.ncuts); in IntegLinear()
|
/dports/math/creme/Creme-ab42f19/Creme/src/Base/ |
H A D | locsrch.c | 183 int i,j,k, max, argmax, ncuts, cursat, ndelta; in locsrch() local 246 for (ncuts=k=cursat=0, j=*vl; j>0; j--, pos++, coe++) { in locsrch() 256 cuts++; ncuts++; in locsrch() 265 cuts -= ncuts; in locsrch() 267 qsort ((void *) cuts, (size_t) ncuts, (size_t) sizeof (frontier), compare_frontier); in locsrch() 272 for (j=0; j<ncuts; j++, cuts++) in locsrch() 277 cuts -= ncuts; in locsrch()
|
/dports/math/R-cran-spdep/spdep/R/ |
H A D | skater.R | 1 skater <- function(edges, data, ncuts, crit, vec.crit, argument 31 if (missing(ncuts)) 32 ncuts <- n-cuts 34 ncuts <- ncuts+cuts-1 43 if (cuts>ncuts)
|
/dports/math/vtk8/VTK-8.2.0/Common/DataModel/ |
H A D | vtkBSPCuts.cxx | 261 void vtkBSPCuts::CreateCuts(double *bnds, int ncuts, int *dim, double *coord, in CreateCuts() argument 269 vtkBSPCuts::AllocateArrays(ncuts); in CreateCuts() 276 this->NumberOfCuts = ncuts; in CreateCuts() 278 memcpy(this->Dim, dim, sizeof(int) * ncuts); in CreateCuts() 279 memcpy(this->Coord, coord, sizeof(double) * ncuts); in CreateCuts() 280 memcpy(this->Lower, lower, sizeof(int) * ncuts); in CreateCuts() 281 memcpy(this->Upper, upper, sizeof(int) * ncuts); in CreateCuts() 285 memcpy(this->LowerDataCoord, lowerDataCoord, sizeof(double) * ncuts); in CreateCuts() 295 memcpy(this->UpperDataCoord, upperDataCoord, sizeof(double) * ncuts); in CreateCuts() 305 memcpy(this->Npoints, npoints, sizeof(int) * ncuts); in CreateCuts()
|
/dports/math/vtk9/VTK-9.1.0/Common/DataModel/ |
H A D | vtkBSPCuts.cxx | 260 void vtkBSPCuts::CreateCuts(double* bnds, int ncuts, int* dim, double* coord, int* lower, in CreateCuts() argument 266 vtkBSPCuts::AllocateArrays(ncuts); in CreateCuts() 273 this->NumberOfCuts = ncuts; in CreateCuts() 275 memcpy(this->Dim, dim, sizeof(int) * ncuts); in CreateCuts() 276 memcpy(this->Coord, coord, sizeof(double) * ncuts); in CreateCuts() 277 memcpy(this->Lower, lower, sizeof(int) * ncuts); in CreateCuts() 278 memcpy(this->Upper, upper, sizeof(int) * ncuts); in CreateCuts() 282 memcpy(this->LowerDataCoord, lowerDataCoord, sizeof(double) * ncuts); in CreateCuts() 292 memcpy(this->UpperDataCoord, upperDataCoord, sizeof(double) * ncuts); in CreateCuts() 302 memcpy(this->Npoints, npoints, sizeof(int) * ncuts); in CreateCuts()
|
/dports/math/vtk6/VTK-6.2.0/Common/DataModel/ |
H A D | vtkBSPCuts.cxx | 265 void vtkBSPCuts::CreateCuts(double *bnds, int ncuts, int *dim, double *coord, in CreateCuts() argument 273 vtkBSPCuts::AllocateArrays(ncuts); in CreateCuts() 280 this->NumberOfCuts = ncuts; in CreateCuts() 282 memcpy(this->Dim, dim, sizeof(int) * ncuts); in CreateCuts() 283 memcpy(this->Coord, coord, sizeof(double) * ncuts); in CreateCuts() 284 memcpy(this->Lower, lower, sizeof(int) * ncuts); in CreateCuts() 285 memcpy(this->Upper, upper, sizeof(int) * ncuts); in CreateCuts() 289 memcpy(this->LowerDataCoord, lowerDataCoord, sizeof(double) * ncuts); in CreateCuts() 299 memcpy(this->UpperDataCoord, upperDataCoord, sizeof(double) * ncuts); in CreateCuts() 309 memcpy(this->Npoints, npoints, sizeof(int) * ncuts); in CreateCuts()
|
/dports/math/highs/HiGHS-cfe064e/src/mip/ |
H A D | HighsCutPool.h | 34 int ncuts = numCuts(); in resize() local 35 lower_.resize(ncuts, -HIGHS_CONST_INF); in resize() 36 upper_.resize(ncuts); in resize() 37 ARstart_.resize(ncuts + 1); in resize()
|
/dports/biology/emboss/EMBOSS-6.6.0/emboss/ |
H A D | redata.c | 73 ajint ncuts; in main() local 140 sscanf(p,"%d%d",&len,&ncuts); in main() 141 if(ncuts==2) in main() 142 sscanf(p,"%d%d%d%d%d",&len,&ncuts,&blunt,&cut1,&cut2); in main() 144 sscanf(p,"%d%d%d%d%d%d%d",&len,&ncuts,&blunt,&cut1,&cut2, in main() 154 if(ncuts==2) in main()
|
/dports/astro/pykep/pykep-2.6/src/third_party/cspice/ |
H A D | limbpt.c | 3040 if (*ncuts < 1 || *ncuts > *maxn) { in limbpt_() 3043 errint_("#", ncuts, (ftnlen)1); in limbpt_() 3075 if (*ncuts > 1 && *rolstp == 0.) { in limbpt_() 3078 errint_("#", ncuts, (ftnlen)1); in limbpt_() 3119 if (*ncuts < 1 || *ncuts > *maxn) { in limbpt_() 3122 errint_("#", ncuts, (ftnlen)1); in limbpt_() 3163 cleari_(ncuts, npts); in limbpt_() 3249 i__1 = *ncuts; in limbpt_() 3393 errint_("#", ncuts, (ftnlen)1); in limbpt_() 3453 i__1 = *ncuts; in limbpt_() [all …]
|
H A D | termpt.c | 19 obsrvr, doublereal *refvec, doublereal *rolstp, integer *ncuts, in termpt_() argument 2914 if (*ncuts < 0 || *ncuts > *maxn) { in termpt_() 2917 errint_("#", ncuts, (ftnlen)1); in termpt_() 2926 if (*ncuts > 1) { in termpt_() 2931 errint_("#", ncuts, (ftnlen)1); in termpt_() 3034 cleari_(ncuts, npts); in termpt_() 3099 i__1 = *ncuts; in termpt_() 3225 errint_("#", ncuts, (ftnlen)1); in termpt_() 3286 i__1 = *ncuts; in termpt_() 3521 errint_("#", ncuts, (ftnlen)1); in termpt_()
|
/dports/astro/py-pykep/pykep-2.6/src/third_party/cspice/ |
H A D | limbpt.c | 3040 if (*ncuts < 1 || *ncuts > *maxn) { in limbpt_() 3043 errint_("#", ncuts, (ftnlen)1); in limbpt_() 3075 if (*ncuts > 1 && *rolstp == 0.) { in limbpt_() 3078 errint_("#", ncuts, (ftnlen)1); in limbpt_() 3119 if (*ncuts < 1 || *ncuts > *maxn) { in limbpt_() 3122 errint_("#", ncuts, (ftnlen)1); in limbpt_() 3163 cleari_(ncuts, npts); in limbpt_() 3249 i__1 = *ncuts; in limbpt_() 3393 errint_("#", ncuts, (ftnlen)1); in limbpt_() 3453 i__1 = *ncuts; in limbpt_() [all …]
|
H A D | termpt.c | 19 obsrvr, doublereal *refvec, doublereal *rolstp, integer *ncuts, in termpt_() argument 2914 if (*ncuts < 0 || *ncuts > *maxn) { in termpt_() 2917 errint_("#", ncuts, (ftnlen)1); in termpt_() 2926 if (*ncuts > 1) { in termpt_() 2931 errint_("#", ncuts, (ftnlen)1); in termpt_() 3034 cleari_(ncuts, npts); in termpt_() 3099 i__1 = *ncuts; in termpt_() 3225 errint_("#", ncuts, (ftnlen)1); in termpt_() 3286 i__1 = *ncuts; in termpt_() 3521 errint_("#", ncuts, (ftnlen)1); in termpt_()
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/C3/src/lib_clinalg/backup/ |
H A D | algs.c | 94 size_t ncols, ncuts; in prepCore() local 103 ncuts = nrows; in prepCore() 111 fcut = fiber_cut_ndarray(f,args, dim, ii, ncuts, vals); in prepCore() 114 ncuts = cargs->ranks[ii+1]; in prepCore() 115 ncols = ncuts; in prepCore() 122 ncuts = right_ind[ii]->n; in prepCore() 125 ncuts = left_ind[ii]->n; in prepCore() 128 ncuts = left_ind[ii]->n * right_ind[ii]->n; in prepCore() 132 ncols = ncuts / nrows; in prepCore() 149 free_dd(ncuts,vals); vals = NULL; in prepCore() [all …]
|
/dports/math/chaco/Chaco-2.2/code/misc/ |
H A D | countup_cube.c | 28 double ncuts; /* total number of edges connecting sets */ local 149 ncuts = nhops = 0; 256 ncuts += cutsize[set]; 261 ncuts /= 2; 270 ncuts, maxcuts, mincuts); 289 ncuts, maxcuts, mincuts);
|
H A D | countup_mesh.c | 27 double ncuts; /* total number of edges connecting sets */ local 133 ncuts = nhops = 0; 236 ncuts += cutsize[set]; 241 ncuts /= 2; 249 ncuts, maxcuts, mincuts); 270 ncuts, maxcuts, mincuts);
|
/dports/math/combblas/CombBLAS_beta_16_2/include/CombBLAS/ |
H A D | dcsc.cpp | 1093 int ncuts = cuts.size(); // all except last piece in ColSplit() local 1094 for(int i=1; i< ncuts; ++i) // treat the first piece differently in ColSplit() 1113 if(nz - cp[pos[ncuts-1]] == 0) in ColSplit() 1115 parts[ncuts] = NULL; in ColSplit() 1119 … parts[ncuts] = new Dcsc<IT,NT>(nz-cp[pos[ncuts-1]], nzc-pos[ncuts-1]); // ncuts = npieces -1 in ColSplit() 1120 std::copy(jc+pos[ncuts-1], jc+ nzc, parts[ncuts]->jc); in ColSplit() 1121 …transform(parts[ncuts]->jc, parts[ncuts]->jc + (nzc-pos[ncuts-1]), parts[ncuts]->jc, bind2nd(std::… in ColSplit() 1123 std::copy(cp+pos[ncuts-1], cp+nzc+1, parts[ncuts]->cp); in ColSplit() 1124 …transform(parts[ncuts]->cp, parts[ncuts]->cp + (nzc-pos[ncuts-1]+1), parts[ncuts]->cp, bind2nd(std… in ColSplit() 1125 std::copy(ir+cp[pos[ncuts-1]], ir+nz, parts[ncuts]->ir); in ColSplit() [all …]
|
/dports/math/SCIP/scip-7.0.3/applications/CycleClustering/src/ |
H A D | sepa_subtour.c | 89 int* ncuts /**< pointer to store number of cuts */ in addSubtourCuts() argument 263 (*ncuts)++; in addSubtourCuts() 287 int* ncuts /**< pointer to store number of cuts */ in addPathCuts() argument 444 (*ncuts)++; in addPathCuts() 467 int* ncuts /**< pointer to store number of cuts */ in addTourCuts() argument 590 (*ncuts)++; in addTourCuts() 693 int ncuts; in SCIP_DECL_SEPAEXECLP() local 711 ncuts = 0; in SCIP_DECL_SEPAEXECLP() 823 result, &ncuts) ); in SCIP_DECL_SEPAEXECLP() 832 result, &ncuts) ); in SCIP_DECL_SEPAEXECLP() [all …]
|