Searched refs:rank_first (Results 1 – 12 of 12) sorted by relevance
/dports/net/openmpi3/openmpi-3.1.6/ompi/group/ |
H A D | group_sporadic.c | 65 if( child_group->sparse_data.grp_sporadic.grp_sporadic_list[i].rank_first in ompi_group_translate_ranks_sporadic() 67 child_group->sparse_data.grp_sporadic.grp_sporadic_list[i].rank_first + in ompi_group_translate_ranks_sporadic() 71 sparse_data.grp_sporadic.grp_sporadic_list[i].rank_first + count; in ompi_group_translate_ranks_sporadic() 107 … ranks2[j] = child_group->sparse_data.grp_sporadic.grp_sporadic_list[i].rank_first in ompi_group_translate_ranks_sporadic_reverse() 153 sparse_data.grp_sporadic.grp_sporadic_list[j].rank_first = ranks[0]; in ompi_group_incl_spor() 164 sparse_data.grp_sporadic.grp_sporadic_list[j].rank_first = ranks[i]; in ompi_group_incl_spor()
|
H A D | group.h | 48 int rank_first; member
|
H A D | group.c | 146 group->sparse_data.grp_sporadic.grp_sporadic_list[i].rank_first, in ompi_group_dump()
|
/dports/net/openmpi/openmpi-4.1.1/ompi/group/ |
H A D | group_sporadic.c | 65 if( child_group->sparse_data.grp_sporadic.grp_sporadic_list[i].rank_first in ompi_group_translate_ranks_sporadic() 67 child_group->sparse_data.grp_sporadic.grp_sporadic_list[i].rank_first + in ompi_group_translate_ranks_sporadic() 71 sparse_data.grp_sporadic.grp_sporadic_list[i].rank_first + count; in ompi_group_translate_ranks_sporadic() 107 … ranks2[j] = child_group->sparse_data.grp_sporadic.grp_sporadic_list[i].rank_first in ompi_group_translate_ranks_sporadic_reverse() 153 sparse_data.grp_sporadic.grp_sporadic_list[j].rank_first = ranks[0]; in ompi_group_incl_spor() 164 sparse_data.grp_sporadic.grp_sporadic_list[j].rank_first = ranks[i]; in ompi_group_incl_spor()
|
H A D | group.h | 48 int rank_first; member
|
H A D | group.c | 146 group->sparse_data.grp_sporadic.grp_sporadic_list[i].rank_first, in ompi_group_dump()
|
/dports/math/py-or-tools/or-tools-9.2/ortools/constraint_solver/ |
H A D | sched_search.cc | 269 void SequenceVar::RankSequence(const std::vector<int>& rank_first, in create_data_model() 272 solver()->GetPropagationMonitor()->RankSequence(this, rank_first, rank_last, in create_data_model() 280 for (int i = 0; i < rank_first.size(); ++i) { in create_data_model() 281 const int next = 1 + rank_first[i]; in create_data_model() 349 void SequenceVar::FillSequence(std::vector<int>* const rank_first, in create_data_model() 352 CHECK(rank_first != nullptr); in create_data_model() 355 rank_first->clear(); in create_data_model() 367 rank_first->push_back(ValueToIndex(first)); in create_data_model()
|
H A D | trace.cc | 726 void RankSequence(SequenceVar* const var, const std::vector<int>& rank_first, in RankSequence() argument 731 var->DebugString(), absl::StrJoin(rank_first, ", "), in RankSequence()
|
H A D | demon_profiler.cc | 241 void RankSequence(SequenceVar* const var, const std::vector<int>& rank_first, in RankSequence() argument
|
H A D | constraint_solver.cc | 3115 void RankSequence(SequenceVar* const var, const std::vector<int>& rank_first, in RankSequence() argument 3118 ForAll(monitors_, &PropagationMonitor::RankSequence, var, rank_first, in RankSequence()
|
H A D | constraint_solver.h | 4644 void RankSequence(const std::vector<int>& rank_first, 4656 void FillSequence(std::vector<int>* const rank_first,
|
H A D | constraint_solveri.h | 1921 const std::vector<int>& rank_first,
|