| /dports/databases/percona57-client/boost_1_59_0/boost/graph/planar_detail/ |
| H A D | bucket_sort.hpp | 78 ItemToRankMap rank, in bucket_sort() argument
82 std::stable_sort(begin, end, rank_comparison<ItemToRankMap>(rank)); in bucket_sort()
91 rank_comparison<ItemToRankMap> cmp(rank); in bucket_sort()
95 range = get(rank, *max_by_rank) + 1; in bucket_sort()
102 temp_values[get(rank, *itr)].push_back(*itr); in bucket_sort()
127 ItemToRankMap rank) in bucket_sort() argument
129 bucket_sort(begin, end, rank, 0); in bucket_sort()
|
| /dports/math/octave-forge-linear-algebra/linear-algebra-2.2.3/inst/@kronprod/ |
| H A D | rank.m | 17 ## @deftypefn {Function File} rank (@var{KP})
18 ## Return the rank of the Kronecker product @var{KP}. This is computed as the
20 ## @seealso{rank, @@kronprod/det, @@kronprod/trace}
23 function retval = rank (KP) function
29 error ("rank: input must be of class 'kronprod'");
32 retval = rank (KP.A) * rank (KP.B);
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/planar_detail/ |
| H A D | bucket_sort.hpp | 78 ItemToRankMap rank, in bucket_sort() argument
82 std::stable_sort(begin, end, rank_comparison<ItemToRankMap>(rank)); in bucket_sort()
91 rank_comparison<ItemToRankMap> cmp(rank); in bucket_sort()
95 range = get(rank, *max_by_rank) + 1; in bucket_sort()
102 temp_values[get(rank, *itr)].push_back(*itr); in bucket_sort()
127 ItemToRankMap rank) in bucket_sort() argument
129 bucket_sort(begin, end, rank, 0); in bucket_sort()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/pending/detail/ |
| H A D | disjoint_sets.hpp | 53 link_sets(ParentPA p, RankPA rank, Vertex i, Vertex j, in link_sets() argument
59 if (get(rank, i) > get(rank, j)) in link_sets()
63 if (get(rank, i) == get(rank, j)) in link_sets()
64 put(rank, j, get(rank, j) + 1); in link_sets()
|
| /dports/graphics/wdune/wdune-1.926/vcglib/vcg/math/ |
| H A D | disjoint_set.h | 46 DisjointSetNode(OBJECT_TYPE *x) {obj=x; parent=obj; rank=0;} in DisjointSetNode()
49 int rank; member
115 if (xNode->rank>yNode->rank) in Link()
120 if (xNode->rank==yNode->rank) in Link()
121 yNode->rank++; in Link()
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/petgraph-0.4.13/src/ |
| H A D | unionfind.rs | 26 rank: Vec<u8>, field
42 let rank = vec![0; n]; in new() localVariable
45 UnionFind{parent: parent, rank: rank} in new()
115 let xrank = self.rank[xrepu]; in union()
116 let yrank = self.rank[yrepu]; in union()
127 self.rank[xrepu] += 1; in union()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/planar_detail/ |
| H A D | bucket_sort.hpp | 78 ItemToRankMap rank, in bucket_sort() argument
82 std::stable_sort(begin, end, rank_comparison<ItemToRankMap>(rank)); in bucket_sort()
91 rank_comparison<ItemToRankMap> cmp(rank); in bucket_sort()
95 range = get(rank, *max_by_rank) + 1; in bucket_sort()
102 temp_values[get(rank, *itr)].push_back(*itr); in bucket_sort()
127 ItemToRankMap rank) in bucket_sort() argument
129 bucket_sort(begin, end, rank, 0); in bucket_sort()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/pending/detail/ |
| H A D | disjoint_sets.hpp | 53 link_sets(ParentPA p, RankPA rank, Vertex i, Vertex j, in link_sets() argument
59 if (get(rank, i) > get(rank, j)) in link_sets()
63 if (get(rank, i) == get(rank, j)) in link_sets()
64 put(rank, j, get(rank, j) + 1); in link_sets()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/planar_detail/ |
| H A D | bucket_sort.hpp | 78 ItemToRankMap rank, in bucket_sort() argument
82 std::stable_sort(begin, end, rank_comparison<ItemToRankMap>(rank)); in bucket_sort()
91 rank_comparison<ItemToRankMap> cmp(rank); in bucket_sort()
95 range = get(rank, *max_by_rank) + 1; in bucket_sort()
102 temp_values[get(rank, *itr)].push_back(*itr); in bucket_sort()
127 ItemToRankMap rank) in bucket_sort() argument
129 bucket_sort(begin, end, rank, 0); in bucket_sort()
|
| /dports/devel/boost-libs/boost_1_72_0/libs/mpi/example/ |
| H A D | generate_collect_optional.cpp | 27 srand(time(0) + world.rank()); in generate_data()
40 std::cout << "Generator #" << local.rank() << " sends some data..." in generate_data()
50 if (local.rank() == 0) in generate_data()
59 if (world.rank() == master_collector) { in collect_data()
87 std::cout << "Collector #" << local.rank() in collect_data()
100 if (world.rank() == 0) { in main()
107 bool is_generator = world.rank() < 2 * world.size() / 3; in main()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/pending/detail/ |
| H A D | disjoint_sets.hpp | 53 link_sets(ParentPA p, RankPA rank, Vertex i, Vertex j, in link_sets() argument
59 if (get(rank, i) > get(rank, j)) in link_sets()
63 if (get(rank, i) == get(rank, j)) in link_sets()
64 put(rank, j, get(rank, j) + 1); in link_sets()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/planar_detail/ |
| H A D | bucket_sort.hpp | 78 ItemToRankMap rank, in bucket_sort() argument
82 std::stable_sort(begin, end, rank_comparison<ItemToRankMap>(rank)); in bucket_sort()
91 rank_comparison<ItemToRankMap> cmp(rank); in bucket_sort()
95 range = get(rank, *max_by_rank) + 1; in bucket_sort()
102 temp_values[get(rank, *itr)].push_back(*itr); in bucket_sort()
127 ItemToRankMap rank) in bucket_sort() argument
129 bucket_sort(begin, end, rank, 0); in bucket_sort()
|
| /dports/security/sequoia/sequoia-383133f6be990237044900a4df676488bf8dd71e/cargo-crates/petgraph-0.4.13/src/ |
| H A D | unionfind.rs | 26 rank: Vec<u8>, field
42 let rank = vec![0; n]; in new() localVariable
45 UnionFind{parent: parent, rank: rank} in new()
115 let xrank = self.rank[xrepu]; in union()
116 let yrank = self.rank[yrepu]; in union()
127 self.rank[xrepu] += 1; in union()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/planar_detail/ |
| H A D | bucket_sort.hpp | 78 ItemToRankMap rank,
82 std::stable_sort(begin, end, rank_comparison<ItemToRankMap>(rank));
91 rank_comparison<ItemToRankMap> cmp(rank);
95 range = get(rank, *max_by_rank) + 1;
102 temp_values[get(rank, *itr)].push_back(*itr);
127 ItemToRankMap rank)
129 bucket_sort(begin, end, rank, 0);
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/pending/detail/ |
| H A D | disjoint_sets.hpp | 53 link_sets(ParentPA p, RankPA rank, Vertex i, Vertex j, in link_sets() argument
59 if (get(rank, i) > get(rank, j)) in link_sets()
63 if (get(rank, i) == get(rank, j)) in link_sets()
64 put(rank, j, get(rank, j) + 1); in link_sets()
|
| /dports/net/mpich/mpich-3.4.3/src/mpi/coll/ireduce_scatter/ |
| H A D | ireduce_scatter_inter_sched_remote_reduce_local_scatterv.c | 23 int rank, root, local_size, total_count, i; in MPIR_Ireduce_scatter_inter_sched_remote_reduce_local_scatterv() local
30 rank = comm_ptr->rank; in MPIR_Ireduce_scatter_inter_sched_remote_reduce_local_scatterv()
37 if (rank == 0) { in MPIR_Ireduce_scatter_inter_sched_remote_reduce_local_scatterv()
64 root = (rank == 0) ? MPI_ROOT : MPI_PROC_NULL; in MPIR_Ireduce_scatter_inter_sched_remote_reduce_local_scatterv()
88 root = (rank == 0) ? MPI_ROOT : MPI_PROC_NULL; in MPIR_Ireduce_scatter_inter_sched_remote_reduce_local_scatterv()
104 recvbuf, recvcounts[rank], datatype, 0, newcomm_ptr, s); in MPIR_Ireduce_scatter_inter_sched_remote_reduce_local_scatterv()
|
| /dports/games/scid/scid/engines/togaII1.2.1a/src/ |
| H A D | square.cpp | 83 int rank_to_char(int rank) { in rank_to_char() argument
85 ASSERT(rank>=Rank1&&rank<=Rank8); in rank_to_char()
87 return '1' + (rank - Rank1); in rank_to_char()
111 int file, rank; in square_from_string() local
120 rank = rank_from_char(string[1]); in square_from_string()
122 return SQUARE_MAKE(file,rank); in square_from_string()
|
| /dports/net/mpich2/mpich2-1.5/test/mpi/f90/rma/ |
| H A D | winaccf90.f90 | 11 integer left, right, rank, size variable
32 call mpi_comm_rank( comm, rank, ierr )
33 left = rank - 1
37 right = rank + 1
49 buf(i,j) = rank * (ncols * nrows) + i + (j-1) * nrows
68 ans = rank * (ncols * nrows) - nrows + i - 1
79 ans = (rank + 1) * (ncols * nrows) + i - 1
|
| /dports/devel/vcglib/vcglib-2020.09/vcg/math/ |
| H A D | disjoint_set.h | 46 DisjointSetNode(OBJECT_TYPE *x) {obj=x; parent=obj; rank=0;} in DisjointSetNode()
49 int rank; member
115 if (xNode->rank>yNode->rank) in Link()
120 if (xNode->rank==yNode->rank) in Link()
121 yNode->rank++; in Link()
|
| /dports/science/rdkit/rdkit-Release_2021_03_5/Code/Demos/RDKit/MPI/ |
| H A D | rdkexample2.cpp | 29 if (world.rank() == 0) { in broadcastMols()
38 if (world.rank() != 0) { in broadcastMols()
54 if (world.rank() == 0) { in main()
74 if (world.rank() == 0) { in main()
80 unsigned int pos = extraBits + world.rank() * chunkSize; in main()
85 if (world.rank() == 0) { in main()
92 if (world.rank() == 0) { in main()
|
| /dports/science/siconos/siconos-4.4.0/numerics/src/tools/test/ |
| H A D | NM_MUMPS_test.c | 22 int rank; in main() local
25 MPI_Comm_rank(MPI_COMM_WORLD,&rank); in main()
27 rank = 0; in main()
44 if(rank == 0) in main()
47 assert(rank == 0); in main()
106 if(rank == 0) in main()
109 assert(rank == 0); in main()
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/planar_detail/ |
| H A D | bucket_sort.hpp | 78 ItemToRankMap rank, in bucket_sort() argument
82 std::stable_sort(begin, end, rank_comparison<ItemToRankMap>(rank)); in bucket_sort()
91 rank_comparison<ItemToRankMap> cmp(rank); in bucket_sort()
95 range = get(rank, *max_by_rank) + 1; in bucket_sort()
102 temp_values[get(rank, *itr)].push_back(*itr); in bucket_sort()
127 ItemToRankMap rank) in bucket_sort() argument
129 bucket_sort(begin, end, rank, 0); in bucket_sort()
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/pending/detail/ |
| H A D | disjoint_sets.hpp | 53 link_sets(ParentPA p, RankPA rank, Vertex i, Vertex j, in link_sets() argument
59 if (get(rank, i) > get(rank, j)) in link_sets()
63 if (get(rank, i) == get(rank, j)) in link_sets()
64 put(rank, j, get(rank, j) + 1); in link_sets()
|
| /dports/devel/hyperscan/boost_1_75_0/libs/mpi/example/ |
| H A D | generate_collect_optional.cpp | 27 srand(time(0) + world.rank()); in generate_data()
40 std::cout << "Generator #" << local.rank() << " sends some data..." in generate_data()
50 if (local.rank() == 0) in generate_data()
59 if (world.rank() == master_collector) { in collect_data()
87 std::cout << "Collector #" << local.rank() in collect_data()
100 if (world.rank() == 0) { in main()
107 bool is_generator = world.rank() < 2 * world.size() / 3; in main()
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/pending/detail/ |
| H A D | disjoint_sets.hpp | 53 link_sets(ParentPA p, RankPA rank, Vertex i, Vertex j, in link_sets() argument
59 if (get(rank, i) > get(rank, j)) in link_sets()
63 if (get(rank, i) == get(rank, j)) in link_sets()
64 put(rank, j, get(rank, j) + 1); in link_sets()
|