/dports/graphics/blender/blender-2.91.0/source/blender/editors/space_node/ |
H A D | node_group.c | 150 if (ngroup) { in node_group_edit_exec() 468 if (ngroup->adt) { in node_group_separate_selected() 520 nodeRemLink(ngroup, link); in node_group_separate_selected() 527 if (ngroup->adt) { in node_group_separate_selected() 669 ntreeFreeTree(ngroup); in node_group_make_test_selected() 670 MEM_freeN(ngroup); in node_group_make_test_selected() 779 nodeUniqueName(ngroup, node); in node_group_make_insert_selected() 794 ntreeFreeCache(ngroup); in node_group_make_insert_selected() 974 gnode->id = (ID *)ngroup; in node_group_make_from_selected() 1007 if (ngroup) { in node_group_make_exec() [all …]
|
/dports/french/med/med-4.0.0/src/2.3.6/ci/ |
H A D | MEDgro2famCr.c | 53 for (j=0;j<ngroup/8+1;j++) in MEDgro2famCr() 54 *(groupes_par_entite+i*(ngroup/8+1)+j) = 0; in MEDgro2famCr() 55 for (i=0;i<ngroup;i++) { in MEDgro2famCr() 73 for (j=0;j<ngroup/8+1;j++) in MEDgro2famCr() 74 som += (int) *(groupes_par_entite+i*(ngroup/8+1)+j); in MEDgro2famCr() 88 for (k=0;k<ngroup/8+1;k++) in MEDgro2famCr() 89 if (*(groupes_par_entite+i*(ngroup/8+1)+k) != *(groupes_par_entite+j*(ngroup/8+1)+k)) in MEDgro2famCr() 127 for (k=0;k<ngroup/8+1;k++) in MEDgro2famCr() 128 if (*(groupes_par_entite+j*(ngroup/8+1)+k) != 0) { in MEDgro2famCr() 129 tmp = *(groupes_par_entite+j*(ngroup/8+1)+k); in MEDgro2famCr() [all …]
|
/dports/editors/ted/Ted-2.23/ind/ |
H A D | indmini.c | 28 int ngroup= *pngroup; in indPartition() local 43 oldNgroup= ngroup; in indPartition() 44 ngroup= 0; in indPartition() 119 gend[ngroup++]= ++first; in indPartition() 124 if ( ngroup == oldNgroup ) in indPartition() 167 int ngroup; in indINDmini() local 208 for ( r= 0; r < ngroup; r++ ) in indINDmini() 223 for ( r= 0; r < ngroup; r++ ) in indINDmini() 256 ngroup= l; in indINDmini() 262 for ( r= 0; r < ngroup; r++ ) in indINDmini() [all …]
|
/dports/science/nwchem-data/nwchem-7.0.2-release/src/argos/ |
H A D | argos_diana_group.F | 20 ngroup=ngroup+1 21 if(ngroup.gt.maxgrp) call md_abort('Increase maxgrp',maxgrp) 23 read(card(8:46),1000) (igroup(ngroup,i),i=1,3), 24 + (rgroup(ngroup,i),i=1,2) 29 iwrk(i,j,ngroup)=0
|
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/argos/ |
H A D | argos_diana_group.F | 20 ngroup=ngroup+1 21 if(ngroup.gt.maxgrp) call md_abort('Increase maxgrp',maxgrp) 23 read(card(8:46),1000) (igroup(ngroup,i),i=1,3), 24 + (rgroup(ngroup,i),i=1,2) 29 iwrk(i,j,ngroup)=0
|
/dports/math/py-pandas/pandas-1.2.5/pandas/tests/groupby/ |
H A D | test_counting.py | 83 tm.assert_series_equal(expected, g.ngroup()) 84 tm.assert_series_equal(expected, sg.ngroup()) 93 tm.assert_series_equal(expected, g.ngroup()) 94 tm.assert_series_equal(expected, sg.ngroup()) 103 tm.assert_series_equal(expected, g.ngroup()) 113 tm.assert_series_equal(e, ge.ngroup()) 114 tm.assert_series_equal(e, se.ngroup()) 120 tm.assert_series_equal(df.groupby(s).ngroup(), s.groupby(s).ngroup()) 129 tm.assert_series_equal(expected, g.ngroup()) 139 tm.assert_series_equal(expected, g.ngroup()) [all …]
|
/dports/science/sparta/sparta-20Oct2021/src/ |
H A D | compute_count.cpp | 57 mixgroups[nvalues] = particle->mixture[imix]->ngroup; in ComputeCount() 73 int ngroup = particle->mixture[imix]->ngroup; in ComputeCount() local 74 if (nvalues+ngroup > maxvalues) allocate(nvalues+ngroup); in ComputeCount() 75 for (int i = 0; i < ngroup; i++) { in ComputeCount() 79 mixgroups[nvalues] = ngroup; in ComputeCount() 143 int ngroup = mixgroups[i]; in init() local 144 if (ngroup != particle->mixture[imix]->ngroup) warn = 1; in init() 145 if (igroup >= particle->mixture[imix]->ngroup) err = 1; in init()
|
H A D | mixture.cpp | 67 ngroup = maxgroup = 0; in Mixture() 253 groupsize = new int[ngroup]; in init() 510 mix2group[i] = ngroup-1; in params() 518 igroup = ngroup-1; in params() 533 igroup = ngroup-1; in params() 546 igroup = ngroup-1; in params() 589 ngroup = 0; in delete_groups() 602 while (igroup < ngroup) { in shrink_groups() 612 ngroup--; in shrink_groups() 623 if (ngroup == maxgroup) { in add_group() [all …]
|
H A D | compute_tvib_grid.cpp | 84 ngroup = particle->mixture[imix]->ngroup; in ComputeTvibGrid() 92 if (modeflag != 2) size_per_grid_cols = ngroup; in ComputeTvibGrid() 93 else size_per_grid_cols = ngroup * maxmode; in ComputeTvibGrid() 108 for (int i = 0; i < ngroup; i++) in ComputeTvibGrid() 115 nmap = new int[ngroup]; in ComputeTvibGrid() 125 for (int igroup = 0; igroup < ngroup; igroup++) { in ComputeTvibGrid() 141 nmap = new int[ngroup]; in ComputeTvibGrid() 153 for (int igroup = 0; igroup < ngroup; igroup++) { in ComputeTvibGrid() 173 nmap = new int[ngroup*maxmode]; in ComputeTvibGrid() 244 if (ngroup != particle->mixture[imix]->ngroup) in init() [all …]
|
H A D | compute_sonine_grid.cpp | 48 ngroup = particle->mixture[imix]->ngroup; in ComputeSonineGrid() 101 ntotal = ngroup*npergroup; in ComputeSonineGrid() 104 size_per_grid_cols = ngroup*noutpergroup; in ComputeSonineGrid() 112 memory->create(map,ngroup*noutpergroup,nmap,"sonine/grid:map"); in ComputeSonineGrid() 113 for (int i = 0; i < ngroup; i++) in ComputeSonineGrid() 146 if (ngroup != particle->mixture[imix]->ngroup) in init() 173 for (j = 0; j < ngroup; j++) { in compute_per_grid() 198 for (j = 0; j < ngroup; j++) { in compute_per_grid() 333 memory->create(vcom,nglocal,ngroup,4,"sonine/grid:vcom"); in reallocate() 345 bytes += nglocal*ngroup*4 * sizeof(double); // vcom in memory_usage()
|
/dports/french/med/med-4.0.0/tests/f/2.3.6/ |
H A D | test19.f | 54 integer ngroup 55 parameter (ngroup = 3) 58 character*80 nomgro(ngroup) 60 integer ind(ngroup+1) 105 call efg2fc(fid,maa,nomgro,ind,ngroup,ent,nent,MED_NOEUD, 115 call efg2fc(fid,maa,nomgro,ind,ngroup,ent,nent,MED_MAILLE,
|
/dports/databases/R-cran-RMySQL/RMySQL/src/ |
H A D | db-apply.c | 43 int ngroup, int i); 148 int ngroup = 0, group_field = INT_EL(s_group_field,0); in RS_MySQL_dbApply() local 333 CHR_EL(group_names, ngroup), rho); in RS_MySQL_dbApply() 334 SET_ELEMENT(out_list, ngroup, val); in RS_MySQL_dbApply() 341 ++ngroup; in RS_MySQL_dbApply() 371 CHR_EL(group_names, ngroup), rho); in RS_MySQL_dbApply() 372 SET_ELEMENT(out_list, ngroup++, val); in RS_MySQL_dbApply() 385 if(GET_LENGTH(out_list) != ngroup){ in RS_MySQL_dbApply() 386 PROTECT(SET_LENGTH(out_list, ngroup)); in RS_MySQL_dbApply() 387 PROTECT(SET_LENGTH(group_names, ngroup)); in RS_MySQL_dbApply() [all …]
|
/dports/misc/py-xgboost/xgboost-1.5.1/src/linear/ |
H A D | updater_coordinate.cc | 51 const int ngroup = model->learner_model_param->num_output_group; in Update() local 53 for (int group_idx = 0; group_idx < ngroup; ++group_idx) { in Update() 54 auto grad = GetBiasGradientParallel(group_idx, ngroup, in Update() 59 UpdateBiasResidualParallel(group_idx, ngroup, in Update() 67 for (int group_idx = 0; group_idx < ngroup; ++group_idx) { in Update() 81 const int ngroup = model->learner_model_param->num_output_group; in UpdateFeature() local 84 GetGradientParallel(group_idx, ngroup, fidx, *in_gpair, p_fmat); in UpdateFeature() 90 UpdateResidualParallel(fidx, group_idx, ngroup, dw, in_gpair, p_fmat); in UpdateFeature()
|
H A D | updater_shotgun.cc | 39 const int ngroup = model->learner_model_param->num_output_group; in Update() local 42 for (int gid = 0; gid < ngroup; ++gid) { in Update() 43 auto grad = GetBiasGradientParallel(gid, ngroup, in Update() 48 UpdateBiasResidualParallel(gid, ngroup, dbias, &in_gpair->HostVector(), p_fmat); in Update() 67 for (int gid = 0; gid < ngroup; ++gid) { in Update() 70 const GradientPair &p = gpair[c.index * ngroup + gid]; in Update() 85 GradientPair &p = gpair[c.index * ngroup + gid]; in Update()
|
/dports/misc/xgboost/xgboost-1.5.1/src/linear/ |
H A D | updater_coordinate.cc | 51 const int ngroup = model->learner_model_param->num_output_group; in Update() local 53 for (int group_idx = 0; group_idx < ngroup; ++group_idx) { in Update() 54 auto grad = GetBiasGradientParallel(group_idx, ngroup, in Update() 59 UpdateBiasResidualParallel(group_idx, ngroup, in Update() 67 for (int group_idx = 0; group_idx < ngroup; ++group_idx) { in Update() 81 const int ngroup = model->learner_model_param->num_output_group; in UpdateFeature() local 84 GetGradientParallel(group_idx, ngroup, fidx, *in_gpair, p_fmat); in UpdateFeature() 90 UpdateResidualParallel(fidx, group_idx, ngroup, dw, in_gpair, p_fmat); in UpdateFeature()
|
H A D | updater_shotgun.cc | 39 const int ngroup = model->learner_model_param->num_output_group; in Update() local 42 for (int gid = 0; gid < ngroup; ++gid) { in Update() 43 auto grad = GetBiasGradientParallel(gid, ngroup, in Update() 48 UpdateBiasResidualParallel(gid, ngroup, dbias, &in_gpair->HostVector(), p_fmat); in Update() 67 for (int gid = 0; gid < ngroup; ++gid) { in Update() 70 const GradientPair &p = gpair[c.index * ngroup + gid]; in Update() 85 GradientPair &p = gpair[c.index * ngroup + gid]; in Update()
|
/dports/math/R-cran-MCMCpack/MCMCpack/R/ |
H A D | MCMChlogit.R | 350 ngroup <- length(LevelsGroup) functionVar 383 b_vect <- rep(0,nq*ngroup*nsamp) 394 nobs=as.integer(nobs), ngroup=as.integer(ngroup), ## Constants 421 Matrix <- matrix(NA,nrow=nsamp,ncol=np+nq*ngroup+nq*nq+2) 423 names.random <- paste("b.",rep(colnames(W),each=ngroup),".",rep(LevelsGroup.Name,nq),sep="") 429 Matrix[,c((np+1):(np+nq*ngroup))] <- matrix(Sample[[13]],ncol=nq*ngroup) 430 Matrix[,c((np+nq*ngroup+1):(np+nq*ngroup+nq*nq))] <- matrix(Sample[[14]],ncol=nq*nq)
|
H A D | MCMChregress.R | 313 ngroup <- length(LevelsGroup) functionVar 346 b_vect <- rep(0,nq*ngroup*nsamp) 357 nobs=as.integer(nobs), ngroup=as.integer(ngroup), ## Constants 382 Matrix <- matrix(NA,nrow=nsamp,ncol=np+nq*ngroup+nq*nq+2) 384 names.random <- paste("b.",rep(colnames(W),each=ngroup),".",rep(LevelsGroup.Name,nq),sep="") 390 Matrix[,c((np+1):(np+nq*ngroup))] <- matrix(Sample[[13]],ncol=nq*ngroup) 391 Matrix[,c((np+nq*ngroup+1):(np+nq*ngroup+nq*nq))] <- matrix(Sample[[14]],ncol=nq*nq)
|
H A D | MCMChpoisson.R | 338 ngroup <- length(LevelsGroup) functionVar 371 b_vect <- rep(0,nq*ngroup*nsamp) 382 nobs=as.integer(nobs), ngroup=as.integer(ngroup), ## Constants 409 Matrix <- matrix(NA,nrow=nsamp,ncol=np+nq*ngroup+nq*nq+2) 411 names.random <- paste("b.",rep(colnames(W),each=ngroup),".",rep(LevelsGroup.Name,nq),sep="") 417 Matrix[,c((np+1):(np+nq*ngroup))] <- matrix(Sample[[13]],ncol=nq*ngroup) 418 Matrix[,c((np+nq*ngroup+1):(np+nq*ngroup+nq*nq))] <- matrix(Sample[[14]],ncol=nq*nq)
|
/dports/graphics/blender/blender-2.91.0/source/blender/nodes/shader/nodes/ |
H A D | node_shader_common.c | 67 bNodeTree *ngroup = (bNodeTree *)node->id; in group_initexec() local 70 if (!ngroup) { in group_initexec() 75 exec = ntreeShaderBeginExecTree_internal(context, ngroup, key); in group_initexec() 93 bNodeTree *ngroup = (bNodeTree *)gnode->id; in group_copy_inputs() local 99 for (node = ngroup->nodes.first; node; node = node->next) { in group_copy_inputs() 115 bNodeTree *ngroup = (bNodeTree *)gnode->id; in group_move_outputs() local 121 for (node = ngroup->nodes.first; node; node = node->next) { in group_move_outputs() 169 bNodeTree *ngroup = (bNodeTree *)gnode->id; in group_gpu_copy_inputs() local 175 for (node = ngroup->nodes.first; node; node = node->next) { in group_gpu_copy_inputs() 192 bNodeTree *ngroup = (bNodeTree *)gnode->id; in group_gpu_move_outputs() local [all …]
|
/dports/lang/yorick/yorick-y_2_2_04/drat/ |
H A D | drat.c | 122 long kxlm, long ngroup, Ray *rays, long nrays, in IntegFlat() argument 142 FlatSource(opac, source, kxlm, ngroup, &path, in IntegFlat() 143 result, result+ngroup, work); in IntegFlat() 144 result+= 2*ngroup; in IntegFlat() 152 long kxlm, long ngroup, Ray *rays, long nrays, in IntegLinear() argument 172 LinearSource(opac, source, kxlm, ngroup, &path, in IntegLinear() 173 result, result+ngroup, work); in IntegLinear() 174 result+= 2*ngroup; in IntegLinear() 196 long kxlm, long ngroup, FullMesh *mesh, in DoPtCenter() argument 239 PtCenterSource(opac, source, kxlm, ngroup, &mesh->mesh, boundary, work); in DoPtCenter()
|
/dports/misc/py-xgboost/xgboost-1.5.1/src/gbm/ |
H A D | gblinear.cc | 165 const int ngroup = model_.learner_model_param->num_output_group; in PredictInstance() local 166 for (int gid = 0; gid < ngroup; ++gid) { in PredictInstance() 182 const int ngroup = model_.learner_model_param->num_output_group; in PredictContribution() local 186 contribs.resize(p_fmat->Info().num_row_ * ncolumns * ngroup); in PredictContribution() 198 for (int gid = 0; gid < ngroup; ++gid) { in PredictContribution() 207 ((base_margin.size() != 0) ? base_margin[row_idx * ngroup + gid] : in PredictContribution() 272 const int ngroup = model_.learner_model_param->num_output_group; in PredictBatchInternal() local 273 preds.resize(p_fmat->Info().num_row_ * ngroup); in PredictBatchInternal() 281 CHECK_EQ(base_margin.size(), nsize * ngroup); in PredictBatchInternal() 286 for (int gid = 0; gid < ngroup; ++gid) { in PredictBatchInternal() [all …]
|
/dports/misc/xgboost/xgboost-1.5.1/src/gbm/ |
H A D | gblinear.cc | 165 const int ngroup = model_.learner_model_param->num_output_group; in PredictInstance() local 166 for (int gid = 0; gid < ngroup; ++gid) { in PredictInstance() 182 const int ngroup = model_.learner_model_param->num_output_group; in PredictContribution() local 186 contribs.resize(p_fmat->Info().num_row_ * ncolumns * ngroup); in PredictContribution() 198 for (int gid = 0; gid < ngroup; ++gid) { in PredictContribution() 207 ((base_margin.size() != 0) ? base_margin[row_idx * ngroup + gid] : in PredictContribution() 272 const int ngroup = model_.learner_model_param->num_output_group; in PredictBatchInternal() local 273 preds.resize(p_fmat->Info().num_row_ * ngroup); in PredictBatchInternal() 281 CHECK_EQ(base_margin.size(), nsize * ngroup); in PredictBatchInternal() 286 for (int gid = 0; gid < ngroup; ++gid) { in PredictBatchInternal() [all …]
|
/dports/graphics/blender/blender-2.91.0/source/blender/nodes/texture/nodes/ |
H A D | node_texture_common.c | 54 bNodeTree *ngroup = (bNodeTree *)node->id; in group_initexec() local 57 if (!ngroup) { in group_initexec() 62 exec = ntreeTexBeginExecTree_internal(context, ngroup, key); in group_initexec() 79 bNodeTree *ngroup = (bNodeTree *)gnode->id; in group_copy_inputs() local 85 for (node = ngroup->nodes.first; node; node = node->next) { in group_copy_inputs() 103 bNodeTree *ngroup = (bNodeTree *)gnode->id; in group_copy_outputs() local 109 for (node = ngroup->nodes.first; node; node = node->next) { in group_copy_outputs()
|
/dports/math/R-cran-robustbase/robustbase/src/ |
H A D | monitor.c | 27 int *kstep, int *ngroup, int *minigr, int *nhalf, int *nrep) in F77_SUB() 30 *part, *all, *kstep, *ngroup, *minigr, *nhalf, *nrep); in F77_SUB() 48 void F77_SUB(prp1mcd)(int *n, int *ngroup, int *minigr, int *nhalf, int *nrep, in F77_SUB() 54 *n, *ngroup, *minigr, *nhalf, *nrep); in F77_SUB() 55 for(int j=0; j < *ngroup; j++) Rprintf(" %d", mini[j]); in F77_SUB()
|