Home
last modified time | relevance | path

Searched refs:union (Results 1 - 25 of 201) sorted by relevance

123456789

/third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/
H A Dgen_dxgi_support_tables.py245 always_for_fl = fl_9_3_supported.union(always_for_fl)
246 optional_for_fl = fl_9_3_check.union(optional_for_fl)
248 always_for_fl = fl_10_0_supported.union(always_for_fl)
249 optional_for_fl = fl_10_0_check_10_1_supported.union(optional_for_fl)
250 optional_for_fl = fl_10_0_check_11_0_supported.union(optional_for_fl)
252 always_for_fl = fl_10_0_supported.union(always_for_fl)
253 always_for_fl = fl_10_1_supported.union(always_for_fl)
254 always_for_fl = fl_10_0_check_10_1_supported.union(always_for_fl)
255 optional_for_fl = fl_10_0_check_11_0_supported.union(optional_for_fl)
257 always_for_fl = fl_10_0_supported.union(always_for_f
[all...]
/third_party/typescript/tests/baselines/reference/
H A DES3For-ofTypeCheck4.js2 var union: string | string[]; variable
3 for (const v of union) { }
6 var union; variable
7 for (var _i = 0, union_1 = union; _i < union_1.length; _i++) {
H A DES3For-ofTypeCheck6.js2 var union: string[] | number[]; variable
3 for (var v of union) { }
6 var union; variable
7 for (var _i = 0, union_1 = union; _i < union_1.length; _i++) {
H A DES5For-ofTypeCheck11.js2 var union: string | number[]; variable
4 for (v of union) { }
7 var union; variable
9 for (var _i = 0, union_1 = union; _i < union_1.length; _i++) {
H A DES5For-ofTypeCheck14.js2 var union: string | Set<number>
3 for (const e of union) { }
6 var union; variable
7 for (var _i = 0, union_1 = union; _i < union_1.length; _i++) {
H A DES5For-ofTypeCheck4.js2 var union: string | string[]; variable
3 for (const v of union) { }
6 var union; variable
7 for (var _i = 0, union_1 = union; _i < union_1.length; _i++) {
H A DES5For-ofTypeCheck5.js2 var union: string | number[]; variable
3 for (var v of union) { }
6 var union; variable
7 for (var _i = 0, union_1 = union; _i < union_1.length; _i++) {
H A DES5For-ofTypeCheck6.js2 var union: string[] | number[]; variable
3 for (var v of union) { }
6 var union; variable
7 for (var _i = 0, union_1 = union; _i < union_1.length; _i++) {
H A DES5For-ofTypeCheck7.js2 var union: string | number; variable
3 for (var v of union) { }
6 var union; variable
7 for (var _i = 0, union_1 = union; _i < union_1.length; _i++) {
H A DES5For-ofTypeCheck9.js2 var union: string | string[] | number | symbol; variable
3 for (let v of union) { }
6 var union; variable
7 for (var _i = 0, union_1 = union; _i < union_1.length; _i++) {
H A DrestUnion.js2 var union: { a: number, c: boolean } | { a: string, b: string };
5 var {a, ...rest1 } = union;
30 var union; variable
32 var a = union.a, rest1 = __rest(union, ["a"]);
H A DES5For-ofTypeCheck8.js2 var union: string | string[]| number[]| symbol[]; variable
4 for (v of union) { }
7 var union; variable
9 for (var _i = 0, union_1 = union; _i < union_1.length; _i++) {
H A DtypeGuardFunction.js35 var union: A | B; variable
36 if(isA(union)) {
37 union.propA;
130 var union; variable
131 if (isA(union)) {
132 union.propA;
H A DnoUncheckedIndexAccess.js12 const union: Meat.Bacon | Meat.Sausage = Meat.Bacon
13 const valueUnion = Meat[union]
40 var union = Meat.Bacon; variable
41 var valueUnion = Meat[union];
H A DemptyAnonymousObjectNarrowing(strictnullchecks=false).js36 declare let union: "xyz" | { a: string } | undefined;
37 if (nonNull === union) {
106 if (nonNull === union) {
H A DemptyAnonymousObjectNarrowing(strictnullchecks=true).js36 declare let union: "xyz" | { a: string } | undefined;
37 if (nonNull === union) {
106 if (nonNull === union) {
H A DnewOperator.js37 // Error on union
38 declare const union: { a: string } | { b: string }
39 new union;
41 // Error on union with one constructor
45 // Error on union with incompatible constructors
83 new union;
/third_party/mesa3d/src/amd/registers/
H A Dregdb.py37 Simplistic implementation of a union-find data structure that also keeps
41 - union: unify the sets containing the two given elements
55 def union(self, k1, k2): member in UnionFind
255 other.chips = sorted(list(chips.union(other_chips)))
332 def __merge_enums(enums, union=False):
339 if not union:
356 def merge_enums(self, names, newname, union=False):
366 union=union
391 def __merge_register_types(regtypes, union
[all...]
/third_party/rust/crates/bitflags/src/
H A Dlib.rs35 //! assert_eq!((e1 | e2), Flags::ABC); // union
142 //! too: `Extend` adds the union of the instances of the `struct` iterated over,
143 //! while `FromIterator` calculates the union.
152 //! - `BitOr` and `BitOrAssign`: union
184 //! - `union`: returns a new set of flags, containing any flags present in
305 /// assert_eq!((e1 | e2), Flags::ABC); // union
651 /// Returns the union of between the flags in `self` and `other`.
664 pub const fn union(self, other: Self) -> Self {
729 /// Returns the union of the two sets of flags.
1156 assert_eq!((e1 | e2), Flags::ABC); // union in test_operators()
[all...]
/third_party/rust/crates/regex/regex-syntax/src/hir/
H A Dinterval.rs95 pub fn union(&mut self, other: &IntervalSet<I>) { in union() functions
242 self.union(other); in symmetric_difference()
298 if let Some(union) = last.union(&rest[oldi]) { in canonicalize()
299 *last = union; in canonicalize()
365 fn union(&self, other: &Self) -> Option<Self> { in next() functions
422 /// returns the union of the two ranges minus its intersection. in next()
427 let union = match self.union(other) { in next()
429 Some(union) in next()
[all...]
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/
H A DRangeTreeTest.java133 assertThat(a.union(a)).isEqualTo(a); in testUnion()
134 assertThat(a.union(RangeTree.empty())).isEqualTo(a); in testUnion()
135 assertThat(RangeTree.empty().union(a)).isEqualTo(a); in testUnion()
138 assertThat(a.union(b)).containsExactly("999", "12xx", "4xxxx"); in testUnion()
139 assertThat(b.union(a)).containsExactly("999", "12xx", "4xxxx"); in testUnion()
201 // Even the union of (A\B) and (B\A) is disjoint to the intersection. in testVennDiagram()
202 assertThat(subAB.union(subBA).intersect(intAB)).isSameInstanceAs(RangeTree.empty()); in testVennDiagram()
205 assertThat(subAB.union(intAB)).isEqualTo(a); in testVennDiagram()
206 assertThat(subBA.union(intAB)).isEqualTo(b); in testVennDiagram()
207 assertThat(subAB.union(subB in testVennDiagram()
[all...]
H A DPrefixTreeTest.java117 assertThat(prefixes("1234").union(prefixes("12"))).containsExactly("12"); in testUnion()
118 // Indentical prefixes treated like normal union. in testUnion()
119 assertThat(prefixes("12").union(prefixes("12"))).containsExactly("12"); in testUnion()
120 // Non-overlapping prefixes treated like normal union. in testUnion()
121 assertThat(prefixes("123").union(prefixes("124"))).containsExactly("12[34]"); in testUnion()
123 assertThat(prefixes("1234", "45", "800").union(prefixes("12", "4x67"))) in testUnion()
135 // Unlike the union case, with intersection, only the longest prefix remains. in testIntersection()
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/
H A DPrefixTree.java181 * Returns the union of two prefix trees. For prefix trees {@code p1}, {@code p2} and any range
182 * tree {@code R}, the union {@code P = p1.union(p2)} is defined such that:
184 * P.retainFrom(R) = p1.retainFrom(R).union(p2.retainFrom(R))
186 * If prefixes are the same length this is equivalent to {@link RangeTree#union(RangeTree)},
189 public PrefixTree union(PrefixTree other) { in union() method in PrefixTree
190 return SetOperations.INSTANCE.union(this, other); in union()
309 minimal = minimal.union(RangeTree.from(path.extendByMask(mask))); in recursivelyMinimize()
342 minimal = minimal.union(RangeTree.from(path)); in emit()
345 minimal = minimal.union( in emit()
[all...]
/third_party/rust/crates/bindgen/bindgen-tests/tests/expectations/tests/
H A Dunion_template.rs15 pub union NastyStruct__bindgen_ty_1 {
29 pub union NastyStruct__bindgen_ty_2 {
52 pub union Whatever {
/third_party/skia/third_party/externals/angle2/infra/specs/
H A Dgenerate_test_spec_json.py116 seen_mixins = seen_mixins.union(waterfall.get('mixins', set()))
118 seen_mixins = seen_mixins.union(tester.get('mixins', set()))
126 seen_mixins = seen_mixins.union(test.get('mixins', set()))

Completed in 12 milliseconds

123456789