Search Options

Results per page
Sort
Preferred Languages
Advance

Results 101 - 110 of 239 for intervention (1.87 sec)

  1. src/cmd/compile/internal/types2/typeset.go

    // API
    
    // A _TypeSet represents the type set of an interface.
    // Because of existing language restrictions, methods can be "factored out"
    // from the terms. The actual type set is the intersection of the type set
    // implied by the methods and the type set described by the terms and the
    // comparable bit. To test whether a type is included in a type set
    // ("implements" relation), the type must implement all methods _and_ be
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 19:19:55 UTC 2024
    - 13.6K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/collect/MapDifference.java

       * present in the left map.
       */
      Map<K, V> entriesOnlyOnRight();
    
      /**
       * Returns an unmodifiable map containing the entries that appear in both maps; that is, the
       * intersection of the two maps.
       */
      Map<K, V> entriesInCommon();
    
      /**
       * Returns an unmodifiable map describing keys that appear in both maps, but with different
       * values.
       */
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Wed Aug 04 13:28:27 UTC 2021
    - 3.5K bytes
    - Viewed (0)
  3. platforms/ide/ide/src/main/java/org/gradle/plugins/ide/eclipse/model/internal/SourceFoldersCreator.java

            List<Set<String>> excludesByType = getFiltersForTreeGroupedByType(sourceSet, directoryTree, "excludes");
            return CollectionUtils.intersection(excludesByType);
        }
    
        private List<String> getIncludesForTree(SourceSet sourceSet, DirectoryTree directoryTree) {
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Thu Apr 04 13:57:30 UTC 2024
    - 14.8K bytes
    - Viewed (0)
  4. src/image/ycbcr.go

    func (p *YCbCr) SubImage(r Rectangle) Image {
    	r = r.Intersect(p.Rect)
    	// If r1 and r2 are Rectangles, r1.Intersect(r2) is not guaranteed to be inside
    	// either r1 or r2 if the intersection is empty. Without explicitly checking for
    	// this, the Pix[i:] expression below can panic.
    	if r.Empty() {
    		return &YCbCr{
    			SubsampleRatio: p.SubsampleRatio,
    		}
    	}
    	yi := p.YOffset(r.Min.X, r.Min.Y)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 12:02:45 UTC 2023
    - 8.7K bytes
    - Viewed (0)
  5. src/go/types/typeset.go

    // API
    
    // A _TypeSet represents the type set of an interface.
    // Because of existing language restrictions, methods can be "factored out"
    // from the terms. The actual type set is the intersection of the type set
    // implied by the methods and the type set described by the terms and the
    // comparable bit. To test whether a type is included in a type set
    // ("implements" relation), the type must implement all methods _and_ be
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 19:19:55 UTC 2024
    - 13.7K bytes
    - Viewed (0)
  6. subprojects/core/src/main/java/org/gradle/internal/classpath/CallInterceptionClosureInstrumentingClassVisitor.java

     *          that this closure is now in the scope of an instrumented call, so changing its delegate must be reflected in updating the new delegate's
     *          metaclass for call interception.
     *     <li> Overrides {@link Closure#setDelegate}, adding a call to {@link InstrumentedGroovyMetaClassHelper#addInvocationHooksInClosureDispatchObject} with
     *          the new delegate. This ensures the invariant above.
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Wed Mar 20 01:16:36 UTC 2024
    - 16.9K bytes
    - Viewed (0)
  7. analysis/analysis-api/src/org/jetbrains/kotlin/analysis/api/symbols/KtSymbol.kt

        SAM_CONSTRUCTOR,
    
        /**
         * Consider the following code:
         * ```
         * interface A { fun x() }
         * interface B { fun x() }
         *
         * interface C : A, B
         * ```
         * The intersection of functions A.foo & B.foo will create a function C.foo which will be marked with [INTERSECTION_OVERRIDE]
         */
        INTERSECTION_OVERRIDE,
    
        /**
         * Consider the following code:
         * ```
    Registered: Wed Jun 12 09:53:16 UTC 2024
    - Last Modified: Tue Jun 11 09:36:27 UTC 2024
    - 5K bytes
    - Viewed (0)
  8. okhttp/src/main/kotlin/okhttp3/internal/-UtilCommon.kt

        }
      }
      return result.toTypedArray()
    }
    
    /**
     * Returns true if there is an element in this array that is also in [other]. This method terminates
     * if any intersection is found. The sizes of both arguments are assumed to be so small, and the
     * likelihood of an intersection so great, that it is not worth the CPU cost of sorting or the
     * memory cost of hashing.
     */
    internal fun Array<String>.hasIntersection(
      other: Array<String>?,
    Registered: Sun Jun 16 04:42:17 UTC 2024
    - Last Modified: Mon May 13 13:42:37 UTC 2024
    - 11K bytes
    - Viewed (0)
  9. src/cmd/compile/internal/types2/termlist.go

    		}
    		rl = append(rl, xi)
    	}
    	return rl
    }
    
    // union returns the union xl ∪ yl.
    func (xl termlist) union(yl termlist) termlist {
    	return append(xl, yl...).norm()
    }
    
    // intersect returns the intersection xl ∩ yl.
    func (xl termlist) intersect(yl termlist) termlist {
    	if xl.isEmpty() || yl.isEmpty() {
    		return nil
    	}
    
    	// Quadratic algorithm, but good enough for now.
    	// TODO(gri) fix asymptotic performance
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Sat Sep 03 18:29:30 UTC 2022
    - 3.8K bytes
    - Viewed (0)
  10. bin/diff_yaml.py

                                   res['metadata']['name'])
    
    
    def keydiff(k0, k1):
        k0s = set(k0)
        k1s = set(k1)
        added = k1s - k0s
        removed = k0s - k1s
        common = k0s.intersection(k1s)
    
        return added, removed, common
    
    
    def drop_keys(res, k1, k2):
        if k2 in res[k1]:
            del res[k1][k2]
    
    
    def normalize_configmap(res):
        try:
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Wed Mar 03 16:14:57 UTC 2021
    - 4.5K bytes
    - Viewed (0)
Back to top