HomeSort by relevance Sort by last modified time
    Searched refs:Tuple (Results 101 - 125 of 215) sorted by null

1 2 3 45 6 7 8 9

  /external/libbrillo/brillo/dbus/
data_serialization.h 36 // | (UVW...) | std::tuple<U,V,W,...>
56 #include <tuple>
613 // std::tuple = D-Bus STRUCT with arbitrary number of members. ----------------
617 // of a tuple<T...> from index I to N. TupleIterator<>::Read and ::Write methods
618 // are called for each element of the tuple and iteration continues until I == N
622 // Tuple is just a convenience alias to a tuple containing elements of type T.
623 using Tuple = std::tuple<T...>;
625 using ValueType = typename std::tuple_element<I, Tuple>::type
    [all...]
  /external/eigen/unsupported/Eigen/CXX11/src/Tensor/
TensorBase.h 612 internal::ArgMaxTupleReducer<Tuple<Index, CoeffReturnType> >,
618 internal::ArgMaxTupleReducer<Tuple<Index, CoeffReturnType> >,
620 const Derived>(derived(), internal::ArgMaxTupleReducer<Tuple<Index, CoeffReturnType> >(), -1, in_dims);
625 internal::ArgMinTupleReducer<Tuple<Index, CoeffReturnType> >,
631 internal::ArgMinTupleReducer<Tuple<Index, CoeffReturnType> >,
633 const Derived>(derived(), internal::ArgMinTupleReducer<Tuple<Index, CoeffReturnType> >(), -1, in_dims);
638 internal::ArgMaxTupleReducer<Tuple<Index, CoeffReturnType> >,
644 internal::ArgMaxTupleReducer<Tuple<Index, CoeffReturnType> >,
646 const Derived>(derived(), internal::ArgMaxTupleReducer<Tuple<Index, CoeffReturnType> >(), return_dim, in_dims);
651 internal::ArgMinTupleReducer<Tuple<Index, CoeffReturnType> >
    [all...]
TensorArgMax.h 20 * \brief Tensor + Index Tuple class.
30 typedef Tuple<Index, typename XprTraits::Scalar> Scalar;
61 typedef Tuple<Index, typename XprType::CoeffReturnType> CoeffReturnType;
131 * \brief Converts to Tensor<Tuple<Index, Scalar> > and reduces to Tensor<Index>.
  /external/fmtlib/test/gmock/
gmock.h 242 // tr1/tuple. gmock-port.h does this via gtest-port.h, which is
243 // guaranteed to pull in the tuple header.
292 // MatcherTuple<T>::type is a tuple type where each field is a Matcher
293 // for the corresponding field in tuple type T.
294 template <typename Tuple>
298 struct MatcherTuple< ::std::tr1::tuple<> > {
299 typedef ::std::tr1::tuple< > type;
303 struct MatcherTuple< ::std::tr1::tuple<A1> > {
304 typedef ::std::tr1::tuple<Matcher<A1> > type;
308 struct MatcherTuple< ::std::tr1::tuple<A1, A2> >
    [all...]
  /external/clang/test/CXX/temp/temp.param/
p15-cxx0x.cpp 169 template <class... Types> class Tuple;
  /external/swiftshader/third_party/subzero/src/
IceOperand.h 395 const RelocatableTuple &Tuple) {
397 ConstantRelocatable(Ty, Tuple.Offset, Tuple.OffsetExpr, Tuple.Name,
398 Tuple.EmitString);
    [all...]
  /external/ply/ply/example/GardenSnake/
GardenSnake.py 10 # - assignment and tuple assignment work
369 elif isinstance(left, ast.Tuple):
412 p[0] = ast.Function(None, p[2], tuple(p[3]), (), 0, None, p[5])
639 # May need to promote singleton to tuple
644 # Convert into a tuple?
646 p[0] = ast.Tuple(p[0])
659 # singleton -> tuple
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Python/
ast.c 408 if (asdl_seq_LEN(e->v.Tuple.elts)) {
409 e->v.Tuple.ctx = ctx;
410 s = e->v.Tuple.elts;
473 /* If the LHS is a list or tuple, we need to set the assignment
653 result = Tuple(args, Store, LINENO(n), n->n_col_offset, c->c_arena);
722 def f((x, (y))): pass will just incur the tuple unpacking warning. */
737 "tuple parameter unpacking has been removed in 3.x"))
745 /* Loop because there can be many parens and tuple
    [all...]
  /external/python/cpython2/Python/
ast.c 408 if (asdl_seq_LEN(e->v.Tuple.elts)) {
409 e->v.Tuple.ctx = ctx;
410 s = e->v.Tuple.elts;
473 /* If the LHS is a list or tuple, we need to set the assignment
653 result = Tuple(args, Store, LINENO(n), n->n_col_offset, c->c_arena);
722 def f((x, (y))): pass will just incur the tuple unpacking warning. */
737 "tuple parameter unpacking has been removed in 3.x"))
745 /* Loop because there can be many parens and tuple
1108 [x for x, in ... ] has 1 element in t, but still requires a Tuple.
1114 lc = comprehension(Tuple(t, Store, first->lineno, first->col_offset
    [all...]
  /prebuilts/go/darwin-x86/src/go/types/
typestring.go 138 case *Tuple:
237 func writeTuple(buf *bytes.Buffer, tup *Tuple, variadic bool, qf Qualifier, visited []Type) {
predicates.go 186 case *Tuple:
189 if y, ok := y.(*Tuple); ok {
  /prebuilts/go/linux-x86/src/go/types/
typestring.go 138 case *Tuple:
237 func writeTuple(buf *bytes.Buffer, tup *Tuple, variadic bool, qf Qualifier, visited []Type) {
predicates.go 186 case *Tuple:
189 if y, ok := y.(*Tuple); ok {
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/
tighten.go 20 // Tuple selectors must stay with the tuple generator.
  /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/
tighten.go 20 // Tuple selectors must stay with the tuple generator.
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/
ast.py 57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts))
163 Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields``
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/
ast.py 57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts))
163 Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields``
  /external/mesa3d/src/gallium/drivers/swr/rasterizer/scripts/mako/
pyparser.py 104 if isinstance(arg, _ast.Tuple):
  /external/python/cpython2/Lib/
ast.py 57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts))
163 Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields``
  /prebuilts/gdb/darwin-x86/lib/python2.7/
ast.py 57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts))
163 Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields``
  /prebuilts/gdb/linux-x86/lib/python2.7/
ast.py 57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts))
163 Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields``
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
ast.py 57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts))
163 Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields``
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
ast.py 57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts))
163 Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields``
  /external/swiftshader/third_party/LLVM/utils/TableGen/
CodeGenRegisters.cpp 193 std::vector<Init*> Tuple;
199 Tuple.push_back(DefInit::get(Reg));
218 // Replace the sub-register list with Tuple.
220 RV.setValue(ListInit::get(Tuple, RegisterRecTy));
226 // CostPerUse is aggregated from all Tuple members.
  /external/fmtlib/test/gtest/
gtest.h 162 // GTEST_HAS_TR1_TUPLE - Define it to 1/0 to indicate tr1::tuple
172 // Test's own tr1 tuple implementation should be
588 // Determines whether Google Test can use tr1/tuple. You can define
589 // this macro to 0 to prevent Google Test from using tuple (any
590 // feature depending on tuple with be disabled in this mode).
593 // STLport, provided with the Android NDK, has neither <tr1/tuple> or <tuple>.
601 // Determines whether Google Test's own tr1 tuple implementation
606 // We use our own TR1 tuple if we aren't sure the user has an
609 // with a TR1 tuple implementation. NVIDIA's CUDA NVCC compile
838 class tuple<> { class in namespace:std::tr1
840 tuple() {} function in class:std::tr1::tuple
841 tuple(const tuple& \/* t *\/) {} function in class:std::tr1::tuple
850 tuple() : f0_() {} function
854 tuple(const tuple& t) : f0_(t.f0_) {} function
882 tuple() : f0_(), f1_() {} function
887 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_) {} function
892 tuple(const ::std::pair<U0, U1>& p) : f0_(p.first), f1_(p.second) {} function
925 tuple() : f0_(), f1_(), f2_() {} function
930 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_) {} function
962 tuple() : f0_(), f1_(), f2_(), f3_() {} function
968 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_) {} function
1003 tuple() : f0_(), f1_(), f2_(), f3_(), f4_() {} function
1009 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
1047 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_() {} function
1054 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
1094 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_() {} function
1101 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
1143 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_() {} function
1151 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
1195 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_() {} function
1203 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function
1245 class tuple { class in namespace:std::tr1
1249 tuple() : f0_(), f1_(), f2_(), f3_(), f4_(), f5_(), f6_(), f7_(), f8_(), function in class:std::tr1::tuple
1258 tuple(const tuple& t) : f0_(t.f0_), f1_(t.f1_), f2_(t.f2_), f3_(t.f3_), function in class:std::tr1::tuple
    [all...]

Completed in 745 milliseconds

1 2 3 45 6 7 8 9