/third_party/flatbuffers/tests/evolution_test/ |
D | evolution_v2_generated.h | 10 namespace V2 { 102 template<> struct UnionTraits<Evolution::V2::TableA> { 106 template<> struct UnionTraits<Evolution::V2::TableB> { 110 template<> struct UnionTraits<Evolution::V2::TableC> { 224 return Evolution::V2::CreateTableA( 329 return Evolution::V2::CreateTableC( 353 Evolution::V2::Union c_type() const { 354 return static_cast<Evolution::V2::Union>(GetField<uint8_t>(VT_C_TYPE, 0)); 360 const Evolution::V2::TableA *c_as_TableA() const { 361 …return c_type() == Evolution::V2::Union::TableA ? static_cast<const Evolution::V2::TableA *>(c()) … [all …]
|
/third_party/boost/libs/qvm/test/ |
D | swizzle2_test.cpp | 26 test_qvm::vector<V2,2> v0=X0(42.0f); in main() 29 test_qvm::vector<V2,2> v2=_1X(42.0f); in main() 36 test_qvm::vector<V2,2> r; in main() 39 test_qvm::vector<V2,2> v2=XX(v1); in main() 43 test_qvm::vector<V2,2> r; in main() 46 test_qvm::vector<V2,2> v2=XY(v1); in main() 50 test_qvm::vector<V2,2> r; in main() 53 test_qvm::vector<V2,2> v2=XZ(v1); in main() 57 test_qvm::vector<V2,2> r; in main() 60 test_qvm::vector<V2,2> v2=XW(v1); in main() [all …]
|
D | swizzle3_test.cpp | 26 test_qvm::vector<V2,3> v0=X00(42.0f); in main() 30 test_qvm::vector<V2,3> v2=_10X(42.0f); in main() 38 test_qvm::vector<V2,3> r; in main() 42 test_qvm::vector<V2,3> v2=XXX(v1); in main() 46 test_qvm::vector<V2,3> r; in main() 50 test_qvm::vector<V2,3> v2=XXY(v1); in main() 54 test_qvm::vector<V2,3> r; in main() 58 test_qvm::vector<V2,3> v2=XXZ(v1); in main() 62 test_qvm::vector<V2,3> r; in main() 66 test_qvm::vector<V2,3> v2=XXW(v1); in main() [all …]
|
D | swizzle4_test.cpp | 26 test_qvm::vector<V2,4> v0=X001(42.0f); in main() 31 test_qvm::vector<V2,4> v2=_100X(42.0f); in main() 40 test_qvm::vector<V2,4> r; in main() 45 test_qvm::vector<V2,4> v2=XXXX(v1); in main() 49 test_qvm::vector<V2,4> r; in main() 54 test_qvm::vector<V2,4> v2=XXXY(v1); in main() 58 test_qvm::vector<V2,4> r; in main() 63 test_qvm::vector<V2,4> v2=XXXZ(v1); in main() 67 test_qvm::vector<V2,4> r; in main() 72 test_qvm::vector<V2,4> v2=XXXW(v1); in main() [all …]
|
/third_party/boost/boost/assign/std/ |
D | queue.hpp | 30 template< class V, class C, class V2 > 32 operator+=( std::queue<V,C>& c, V2 v ) in operator +=() 37 template< class V, class C, class V2 > 39 operator+=( std::priority_queue<V,C>& c, V2 v ) in operator +=() 46 template< class V, class C, class V2 > 48 operator+=(std::queue<V, C>& c, V2&& v) 50 return push(c)(boost::forward<V2>(v)); 53 template< class V, class C, class V2 > 55 operator+=(std::priority_queue<V, C>& c, V2&& v) 57 return push(c)(boost::forward<V2>(v));
|
D | stack.hpp | 29 template< class V, class C, class V2 > 31 operator+=( std::stack<V,C>& c, V2 v ) in operator +=() 38 template< class V, class C, class V2 > 40 operator+=(std::stack<V, C>& c, V2&& v) 42 return push(c)(boost::forward<V2>(v));
|
D | vector.hpp | 29 template< class V, class A, class V2 > 31 operator+=( std::vector<V,A>& c, V2 v ) in operator +=() 38 template< class V, class A, class V2 > 40 operator+=( std::vector<V, A>& c, V2&& v ) 42 return push_back( c )( std::forward<V2>(v) );
|
D | deque.hpp | 30 template< class V, class A, class V2 > 32 operator+=( std::deque<V,A>& c, V2 v ) in operator +=() 39 template< class V, class A, class V2 > 41 operator+=(std::deque<V, A>& c, V2&& v) 43 return push_back(c)(boost::forward<V2>(v));
|
D | list.hpp | 30 template< class V, class A, class V2 > 32 operator+=( std::list<V,A>& c, V2 v ) in operator +=() 39 template< class V, class A, class V2 > 41 operator+=(std::list<V, A>& c, V2&& v) 43 return push_back(c)(boost::forward<V2>(v));
|
D | slist.hpp | 34 template< class V, class A, class V2 > 36 operator+=( BOOST_STD_EXTENSION_NAMESPACE::slist<V,A>& c, V2 v ) in operator +=() 41 template< class V, class A, class V2 > 43 operator+=( BOOST_STD_EXTENSION_NAMESPACE::slist<V,A>& c, V2&& v ) 45 return push_back( c )( boost::forward<V2>(v) );
|
/third_party/boost/boost/phoenix/function/ |
D | lazy_reuse.hpp | 105 template <class V1, class V2, class F, class X> 108 template <class V1, class V2, class F, class X, class R> 115 Maybe_Var_Inv<V2,X>::remake( x, xx ); in init() 119 Maybe_Var_Inv<V2,X>::clone(x), in operator ()() 120 reuser1<V1,V2,F,X>(this) ); in operator ()() 124 template <class V1, class V2, class F, class X> 128 typedef Thunk1<V1,V2,F,X,R> M; 147 template <class V1, class V2, class V3, class F, class X, class Y> 150 template <class V1, class V2, class V3, class F, class X, class Y, class R> 158 Maybe_Var_Inv<V2,X>::remake( x, xx ); in init() [all …]
|
/third_party/boost/boost/numeric/ublas/ |
D | blas.hpp | 73 template<class V1, class V2> 74 typename promote_traits<typename V1::value_type, typename V2::value_type>::promote_type 75 dot (const V1 &v1, const V2 &v2) { in dot() 88 template<class V1, class V2> 89 V1 & copy (V1 &v1, const V2 &v2) in copy() 102 template<class V1, class V2> 103 void swap (V1 &v1, V2 &v2) in swap() 134 template<class V1, class T, class V2> 135 V1 & axpy (V1 &v1, const T &t, const V2 &v2) in axpy() 157 template<class T1, class V1, class T2, class V2> [all …]
|
/third_party/boost/libs/sort/test/ |
D | test_sample_sort.cpp | 40 std::vector<xk> V1, V2, V3; in test1() local 52 V3 = V2 = V1; in test1() 54 std::stable_sort(V2.begin(), V2.end()); in test1() 57 BOOST_CHECK(V1.size() == V2.size()); in test1() 59 { BOOST_CHECK(V1[i].num == V2[i].num and V1[i].tail == V2[i].tail); in test1() 62 BOOST_CHECK(V3.size() == V2.size()); in test1() 64 { BOOST_CHECK(V3[i].num == V2[i].num and V3[i].tail == V2[i].tail); in test1() 101 std::vector<uint64_t> V1,V2,V3; in test3() local 105 V3 = V2 = V1; in test3() 106 std::stable_sort (V2.begin(), V2.end()); in test3() [all …]
|
D | test_parallel_stable_sort.cpp | 41 std::vector<xk> V1, V2, V3; in test1() local 53 V3 = V2 = V1; in test1() 55 std::stable_sort(V2.begin(), V2.end()); in test1() 58 BOOST_CHECK(V1.size() == V2.size()); in test1() 60 { BOOST_CHECK(V1[i].num == V2[i].num and V1[i].tail == V2[i].tail); in test1() 63 BOOST_CHECK(V3.size() == V2.size()); in test1() 65 { BOOST_CHECK(V3[i].num == V2[i].num and V3[i].tail == V2[i].tail); in test1() 101 std::vector<uint64_t> V1,V2,V3; in test3() local 105 V3 = V2 = V1; in test3() 106 std::stable_sort (V2.begin(), V2.end()); in test3() [all …]
|
D | test_flat_stable_sort.cpp | 45 std::vector< xk > V1, V2; in test1() local 56 V2 = V1; in test1() 58 std::stable_sort (V2.begin ( ), V2.end ( )); in test1() 60 BOOST_CHECK (V1.size ( ) == V2.size ( )); in test1() 62 BOOST_CHECK (V1[ i ].num == V2[ i ].num and in test1() 63 V1[ i ].tail == V2[ i ].tail); in test1() 72 std::vector< uint64_t > V1,V2; in test2() local 78 V2 = V1; in test2() 80 std::stable_sort (V2.begin ( ), V2.end ( ), comp); in test2() 82 BOOST_CHECK (V2[ i ] == V1[ i ]); in test2()
|
D | test_spinsort.cpp | 52 std::vector< xk > V1, V2; in test1() local 63 V2 = V1; in test1() 65 std::stable_sort (V2.begin ( ), V2.end ( )); in test1() 67 BOOST_CHECK (V1.size ( ) == V2.size ( )); in test1() 69 BOOST_CHECK (V1[ i ].num == V2[ i ].num and in test1() 70 V1[ i ].tail == V2[ i ].tail); in test1() 79 std::vector< uint64_t > V1,V2; in test2() local 85 V2 = V1; in test2() 87 std::stable_sort (V2.begin ( ), V2.end ( ), comp); in test2() 89 BOOST_CHECK (V2[ i ] == V1[ i ]); in test2()
|
D | test_block_indirect_sort.cpp | 98 std::vector< uint64_t > V1, V2; in test2() local 101 V2 = Vrandom; in test2() 102 std::sort (V2.begin ( ), V2.end ( )); in test2() 108 { BOOST_CHECK (V1[i] == V2[i]); in test2() 115 { BOOST_CHECK (V1[i] == V2[i]); in test2() 122 { BOOST_CHECK (V1[i] == V2[i]); in test2() 129 { BOOST_CHECK (V1[i] == V2[i]); in test2() 136 { BOOST_CHECK (V1[i] == V2[i]); in test2()
|
/third_party/mesa3d/src/amd/addrlib/src/ |
D | addrinterface.cpp | 1156 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeSurfaceInfo() 1189 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeSurfaceAddrFromCoord() 1222 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeSurfaceCoordFromAddr() 1260 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeHtileInfo() 1293 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeHtileAddrFromCoord() 1327 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeHtileCoordFromAddr() 1366 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeCmaskInfo() 1399 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeCmaskAddrFromCoord() 1433 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeCmaskCoordFromAddr() 1471 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeFmaskInfo() [all …]
|
/third_party/typescript/tests/baselines/reference/ |
D | constEnums.types | 194 V2 = A.B.C.E.V1 | 100 195 >V2 : E 218 V3 = A.B.C.E["V2"] & 200, 220 >A.B.C.E["V2"] & 200 : number 221 >A.B.C.E["V2"] : E 229 >"V2" : "V2" 260 V2 = 110, 261 >V2 : E.V2 282 V2 = 110, 283 >V2 : E.V2 [all …]
|
D | constEnums.js | 47 V2 = A.B.C.E.V1 | 100 69 V2 = 110, 80 V2 = 110, 97 else if (e === I.V2) { 104 else if (e === I1.C.E.V2) { 111 else if (e === I2.C.E.V2) { 153 case A.B.C.E.V2: return 1;
|
/third_party/boost/boost/gil/extension/dynamic_image/ |
D | reduce.hpp | 508 template <typename Op, typename V1, typename V2, bool AreBasic> 511 using type = std::pair<const V1*, const V2*>; 670 template <typename V1, typename V2, bool Compatible> 678 template <typename V1, typename V2> 679 struct reduce_copy_pixop_compat<V1,V2,true> 682 using layout2 = layout<typename V2::color_space_t, typename V2::channel_mapping_t>; 688 …using DV2 = typename derived_view_type<V2, use_default, L2, use_default, use_default, use_default,… 694 template <typename V1, typename V2> 695 struct reduce_views_basic<copy_pixels_fn, V1, V2, true> 696 …: public reduce_copy_pixop_compat<V1, V2, mpl::and_<views_are_compatible<V1,V2>, view_is_mutable<V… [all …]
|
/third_party/boost/libs/asio/test/execution/ |
D | set_value.cpp | 91 template <typename V1, typename V2> 92 void set_value(BOOST_ASIO_MOVE_ARG(V1) v1, BOOST_ASIO_MOVE_ARG(V2) v2) const in set_value() 96 typename boost::asio::decay<V2>::type tmp2(BOOST_ASIO_MOVE_CAST(V2)(v2)); in set_value() 108 template <typename V1, typename V2> 109 struct set_value_member<const const_member_set_value_2, void(V1, V2)> 184 template <typename V1, typename V2> 186 BOOST_ASIO_MOVE_ARG(V1) v1, BOOST_ASIO_MOVE_ARG(V2) v2) in set_value() 190 typename boost::asio::decay<V2>::type tmp2(BOOST_ASIO_MOVE_CAST(V2)(v2)); in set_value() 202 template <typename V1, typename V2> 203 struct set_value_free<const free_set_value_const_receiver_2, void(V1, V2)> [all …]
|
/third_party/boost/libs/iterator/doc/ |
D | iterator_facade_ref.rst | 44 class Dr2, class V2, class TC2, class R2, class D2> 47 iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs); 50 class Dr2, class V2, class TC2, class R2, class D2> 53 iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs); 56 class Dr2, class V2, class TC2, class R2, class D2> 59 iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs); 62 class Dr2, class V2, class TC2, class R2, class D2> 65 iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs); 68 class Dr2, class V2, class TC2, class R2, class D2> 71 iterator_facade<Dr2,V2,TC2,R2,D2> const& rhs); [all …]
|
/third_party/boost/boost/geometry/srs/projections/proj/ |
D | labrd.hpp | 76 T V1, V2, ps, sinps, cosps, sinps2, cosps2; in fwd() local 81 V2 = .5 * par.e * this->m_proj_parm.A * log ((1. + t)/(1. - t)); in fwd() 82 ps = 2. * (atan(exp(V1 - V2 + this->m_proj_parm.C)) - fourth_pi); in fwd() 99 V2 = xy_y * y2 - 3. * x2 * xy_y; in fwd() 100 xy_x += this->m_proj_parm.Ca * V1 + this->m_proj_parm.Cb * V2; in fwd() 101 xy_y += this->m_proj_parm.Ca * V2 - this->m_proj_parm.Cb * V1; in fwd() 113 T x2, y2, V1, V2, V3, V4, t = 0.0, t2, ps, pe, tpe, s; in inv() local 120 V2 = xy_y * y2 - 3. * x2 * xy_y; in inv() 123 …xy_x += - this->m_proj_parm.Ca * V1 - this->m_proj_parm.Cb * V2 + this->m_proj_parm.Cc * V3 + this… in inv() 124 …xy_y += this->m_proj_parm.Cb * V1 - this->m_proj_parm.Ca * V2 - this->m_proj_parm.Cd * V3 + this… in inv() [all …]
|
/third_party/typescript/tests/cases/compiler/ |
D | constEnums.ts | 46 V2 = A.B.C.E.V1 | 100 enumerator 68 V2 = 110, 79 V2 = 110, 96 else if (e === I.V2) { 103 else if (e === I1.C.E.V2) { 110 else if (e === I2.C.E.V2) { 152 case A.B.C.E.V2: return 1;
|