| /dports/math/oink/oink-c1259fe/src/ |
| H A D | zlkpp.cpp | 37 if (num_successors[v2] < 0) { in get_attractor()
41 ++num_successors[v2]; in get_attractor()
42 assert(num_successors[v2] >= 0); in get_attractor()
46 --num_successors[v2]; in get_attractor()
47 if (num_successors[v2]) in get_attractor()
63 num_successors[v] = -1; in get_attractor()
236 num_successors = new int[nodecount()]; in run()
237 std::fill(num_successors, num_successors + nodecount(), -1); in run()
276 delete[] num_successors; in run()
|
| H A D | zlkpp.hpp | 37 int *num_successors; member in pg::ZLKPPSolver
|
| /dports/cad/opentimer/OpenTimer-18d28ff/ot/taskflow/core/ |
| H A D | task.hpp | 68 size_t num_successors() const;
257 inline size_t Task::num_successors() const { in num_successors() function in tf::Task
258 return _node->num_successors(); in num_successors()
350 size_t num_successors() const;
447 inline size_t TaskView::num_successors() const { in num_successors() function in tf::TaskView
448 return _node->num_successors(); in num_successors()
|
| H A D | executor.hpp | 623 const auto num_successors = node->num_successors(); in _invoke() local
635 if(size_t id = std::get<Node::ConditionWork>(node->_work)(); id < num_successors) { in _invoke()
742 for(size_t i=0; i<num_successors; ++i) { in _invoke()
746 c.fetch_add(num_successors); in _invoke()
|
| H A D | graph.hpp | 85 size_t num_successors() const;
168 inline size_t Node::num_successors() const { in num_successors() function in tf::Node
|
| H A D | flow_builder.hpp | 494 if(S.num_successors() == 0) { in parallel_for()
684 if(source.num_successors() == 0) { in parallel_for()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/taskflow-2.5.0/include/taskflow/core/ |
| H A D | task.hpp | 159 size_t num_successors() const;
448 inline size_t Task::num_successors() const { in num_successors() function in tf::Task
449 return _node->num_successors(); in num_successors()
583 size_t num_successors() const;
685 inline size_t TaskView::num_successors() const { in num_successors() function in tf::TaskView
686 return _node->num_successors(); in num_successors()
|
| H A D | graph.hpp | 168 size_t num_successors() const;
296 inline size_t Node::num_successors() const { in num_successors() function in tf::Node
|
| H A D | executor.hpp | 752 const auto num_successors = node->num_successors(); in _invoke() local
810 for(size_t i=0; i<num_successors; ++i) { in _invoke()
927 if(id >= 0 && static_cast<size_t>(id) < node->num_successors()) { in _invoke_condition_work()
|
| H A D | flow_builder.hpp | 492 if(S.num_successors() == 0) { in parallel_for()
550 if(source.num_successors() == 0) { in parallel_for()
631 if(source.num_successors() == 0) { in parallel_for()
|
| /dports/devel/py-rapidfuzz/rapidfuzz-1.8.0/3rd-party/taskflow/taskflow/core/ |
| H A D | task.hpp | 161 size_t num_successors() const;
450 inline size_t Task::num_successors() const { in num_successors() function in tf::Task
451 return _node->num_successors(); in num_successors()
585 size_t num_successors() const;
687 inline size_t TaskView::num_successors() const { in num_successors() function in tf::TaskView
688 return _node->num_successors(); in num_successors()
|
| H A D | graph.hpp | 184 size_t num_successors() const;
321 inline size_t Node::num_successors() const { in num_successors() function in tf::Node
|
| H A D | executor.hpp | 828 const auto num_successors = node->num_successors(); in _invoke() local
901 for(size_t i=0; i<num_successors; ++i) { in _invoke()
910 if(cond >= 0 && static_cast<size_t>(cond) < num_successors) { in _invoke()
|
| /dports/devel/taskflow/taskflow-3.2.0/taskflow/core/ |
| H A D | task.hpp | 186 size_t num_successors() const;
430 inline size_t Task::num_successors() const { in num_successors() function in tf::Task
431 return _node->num_successors(); in num_successors()
543 size_t num_successors() const;
615 inline size_t TaskView::num_successors() const { in num_successors() function in tf::TaskView
616 return _node.num_successors(); in num_successors()
|
| H A D | graph.hpp | 204 size_t num_successors() const;
380 inline size_t Node::num_successors() const { in num_successors() function in tf::Node
|
| H A D | executor.hpp | 736 const auto num_successors = node->num_successors(); in _invoke() local
822 for(size_t i=0; i<num_successors; ++i) { in _invoke()
831 if(cond >= 0 && static_cast<size_t>(cond) < num_successors) { in _invoke()
|
| /dports/math/py-or-tools/or-tools-9.2/ortools/scheduling/ |
| H A D | rcpsp_parser.cc | 169 const int num_successors = strtoint32(words[2]);
170 if (words.size() != 3 + num_successors) {
175 for (int i = 0; i < num_successors; ++i) {
339 const int num_successors = strtoint32(words[2]);
344 for (int i = 0; i < num_successors; ++i) {
349 for (int i = 3 + num_successors; i < words.size(); ++i) {
358 const int num_successors = rcpsp_.tasks(t).successors_size();
360 for (int s = 0; s < num_successors; ++s) {
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/taskflow-2.5.0/include/taskflow/cuda/ |
| H A D | cuda_task.hpp | 74 size_t num_successors() const;
169 inline size_t cudaTask::num_successors() const { in num_successors() function in tf::cudaTask
|
| /dports/devel/taskflow/taskflow-3.2.0/taskflow/sycl/ |
| H A D | sycl_task.hpp | 85 size_t num_successors() const;
160 inline size_t syclTask::num_successors() const { in num_successors() function in tf::syclTask
|
| /dports/devel/taskflow/taskflow-3.2.0/doxygen/cookbook/ |
| H A D | static_tasking.dox | 54 10: std::cout << A.num_successors() << std::endl; // 1
57 13: std::cout << B.num_successors() << std::endl; // 0
142 19: << "num_successors=" << task.num_successors() << '\n';
157 This is Task 0: num_dependents=0, num_successors=1
158 This is Task 1: num_dependents=1, num_successors=0
|
| /dports/devel/taskflow/taskflow-3.2.0/taskflow/cuda/ |
| H A D | cuda_task.hpp | 131 size_t num_successors() const;
211 inline size_t cudaTask::num_successors() const { in num_successors() function in tf::cudaTask
|
| /dports/devel/taskflow/taskflow-3.2.0/unittests/sycl/ |
| H A D | sycl_basics.cpp | 19 REQUIRE(task1.num_successors() == 0);
28 REQUIRE(task1.num_successors() == 1);
30 REQUIRE(task2.num_successors() == 0);
|
| /dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/lib/Analysis/ |
| H A D | RegionInfo.cpp | 469 unsigned num_successors = succ_end(entry) - succ_begin(entry); in isTrivialRegion() local
471 if (num_successors <= 1 && exit == *(succ_begin(entry))) in isTrivialRegion()
|
| /dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/shark/ |
| H A D | sharkTopLevelBlock.hpp | 97 int num_successors() const { in num_successors() function in SharkTopLevelBlock
|
| /dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/shark/ |
| H A D | sharkTopLevelBlock.hpp | 97 int num_successors() const { in num_successors() function in SharkTopLevelBlock
|