| /dports/games/gnuchess/gnuchess-6.2.9/src/engine/ |
| H A D | square.cpp | 105 int rank_to_char(int rank) { in rank_to_char() argument
107 ASSERT(rank>=Rank1&&rank<=Rank8); in rank_to_char()
109 return '1' + (rank - Rank1); in rank_to_char()
133 int file, rank; in square_from_string() local
142 rank = rank_from_char(string[1]); in square_from_string()
144 return SQUARE_MAKE(file,rank); in square_from_string()
|
| /dports/databases/percona57-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/pgloader3/cl-containers-20200427-git/dev/ |
| H A D | union-find-container.lisp | 6 ((rank 0 ir)))
16 (format stream "UFN: ~A, ~D" (element o) (rank o))))
34 (if (> (rank node1) (rank node2))
37 (when (= (rank node1) (rank node2))
38 (incf (slot-value node2 'rank))))))
|
| /dports/databases/percona57-pam-for-mysql/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/percona57-pam-for-mysql/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/percona57-pam-for-mysql/boost_1_59_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/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/pending/detail/ |
| H A D | disjoint_sets.hpp | 55 inline void link_sets(ParentPA p, RankPA rank, Vertex i, Vertex j, in link_sets() argument
62 if (get(rank, i) > get(rank, j)) in link_sets()
67 if (get(rank, i) == get(rank, j)) in link_sets()
68 put(rank, j, get(rank, j) + 1); in link_sets()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/planar_detail/ |
| H A D | bucket_sort.hpp | 61 void bucket_sort(ForwardIterator begin, ForwardIterator end, ItemToRankMap rank, in bucket_sort() argument
65 std::stable_sort(begin, end, rank_comparison< ItemToRankMap >(rank)); in bucket_sort()
74 rank_comparison< ItemToRankMap > cmp(rank); in bucket_sort()
78 range = get(rank, *max_by_rank) + 1; in bucket_sort()
85 temp_values[get(rank, *itr)].push_back(*itr); in bucket_sort()
105 void bucket_sort(ForwardIterator begin, ForwardIterator end, ItemToRankMap rank) in bucket_sort() argument
107 bucket_sort(begin, end, rank, 0); in bucket_sort()
|
| /dports/multimedia/qmmp-qt5/qmmp-1.5.2/src/plugins/Input/cue/ |
| H A D | settingsdialog.cpp | 88 int rank; in findCodecs() local
93 rank = 1; in findCodecs()
97 rank = 2; in findCodecs()
102 rank = 3; in findCodecs()
104 rank = 4; in findCodecs()
108 rank = 5; in findCodecs()
110 sortKey.prepend(QChar('0' + rank)); in findCodecs()
|
| /dports/science/PETSc/petsc-3.14.1/src/mat/tests/ |
| H A D | ex95.c | 9 PetscMPIInt size,rank; in main() local
15 ierr = MPI_Comm_rank(PETSC_COMM_WORLD,&rank);CHKERRQ(ierr); in main()
25 a[0] = rank+1; in main()
26 for (i=0; i<m-rank; i++) { in main()
27 col = i+rank; in main()
33 if (rank == prid) { in main()
34 ierr = PetscPrintf(PETSC_COMM_SELF,"[%d] A: \n",rank);CHKERRQ(ierr); in main()
|
| /dports/science/PETSc/petsc-3.14.1/src/vec/is/sf/tutorials/output/ |
| H A D | ex1_7_basic.out | 3 sort=rank-order
19 [0] Roots referenced by my leaves, by rank
24 [1] Roots referenced by my leaves, by rank
30 [2] Roots referenced by my leaves, by rank
37 [3] Roots referenced by my leaves, by rank
46 sort=rank-order
70 sort=rank-order
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/planar_detail/ |
| H A D | bucket_sort.hpp | 61 void bucket_sort(ForwardIterator begin, ForwardIterator end, ItemToRankMap rank, in bucket_sort() argument
65 std::stable_sort(begin, end, rank_comparison< ItemToRankMap >(rank)); in bucket_sort()
74 rank_comparison< ItemToRankMap > cmp(rank); in bucket_sort()
78 range = get(rank, *max_by_rank) + 1; in bucket_sort()
85 temp_values[get(rank, *itr)].push_back(*itr); in bucket_sort()
105 void bucket_sort(ForwardIterator begin, ForwardIterator end, ItemToRankMap rank) in bucket_sort() argument
107 bucket_sort(begin, end, rank, 0); in bucket_sort()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/pending/detail/ |
| H A D | disjoint_sets.hpp | 55 inline void link_sets(ParentPA p, RankPA rank, Vertex i, Vertex j, in link_sets() argument
62 if (get(rank, i) > get(rank, j)) in link_sets()
67 if (get(rank, i) == get(rank, j)) in link_sets()
68 put(rank, j, get(rank, j) + 1); in link_sets()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_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/xtrabackup/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/percona57-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/databases/xtrabackup/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/percona57-server/boost_1_59_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/xtrabackup/boost_1_59_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/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/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/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/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/textproc/ripgrep-all/ripgrep-all-0.9.6/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/games/brutalchess/brutalchess-0.5.2/src/ |
| H A D | faileplayer.cpp | 89 int rank; in think() local
92 oss >> rank; in think()
93 BoardPosition origin(c, rank); in think()
96 oss >> rank; in think()
97 BoardPosition dest(c, rank); in think()
124 movestr += '0' + move.origin().rank(); in opponentMove()
126 movestr += '0' + move.dest().rank(); in opponentMove()
|
| /dports/databases/percona57-client/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/percona57-client/boost_1_59_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()
|