/dports/science/PETSc/petsc-3.14.1/src/vec/is/sf/impls/basic/alltoall/ |
H A D | sfalltoall.c | 18 if (nleaves) *nleaves = sf->nleaves; in PetscSFGetGraph_Alltoall() 24 for (i=0; i<sf->nleaves; i++) { in PetscSFGetGraph_Alltoall() 71 PetscInt nroots = 1,nleaves = 1,*ilocal; in PetscSFCreateLocalSF_Alltoall() local 78 nleaves = 1; in PetscSFCreateLocalSF_Alltoall() 98 PetscMPIInt nroots,*roots,nleaves,*leaves,rank; in PetscSFCreateEmbeddedSF_Alltoall() local 122 for (i=0; i<nleaves; i++) { in PetscSFCreateEmbeddedSF_Alltoall() 126 if (nleaves && leaves[0] < 0) leaves[0] = rank; in PetscSFCreateEmbeddedSF_Alltoall() 138 …ierr = PetscSFSetGraph(esf,sf->nleaves,nleaves,ilocal,PETSC_OWN_POINTER,iremote,PETSC_OWN_POINTER)… in PetscSFCreateEmbeddedSF_Alltoall() 141 …ierr = PetscMalloc4(nleaves,&esf->ranks,nleaves+1,&esf->roffset,nleaves,&esf->rmine,nleaves,&esf->… in PetscSFCreateEmbeddedSF_Alltoall() 142 esf->nranks = nleaves; in PetscSFCreateEmbeddedSF_Alltoall() [all …]
|
/dports/science/PETSc/petsc-3.14.1/src/vec/is/sf/tutorials/ |
H A D | ex1f.F90 | 14 PetscInt i,nroots,nrootsalloc,nleaves,nleavesalloc,mine(6),stride 41 nleaves = 3 43 nleaves = 2 45 nleavesalloc = nleaves * stride 47 do i=1,nleaves 66 …call PetscSFSetGraph(sf,nrootsalloc,nleaves,mine,PETSC_COPY_VALUES,remote,PETSC_COPY_VALUES,ierr);… 98 …if (gnleaves .ne. nleaves) then; SETERRA(PETSC_COMM_WORLD,PETSC_ERR_PLIB,'nleaves returned from Pe… 99 do i=1,nleaves 102 do i=1,nleaves
|
H A D | ex3.c | 15 PetscInt nroots, nleaves; in main() local 36 nleaves = 1; in main() 38 ierr = PetscMalloc1(nleaves,&ilocal);CHKERRQ(ierr); in main() 40 for (i = 0; i<nleaves; i++) { in main() 44 ierr = PetscMalloc1(nleaves,&iremote);CHKERRQ(ierr); in main() 47 …ierr = PetscSFSetGraph(sf,nroots,nleaves,ilocal,PETSC_OWN_POINTER,iremote,PETSC_OWN_POINTER);CHKER… in main()
|
H A D | ex2.c | 18 PetscInt nroots, nleaves; in main() local 32 nleaves = 2; in main() 34 ierr = PetscMalloc1(nleaves,&ilocal);CHKERRQ(ierr); in main() 36 for (i = 0; i<nleaves; i++) { in main() 40 ierr = PetscMalloc1(nleaves,&iremote);CHKERRQ(ierr); in main() 52 …ierr = PetscSFSetGraph(sf,nroots,nleaves,ilocal,PETSC_OWN_POINTER,iremote,PETSC_OWN_POINTER);CHKER… in main()
|
H A D | ex1.c | 21 PetscInt i,nroots,nleaves,nranks; in PetscSFViewCustomLocals_Private() local 32 for (i=0; i<nleaves; i++) { in PetscSFViewCustomLocals_Private() 44 PetscInt i,nroots,nrootsalloc,nleaves,nleavesalloc,*mine,stride; in main() local 133 nleaves = size; in main() 136 ierr = PetscMalloc1(nleaves,&remote);CHKERRQ(ierr); in main() 144 nleaves = 2 + (PetscInt)(rank > 0); in main() 145 nleavesalloc = nleaves * stride; in main() 150 ierr = PetscMalloc1(nleaves,&mine);CHKERRQ(ierr); in main() 151 for (i = 0; i < nleaves; i++) { in main() 155 ierr = PetscMalloc1(nleaves,&remote);CHKERRQ(ierr); in main() [all …]
|
/dports/biology/py-ete3/ete3-3.1.2/examples/general/ |
H A D | getting_leaves.py | 13 nleaves = 0 variable 15 nleaves += 1 16 print "This tree has", nleaves, "terminal nodes" 18 nleaves = len(t) variable 19 print "This tree has", nleaves, "terminal nodes [proper way: len(tree) ]"
|
/dports/science/PETSc/petsc-3.14.1/src/binding/petsc4py/src/PETSc/ |
H A D | SF.pyx | 66 cdef PetscInt nroots = 0, nleaves = 0 71 local = arange(0, nleaves, 1) 73 local = array_i(nleaves, ilocal) 74 remote = array_i(nleaves*2, <const PetscInt*>iremote) 75 remote = remote.reshape(nleaves, 2) 85 cdef PetscInt nleaves = 0 91 local = iarray_i(local, &nleaves, &ilocal) 92 assert 2*nleaves == nremote 95 nleaves = nremote // 2 133 cdef PetscInt nleaves = asInt(len(selected)) [all …]
|
/dports/science/PETSc/petsc-3.14.1/src/vec/is/sf/impls/basic/allgatherv/ |
H A D | sfallgatherv.c | 16 if (nleaves) *nleaves = sf->nleaves; in PetscSFGetGraph_Allgatherv() 21 ierr = PetscMalloc1(sf->nleaves,&sf->remote);CHKERRQ(ierr); in PetscSFGetGraph_Allgatherv() 221 ierr = PetscMPIIntCast(sf->nleaves,&count);CHKERRQ(ierr); in PetscSFFetchAndOpBegin_Allgatherv() 260 …ierr = PetscMalloc4(size,&sf->ranks,size+1,&sf->roffset,sf->nleaves,&sf->rmine,sf->nleaves,&sf->rr… in PetscSFGetRootRanks_Allgatherv() 315 ierr = PetscMalloc1(sf->nleaves,&dat->irootloc);CHKERRQ(ierr); in PetscSFGetLeafRanks_Allgatherv() 327 PetscInt i,nroots,nleaves,rstart,*ilocal; in PetscSFCreateLocalSF_Allgatherv() local 333 nleaves = sf->nleaves ? sf->nroots : 0; /* sf->nleaves can be zero with SFGather(v) */ in PetscSFCreateLocalSF_Allgatherv() 334 nroots = nleaves; in PetscSFCreateLocalSF_Allgatherv() 335 ierr = PetscMalloc1(nleaves,&ilocal);CHKERRQ(ierr); in PetscSFCreateLocalSF_Allgatherv() 336 ierr = PetscMalloc1(nleaves,&iremote);CHKERRQ(ierr); in PetscSFCreateLocalSF_Allgatherv() [all …]
|
/dports/science/PETSc/petsc-3.14.1/src/vec/is/sf/interface/ |
H A D | sf.c | 96 b->nleaves = -1; in PetscSFCreate() 138 sf->nleaves = -1; in PetscSFReset() 257 PetscInt i, nleaves; in PetscSFCheckGraphValid_Private() local 267 for (i = 0; i < nleaves; i++) { in PetscSFCheckGraphValid_Private() 455 sf->nleaves = nleaves; in PetscSFSetGraph() 457 if (nleaves && ilocal) { in PetscSFSetGraph() 462 for (i=0; i<nleaves; i++) { in PetscSFSetGraph() 477 sf->maxleaf = nleaves - 1; in PetscSFSetGraph() 596 sf->nleaves = N; in PetscSFSetGraphWithPattern() 608 sf->nleaves = size; in PetscSFSetGraphWithPattern() [all …]
|
/dports/ports-mgmt/pkg_cutleaves/pkg_cutleaves-20181216/ |
H A D | pkg_cutleaves | 104 my $nleaves = keys %leaves; 105 if ($nleaves > 0) { 133 print $fh "# There are $nleaves (new) leaf packages:\n"; 186 print "Package $i of $nleaves:\n"; 237 $nleaves = keys %leaves; 238 if ($nleaves == 0) {
|
/dports/math/spooles/spooles.2.2/Tree/src/ |
H A D | getCoords.c | 33 int count, I, J, n, nleaves ; in Tree_getSimpleCoords() local 130 nleaves = 0 ; in Tree_getSimpleCoords() 135 x[J] = nleaves++ ; in Tree_getSimpleCoords() 146 x[J] = x[J] / nleaves ; in Tree_getSimpleCoords() 152 theta = 6.283185 * x[J] / nleaves ; in Tree_getSimpleCoords()
|
/dports/math/spooles-mpich/spooles.2.2_SHARED/Tree/src/ |
H A D | getCoords.c | 33 int count, I, J, n, nleaves ; in Tree_getSimpleCoords() local 130 nleaves = 0 ; in Tree_getSimpleCoords() 135 x[J] = nleaves++ ; in Tree_getSimpleCoords() 146 x[J] = x[J] / nleaves ; in Tree_getSimpleCoords() 152 theta = 6.283185 * x[J] / nleaves ; in Tree_getSimpleCoords()
|
/dports/math/spooles-mpich/spooles.2.2/Tree/src/ |
H A D | getCoords.c | 33 int count, I, J, n, nleaves ; in Tree_getSimpleCoords() local 130 nleaves = 0 ; in Tree_getSimpleCoords() 135 x[J] = nleaves++ ; in Tree_getSimpleCoords() 146 x[J] = x[J] / nleaves ; in Tree_getSimpleCoords() 152 theta = 6.283185 * x[J] / nleaves ; in Tree_getSimpleCoords()
|
/dports/math/spooles/spooles.2.2_SHARED/Tree/src/ |
H A D | getCoords.c | 33 int count, I, J, n, nleaves ; in Tree_getSimpleCoords() local 130 nleaves = 0 ; in Tree_getSimpleCoords() 135 x[J] = nleaves++ ; in Tree_getSimpleCoords() 146 x[J] = x[J] / nleaves ; in Tree_getSimpleCoords() 152 theta = 6.283185 * x[J] / nleaves ; in Tree_getSimpleCoords()
|
/dports/science/PETSc/petsc-3.14.1/src/vec/is/sf/tests/ |
H A D | ex3.c | 10 PetscInt i,N=10,low,high,nleaves; in main() local 54 ierr = PetscSFGetGraph(gathersf,NULL,&nleaves,NULL,NULL);CHKERRQ(ierr); in main() 55 ierr = VecCreateSeq(PETSC_COMM_SELF,nleaves,&y);CHKERRQ(ierr); in main() 74 …ierr = VecCreateMPIWithArray(PETSC_COMM_WORLD,1,nleaves,PETSC_DECIDE,leafupdate,&gy2);CHKERRQ(ierr… in main() 109 ierr = PetscSFGetGraph(allgathersf,NULL,&nleaves,NULL,NULL);CHKERRQ(ierr); in main() 110 ierr = VecCreateSeq(PETSC_COMM_SELF,nleaves,&y);CHKERRQ(ierr); in main() 134 …ierr = VecCreateMPIWithArray(PETSC_COMM_WORLD,1,nleaves,PETSC_DECIDE,leafupdate,&gy2);CHKERRQ(ierr… in main() 173 ierr = PetscSFGetGraph(alltoallsf,NULL,&nleaves,NULL,NULL);CHKERRQ(ierr); in main() 174 ierr = VecCreateSeq(PETSC_COMM_SELF,nleaves,&y);CHKERRQ(ierr); in main() 192 …ierr = VecCreateMPIWithArray(PETSC_COMM_WORLD,1,nleaves,PETSC_DECIDE,leafupdate,&gy2);CHKERRQ(ierr… in main()
|
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bpro/core/bvgl_pro/processes/ |
H A D | bvgl_geo_index_region_overlap_process.cxx | 78 unsigned nleaves = leaves.size(); in bvgl_geo_index_region_overlap_process() local 79 std::vector<double> overlap(nleaves,0.0); in bvgl_geo_index_region_overlap_process() 81 for (i = 0; i < nleaves; i++) { in bvgl_geo_index_region_overlap_process() 88 bbas_1d_array_double_sptr overlap_bbas = new bbas_1d_array_double(nleaves); in bvgl_geo_index_region_overlap_process()
|
H A D | bvgl_geo_index_extent_process.cxx | 62 unsigned nleaves = leaves.size(); in bvgl_geo_index_extent_process() local 65 std::vector<double> extent(4*nleaves, 0); in bvgl_geo_index_extent_process() 66 for (i=0; i < nleaves; i++) { in bvgl_geo_index_extent_process()
|
/dports/math/taucs/taucs-2.2_23/src/ |
H A D | taucs_recvaidya.c | 39 int n,nnz,i,j,ip,k,p,nleaves; in recvaidya_order() local 89 nleaves = 0; in recvaidya_order() 93 leaves[nleaves] = i; in recvaidya_order() 94 nleaves++; in recvaidya_order() 122 while (nleaves > 0) { in recvaidya_order() 124 nleaves--; in recvaidya_order() 125 j = leaves[nleaves]; in recvaidya_order() 151 leaves[ nleaves ] = p; in recvaidya_order() 152 nleaves++; in recvaidya_order()
|
H A D | taucs_ccs_order.c | 453 int n,nnz,i,j,ip,k,p,nleaves; in taucs_ccs_treeorder() local 517 nleaves = 0; in taucs_ccs_treeorder() 521 leaves[nleaves] = i; in taucs_ccs_treeorder() 522 nleaves++; in taucs_ccs_treeorder() 553 nleaves--; in taucs_ccs_treeorder() 554 if (nleaves <= 0) { in taucs_ccs_treeorder() 565 j = leaves[nleaves]; in taucs_ccs_treeorder() 609 leaves[ nleaves ] = p; in taucs_ccs_treeorder() 610 nleaves++; in taucs_ccs_treeorder()
|
/dports/multimedia/lives/lives-3.2.0/src/ |
H A D | diagnostics.c | 334 weed_size_t nleaves; in run_weed_startup_tests() local 362 keys = weed_plant_list_leaves(plant, &nleaves); in run_weed_startup_tests() 489 keys = weed_plant_list_leaves(plant, &nleaves); in run_weed_startup_tests() 507 keys = weed_plant_list_leaves(plant, &nleaves); in run_weed_startup_tests() 524 keys = weed_plant_list_leaves(plant, &nleaves); in run_weed_startup_tests() 538 keys = weed_plant_list_leaves(plant, &nleaves); in run_weed_startup_tests() 555 keys = weed_plant_list_leaves(plant, &nleaves); in run_weed_startup_tests() 569 keys = weed_plant_list_leaves(plant, &nleaves); in run_weed_startup_tests() 586 keys = weed_plant_list_leaves(plant, &nleaves); in run_weed_startup_tests() 603 keys = weed_plant_list_leaves(plant, &nleaves); in run_weed_startup_tests() [all …]
|
/dports/science/PETSc/petsc-3.14.1/src/vec/is/sf/interface/ftn-custom/ |
H A D | zsf.c | 31 PETSC_EXTERN void petscsfgetgraph_(PetscSF *sf,PetscInt *nroots,PetscInt *nleaves, F90Array1d *ai… in petscsfgetgraph_() argument 36 *ierr = PetscSFGetGraph(*sf,nroots,nleaves,&ilocal,&iremote);if (*ierr) return; in petscsfgetgraph_() 37 …*ierr = F90Array1dCreate((void*)ilocal,MPIU_INT,1,*nleaves, ailocal PETSC_F90_2PTR_PARAM(pilocal)); in petscsfgetgraph_() 39 f90arraysfnodecreate_((PetscInt*)iremote,nleaves, airemote PETSC_F90_2PTR_PARAM(piremote)); in petscsfgetgraph_()
|
/dports/science/PETSc/petsc-3.14.1/src/mat/utils/ |
H A D | overlapsplit.c | 17 …PetscInt *indices_ov_rd,nroots,nleaves,*localoffsets,*indices_recv,*sources_sc,*sources_sc… in MatIncreaseOverlapSplit_Single() local 117 nleaves = localoffsets[ssize]; in MatIncreaseOverlapSplit_Single() 120 ierr = PetscMalloc1(nleaves,&remote);CHKERRQ(ierr); in MatIncreaseOverlapSplit_Single() 121 for (i=0; i<nleaves; i++){ in MatIncreaseOverlapSplit_Single() 130 nleaves = 0; in MatIncreaseOverlapSplit_Single() 142 …ierr = PetscSFSetGraph(sf,nroots,nleaves,NULL,PETSC_OWN_POINTER,remote,PETSC_OWN_POINTER);CHKERRQ(… in MatIncreaseOverlapSplit_Single()
|
/dports/science/PETSc/petsc-3.14.1/src/vec/vscat/impls/sf/ |
H A D | vscatsf.c | 563 ierr = ISGetLocalSize(iyy,&nleaves);CHKERRQ(ierr); in VecScatterSetUp_SF() 564 ierr = PetscMalloc2(nleaves,&iremote,nleaves*2,&leafdata);CHKERRQ(ierr); in VecScatterSetUp_SF() 566 for (i=0; i<nleaves; i++) { in VecScatterSetUp_SF() 589 nleaves = inedges; in VecScatterSetUp_SF() 591 ierr = PetscMalloc1(nleaves,&ilocal);CHKERRQ(ierr); in VecScatterSetUp_SF() 692 nleaves = rlentotal; in VecScatterSetUp_SF() 693 ierr = PetscMalloc1(nleaves,&ilocal);CHKERRQ(ierr); in VecScatterSetUp_SF() 716 ierr = ISGetLocalSize(iyy,&nleaves);CHKERRQ(ierr); in VecScatterSetUp_SF() 717 ierr = PetscMalloc1(nleaves,&ilocal);CHKERRQ(ierr); in VecScatterSetUp_SF() 718 ierr = PetscMalloc1(nleaves,&iremote);CHKERRQ(ierr); in VecScatterSetUp_SF() [all …]
|
/dports/science/PETSc/petsc-3.14.1/src/vec/is/utils/ |
H A D | pmap.c | 630 PetscInt i,nroots,nleaves = 0; in PetscLayoutsCreateSF() local 653 remote[nleaves].rank = owner; in PetscLayoutsCreateSF() 654 remote[nleaves].index = i - rmap->range[owner]; in PetscLayoutsCreateSF() 655 nleaves++; in PetscLayoutsCreateSF() 657 …ierr = PetscSFSetGraph(*sf,nroots,nleaves,NULL,PETSC_OWN_POINTER,remote,PETSC_COPY_VALUES);CHKERRQ… in PetscLayoutsCreateSF() 683 PetscErrorCode PetscSFSetGraphLayout(PetscSF sf,PetscLayout layout,PetscInt nleaves,const PetscInt … in PetscSFSetGraphLayout() argument 691 ierr = PetscMalloc1(nleaves,&remote);CHKERRQ(ierr); in PetscSFSetGraphLayout() 692 for (i=0; i<nleaves; i++) { in PetscSFSetGraphLayout() 698 ierr = PetscSFSetGraph(sf,nroots,nleaves,ilocal,localmode,remote,PETSC_OWN_POINTER);CHKERRQ(ierr); in PetscSFSetGraphLayout()
|
/dports/science/PETSc/petsc-3.14.1/src/dm/impls/plex/ |
H A D | plexdistribute.c | 495 for (l = 0; l < nleaves; ++l) { in DMPlexCreateOverlapLabel() 556 for (l = 0; l < nleaves; ++l) { in DMPlexCreateOverlapLabel() 608 for (p=0; p<nleaves; p++) remoteDepths[p] = -1; in DMPlexCreateOverlapMigrationSF() 627 newLeaves = pEnd - pStart + nleaves; in DMPlexCreateOverlapMigrationSF() 657 for (p=0; p<nleaves; p++) { in DMPlexCreateOverlapMigrationSF() 734 for (p = 0; p < nleaves; ++p) { in DMPlexStratifyMigrationSF() 772 for (p = 0; p < nleaves; ++p) { in DMPlexStratifyMigrationSF() 1416 for (p = 0; p < nleaves; ++p) { in DMPlexCreatePointSF() 1449 for (p = 0; p < nleaves; p++) { in DMPlexCreatePointSF() 1464 for (idx = 0, p = 0; p < nleaves; p++) { in DMPlexCreatePointSF() [all …]
|