| /third_party/boost/libs/math/test/ |
| D | functor.hpp | 35 row_binder1(F _f, unsigned i) : f(_f), m_i(i) {} in row_binder1()
40 return f(row[m_i]); in operator ()()
45 unsigned m_i; member
57 row_binder2(F _f, unsigned i, unsigned j) : f(_f), m_i(i), m_j(j) {} in row_binder2()
62 return f(row[m_i], row[m_j]); in operator ()()
67 unsigned m_i, m_j; member
79 row_binder3(F _f, unsigned i, unsigned j, unsigned k) : f(_f), m_i(i), m_j(j), m_k(k) {} in row_binder3()
84 return f(row[m_i], row[m_j], row[m_k]); in operator ()()
89 unsigned m_i, m_j, m_k; member
101 …row_binder4(F _f, unsigned i, unsigned j, unsigned k, unsigned l) : f(_f), m_i(i), m_j(j), m_k(k),… in row_binder4()
[all …]
|
| /third_party/boost/libs/serialization/test/ |
| D | test_vector.cpp | 67 int m_i; member
69 m_i(x.m_i) in X()
72 m_i(i) in X()
75 return m_i == rhs.m_i; in operator ==()
79 ar & BOOST_SERIALIZATION_NVP(m_i); in serialize()
90 ar << boost::serialization::make_nvp("i", x->m_i); in save_construct_data()
|
| D | test_map.cpp | 46 ar & boost::serialization::make_nvp("random_key", m_i); in serialize()
48 int m_i; member
49 random_key() : m_i(std::rand()){}; in random_key()
51 return m_i < rhs.m_i; in operator <()
54 return m_i == rhs.m_i; in operator ==()
57 return m_i; in operator std::size_t()
|
| D | test_map_boost_unordered.cpp | 46 ar & boost::serialization::make_nvp("random_key", m_i); in serialize()
48 int m_i; member
49 random_key() : m_i(std::rand()){}; in random_key()
51 return m_i < rhs.m_i; in operator <()
54 return m_i == rhs.m_i; in operator ==()
57 return m_i; in operator std::size_t()
|
| D | test_map_hashed.cpp | 46 ar & boost::serialization::make_nvp("random_key", m_i); in serialize()
48 int m_i; member
49 random_key() : m_i(std::rand()){}; in random_key()
51 return m_i < rhs.m_i; in operator <()
54 return m_i == rhs.m_i; in operator ==()
57 return m_i; in operator std::size_t()
|
| D | test_map_unordered.cpp | 46 ar & boost::serialization::make_nvp("random_key", m_i); in serialize()
48 int m_i; member
49 random_key() : m_i(std::rand()){}; in random_key()
51 return m_i < rhs.m_i; in operator <()
54 return m_i == rhs.m_i; in operator ==()
57 return m_i; in operator std::size_t()
|
| D | test_private_ctor.cpp | 22 int m_i; member in V
24 m_i(0) in V()
29 ar & m_i; in serialize() local
34 return m_i == v.m_i; in operator ==()
|
| D | test_reset_object_address.cpp | 64 int m_i; member in B
67 ar & m_i; in serialize() local
71 return m_i == rhs.m_i; in operator ==()
74 m_i(std::rand()) in B()
149 int m_i; member in E
153 ar & m_i; in serialize() local
157 return m_i == rhs.m_i; in operator ==()
160 m_i(std::rand()) in E()
163 m_i(rhs.m_i) in E()
|
| D | test_private_base.cpp | 29 int m_i; member in Base
32 ar & BOOST_SERIALIZATION_NVP(m_i); in serialize()
36 return m_i == rhs.m_i; in equals()
39 m_i(i) in Base()
|
| D | test_private_base2.cpp | 29 int m_i; member in Base
32 ar & BOOST_SERIALIZATION_NVP(m_i); in serialize()
36 return m_i == rhs.m_i; in equals()
39 m_i(i) in Base()
|
| /third_party/boost/libs/graph/example/ |
| D | knights_tour.cpp | 38 : m_pos(p), m_g(&g), m_i(ii) in knight_adjacency_iterator()
42 Position operator*() const { return m_pos + knight_jumps[m_i]; } in operator *()
45 ++m_i; in operator ++()
50 return m_i == x.m_i; in operator ==()
57 int m_i; member
85 Position new_pos = m_pos + knight_jumps[m_i]; in valid_position()
86 while (m_i < 8 in valid_position()
91 ++m_i; in valid_position()
92 new_pos = m_pos + knight_jumps[m_i]; in valid_position()
|
| /third_party/vk-gl-cts/framework/common/ |
| D | tcuEither.cpp | 40 : m_i (i) in TestClassWithConstructor()
51 : m_i (other.m_i) in TestClassWithConstructor()
63 m_i = other.m_i; in operator =()
75 return m_i; in getValue()
79 int m_i; member in tcu::__anon4c4e619e0111::TestClassWithConstructor
|
| /third_party/boost/libs/test/test/writing-test-ts/ |
| D | test_tools-test.cpp | 352 B( int i ) : m_i( i ) {} in B()
354 int m_i; member
357 bool operator==( B const& b1, B const& b2 ) { return b1.m_i == b2.m_i; } in operator ==()
358 std::ostream& operator<<( std::ostream& str, B const& b ) { return str << "B(" << b.m_i << ")"; } in operator <<()
363 C( int i, int id ) : m_i( i ), m_id( id ) {} in C()
365 int m_i; member
372 boost::test_tools::predicate_result res( c1.m_i == c2.m_i && c1.m_id == c2.m_id ); in operator ==()
375 if( c1.m_i != c2.m_i ) in operator ==()
384 std::ostream& operator<<( std::ostream& str, C const& c ) { return str << "C(" << c.m_i << ',' << c… in operator <<()
|
| /third_party/boost/libs/type_traits/doc/ |
| D | operators.qbk | 86 int m_i;
88 with(int i=0) : m_i(i) { }
89 with &operator+=(int rhs) { m_i+=rhs; return *this; }
90 operator int const () { return m_i; }
94 int m_i;
96 without(int i=0) : m_i(i) { }
97 without &operator++() { ++m_i; return *this; }
98 without &operator--() { --m_i; return *this; }
99 operator int const () { return m_i; }
|
| /third_party/json/test/src/ |
| D | unit-udt.cpp | 820 Evil(T t) : m_i(sizeof(t)) {} in Evil()
822 int m_i = 0; member in __anonf40aa0fe0211::Evil
838 CHECK(e.m_i >= 0);
|
| /third_party/boost/boost/graph/detail/ |
| D | adjacency_list.hpp | 378 : stored_edge< Vertex >(v), m_i(0), m_vec(0) in stored_ra_edge_iter()
382 : stored_edge< Vertex >(v), m_i(i - edge_vec->begin()), m_vec(edge_vec) in stored_ra_edge_iter()
388 return (*m_vec)[m_i].get_property(); in get_property()
393 return (*m_vec)[m_i].get_property(); in get_property()
398 return m_vec->begin() + m_i; in get_iter()
402 std::size_t m_i; member in boost::detail::stored_ra_edge_iter
|
| /third_party/ffmpeg/libavcodec/x86/ |
| D | hevc_idct.asm | 593 ; M1 M2 M3 M4 ^T m1 m5 m9 m13 M_i^T = m_i
|
| /third_party/chromium/patch/ |
| D | 0001-cve.patch | 48189 zRHrlbC2-q&H^|v{+^#|>$93HjsK+Tbt^c(1HWpTM!m_i$*1YZV=Xc)Tf?fI7dR9H3
|