Searched defs:tuple (Results 1 - 25 of 54) sorted by relevance

123

/external/clang/test/Index/
H A Dusrs-cxx0x.cpp2 struct tuple { }; struct
4 void f(tuple<int, float, double>);
13 // CHECK: usrs-cxx0x.cpp c:@ST>1#pT@tuple Extent=[1:1 - 2:17]
14 // CHECK: usrs-cxx0x.cpp c:@F@f#$@S@tuple>#p3Ifd# Extent=[4:1 - 4:34]
/external/clang/test/Parser/
H A DPR11000.cpp4 class tuple<> class
7 tuple(allocator_arg_t, const _Alloc&) {} function in class:tuple
/external/clang/test/CXX/temp/temp.decls/temp.variadic/
H A Dparameter-matching.cpp31 template<typename ...> struct tuple { }; struct in namespace:rdar8859985
37 X(tuple<Args1...>, int_tuple<Indices1...>);
42 X<T>::X(tuple<Args1...>, int_tuple<Indices1...>) {}
H A Dfixed-expansion.cpp4 template<typename ...Types> struct tuple { }; struct
70 template <typename ...Args> tuple<Args...> &foo(Foo<Args...>);
73 tuple<int, float> &t1 = foo(foo_if);
74 tuple<int, double> &t2 = foo(foo_i);
H A Dexample-tuple.cpp4 // Example tuple implementation from the variadic templates proposal,
54 template<typename... Values> class tuple;
56 // Basis case: zero-length tuple
57 template<> class tuple<> { }; class
60 class tuple<Head, Tail...> : private tuple<Tail...> { class in inherits:tuple
61 typedef tuple<Tail...> inherited;
64 tuple() { } function in class:tuple
67 // Construct tuple from separate arguments.
68 tuple(typenam function in class:tuple
73 template<typename... VValues> tuple(const tuple<VValues...>& other) function in class:tuple
186 get(const tuple<Head, Values...>& t) argument
195 get(const tuple<Head, Values...>& t) argument
220 operator ==(const tuple<&, const tuple<>&) argument
223 operator ==(const tuple<T, TTail...>& t, const tuple<U, UTail...>& u) argument
232 operator <(const tuple<&, const tuple<>&) argument
235 operator <(const tuple<T, TTail...>& t, const tuple<U, UTail...>& u) argument
[all...]
H A Dmetafunctions.cpp15 template<typename...> struct tuple { }; struct
65 int check0[is_same<EverythingToInt<tuple<double, float>>::type,
66 tuple<int, int>>::value? 1 : -1];
173 typedef tuple<typename Meta<T>::type...> type;
193 tuple<int&, int*, int const>>::value? 1 : -1];
202 tuple<int&, int*, int const>>::value? 1 : -1];
232 tuple<int&, int*, int const>>::value? 1 : -1];
271 int check0[is_same<replace_with_int<pair<tuple<float, double, short>,
273 pair<tuple<int, int, int>, pair<int, int>>>::value? 1 : -1];
H A Dmulti-level-substitution.cpp4 template<typename...> struct tuple { }; struct
38 struct Inner<tuple<pair<Types, YTypes>...> > {
43 int check0[X<short, int, long>::Inner<tuple<pair<short, unsigned short>,
48 int check1[X<short, int>::Inner<tuple<pair<short, unsigned short>,
61 struct Inner<tuple<pair<Types, YTypes>...>,
67 int check2[X1<short, int, long>::Inner<tuple<pair<short, unsigned short>,
74 int check3[X1<short, int>::Inner<tuple<pair<short, unsigned short>,
119 struct Inner<tuple<pair<Types1, Types2>...>,
125 int check6[X3<short, int, long>::Inner<tuple<pair<short, unsigned short>,
133 int check7[X3<short, int>::Inner<tuple<pai
278 template<typename...> struct tuple {}; struct in namespace:PR13386
[all...]
/external/libcxx/test/std/containers/unord/unord.map/unord.map.elem/
H A Dindex_tuple.pass.cpp24 #include <tuple>
30 size_t operator()(const tuple<int,int>&) const {return 0;} argument
38 unordered_map<tuple<int,int>, size_t, my_hash> m;
/external/clang/test/CXX/temp/temp.fct.spec/temp.arg.explicit/
H A Dp9-0x.cpp48 struct tuple { }; struct
51 void accept_tuple(tuple<Types...>);
53 void test_explicit_spec_extension_targs(tuple<int, float, double> t3) {
/external/clang/test/CodeGenCXX/
H A Dmangle-variadic-templates.cpp8 template<typename ...Types> struct tuple { }; struct
49 template<typename ...Types> tuple<Types...> f4() {}
51 template tuple<int, float, double> f4();
/external/clang/test/SemaTemplate/
H A Ddefault-arguments-cxx0x.cpp30 template <typename T1, typename T2> class tuple { class in namespace:PR16689
33 constexpr tuple() {} function in class:PR16689::tuple
38 auto x = a<tuple<int, int> >();
H A Dalias-templates.cpp173 template <typename ... Args> struct tuple {}; struct in namespace:PR16646::test1
174 template <typename ... Args> using Zero = tuple<DefaultValue<Args> ...>;
184 template <typename ... Args> struct tuple {}; struct in namespace:PR16646::test2
185 template <template<int x> class... Args> using Zero = tuple<DefaultValue<Args> ...>;
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/
H A Dp1-0x.cpp82 template<typename ...Types> struct tuple { }; struct
85 void pack_not_at_end(tuple<Types...>, Types... values, int);
87 void test_pack_not_at_end(tuple<int*, double*> t2) {
/external/google-breakpad/src/testing/gtest/include/gtest/internal/
H A Dgtest-param-util-generated.h43 // by the maximum arity of the implementation of tr1::tuple which is
3160 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2> > {
3162 typedef ::std::tr1::tuple<T1, T2> ParamType;
3275 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3> > {
3277 typedef ::std::tr1::tuple<T1, T2, T3> ParamType;
3407 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4> > {
3409 typedef ::std::tr1::tuple<T1, T2, T3, T4> ParamType;
3558 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4, T5> > {
3560 typedef ::std::tr1::tuple<T1, T2, T3, T4, T5> ParamType;
3726 : public ParamGeneratorInterface< ::std::tr1::tuple<T
[all...]
H A Dgtest-tuple.h2 // pump.py gtest-tuple.h.pump
36 // Implements a subset of TR1 tuple needed by Google Test and Google Mock.
44 // tuple template as a friend (it complains that tuple is redefined). This
52 template <GTEST_10_TYPENAMES_(U)> friend class tuple; \
56 // GTEST_n_TUPLE_(T) is the type of an n-tuple.
57 #define GTEST_0_TUPLE_(T) tuple<>
58 #define GTEST_1_TUPLE_(T) tuple<T##0, void, void, void, void, void, void, \
60 #define GTEST_2_TUPLE_(T) tuple<T##0, T##1, void, void, void, void, void, \
62 #define GTEST_3_TUPLE_(T) tuple<
197 class tuple<> { class in namespace:std::tr1
199 tuple() {} function in class:std::tr1::tuple
200 tuple(const tuple& /* t */) {} function in class:std::tr1::tuple
209 tuple() : f0_() {} function
213 tuple(const tuple& t) : f0_(t.f0_) {} function
241 tuple() : f0_(), f1_() {} function
246 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_) {} function
251 tuple(const ::std::pair<U0, U1>& p) : f0_(p.first), f1_(p.second) {} function
284 tuple() : f0_(), f1_(), f2_() {} function
289 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_) {} function
321 tuple() : f0_(), f1_(), f2_(), f3_() {} function
327 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_) {} function
362 tuple() : f0_(), f1_(), f2_(), f3_(), f4_() {} function
368 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
406 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_() {} function
413 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
453 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_() {} function
460 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
502 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_() {} function
510 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
554 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_() {} function
562 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
604 class tuple { class in namespace:std::tr1
608 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_(), function in class:std::tr1::tuple
617 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function in class:std::tr1::tuple
[all...]
/external/gtest/include/gtest/internal/
H A Dgtest-param-util-generated.h43 // by the maximum arity of the implementation of tr1::tuple which is
3160 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2> > {
3162 typedef ::std::tr1::tuple<T1, T2> ParamType;
3275 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3> > {
3277 typedef ::std::tr1::tuple<T1, T2, T3> ParamType;
3407 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4> > {
3409 typedef ::std::tr1::tuple<T1, T2, T3, T4> ParamType;
3558 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4, T5> > {
3560 typedef ::std::tr1::tuple<T1, T2, T3, T4, T5> ParamType;
3726 : public ParamGeneratorInterface< ::std::tr1::tuple<T
[all...]
H A Dgtest-tuple.h2 // pump.py gtest-tuple.h.pump
36 // Implements a subset of TR1 tuple needed by Google Test and Google Mock.
44 // tuple template as a friend (it complains that tuple is redefined). This
52 template <GTEST_10_TYPENAMES_(U)> friend class tuple; \
56 // GTEST_n_TUPLE_(T) is the type of an n-tuple.
57 #define GTEST_0_TUPLE_(T) tuple<>
58 #define GTEST_1_TUPLE_(T) tuple<T##0, void, void, void, void, void, void, \
60 #define GTEST_2_TUPLE_(T) tuple<T##0, T##1, void, void, void, void, void, \
62 #define GTEST_3_TUPLE_(T) tuple<
197 class tuple<> { class in namespace:std::tr1
199 tuple() {} function in class:std::tr1::tuple
200 tuple(const tuple& /* t */) {} function in class:std::tr1::tuple
209 tuple() : f0_() {} function
213 tuple(const tuple& t) : f0_(t.f0_) {} function
241 tuple() : f0_(), f1_() {} function
246 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_) {} function
251 tuple(const ::std::pair<U0, U1>& p) : f0_(p.first), f1_(p.second) {} function
284 tuple() : f0_(), f1_(), f2_() {} function
289 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_) {} function
321 tuple() : f0_(), f1_(), f2_(), f3_() {} function
327 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_) {} function
362 tuple() : f0_(), f1_(), f2_(), f3_(), f4_() {} function
368 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
406 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_() {} function
413 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
453 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_() {} function
460 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
502 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_() {} function
510 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
554 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_() {} function
562 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
604 class tuple { class in namespace:std::tr1
608 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_(), function in class:std::tr1::tuple
617 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function in class:std::tr1::tuple
[all...]
/external/llvm/utils/unittest/googletest/include/gtest/internal/
H A Dgtest-param-util-generated.h43 // by the maximum arity of the implementation of tr1::tuple which is
2836 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2> > {
2838 typedef ::std::tr1::tuple<T1, T2> ParamType;
2951 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3> > {
2953 typedef ::std::tr1::tuple<T1, T2, T3> ParamType;
3083 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4> > {
3085 typedef ::std::tr1::tuple<T1, T2, T3, T4> ParamType;
3234 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4, T5> > {
3236 typedef ::std::tr1::tuple<T1, T2, T3, T4, T5> ParamType;
3402 : public ParamGeneratorInterface< ::std::tr1::tuple<T
[all...]
H A Dgtest-tuple.h34 // Implements a subset of TR1 tuple needed by Google Test and Google Mock.
42 // tuple template as a friend (it complains that tuple is redefined). This
50 template <GTEST_10_TYPENAMES_(U)> friend class tuple; \
54 // GTEST_n_TUPLE_(T) is the type of an n-tuple.
55 #define GTEST_0_TUPLE_(T) tuple<>
56 #define GTEST_1_TUPLE_(T) tuple<T##0, void, void, void, void, void, void, \
58 #define GTEST_2_TUPLE_(T) tuple<T##0, T##1, void, void, void, void, void, \
60 #define GTEST_3_TUPLE_(T) tuple<T##0, T##1, T##2, void, void, void, void, \
62 #define GTEST_4_TUPLE_(T) tuple<
175 class tuple<> { class in namespace:std::tr1
177 tuple() {} function in class:std::tr1::tuple
178 tuple(const tuple& /* t */) {} function in class:std::tr1::tuple
187 tuple() : f0_() {} function
191 tuple(const tuple& t) : f0_(t.f0_) {} function
219 tuple() : f0_(), f1_() {} function
224 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_) {} function
229 tuple(const ::std::pair<U0, U1>& p) : f0_(p.first), f1_(p.second) {} function
262 tuple() : f0_(), f1_(), f2_() {} function
267 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_) {} function
299 tuple() : f0_(), f1_(), f2_(), f3_() {} function
305 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_) {} function
340 tuple() : f0_(), f1_(), f2_(), f3_(), f4_() {} function
346 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
384 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_() {} function
391 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
431 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_() {} function
438 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
480 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_() {} function
488 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
532 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_() {} function
540 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
582 class tuple { class in namespace:std::tr1
586 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_(), function in class:std::tr1::tuple
595 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function in class:std::tr1::tuple
[all...]
/external/mesa3d/src/gtest/include/gtest/internal/
H A Dgtest-param-util-generated.h43 // by the maximum arity of the implementation of tr1::tuple which is
2839 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2> > {
2841 typedef ::std::tr1::tuple<T1, T2> ParamType;
2954 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3> > {
2956 typedef ::std::tr1::tuple<T1, T2, T3> ParamType;
3086 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4> > {
3088 typedef ::std::tr1::tuple<T1, T2, T3, T4> ParamType;
3237 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4, T5> > {
3239 typedef ::std::tr1::tuple<T1, T2, T3, T4, T5> ParamType;
3405 : public ParamGeneratorInterface< ::std::tr1::tuple<T
[all...]
H A Dgtest-tuple.h34 // Implements a subset of TR1 tuple needed by Google Test and Google Mock.
42 // tuple template as a friend (it complains that tuple is redefined). This
50 template <GTEST_10_TYPENAMES_(U)> friend class tuple; \
54 // GTEST_n_TUPLE_(T) is the type of an n-tuple.
55 #define GTEST_0_TUPLE_(T) tuple<>
56 #define GTEST_1_TUPLE_(T) tuple<T##0, void, void, void, void, void, void, \
58 #define GTEST_2_TUPLE_(T) tuple<T##0, T##1, void, void, void, void, void, \
60 #define GTEST_3_TUPLE_(T) tuple<T##0, T##1, T##2, void, void, void, void, \
62 #define GTEST_4_TUPLE_(T) tuple<
175 class tuple<> { class in namespace:std::tr1
177 tuple() {} function in class:std::tr1::tuple
178 tuple(const tuple& /* t */) {} function in class:std::tr1::tuple
187 tuple() : f0_() {} function
191 tuple(const tuple& t) : f0_(t.f0_) {} function
219 tuple() : f0_(), f1_() {} function
224 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_) {} function
229 tuple(const ::std::pair<U0, U1>& p) : f0_(p.first), f1_(p.second) {} function
262 tuple() : f0_(), f1_(), f2_() {} function
267 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_) {} function
299 tuple() : f0_(), f1_(), f2_(), f3_() {} function
305 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_) {} function
340 tuple() : f0_(), f1_(), f2_(), f3_(), f4_() {} function
346 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
384 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_() {} function
391 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
431 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_() {} function
438 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
480 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_() {} function
488 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
532 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_() {} function
540 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
582 class tuple { class in namespace:std::tr1
586 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_(), function in class:std::tr1::tuple
595 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function in class:std::tr1::tuple
[all...]
/external/protobuf/gtest/include/gtest/internal/
H A Dgtest-param-util-generated.h41 // by the maximum arity of the implementation of tr1::tuple which is
2837 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2> > {
2839 typedef ::std::tr1::tuple<T1, T2> ParamType;
2952 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3> > {
2954 typedef ::std::tr1::tuple<T1, T2, T3> ParamType;
3084 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4> > {
3086 typedef ::std::tr1::tuple<T1, T2, T3, T4> ParamType;
3235 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4, T5> > {
3237 typedef ::std::tr1::tuple<T1, T2, T3, T4, T5> ParamType;
3403 : public ParamGeneratorInterface< ::std::tr1::tuple<T
[all...]
H A Dgtest-tuple.h34 // Implements a subset of TR1 tuple needed by Google Test and Google Mock.
42 // tuple template as a friend (it complains that tuple is redefined). This
50 template <GTEST_10_TYPENAMES_(U)> friend class tuple; \
54 // GTEST_n_TUPLE_(T) is the type of an n-tuple.
55 #define GTEST_0_TUPLE_(T) tuple<>
56 #define GTEST_1_TUPLE_(T) tuple<T##0, void, void, void, void, void, void, \
58 #define GTEST_2_TUPLE_(T) tuple<T##0, T##1, void, void, void, void, void, \
60 #define GTEST_3_TUPLE_(T) tuple<T##0, T##1, T##2, void, void, void, void, \
62 #define GTEST_4_TUPLE_(T) tuple<
175 class tuple<> { class in namespace:std::tr1
177 tuple() {} function in class:std::tr1::tuple
178 tuple(const tuple& /* t */) {} function in class:std::tr1::tuple
187 tuple() : f0_() {} function
191 tuple(const tuple& t) : f0_(t.f0_) {} function
219 tuple() : f0_(), f1_() {} function
224 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_) {} function
229 tuple(const ::std::pair<U0, U1>& p) : f0_(p.first), f1_(p.second) {} function
262 tuple() : f0_(), f1_(), f2_() {} function
267 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_) {} function
299 tuple() : f0_(), f1_(), f2_(), f3_() {} function
305 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_) {} function
340 tuple() : f0_(), f1_(), f2_(), f3_(), f4_() {} function
346 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
384 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_() {} function
391 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
431 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_() {} function
438 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
480 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_() {} function
488 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
532 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_() {} function
540 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
582 class tuple { class in namespace:std::tr1
586 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_(), function in class:std::tr1::tuple
595 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function in class:std::tr1::tuple
[all...]
/external/libnl/lib/netfilter/
H A Dct.c386 struct nlattr *tuple, *ip, *proto; local
392 tuple = nla_nest_start(msg, repl ? CTA_TUPLE_REPLY : CTA_TUPLE_ORIG);
393 if (!tuple)
443 nla_nest_end(msg, tuple);
/external/openfst/src/include/fst/
H A Dstate-table.h48 // // Lookup state ID by tuple. If it doesn't exist, then add it.
50 // // Lookup state tuple by state ID.
56 // A state tuple has the form:
68 // An implementation using a hash map for the tuple to state ID mapping.
69 // The state tuple T must have == defined. H is the hash function.
85 StateId FindState(const StateTuple &tuple) { return FindId(tuple); } argument
90 // An implementation using a hash map for the tuple to state ID mapping.
91 // The state tuple T must have == defined. H is the hash function.
108 StateId FindState(const StateTuple &tuple) { retur argument
133 FindState(const StateTuple &tuple) argument
163 FindState(const StateTuple &tuple) argument
183 FindState(const StateTuple &tuple) argument
306 operator ()(const StateTuple &tuple) argument
325 operator ()(const StateTuple &tuple) argument
337 operator ()(const StateTuple &tuple) argument
[all...]

Completed in 618 milliseconds

123