/external/clang/test/CodeGen/ |
2009-03-08-ZeroEltStructCrash.c | 4 struct Union { 5 union { 9 static inline void Foo(struct Union *u) { 12 static void Bar(struct Union *u) {
|
/external/openfst/src/script/ |
union.cc | 19 #include <fst/script/union.h> 24 void Union(MutableFstClass *fst1, const FstClass &fst2) { 25 if (!ArcTypesMatch(*fst1, fst2, "Union")) return; 29 Apply<Operation<UnionArgs> >("Union", fst1->ArcType(), &args); 32 REGISTER_FST_OPERATION(Union, StdArc, UnionArgs); 33 REGISTER_FST_OPERATION(Union, LogArc, UnionArgs); 34 REGISTER_FST_OPERATION(Union, Log64Arc, UnionArgs);
|
/external/openfst/src/include/fst/script/ |
union.h | 22 #include <fst/union.h> 30 void Union(UnionArgs *args) { 34 Union(fst1, fst2); 37 void Union(MutableFstClass *fst1, const FstClass &fst2);
|
/external/openfst/src/bin/ |
fstunion.cc | 20 // Creates the union of two FSTs. 25 #include <fst/script/union.h> 32 using fst::script::Union; 34 string usage = "Creates the union of two FSTs.\n\n Usage: "; 63 Union(fst1, *fst2);
|
/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'}}
|
type-traits.cpp | 16 union EmptyUnion {}; 17 union Union { int i; float f; }; 24 union { 63 union NonPODUnion { int i; Derives n; }; 125 { int arr[T(__is_pod(Union))]; } 212 { int arr[F(__is_class(Union))]; } 217 typedef Union UnionAr[10]; 218 typedef Union UnionType; 222 { int arr[T(__is_union(Union))]; } [all...] |
/external/v8/test/cctest/ |
test-dataflow.cc | 79 v.Union(w); 94 v.Union(w); 104 v.Union(w);
|
/external/icu4c/i18n/ |
uspoof_impl.h | 74 // Add (union) to the UnicodeSet all of the characters for the scripts used for 200 void Union(const ScriptSet &other); 201 void Union(UScriptCode script);
|
uspoof_wsconf.cpp | 245 bsset->sset->Union(targScript); 246 bsset->sset->Union(srcScript);
|
/external/openfst/src/include/fst/ |
state-reachable.h | 108 (*isets_)[s].Union((*isets_)[arc.nextstate]); 119 (*isets_)[p].Union((*isets_)[s]); // Propagate intervals to parent
|
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...] |
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) {
|
connect.h | 28 #include <fst/union-find.h> 70 comps_->Union(s, arc.nextstate); 75 comps_->Union(s, arc.nextstate); 80 comps_->Union(s, arc.nextstate);
|
rational.h | 44 template <class A> void Union(RationalFst<A> *fst1, const Fst<A> &fst2); 192 // Implementation of Union(Fst &, RationalFst *) 205 Union(&rfst_, afst); 261 // Parent class for the delayed rational operations - delayed union, 271 friend void Union<>(RationalFst<A> *fst1, const Fst<A> &fst2);
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
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...] |
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) {
|
rational.h | 37 template <class A> void Union(RationalFst<A> *fst1, const Fst<A> &fst2); 135 // Implementation of Union(Fst &, RationalFst *) 145 Union(&rfst_, afst); 183 // Parent class for the delayed rational operations - delayed union, 192 friend void Union<>(RationalFst<A> *fst1, const Fst<A> &fst2);
|
/external/webkit/Source/WebCore/xml/ |
XPathPredicate.h | 102 class Union : public Expression {
|
/external/clang/include/clang/Analysis/Support/ |
BlkExprDeclBitVector.h | 162 struct Union { void operator()(ValTy& Dst, ValTy& Src) { Dst |= Src; } }; 301 struct Union { void operator()(ValTy& Dst, ValTy& Src) { Dst |= Src; } };
|
/external/clang/include/clang/AST/ |
APValue.h | 1 //===--- APValue.h - Union class for APFloat/APSInt/Complex -----*- C++ -*-===// 35 /// APValue - This class implements a discriminated union of [uninitialized] 52 Union, 58 union LValuePathEntry { 116 union { 184 bool isUnion() const { return Kind == Union; } 433 Kind = Union;
|
/external/openfst/src/test/ |
algo_test.h | 89 VLOG(1) << "Check destructive and delayed union are equivalent."; 91 Union(&U1, T2); 125 VLOG(1) << "Check union is associative (destructive)."; 127 Union(&U1, T2); 128 Union(&U1, T3); 131 Union(&U3, T3); 133 Union(&U4, U3); 139 VLOG(1) << "Check union is associative (delayed)."; 151 VLOG(1) << "Check union is associative (destructive delayed)."; 153 Union(&U1, T3) [all...] |
/external/clang/lib/AST/ |
APValue.cpp | 1 //===--- APValue.cpp - Union class for APFloat/APSInt/Complex -------------===// 42 union { 80 union { 173 case Union: 206 else if (Kind == Union) 295 case Union: 296 OS << "Union: "; 478 case APValue::Union:
|
/external/v8/src/ |
data-flow.h | 138 void Union(const BitVector& other) {
|
/hardware/ti/wlan/wl1271/Test/ |
smeDebug.c | 216 Freq2Chan(pBssid->Configuration.Union.channel),
|
/external/chromium/chrome/browser/chromeos/notifications/ |
notification_panel.cc | 176 rect = rect.Union(view->bounds()); 281 return sticky.Union(new_non_sticky).size(); 428 bounds = bounds.Union(min_bounds_); 756 return gfx::Rect(0, 0, new_width, new_height).Union(min_bounds_); 767 return gfx::Rect(0, 0, new_width, new_height).Union(min_bounds_);
|