- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 200 for Intersections (0.12 sec)
-
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) -
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) -
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) -
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) -
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) -
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) -
bin/diff_yaml.py
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Mar 03 16:14:57 UTC 2021 - 4.5K bytes - Viewed (0) -
src/cmd/compile/internal/types2/typeterm.go
} // x.typ == y.typ // ~t ∪ ~t == ~t // ~t ∪ T == ~t // T ∪ ~t == ~t // T ∪ T == T if x.tilde || !y.tilde { return x, nil } return y, nil } // intersect returns the intersection x ∩ y. func (x *term) intersect(y *term) *term { // easy cases switch { case x == nil || y == nil: return nil // ∅ ∩ y == ∅ and ∩ ∅ == ∅ case x.typ == nil: return y // 𝓤 ∩ y == y case y.typ == nil:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 3.5K bytes - Viewed (0) -
src/go/types/typeterm.go
} // x.typ == y.typ // ~t ∪ ~t == ~t // ~t ∪ T == ~t // T ∪ ~t == ~t // T ∪ T == T if x.tilde || !y.tilde { return x, nil } return y, nil } // intersect returns the intersection x ∩ y. func (x *term) intersect(y *term) *term { // easy cases switch { case x == nil || y == nil: return nil // ∅ ∩ y == ∅ and ∩ ∅ == ∅ case x.typ == nil: return y // 𝓤 ∩ y == y case y.typ == nil:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 3.6K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/internal/typeparams/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: Thu Sep 21 21:08:44 UTC 2023 - 3.8K bytes - Viewed (0)