/dports/science/chrono/chrono-7.0.1/template_project_vehicle_cosim/ |
H A D | vehicle_cosim.cpp | 218 int rank; in main() local 224 MPI_Comm_rank(MPI_COMM_WORLD, &rank); in main() 228 if (rank == 0) { in main() 237 if (rank == 0) in main() 254 if (rank == 0) { in main() 270 if (rank == MBS_NODE_RANK) { in main() 286 } else if (rank == TIRE_NODE_RANK(0)) { in main() 294 } else if (rank == TERRAIN_NODE_RANK) { in main() 310 if (rank == 0) in main() 313 if (rank == i) { in main() [all …]
|
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/cf/ |
H A D | cf_main.cpp | 389 const size_t rank, in PerformAction() argument 403 c->template Train<DecompositionPolicy>(dataset, neighborhood, rank, in PerformAction() 421 const size_t rank) in AssembleFactorizerType() argument 428 PerformAction<NMFPolicy>(dataset, rank, maxIterations, minResidue); in AssembleFactorizerType() 432 PerformAction<BatchSVDPolicy>(dataset, rank, maxIterations, minResidue); in AssembleFactorizerType() 436 PerformAction<SVDIncompletePolicy>(dataset, rank, maxIterations, in AssembleFactorizerType() 447 PerformAction<RegSVDPolicy>(dataset, rank, maxIterations, minResidue); in AssembleFactorizerType() 453 PerformAction<RandomizedSVDPolicy>(dataset, rank, maxIterations, in AssembleFactorizerType() 460 PerformAction<BiasSVDPolicy>(dataset, rank, maxIterations, minResidue); in AssembleFactorizerType() 524 const size_t rank = (size_t) IO::GetParam<int>("rank"); in mlpackMain() local [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/extensions/common/ |
H A D | manifest.cc | 42 rank = 9; in GetLocationRank() 46 rank = 8; in GetLocationRank() 52 rank = 7; in GetLocationRank() 56 rank = 6; in GetLocationRank() 63 rank = 5; in GetLocationRank() 67 rank = 4; in GetLocationRank() 73 rank = 3; in GetLocationRank() 77 rank = 2; in GetLocationRank() 81 rank = 1; in GetLocationRank() 86 rank = 0; in GetLocationRank() [all …]
|
/dports/x11-fm/krusader2/krusader-2.7.2/krusader/Dialogs/ |
H A D | popularurls.cpp | 86 rankList << p->rank; in save() 110 node->rank = *rit; in load() 147 pnode->rank = STARTING_RANK; in addUrl() 154 pnode->rank = STARTING_RANK; in addUrl() 160 pnode->rank += INCREASE; in addUrl() 176 if (node->prev && (node->prev->rank < node->rank)) { in relocateIfNeeded() 180 if (tmp->rank >= node->rank) in relocateIfNeeded() 199 if (p->rank - DECREASE >= 0) in decreaseRanks() 200 p->rank -= DECREASE; in decreaseRanks() 201 else p->rank = 0; in decreaseRanks() [all …]
|
/dports/biology/py-orange3-bioinformatics/Orange3-Bioinformatics-4.3.1/orangecontrib/bioinformatics/ncbi/taxonomy/ |
H A D | utils.py | 68 res = [taxid for taxid in res if self._tax[taxid].rank == "species"] 80 def rank(self, id): member in Taxonomy 81 return self._tax[id].rank 102 if self.rank(tax) == 'species': 105 if self.rank(taxid) == 'species': 183 _, parent, rank = node 184 return Taxon(str(tax_id), str(parent), scientific_name, names, rank) 334 ranks = list(enumerate(sorted({rank for _, _, rank in nodes}))) 335 rank_id = {rank: i for i, rank in ranks} 341 … ((int(tax_id), int(parent_tax_id), rank_id[rank]) for tax_id, parent_tax_id, rank in nodes),
|
/dports/net/mpich2/mpich2-1.5/src/mpe2/src/slog2sdk/src/logformat/clog2TOdrawable/ |
H A D | CommProcThdID.java | 18 public int rank; // rank of the process in icomm field in CommProcThdID 28 rank = comm_rec.rank; in CommProcThdID() 32 gthdLineID = LineID.computeGlobalThreadID( icomm, rank, thd ); in CommProcThdID() 50 + ", rank=" + rank in toString()
|
/dports/net/mpich/mpich-3.4.3/test/mpi/errors/coll/ |
H A D | reducelength.c | 20 int rank; in main() local 29 MPI_Comm_rank(MPI_COMM_WORLD, &rank); in main() 31 if (rank == 0) { in main() 37 if (rank == 0) { in main() 42 printf("Did not detect mismatched length (short) on process %d\n", rank); in main()
|
/dports/lang/gnu-apl/apl-1.8/src/ |
H A D | IndexExpr.hh | 50 { Assert(rank < MAX_RANK); in add() 51 values[rank++] = val; } in add() 54 uRank value_count() const { return rank; } in value_count() 57 bool is_axis() const { return rank == 1; } in is_axis() 90 uRank rank; member in IndexExpr
|
/dports/www/tikiwiki/tiki-21.2/ |
H A D | tiki-forum_rankings.php | 73 $rank["data"] = $rk["data"]; 74 $rank["title"] = $rk["title"]; 75 $rank["y"] = $rk["y"]; 76 $rank["type"] = $rk["type"]; 77 $rankings[] = $rank;
|
H A D | tiki-file_galleries_rankings.php | 63 $rank["data"] = $rk["data"]; 64 $rank["title"] = $rk["title"]; 65 $rank["y"] = $rk["y"]; 66 $rank["type"] = $rk["type"]; 67 $rankings[] = $rank;
|
/dports/biology/mothur/mothur-1.46.1/source/calculators/ |
H A D | npshannon.cpp | 15 EstOutput NPShannon::getValues(SAbundVector* rank){ in getValues() argument 20 double maxRank = (double)rank->getMaxRank(); in getValues() 21 double sampled = rank->getNumSeqs(); in getValues() 23 double Chat = 1.0000 - (double)rank->get(1)/(double)sampled; in getValues() 30 npShannon += rank->get(i) * ChatPi*log(ChatPi)/(1-pow(1-ChatPi,(double)sampled)); in getValues()
|
/dports/editors/libreoffice/libreoffice-7.2.6.2/unodevtools/source/skeletonmaker/ |
H A D | javatypemaker.cxx | 68 } else if (sort == codemaker::UnoType::Sort::Any && rank == 0) { in printType() 81 sort, u2b(nucleus), referenceType && rank == 0)); in printType() 98 for (sal_Int32 i = 0; i != rank; ++i) { in printType() 119 sal_Int32 rank; in printType() local 122 name, true, &nucleus, &rank, &arguments, nullptr); in printType() 635 if (rank == 0 && nucleus == u"com.sun.star.uno.XInterface") { in printMapsToJavaType() 649 sal_Int32 rank; in generateDocumentation() local 651 b2u(type), false, &nucleus, &rank, nullptr, nullptr); in generateDocumentation() 666 if (rank != 0) { in generateDocumentation() 734 b2u(type), true, &nucleus, &rank, &arguments, &entity); in generateDocumentation() [all …]
|
/dports/editors/libreoffice6/libreoffice-6.4.7.2/unodevtools/source/skeletonmaker/ |
H A D | javatypemaker.cxx | 67 } else if (sort == codemaker::UnoType::Sort::Any && rank == 0) { in printType() 80 sort, u2b(nucleus), referenceType && rank == 0)); in printType() 97 for (sal_Int32 i = 0; i != rank; ++i) { in printType() 118 sal_Int32 rank; in printType() local 121 name, true, &nucleus, &rank, &arguments, nullptr); in printType() 634 if (rank == 0 && nucleus == "com.sun.star.uno.XInterface") { in printMapsToJavaType() 648 sal_Int32 rank; in generateDocumentation() local 650 b2u(type), false, &nucleus, &rank, nullptr, nullptr); in generateDocumentation() 665 if (rank != 0) { in generateDocumentation() 733 b2u(type), true, &nucleus, &rank, &arguments, &entity); in generateDocumentation() [all …]
|
/dports/lang/gcc6-aux/gcc-6-20180516/libgfortran/m4/ |
H A D | ifunction_logical.m4 | 37 index_type rank; 47 rank = GFC_DESCRIPTOR_RANK (array) - 1; 65 for (n = dim; n < rank; n++) 78 for (n = 0; n < rank; n++) 92 alloc_size = GFC_DESCRIPTOR_STRIDE(retarray,rank-1) * extent[rank-1]; 105 if (rank != GFC_DESCRIPTOR_RANK (retarray)) 106 runtime_error ("rank of return array incorrect in" 109 (long int) rank); 113 for (n=0; n < rank; n++) 127 for (n = 0; n < rank; n++) [all …]
|
/dports/math/highs/HiGHS-cfe064e/src/ipm/basiclu/src/ |
H A D | lu_build_factors.c | 123 const lu_int rank = this->rank; in lu_build_factors() local 165 Lnz = Lbegin_p[rank]; in lu_build_factors() 212 lrank = rank; in lu_build_factors() 220 lrank = rank; in lu_build_factors() 237 for (k = rank; k < m; k++) in lu_build_factors() 248 put = Lbegin_p[rank]; in lu_build_factors() 249 for (k = rank; k < m; k++) in lu_build_factors() 310 if (rank == m) in lu_build_factors() 333 for (k = 0; k < rank; k++) in lu_build_factors() 341 if (qinv[j] < rank) in lu_build_factors() [all …]
|
/dports/net/mpich2/mpich2-1.5/src/mpid/ch3/src/ |
H A D | mpid_startall.c | 38 (sreq_)->dev.match.parts.rank = rank; \ 75 …PID_Irecv(preq->dev.user_buf, preq->dev.user_count, preq->dev.datatype, preq->dev.match.parts.rank, in MPID_Startall() 83 …PID_Isend(preq->dev.user_buf, preq->dev.user_count, preq->dev.datatype, preq->dev.match.parts.rank, in MPID_Startall() 91 …ID_Irsend(preq->dev.user_buf, preq->dev.user_count, preq->dev.datatype, preq->dev.match.parts.rank, in MPID_Startall() 99 …ID_Issend(preq->dev.user_buf, preq->dev.user_count, preq->dev.datatype, preq->dev.match.parts.rank, in MPID_Startall() 110 preq->dev.datatype, preq->dev.match.parts.rank, in MPID_Startall() 165 int MPID_Send_init(const void * buf, int count, MPI_Datatype datatype, int rank, int tag, MPID_Comm… in MPID_Send_init() argument 195 int MPID_Ssend_init(const void * buf, int count, MPI_Datatype datatype, int rank, int tag, MPID_Com… in MPID_Ssend_init() argument 225 int MPID_Rsend_init(const void * buf, int count, MPI_Datatype datatype, int rank, int tag, MPID_Com… in MPID_Rsend_init() argument 293 int MPID_Recv_init(void * buf, int count, MPI_Datatype datatype, int rank, int tag, MPID_Comm * com… in MPID_Recv_init() argument [all …]
|
/dports/lang/gcc48/gcc-4.8.5/libgfortran/m4/ |
H A D | ifunction_logical.m4 | 37 index_type rank; 47 rank = GFC_DESCRIPTOR_RANK (array) - 1; 65 for (n = dim; n < rank; n++) 78 for (n = 0; n < rank; n++) 92 alloc_size = GFC_DESCRIPTOR_STRIDE(retarray,rank-1) * extent[rank-1]; 105 if (rank != GFC_DESCRIPTOR_RANK (retarray)) 106 runtime_error ("rank of return array incorrect in" 109 (long int) rank); 113 for (n=0; n < rank; n++) 127 for (n = 0; n < rank; n++) [all …]
|
/dports/science/py-scipy/scipy-1.7.1/scipy/optimize/_highs/src/ipm/basiclu/src/ |
H A D | lu_build_factors.c | 123 const lu_int rank = this->rank; in lu_build_factors() local 165 Lnz = Lbegin_p[rank]; in lu_build_factors() 212 lrank = rank; in lu_build_factors() 220 lrank = rank; in lu_build_factors() 237 for (k = rank; k < m; k++) in lu_build_factors() 248 put = Lbegin_p[rank]; in lu_build_factors() 249 for (k = rank; k < m; k++) in lu_build_factors() 310 if (rank == m) in lu_build_factors() 333 for (k = 0; k < rank; k++) in lu_build_factors() 341 if (qinv[j] < rank) in lu_build_factors() [all …]
|
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libgfortran/m4/ |
H A D | ifunction_logical.m4 | 37 index_type rank; 47 rank = GFC_DESCRIPTOR_RANK (array) - 1; 65 for (n = dim; n < rank; n++) 78 for (n = 0; n < rank; n++) 92 alloc_size = GFC_DESCRIPTOR_STRIDE(retarray,rank-1) * extent[rank-1]; 105 if (rank != GFC_DESCRIPTOR_RANK (retarray)) 106 runtime_error ("rank of return array incorrect in" 109 (long int) rank); 113 for (n=0; n < rank; n++) 127 for (n = 0; n < rank; n++) [all …]
|
/dports/lang/gnat_util/gcc-6-20180516/libgfortran/m4/ |
H A D | ifunction_logical.m4 | 37 index_type rank; 47 rank = GFC_DESCRIPTOR_RANK (array) - 1; 65 for (n = dim; n < rank; n++) 78 for (n = 0; n < rank; n++) 92 alloc_size = GFC_DESCRIPTOR_STRIDE(retarray,rank-1) * extent[rank-1]; 105 if (rank != GFC_DESCRIPTOR_RANK (retarray)) 106 runtime_error ("rank of return array incorrect in" 109 (long int) rank); 113 for (n=0; n < rank; n++) 127 for (n = 0; n < rank; n++) [all …]
|
/dports/science/madness/madness-ebb3fd7/src/madness/tensor/ |
H A D | systolic.h | 51 const ProcessID rank; ///< Rank of current process variable 69 const int pairlo = rank*A.coltile()/2; in iteration() 116 int pairlo = rank*A.coltile()/2; in iteration() 175 if (rank==(nproc-1) && (coldim&0x1)) jptr[nlocal-1] = 0; in unshuffle() 182 MADNESS_ASSERT(rank >= nproc); in cycle() 190 const ProcessID right = rank+1; in cycle() 267 else if (rank == 0) { in cycle() 273 else if (rank == (nproc-1)) { in cycle() 321 , rank(A.get_world().rank()) in A() 342 if (rank==(nproc-1) && (coldim&0x1)) jptr[nlocal-1] = 0; in A() [all …]
|
/dports/devel/mingw32-gcc/gcc-4.8.1/libgfortran/m4/ |
H A D | ifunction_logical.m4 | 37 index_type rank; 47 rank = GFC_DESCRIPTOR_RANK (array) - 1; 65 for (n = dim; n < rank; n++) 78 for (n = 0; n < rank; n++) 93 * extent[rank-1]; 106 if (rank != GFC_DESCRIPTOR_RANK (retarray)) 107 runtime_error ("rank of return array incorrect in" 110 (long int) rank); 114 for (n=0; n < rank; n++) 128 for (n = 0; n < rank; n++) [all …]
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/C3/src/lib_linalg/ |
H A D | linalg.c | 382 rank -= 1; in truncated_svd() 392 memmove( (*vt)+ii*rank, vt_temp + ii * n, rank * sizeof(double)); in truncated_svd() 401 return rank; in truncated_svd() 430 size_t rank = 0; in pinv() local 437 rank += 1; in pinv() 455 return rank; in pinv() 806 (*skd)->rank = rank; in init_skf() 869 skd->rank, 1.0, C, skd->rank, skd->cross_inv, skd->rank, 0.0, temp, skd->rank); in sk_decomp_to_full() 872 skd->rank, 1.0, temp, skd->rank, R, skd->m, 0.0, out, skd->m); in sk_decomp_to_full() 1070 size_t rank_cross = pinv((*skd)->rank, (*skd)->rank, (*skd)->rank, across, ainv, 1e-15); in skeleton_func2() [all …]
|
/dports/devel/boost-docs/boost_1_72_0/boost/mpi/collectives/ |
H A D | reduce.hpp | 120 int rank = comm.rank(); in tree_reduce_impl() local 144 if (tree.parent() != rank) { in tree_reduce_impl() 211 int rank = comm.rank(); in tree_reduce_impl() local 226 if (rank < parent) { in tree_reduce_impl() 231 } else if (rank > parent) { in tree_reduce_impl() 249 if (left_child != rank) { in tree_reduce_impl() 264 if (right_child != rank) { in tree_reduce_impl() 315 if (comm.rank() == root) in reduce() 327 BOOST_ASSERT(comm.rank() != root); in reduce() 357 if (comm.rank() == root) in reduce() [all …]
|
/dports/devel/hyperscan/boost_1_75_0/boost/mpi/collectives/ |
H A D | reduce.hpp | 120 int rank = comm.rank(); in tree_reduce_impl() local 144 if (tree.parent() != rank) { in tree_reduce_impl() 211 int rank = comm.rank(); in tree_reduce_impl() local 226 if (rank < parent) { in tree_reduce_impl() 231 } else if (rank > parent) { in tree_reduce_impl() 249 if (left_child != rank) { in tree_reduce_impl() 264 if (right_child != rank) { in tree_reduce_impl() 315 if (comm.rank() == root) in reduce() 327 BOOST_ASSERT(comm.rank() != root); in reduce() 357 if (comm.rank() == root) in reduce() [all …]
|