/dports/math/gap/gap-4.11.0/pkg/fwtree-1.3/tst/ |
H A D | manual.tst | 5 Constructed 3 1-step descendants. 7 Constructed 0 1-step descendants. 8 Constructed 0 2-step descendants. 10 Constructed 0 1-step descendants. 11 Constructed 0 2-step descendants. 13 Constructed 0 1-step descendants. 14 Constructed 0 2-step descendants. 15 Constructed 3 2-step descendants. 17 Constructed 0 1-step descendants. 18 Constructed 0 2-step descendants. [all …]
|
/dports/devel/systemc/systemc-2.3.4_pub_rev_20190614/src/sysc/kernel/ |
H A D | sc_process_handle.h | 272 m_target_p->disable_process(descendants); in disable() 306 m_target_p->enable_process(descendants); in enable() 358 m_target_p->kill_process( descendants ); in kill() 390 descendants ); in reset() 413 m_target_p->resume_process(descendants); in resume() 440 sc_descendant_inclusion_info descendants) in sync_reset_off() argument 444 descendants); in sync_reset_off() 452 sc_descendant_inclusion_info descendants) in sync_reset_on() argument 457 descendants); in sync_reset_on() 512 sc_descendant_inclusion_info descendants) in throw_it() argument [all …]
|
H A D | sc_method_process.cpp | 146 sc_descendant_inclusion_info descendants ) in disable_process() argument 151 if ( descendants == SC_INCLUDE_DESCENDANTS ) in disable_process() 205 sc_descendant_inclusion_info descendants ) in enable_process() argument 210 if ( descendants == SC_INCLUDE_DESCENDANTS ) in enable_process() 255 if ( descendants == SC_INCLUDE_DESCENDANTS ) in kill_process() 390 sc_descendant_inclusion_info descendants ) in suspend_process() argument 395 if ( descendants == SC_INCLUDE_DESCENDANTS ) in suspend_process() 453 sc_descendant_inclusion_info descendants ) in resume_process() argument 458 if ( descendants == SC_INCLUDE_DESCENDANTS ) in resume_process() 575 sc_descendant_inclusion_info descendants ) in throw_user() argument [all …]
|
/dports/math/gap/gap-4.11.0/pkg/anupq-3.2.1/tst/out/ |
H A D | test3.out | 27 5. Construct descendants 42 Input class bound on descendants: 5 43 Construct all descendants? 1 44 Set an order bound on the descendants? 0 59 # of capable immediate descendants is 1 75 # of capable immediate descendants is 1 77 # of capable immediate descendants is 1 101 # of capable immediate descendants is 1 103 # of capable immediate descendants is 1 114 # of capable immediate descendants is 2 [all …]
|
H A D | test2.out | 27 5. Construct descendants 42 Input class bound on descendants: 7 43 Construct all descendants? 1 45 Input order bound on descendants: 5 56 # of capable immediate descendants is 2 58 # of capable immediate descendants is 3 60 # of capable immediate descendants is 1 71 # of capable immediate descendants is 1 79 # of capable immediate descendants is 1 87 # of capable immediate descendants is 2 [all …]
|
H A D | test1.out | 27 5. Construct descendants 51 Input class bound on descendants: 4 52 Construct all descendants? 0 64 # of immediate descendants of order 3^4 is 3 65 # of capable immediate descendants is 3 82 # of immediate descendants of order 3^7 is 4 83 # of capable immediate descendants is 4 101 # of capable immediate descendants is 11 109 # of capable immediate descendants is 9 117 # of capable immediate descendants is 9 [all …]
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/core/css/ |
H A D | rule_feature_set_test.cc | 424 ExpectNoInvalidation(invalidation_lists.descendants); in TEST_F() 445 ExpectNoInvalidation(invalidation_lists.descendants); in TEST_F() 455 ExpectNoInvalidation(invalidation_lists.descendants); in TEST_F() 477 ExpectNoInvalidation(invalidation_lists.descendants); in TEST_F() 545 ExpectNoInvalidation(invalidation_lists.descendants); in TEST_F() 605 invalidation_lists.descendants.clear(); in TEST_F() 1122 invalidation_lists.descendants.clear(); in TEST_F() 1127 invalidation_lists.descendants.clear(); in TEST_F() 1132 invalidation_lists.descendants.clear(); in TEST_F() 1138 invalidation_lists.descendants.clear(); in TEST_F() [all …]
|
/dports/www/webtrees20/webtrees-2.0.19/webtrees/app/Services/ |
H A D | ChartService.php | 80 public function descendants(Individual $individual, int $generations): Collection function in Fisharebest\\Webtrees\\Services\\ChartService 82 $descendants = new Collection([$individual->xref() => $individual]); 87 if (!$descendants->has($child->xref())) { 88 … $descendants = $descendants->merge($this->descendants($child, $generations - 1)); 94 return $descendants; 107 $descendants = new Collection($individual->spouseFamilies()); 110 foreach ($descendants as $family) { 112 … $descendants = $descendants->merge($this->descendantFamilies($child, $generations - 1)); 117 return $descendants;
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/core/css/ |
H A D | rule_feature_set_test.cc | 432 ExpectNoInvalidation(invalidation_lists.descendants); in TEST_F() 453 ExpectNoInvalidation(invalidation_lists.descendants); in TEST_F() 463 ExpectNoInvalidation(invalidation_lists.descendants); in TEST_F() 485 ExpectNoInvalidation(invalidation_lists.descendants); in TEST_F() 553 ExpectNoInvalidation(invalidation_lists.descendants); in TEST_F() 613 invalidation_lists.descendants.clear(); in TEST_F() 1108 invalidation_lists.descendants.clear(); in TEST_F() 1113 invalidation_lists.descendants.clear(); in TEST_F() 1118 invalidation_lists.descendants.clear(); in TEST_F() 1124 invalidation_lists.descendants.clear(); in TEST_F() [all …]
|
/dports/net/boinc-client/boinc-client_release-7.8-7.8.6/lib/ |
H A D | proc_control.cpp | 191 vector<int> descendants; in kill_descendants() local 195 kill_all(descendants); in kill_descendants() 202 vector<int> descendants; in kill_descendants() local 206 get_descendants(getpid(), descendants); in kill_descendants() 210 if (!any_process_exists(descendants)) { in kill_descendants() 215 kill_all(descendants); in kill_descendants() 218 get_descendants(getpid(), descendants); in kill_descendants() 220 kill_all(descendants); in kill_descendants() 228 vector<int> descendants; in suspend_or_resume_descendants() local 231 get_descendants(pid, descendants); in suspend_or_resume_descendants() [all …]
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/core/css/invalidation/ |
H A D | pending_invalidations.cc | 33 for (auto& invalidation_set : invalidation_lists.descendants) { in ScheduleInvalidationSetsForNode() 89 for (auto& invalidation_set : invalidation_lists.descendants) { in ScheduleInvalidationSetsForNode() 102 DCHECK(invalidation_lists.descendants.IsEmpty()); in ScheduleSiblingInvalidationsAsDescendants() 120 DescendantInvalidationSet* descendants = in ScheduleSiblingInvalidationsAsDescendants() local 123 (descendants && descendants->WholeSubtreeInvalid())) { in ScheduleSiblingInvalidationsAsDescendants() 135 if (descendants && in ScheduleSiblingInvalidationsAsDescendants() 136 !pending_invalidations.Descendants().Contains(descendants)) { in ScheduleSiblingInvalidationsAsDescendants() 137 pending_invalidations.Descendants().push_back(descendants); in ScheduleSiblingInvalidationsAsDescendants() 158 invalidation_lists.descendants.push_back(invalidation_set); in RescheduleSiblingInvalidationsAsDescendants() 159 if (DescendantInvalidationSet* descendants = in RescheduleSiblingInvalidationsAsDescendants() local [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/core/css/invalidation/ |
H A D | pending_invalidations.cc | 33 for (auto& invalidation_set : invalidation_lists.descendants) { in ScheduleInvalidationSetsForNode() 86 for (auto& invalidation_set : invalidation_lists.descendants) { in ScheduleInvalidationSetsForNode() 99 DCHECK(invalidation_lists.descendants.IsEmpty()); in ScheduleSiblingInvalidationsAsDescendants() 114 DescendantInvalidationSet* descendants = in ScheduleSiblingInvalidationsAsDescendants() local 117 (descendants && descendants->WholeSubtreeInvalid())) { in ScheduleSiblingInvalidationsAsDescendants() 129 if (descendants && in ScheduleSiblingInvalidationsAsDescendants() 130 !pending_invalidations.Descendants().Contains(descendants)) { in ScheduleSiblingInvalidationsAsDescendants() 131 pending_invalidations.Descendants().push_back(descendants); in ScheduleSiblingInvalidationsAsDescendants() 152 invalidation_lists.descendants.push_back(invalidation_set); in RescheduleSiblingInvalidationsAsDescendants() 153 if (DescendantInvalidationSet* descendants = in RescheduleSiblingInvalidationsAsDescendants() local [all …]
|
/dports/math/gap/gap-4.11.0/pkg/anupq-3.2.1/tst/ |
H A D | anupqeg.tst | 156 #I # of capable immediate descendants is 2 577 #I # of capable immediate descendants is 2 652 #I # of capable immediate descendants is 3 686 #I # of capable immediate descendants is 1 745 #I # of capable immediate descendants is 1 815 #I # of capable immediate descendants is 1 6035 gap> ##All descendants of C2 x C2 x C2 44960 gap> ##A `by hand' descendants example 45068 gap> ##Iterated descendants example 47910 gap> # in the descendants tree. [all …]
|
/dports/databases/p5-DBIx-Class-Tree-NestedSet/DBIx-Class-Tree-NestedSet-0.10/t/ |
H A D | 09-multi.t | 23 is($root->descendants->count, 0, 'no descendants, initially'); 31 is($child->root->id, $root->id, 'root set for descendants'); 34 is($root->descendants->count, 1, 'now one child'); 49 is($root->descendants->count, 4, 'root now four descendants'); 51 is($child->descendants->count, 2, 'subnode has two descendants'); 53 is($subchild->descendants->count, 0, 'subchild does not have descendants yet'); 64 [map { $_->id } $root->descendants], 66 'roots descendants are ordered correctly',
|
/dports/math/gap/gap-4.11.0/pkg/anupq-3.2.1/examples/ |
H A D | PqDescendants-treetraverse-i | 3 # traverse a descendants tree, by exploring the 3-groups of rank 2 10 ## Below, we use the option StepSize in order to construct descendants 14 ## The elementary abelian group of order 9 has 3 descendants of 20 ## Now we will compute the descendants of coclass 1 for each of the 21 ## groups above. Then we will compute the descendants of coclass 1 23 ## one file for each class at a time. For example, the descendants 26 ## Hence, we have to traverse the descendants tree in depth first 40 ## descendants tree and move upwards. 57 ## We get four descendants here, three of which will turn out to be 59 ## in the descendants tree. [all …]
|
/dports/net-p2p/bitcoin/bitcoin-22.0/src/test/ |
H A D | mempool_tests.cpp | 595 size_t ancestors, descendants; in BOOST_AUTO_TEST_CASE() local 611 BOOST_CHECK_EQUAL(descendants, 1ULL); in BOOST_AUTO_TEST_CASE() 627 BOOST_CHECK_EQUAL(descendants, 2ULL); in BOOST_AUTO_TEST_CASE() 630 BOOST_CHECK_EQUAL(descendants, 2ULL); in BOOST_AUTO_TEST_CASE() 647 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 650 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 653 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 673 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() 676 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() 679 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/net-p2p/bitcoin-daemon/bitcoin-22.0/src/test/ |
H A D | mempool_tests.cpp | 595 size_t ancestors, descendants; in BOOST_AUTO_TEST_CASE() local 611 BOOST_CHECK_EQUAL(descendants, 1ULL); in BOOST_AUTO_TEST_CASE() 627 BOOST_CHECK_EQUAL(descendants, 2ULL); in BOOST_AUTO_TEST_CASE() 630 BOOST_CHECK_EQUAL(descendants, 2ULL); in BOOST_AUTO_TEST_CASE() 647 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 650 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 653 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 673 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() 676 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() 679 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/net-p2p/bitcoin-utils/bitcoin-22.0/src/test/ |
H A D | mempool_tests.cpp | 595 size_t ancestors, descendants; in BOOST_AUTO_TEST_CASE() local 611 BOOST_CHECK_EQUAL(descendants, 1ULL); in BOOST_AUTO_TEST_CASE() 627 BOOST_CHECK_EQUAL(descendants, 2ULL); in BOOST_AUTO_TEST_CASE() 630 BOOST_CHECK_EQUAL(descendants, 2ULL); in BOOST_AUTO_TEST_CASE() 647 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 650 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 653 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 673 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() 676 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() 679 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/net-p2p/qtum/qtum-mainnet-fastlane-v0.20.3/src/test/ |
H A D | mempool_tests.cpp | 597 size_t ancestors, descendants; in BOOST_AUTO_TEST_CASE() local 613 BOOST_CHECK_EQUAL(descendants, 1ULL); in BOOST_AUTO_TEST_CASE() 629 BOOST_CHECK_EQUAL(descendants, 2ULL); in BOOST_AUTO_TEST_CASE() 632 BOOST_CHECK_EQUAL(descendants, 2ULL); in BOOST_AUTO_TEST_CASE() 649 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 652 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 655 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 675 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() 678 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() 681 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/net-p2p/namecoin-daemon/namecoin-core-nc0.21.0.1/src/test/ |
H A D | mempool_tests.cpp | 597 size_t ancestors, descendants; in BOOST_AUTO_TEST_CASE() local 613 BOOST_CHECK_EQUAL(descendants, 1ULL); in BOOST_AUTO_TEST_CASE() 629 BOOST_CHECK_EQUAL(descendants, 2ULL); in BOOST_AUTO_TEST_CASE() 632 BOOST_CHECK_EQUAL(descendants, 2ULL); in BOOST_AUTO_TEST_CASE() 649 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 652 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 655 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 675 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() 678 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() 681 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/net-p2p/namecoin/namecoin-core-nc0.21.0.1/src/test/ |
H A D | mempool_tests.cpp | 597 size_t ancestors, descendants; in BOOST_AUTO_TEST_CASE() local 613 BOOST_CHECK_EQUAL(descendants, 1ULL); in BOOST_AUTO_TEST_CASE() 629 BOOST_CHECK_EQUAL(descendants, 2ULL); in BOOST_AUTO_TEST_CASE() 632 BOOST_CHECK_EQUAL(descendants, 2ULL); in BOOST_AUTO_TEST_CASE() 649 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 652 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 655 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 675 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() 678 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() 681 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/net-p2p/namecoin-utils/namecoin-core-nc0.21.0.1/src/test/ |
H A D | mempool_tests.cpp | 597 size_t ancestors, descendants; in BOOST_AUTO_TEST_CASE() local 613 BOOST_CHECK_EQUAL(descendants, 1ULL); in BOOST_AUTO_TEST_CASE() 629 BOOST_CHECK_EQUAL(descendants, 2ULL); in BOOST_AUTO_TEST_CASE() 632 BOOST_CHECK_EQUAL(descendants, 2ULL); in BOOST_AUTO_TEST_CASE() 649 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 652 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 655 BOOST_CHECK_EQUAL(descendants, 3ULL); in BOOST_AUTO_TEST_CASE() 675 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() 678 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() 681 BOOST_CHECK_EQUAL(descendants, 4ULL); in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/rubocop/cop/gitlab/ |
H A D | keys_first_and_values_first.rb | 26 replace_with = if node.descendants.first.method_name == :values 28 elsif node.descendants.first.method_name == :keys 31 …throw("Expect '.values.first' or '.keys.first', but get #{node.descendants.first.method_name}.firs… 34 upto_including_keys_or_values = node.descendants.first.source_range 35 before_keys_or_values = node.descendants[1].source_range 44 chained_on_node = node.descendants.first 48 node.descendants[1]
|
/dports/devel/libgit2/libgit2-1.3.0/tests/graph/ |
H A D | reachable_from_any.c | 35 git_oid descendants[7]; in test_graph_reachable_from_any__returns_correct_result() local 55 cl_git_pass(git_oid_cpy(&descendants[0], git_object_id(branchA1))); in test_graph_reachable_from_any__returns_correct_result() 56 cl_git_pass(git_oid_cpy(&descendants[1], git_object_id(branchA2))); in test_graph_reachable_from_any__returns_correct_result() 57 cl_git_pass(git_oid_cpy(&descendants[2], git_object_id(branchB1))); in test_graph_reachable_from_any__returns_correct_result() 58 cl_git_pass(git_oid_cpy(&descendants[3], git_object_id(branchB2))); in test_graph_reachable_from_any__returns_correct_result() 59 cl_git_pass(git_oid_cpy(&descendants[4], git_object_id(branchC1))); in test_graph_reachable_from_any__returns_correct_result() 60 cl_git_pass(git_oid_cpy(&descendants[5], git_object_id(branchC2))); in test_graph_reachable_from_any__returns_correct_result() 178 git_oid descendants[10]; in test_graph_reachable_from_any__exhaustive() local 193 git_oid_cpy(&descendants[descendant_i], in test_graph_reachable_from_any__exhaustive() 200 descendants, in test_graph_reachable_from_any__exhaustive() [all …]
|
/dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/app/models/concerns/ |
H A D | group_descendant.rb | 20 def self.build_hierarchy(descendants, hierarchy_top = nil) argument 21 descendants = Array.wrap(descendants).uniq 22 return [] if descendants.empty? 24 unless descendants.all? { |hierarchy| hierarchy.is_a?(GroupDescendant) } 28 all_hierarchies = descendants.map do |descendant| 29 descendant.hierarchy(hierarchy_top, descendants)
|