| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/meta/meta.unary/meta.unary.prop/ |
| is_trivially_copy_constructible.pass.cpp | 40 union Union {};
66 test_is_trivially_copy_constructible<Union>();
|
| is_trivially_default_constructible.pass.cpp | 43 union Union {};
68 test_is_trivially_default_constructible<Union>();
|
| is_trivially_destructible.pass.cpp | 43 union Union {};
68 test_is_trivially_destructible<Union>();
|
| is_trivially_move_assignable.pass.cpp | 37 union Union {};
57 test_has_trivial_assign<Union>();
|
| is_trivially_move_constructible.pass.cpp | 38 union Union {};
77 test_is_trivially_move_constructible<Union>();
|
| /external/chromium_org/sync/internal_api/public/base/ |
| enum_set.h | 22 EnumSet<E, Min, Max> Union(EnumSet<E, Min, Max> set1,
155 // self-mutating versions of Union, Intersection, and Difference
225 friend EnumSet Union<E, MinEnumValue, MaxEnumValue>(
266 EnumSet<E, Min, Max> Union(EnumSet<E, Min, Max> set1,
|
| /external/chromium_org/ui/gfx/ |
| box_f.cc | 46 void BoxF::Union(const BoxF& box) {
66 result.Union(b);
|
| rect_base_impl.h | 190 Union(const Class& rect) {
344 c.Union(rect);
|
| /external/openfst/src/include/fst/ |
| union-find.h | 17 // \file Union-Find algorithm for dense sets of non-negative
31 // Union-Find algorithm for dense sets of non-negative integers
60 // Creates the (destructive) union of the sets x and y belong to.
61 void Union(T x, T y) {
|
| union.h | 0 // union.h
19 // Functions and classes to compute the union of two FSTs.
34 // Computes the union (sum) of two FSTs. This version writes the
35 // union to an output MurableFst. If A transduces string x to y with
37 // union transduces x to y with weight a and w to v with weight b.
44 void Union(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) {
53 LOG(ERROR) << "Union: input/output symbol tables of 1st argument "
109 // Computes the union of two FSTs; this version modifies its
112 void Union(RationalFst<Arc> *fst1, const Fst<Arc> &fst2) {
120 // Computes the union (sum) of two FSTs. This version is a delaye
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| union-find.h | 0 // union-find.h
16 // \file Union-Find algorithm for dense sets of non-negative
28 // Union-Find algorithm for dense sets of non-negative integers
58 // Creates the (destructive) union of the sets x and y belong to.
59 void Union(T x, T y) {
|
| union.h | 0 // union.h
17 // Functions and classes to compute the union of two FSTs.
27 // Computes the union (sum) of two FSTs. This version writes the
28 // union to an output MurableFst. If A transduces string x to y with
30 // union transduces x to y with weight a and w to v with weight b.
37 void Union(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) {
84 // Computes the union of two FSTs; this version modifies its
87 void Union(RationalFst<Arc> *fst1, const Fst<Arc> &fst2) {
95 // Computes the union (sum) of two FSTs. This version is a delayed
97 // string w to v with weight b, then their union transduces x to
[all...] |
| /art/compiler/dex/ |
| arena_bit_vector.cc | 106 * Union with another bit vector. Sizes and expandability must be the same.
108 void ArenaBitVector::Union(const ArenaBitVector* src) {
|
| /external/chromium_org/chrome/common/extensions/permissions/ |
| settings_override_permission.cc | 90 APIPermission* SettingsOverrideAPIPermission::Union(
|
| /external/chromium_org/ppapi/cpp/ |
| rect.cc | 64 Rect Rect::Union(const Rect& rect) const {
|
| /external/chromium_org/cc/base/ |
| region.cc | 82 void Region::Union(gfx::Rect rect) {
86 void Region::Union(const Region& region) {
|
| /external/chromium_org/chrome/common/extensions/api/sockets/ |
| sockets_manifest_permission.cc | 243 ManifestPermission* SocketsManifestPermission::Union(
|
| /external/chromium_org/third_party/WebKit/Source/core/xml/ |
| XPathPredicate.h | 100 class Union : public Expression {
|
| /external/chromium_org/v8/src/ |
| hydrogen-flow-engine.h | 53 inline void Union(NoEffects* other, Zone* zone) {
183 effects->Union(nested, zone_);
|
| types.cc | 284 // (iff T is not a union)
360 // Get non-bitsets from this which are not subsumed by union, store at unioned,
379 // Union is O(1) on simple bit unions, but O(n*m) on structured unions.
381 Type* Type::Union(Handle<Type> type1, Handle<Type> type2) {
426 // There was an overlap. Copy to smaller union.
505 // There were dropped cases. Copy to smaller union.
515 : Union(type, Undefined()->handle_via_isolate_of(*type));
|
| /external/clang/test/SemaCXX/ |
| constexpr-printing.cpp | 55 union Union {
56 constexpr Union(int n) : b(n) {}
57 constexpr Union(const Union &u) : b(u.b) {}
60 constexpr Union myUnion = 76;
62 constexpr int badness(Union u) { return u.a + u.b; } // expected-note {{read of member 'a' of union with active member 'b'}}
|
| /external/v8/src/ |
| data-flow.h | 138 void Union(const BitVector& other) {
|
| /external/chromium_org/extensions/common/permissions/ |
| base_set_operators.h | 199 static void Union(const T& set1, const T& set2, T* set3) {
230 set3->insert(it1->Union(*it2));
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/pyxelator/ |
| cparse.py | 157 "Struct or Union"
194 class Union(Compound):
420 elif lexer.tok=='union':
467 node = Union()
473 if not isinstance( _node, Union ):
523 if isinstance( node, Union ):
552 elif lexer.tok=='union':
644 #else: struct, union or enum
723 self.parse_error(lexer,"typedef in struct or union")
|
| genpyx.py | 200 " the tag of a Struct, Union or Enum "
204 "Struct, Union or Enum "
208 "Struct or Union"
221 elif isinstance(self,Union):
222 descr = 'union'
255 class Union(Compound):
449 class StructDeclarator(Declarator): # also used in Union
|
