- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 239 for intervention (0.16 sec)
-
pkg/kubeapiserver/admission/exclusion/resources.go
// should ignore. // The version is omitted, all versions of the same GroupResource are treated the same. var excluded = []schema.GroupResource{ // BEGIN interception of these non-persisted resources may break the cluster {Group: "authentication.k8s.io", Resource: "selfsubjectreviews"}, {Group: "authentication.k8s.io", Resource: "tokenreviews"},
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Feb 28 23:31:18 UTC 2024 - 2.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Range.java
* * <p>For example, the intersection of {@code [1..5]} and {@code (3..7)} is {@code (3..5]}. The * resulting range may be empty; for example, {@code [1..5)} intersected with {@code [5..7)} * yields the empty range {@code [5..5)}. * * <p>The intersection exists if and only if the two ranges are {@linkplain #isConnected * connected}. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 27.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ContiguousSetTest.java
ContiguousSet<Integer> emptySet = ContiguousSet.closedOpen(2, 2); assertEquals(ImmutableSet.of(), set.intersection(emptySet)); assertEquals(ImmutableSet.of(), emptySet.intersection(set)); assertEquals( ImmutableSet.of(), ContiguousSet.create(Range.closed(-5, -1), integers()) .intersection(ContiguousSet.create(Range.open(3, 64), integers()))); } public void testIntersection() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 19 20:34:55 UTC 2024 - 19.1K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/util/sets/set.go
result := s1.Clone() for key := range s2 { result.Insert(key) } return result } // Intersection returns a new set which includes the item in BOTH s1 and s2 // For example: // s1 = {a1, a2} // s2 = {a2, a3} // s1.Intersection(s2) = {a2} func (s1 Set[T]) Intersection(s2 Set[T]) Set[T] { var walk, other Set[T] result := New[T]() if s1.Len() < s2.Len() { walk = s1 other = s2
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Apr 29 19:51:18 UTC 2024 - 5.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/ContiguousSet.java
checkNotNull(domain); Range<C> effectiveRange = range; try { if (!range.hasLowerBound()) { effectiveRange = effectiveRange.intersection(Range.atLeast(domain.minValue())); } if (!range.hasUpperBound()) { effectiveRange = effectiveRange.intersection(Range.atMost(domain.maxValue())); } } catch (NoSuchElementException e) { throw new IllegalArgumentException(e); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Nov 30 21:54:06 UTC 2023 - 9.9K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/features/FeatureUtil.java
newRequirement, earlierRequirement), intersection(newFeatures, earlierFeatures), source); } } /** Construct a new {@link java.util.Set} that is the intersection of the given sets. */ public static <T> Set<T> intersection(Set<? extends T> set1, Set<? extends T> set2) { Set<T> result = Helpers.<T>copyToSet(set1);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 21 15:08:35 UTC 2022 - 12.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/Range.java
* * <p>For example, the intersection of {@code [1..5]} and {@code (3..7)} is {@code (3..5]}. The * resulting range may be empty; for example, {@code [1..5)} intersected with {@code [5..7)} * yields the empty range {@code [5..5)}. * * <p>The intersection exists if and only if the two ranges are {@linkplain #isConnected * connected}. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 27.8K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/excludes/factories/Intersections.java
for (int i = 0; i < intersections.length; i++) { ExcludeSpec intersection = intersections[i]; if (intersection instanceof ExcludeNothing) { continue; } if (intersection != null) { simplified.add(intersection); } else {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Feb 23 21:03:05 UTC 2024 - 21.6K bytes - Viewed (0) -
pkg/util/sets/set.go
for k := range other { if _, f := s[k]; !f { right = append(right, k) } } return } // Intersection returns a set of objects that are common between s and s2 // For example: // s = {a1, a2, a3} // s2 = {a1, a2, a4, a5} // s.Intersection(s2) = {a1, a2} func (s Set[T]) Intersection(s2 Set[T]) Set[T] { result := New[T]() for key := range s { if s2.Contains(key) { result.Insert(key) }
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Sat Mar 30 05:26:03 UTC 2024 - 6.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeRangeMap.java
if (range.isConnected(subRange)) { TreeRangeMap.this.remove(range.intersection(subRange)); } } @Override public RangeMap<K, V> subRangeMap(Range<K> range) { if (!range.isConnected(subRange)) { return emptySubRangeMap(); } else { return TreeRangeMap.this.subRangeMap(range.intersection(subRange)); } } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 21.9K bytes - Viewed (0)