Home
last modified time | relevance | path

Searched refs:multiplicity (Results 1 – 11 of 11) sorted by relevance

/third_party/boost/libs/numeric/odeint/test/
Dresizing.cpp96 const size_t multiplicity = mpl::at< T , mpl::int_< 2 > >::type::value; in BOOST_AUTO_TEST_CASE_TEMPLATE() local
106 …ount == resize_calls * multiplicity , "adjust_size_count : " << adjust_size_count << " expected: "… in BOOST_AUTO_TEST_CASE_TEMPLATE()
Dsymplectic_steppers.cpp185 const size_t multiplicity = mpl::at_c< Stepper , 1 >::type::value; in BOOST_AUTO_TEST_CASE_TEMPLATE() local
204 TEST_COUNTERS( counter_deriv2 , multiplicity , 1 , 0 , 1 ); in BOOST_AUTO_TEST_CASE_TEMPLATE()
/third_party/boost/boost/graph/
Disomorphism.hpp84 compare_multiplicity(Invariant1 invariant1, size_type* multiplicity) in compare_multiplicity()
85 : invariant1(invariant1), multiplicity(multiplicity) in compare_multiplicity()
90 return multiplicity[invariant1(x)] in operator ()()
91 < multiplicity[invariant1(y)]; in operator ()()
94 size_type* multiplicity; member
186 std::vector< size_type > multiplicity(max_invariant, 0); in test_isomorphism() local
188 ++multiplicity.at(invariant1(v)); in test_isomorphism()
190 V_mult, compare_multiplicity(invariant1, &multiplicity[0])); in test_isomorphism()
/third_party/boost/libs/graph/doc/
Disomorphism-impl-v2.w259 invariant number $i$ is called the \emph{invariant multiplicity} for
287 invariants. We examine vertices with low invariant multiplicity
288 before examining vertices with high invariant multiplicity.
304 order the roots of our DFS trees by invariant multiplicity.
438 @<Invariant multiplicity comparison functor@>
455 invariant multiplicity, and then by DFS order. The edges are then
467 @<Sort vertices according to invariant multiplicity@>
498 Next we compute the invariant multiplicity, the number of vertices
501 graph to record the multiplicity. We then order the vertices by their
502 invariant multiplicity. This will allow us to search the more
[all …]
Disomorphism-impl-v3.w214 invariant number $i$ is called the \emph{invariant multiplicity} for
266 invariants. We examine vertices with low invariant multiplicity
267 before examining vertices with high invariant multiplicity.
281 order the roots of our DFS trees by invariant multiplicity.
559 @<Invariant multiplicity comparison functor@>
577 invariant multiplicity, and then by DFS order. The edges are then
586 @<Sort vertices according to invariant multiplicity@>
619 Next we compute the invariant multiplicity, the number of vertices
622 graph to record the multiplicity. We then order the vertices by their
623 invariant multiplicity. This will allow us to search the more
[all …]
Disomorphism-impl.w175 invariant number $i$ is called the \emph{invariant multiplicity} for
210 invariants. We examine vertices with low invariant multiplicity
211 before examining vertices with high invariant multiplicity.
227 order the roots of our DFS trees by invariant multiplicity.
255 vertex ordering, first ordering the vertices by invariant multiplicity
267 @<Compute invariant multiplicity@>
268 @<Sort vertices by invariant multiplicity@>
423 Next we compute the invariant multiplicity, the number of vertices
426 graph to record the multiplicity.
428 @d Compute invariant multiplicity
[all …]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/TranslatorMetalDirect/
DRewriteOutArgs.cpp37 size_t multiplicity(const T &x) const in multiplicity() function in __anon5019b2980111::SmallMultiSet
183 if (hasIndeterminateVar || mVarBuffer.multiplicity(var) > 1) in visitAggregatePost()
/third_party/libphonenumber/migrator/src/main/java/com/google/phonenumbers/migrator/
DCommandLineMain.java42 @ArgGroup(multiplicity = "1")
/third_party/python/Doc/library/
Dshlex.rst414 standard library, given the multiplicity of shells out there), it does allow
/third_party/skia/third_party/externals/brotli/tests/testdata/
Dlcet10.txt5068 LC in the event that a multiplicity of DTDs develops * Producing images
5176 the DTDs in the event that a multiplicity of them develops. Thus,
/third_party/icu/icu4j/perf-tests/data/collation/
D2drvb10.txt16356 manifest? and who hath understood the multiplicity of her steps?