Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for tryFindUnqualifiedTaskCheaply (0.5 sec)

  1. subprojects/core/src/test/groovy/org/gradle/execution/DefaultTaskSelectorTest.groovy

            def filter = selector.getFilter(new TaskSelector.SelectionContext(Path.path(":a:b"), "type"), project1, "b", true)
    
            then:
            1 * projectConfigurer.configure(projectModel1)
            1 * resolver.tryFindUnqualifiedTaskCheaply("b", projectModel1) >> true
            0 * _
    
            and:
            !filter.isSatisfiedBy(excluded)
            filter.isSatisfiedBy(notExcluded)
        }
    
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Mon Sep 05 22:49:56 UTC 2022
    - 4.8K bytes
    - Viewed (0)
  2. subprojects/core/src/main/java/org/gradle/execution/TaskNameResolver.java

    public class TaskNameResolver {
    
        /**
         * Non-exhaustively searches for at least one task with the given name, by not evaluating projects before searching.
         */
        public boolean tryFindUnqualifiedTaskCheaply(String name, ProjectInternal project) {
            // don't evaluate children, see if we know it's without validating it
            for (Project project1 : project.getAllprojects()) {
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Mon Dec 11 13:37:56 UTC 2023
    - 6.9K bytes
    - Viewed (0)
  3. subprojects/core/src/main/java/org/gradle/execution/DefaultTaskSelector.java

            if (includeSubprojects) {
                // Try to delay configuring all the subprojects
                configurer.configure(project.getMutableModel());
                if (taskNameResolver.tryFindUnqualifiedTaskCheaply(taskName, project.getMutableModel())) {
                    // An exact match in the target project - can just filter tasks by path to avoid configuring subprojects at this point
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Tue May 28 09:03:53 UTC 2024
    - 6.6K bytes
    - Viewed (0)
Back to top