Home
last modified time | relevance | path

Searched refs:m_order (Results 1 – 7 of 7) sorted by relevance

/third_party/boost/libs/test/test/test-organization-ts/
Dtest_unit-order-shuffled-test.cpp41 m_order.push_back( tu.p_id ); in test_unit_start()
44 std::vector<ut::test_unit_id> m_order; member
117 BOOST_TEST( res1.m_order == res2.m_order, tt::per_element() ); in BOOST_FIXTURE_TEST_CASE()
128 …BOOST_TEST( res1.m_order != res2.m_order ); // some elements might be the same, but not the full s… in BOOST_FIXTURE_TEST_CASE()
141 BOOST_TEST( res1.m_order == res2.m_order, tt::per_element() ); in BOOST_FIXTURE_TEST_CASE()
146 …BOOST_TEST( res1.m_order != res3.m_order ); // some elements might be the same, but not the full s… in BOOST_FIXTURE_TEST_CASE()
Dtest_unit-order-test.cpp42 m_order.push_back( tu.p_id ); in test_unit_start()
45 std::vector<ut::test_unit_id> m_order; member
93 BOOST_TEST( expected_order == res.m_order, tt::per_element() ); in test_run()
96 res.m_order.begin(), res.m_order.end()); in test_run()
196 BOOST_TEST( expected_order == res.m_order, tt::per_element() ); in test_run()
199 res.m_order.begin(), res.m_order.end()); in test_run()
/third_party/boost/libs/iterator/doc/
Dpermutation_iterator_ref.rst30 IndexIterator m_order; // exposition only
86 :Effects: Default constructs ``m_elt`` and ``m_order``.
91 :Effects: Constructs ``m_elt`` from ``x`` and ``m_order`` from ``y``.
104 ``m_order`` from ``y.m_order``.
109 :Returns: ``*(m_elt + *m_order)``
114 :Effects: ``++m_order``
120 :Returns: ``m_order``
/third_party/boost/libs/iterator/doc/quickbook/
Dpermutation_iterator.qbk116 IndexIterator m_order; // exposition only
166 [*Effects: ] Default constructs `m_elt` and `m_order`.
171 [*Effects: ] Constructs `m_elt` from `x` and `m_order` from `y`.
182 `m_order` from `y.m_order`.
187 [*Returns: ] `*(m_elt + *m_order)`
192 [*Effects: ] `++m_order`[br]
198 [*Returns: ] `m_order`
/third_party/node/tools/inspector_protocol/lib/
DValues_cpp.template572 const String key = m_order[index];
600 m_order.erase(std::remove(m_order.begin(), m_order.end(), name), m_order.end());
606 for (size_t i = 0; i < m_order.size(); ++i) {
607 Dictionary::const_iterator it = m_data.find(m_order[i]);
622 for (size_t i = 0; i < m_order.size(); ++i) {
623 const String& key = m_order[i];
636 for (size_t i = 0; i < m_order.size(); ++i) {
637 String key = m_order[i];
DValues_h.template237 m_order.push_back(key);
242 std::vector<String> m_order;
/third_party/boost/libs/numeric/odeint/examples/
Dmolecular_dynamics_cells.cpp159 hash_vector const &m_order; member
167 …: m_cells_begin( cells_begin ) , m_cells_end( cells_end ) , m_order( pos_order ) , m_x( x ) , m_v(… in interaction_functor()
187 if( m_order[ ii ] == pos_hash ) continue; in operator ()()
188 point_type x2 = periodic_bc( m_x[ m_order[ ii ] ] , m_p ); in operator ()()