/third_party/boost/libs/geometry/test/robustness/overlay/areal_areal/ |
D | recursive_polygons.cpp | 23 inline void make_polygon(Polygon& polygon, Generator& generator, bool triangular) in make_polygon() argument 41 if (triangular) in make_polygon() 57 int level, bool triangular, p_q_settings const& settings) in test_recursive_boxes() argument 66 make_polygon(p.front(), generator, triangular); in test_recursive_boxes() 67 make_polygon(q.front(), generator, triangular); in test_recursive_boxes() 75 if (! test_recursive_boxes(p, index, generator, level - 1, triangular, settings) in test_recursive_boxes() 76 || ! test_recursive_boxes(q, index, generator, level - 1, triangular, settings)) in test_recursive_boxes() 110 void test_all(int seed, int count, int field_size, int level, bool triangular, p_q_settings const& … in test_all() argument 133 test_recursive_boxes<mp>(p, index, coordinate_generator, level, triangular, settings); in test_all() 184 bool triangular = form != "box"; in main() local [all …]
|
/third_party/boost/libs/math/doc/distributions/ |
D | triangular.qbk | 4 ``#include <boost/math/distributions/triangular.hpp>`` 11 typedef triangular_distribution<> triangular; 21 …wer(lower), m_mode(mode), m_upper(upper) // Default is -1, 0, +1 symmetric triangular distribution. 30 The [@http://en.wikipedia.org/wiki/Triangular_distribution triangular distribution] 37 The triangular distribution is often used where the distribution is only vaguely known, 44 The [@http://en.wikipedia.org/wiki/Triangular_distribution triangular distribution] 57 The triangular distribution may be appropriate when an assumption of a normal distribution 62 The 001 triangular distribution which expresses an estimate that the lowest value is the most likel… 82 Constructs a [@http://en.wikipedia.org/wiki/triangular_distribution triangular distribution] 92 [^TriangularDistribution\[{min, max}\]] represents a [*symmetric] triangular statistical distribut… [all …]
|
D | dist_algorithms.qbk | 7 …plies to distributions like normal, lognormal, extreme value, Cauchy, (and symmetrical triangular),
|
D | beta.qbk | 84 is dome-shaped, and might be approximated by a symmetrical triangular 202 The [@http://en.wikipedia.org/wiki/Triangular_distribution triangular]
|
/third_party/boost/libs/geometry/test/robustness/common/ |
D | common_settings.hpp | 20 bool triangular; member 28 , triangular(false) in common_settings()
|
D | make_square_polygon.hpp | 35 if (settings.triangular) in make_square_polygon()
|
/third_party/boost/libs/math/test/compile_test/ |
D | test_traits.cpp | 31 BOOST_STATIC_ASSERT(::boost::math::tools::is_distribution<triangular>::value); 53 BOOST_STATIC_ASSERT(::boost::math::tools::is_scaled_distribution<triangular>::value == false);
|
D | dist_triangular_incl_test.cpp | 18 TEST_DIST_FUNC(triangular) in compile_and_link_test()
|
/third_party/boost/libs/random/test/ |
D | test_triangle.cpp | 18 #define BOOST_MATH_DISTRIBUTION boost::math::triangular
|
/third_party/skia/third_party/externals/opengl-registry/extensions/NV/ |
D | NV_evaluators.txt | 79 OpenGL evaluators only support rectangular patches, not triangular 80 patches. Although triangular patches can be converted into 81 rectangular patches, direct support for triangular patches is likely 89 three of a triangular patch. This extension goes one step further 112 * Should we support triangular patches? 118 * What domain should triangular patches be defined on? 122 * What memory layout should we use for triangular patch control 313 do not. First, they support triangular surfaces in addition to 412 A triangular map may be evaluated as follows. Let Ri,j be the 423 evaluates the point p_t(u,v) on the triangular patch at parameter [all …]
|
/third_party/openGLES/extensions/NV/ |
D | NV_evaluators.txt | 79 OpenGL evaluators only support rectangular patches, not triangular 80 patches. Although triangular patches can be converted into 81 rectangular patches, direct support for triangular patches is likely 89 three of a triangular patch. This extension goes one step further 112 * Should we support triangular patches? 118 * What domain should triangular patches be defined on? 122 * What memory layout should we use for triangular patch control 313 do not. First, they support triangular surfaces in addition to 412 A triangular map may be evaluated as follows. Let Ri,j be the 423 evaluates the point p_t(u,v) on the triangular patch at parameter [all …]
|
/third_party/python/Lib/ |
D | random.py | 550 def triangular(self, low=0.0, high=1.0, mode=None): member in Random 861 triangular = _inst.triangular variable 919 _test_generator(N, triangular, (0.0, 1.0, 1.0 / 3.0))
|
/third_party/boost/libs/math/dot_net_example/boost_math/ |
D | boost_math.cpp | 127 …this->reset(new concrete_distribution<boost::math::triangular>(boost::math::triangular(arg1, arg2,… in any_distribution()
|
/third_party/boost/libs/math/test/ |
D | test_triangular.cpp | 595 triangular triang; // Using typedef in BOOST_AUTO_TEST_CASE() 602 triangular tristd (0, 0.5, 1); // Using typedef in BOOST_AUTO_TEST_CASE() 636 triangular tri0h1(0, 0.5, 1); // Equilateral triangle - mode is the middle. in BOOST_AUTO_TEST_CASE() 658 triangular tri0q1(0, 0.25, 1); // mode is near bottom. in BOOST_AUTO_TEST_CASE() 668 triangular trim12(-1, -0.5, 2); // mode is negative. in BOOST_AUTO_TEST_CASE()
|
/third_party/boost/libs/numeric/ublas/test/ |
D | README | 18 test5 - triangular matrix tests
|
/third_party/boost/libs/math/doc/sf/ |
D | cardinal_b_splines.qbk | 78 … Cox' 1972 paper 'The Numerical Evaluation of B-splines', and uses the triangular array of Algorit… 80 Since few people use /B/ splines of degree 18, the triangular array is used.
|
/third_party/boost/libs/numeric/ublas/IDEs/qtcreator/include/ |
D | include.pro | 26 $${INCLUDE_DIR}/boost/numeric/ublas/triangular.hpp \
|
/third_party/ffmpeg/doc/ |
D | resampler.texi | 92 @item triangular 93 select triangular dither 95 select triangular dither with high pass
|
/third_party/flutter/flutter/packages/flutter/lib/src/gestures/ |
D | lsq_solver.dart | 121 // Upper triangular matrix, row-major order. 145 // Solve R B = Qt W Y to find B. This is easy because R is upper triangular.
|
/third_party/boost/boost/math/distributions/ |
D | fwd.hpp | 149 typedef boost::math::triangular_distribution<Type, Policy> triangular;\
|
/third_party/boost/libs/math/doc/distexplorer/ |
D | distexplorer.qbk | 36 *triangular
|
/third_party/skia/third_party/externals/opengl-registry/extensions/SGIX/ |
D | SGIX_subdiv_patch.txt | 36 considered first. Other representations as well as non-triangular ones
|
/third_party/openGLES/extensions/SGIX/ |
D | SGIX_subdiv_patch.txt | 36 considered first. Other representations as well as non-triangular ones
|
/third_party/boost/libs/math/dot_net_example/distribution_explorer/ |
D | readme.txt | 42 * triangular
|
/third_party/python/Lib/test/ |
D | test_random.py | 1015 g.random = x[:].pop; g.triangular(0.0, 1.0, 1.0/3.0) 1025 (g.triangular, (0.0, 1.0, 1.0/3.0), 4.0/9.0, 7.0/9.0/18.0), 1054 (g.triangular, (10.0, 10.0), 10.0), 1055 (g.triangular, (10.0, 10.0, 10.0), 10.0),
|