| /third_party/boost/boost/geometry/views/detail/ |
| D | points_view.hpp | 49 : m_points(p) in points_iterator()
55 : m_points(p) in points_iterator()
61 : m_points(NULL) in points_iterator()
74 return m_points[m_index]; in dereference()
79 return m_points[0]; in dereference()
107 Point const* m_points; member
116 const_iterator begin() const { return const_iterator(m_points); } in begin()
117 const_iterator end() const { return const_iterator(m_points, true); } in end()
128 copy.apply(m_points); in points_view()
133 Point m_points[MaxSize]; member in boost::geometry::detail::points_view
|
| /third_party/vk-gl-cts/external/openglcts/modules/glesext/geometry_shader/ |
| D | esextcGeometryShaderAdjacencyTests.cpp | 338 test_data.m_grid->m_points = new AdjacencyGridPoint[test_data.m_grid->m_n_points]; in createGrid()
349 test_data.m_grid->m_points[nPoint].index = nPoint; in createGrid()
350 test_data.m_grid->m_points[nPoint].x = dx * static_cast<float>(x); in createGrid()
351 test_data.m_grid->m_points[nPoint].y = dy * static_cast<float>(y); in createGrid()
417 AdjacencyGridPoint* pointTL = test_data.m_grid->m_points + nPoint; in createGridLineSegments()
423 pointTR = test_data.m_grid->m_points + nPoint + 1; in createGridLineSegments()
424 pointBL = test_data.m_grid->m_points + m_grid_granulity + 1; in createGridLineSegments()
425 pointBR = test_data.m_grid->m_points + m_grid_granulity + 2; in createGridLineSegments()
489 AdjacencyGridPoint* pointPtr = test_data.m_grid->m_points + nPoint; in createGridLineSegments()
526 …test_data.m_grid->m_line_strip.m_points = new AdjacencyGridPoint[test_data.m_grid->m_line_strip.… in createGridLineStrip()
[all …]
|
| D | esextcGeometryShaderAdjacency.cpp | 38 : m_line_segments(0), m_points(0), m_triangles(0), m_n_points(0), m_n_segments(0), m_n_triangles(0) in AdjacencyGrid()
54 if (m_points) in ~AdjacencyGrid()
56 delete[] m_points; in ~AdjacencyGrid()
57 m_points = 0; in ~AdjacencyGrid()
70 AdjacencyGridStrip::AdjacencyGridStrip() : m_n_points(0), m_points(0) in AdjacencyGridStrip()
80 if (m_points) in ~AdjacencyGridStrip()
82 delete[] m_points; in ~AdjacencyGridStrip()
|
| D | esextcGeometryShaderAdjacency.hpp | 232 AdjacencyGridPoint* m_points; member in glcts::AdjacencyGridStrip
259 AdjacencyGridPoint* m_points; member in glcts::AdjacencyGrid
|
| /third_party/boost/boost/geometry/algorithms/detail/relate/ |
| D | multi_point_geometry.hpp | 64 : m_points(points) in boundary_visitor()
87 …if (std::find_if(m_points.begin(), m_points.end(), find_pred<Point>(boundary_point)) == m_points.e… in apply()
98 Points const& m_points; member
122 : m_points(points) in boundary_visitor()
129 if (! std::binary_search(m_points.begin(), m_points.end(), boundary_point, less_type())) in apply()
140 Points const& m_points; member
|
| /third_party/boost/libs/geometry/test/algorithms/buffer/ |
| D | test_buffer_svg_per_turn.hpp | 31 m_points.push_back(std::make_pair(it->point, it->turn_index)); in get_turns()
44 vector_type const& get_points() { return m_points; } in get_points()
47 vector_type m_points; member in save_turns_visitor
|
| /third_party/boost/libs/range/test/ |
| D | iterator_ext.cpp | 40 return m_points; in points()
44 std::vector<point> m_points; member in boost_range_test::shape
|
| /third_party/boost/libs/geometry/test/algorithms/overlay/ |
| D | get_turn_info.cpp | 41 m_points[0] = i; in sub_range_from_points()
42 m_points[1] = j; in sub_range_from_points()
43 m_points[2] = k; in sub_range_from_points()
53 return m_points[index % 3]; in at()
57 boost::array<Point, 3> m_points; member
|
| /third_party/boost/libs/math/doc/graphs/ |
| D | sf_graphs.cpp | 54 …m_points.push_back(std::pair<std::string, std::map<double,double> >(name, std::map<double,double>(… in add()
55 std::map<double,double>& points = m_points.rbegin()->second; in add()
87 m_points.push_back(std::pair<std::string, std::map<double,double> >(name, m)); in add()
176 …for(std::list<std::pair<std::string, std::map<double,double> > >::const_iterator i = m_points.begi… in plot()
177 i != m_points.end(); ++i) in plot()
193 m_points.clear(); in clear()
199 std::list<std::pair<std::string, std::map<double, double> > > m_points; member in function_arity1_plotter
|
| /third_party/vk-gl-cts/modules/gles2/functional/ |
| D | es2fClippingTests.cpp | 489 const std::vector<tcu::Vec4> m_points; member in deqp::gles2::Functional::__anon1705720b0111::PointCase
496 , m_points (pointsBegin, pointsEnd) in PointCase()
528 for (size_t ndx = 0; ndx < m_points.size(); ++ndx) in testRender()
530 << "\tx=" << m_points[ndx].x() in testRender()
531 << "\ty=" << m_points[ndx].y() in testRender()
532 << "\tz=" << m_points[ndx].z() in testRender()
533 << "\tw=" << m_points[ndx].w() in testRender()
534 << "\t" << genClippingPointInfoString(m_points[ndx]) in testRender()
552 ctx.vertexAttribPointer (positionLoc, 4, GL_FLOAT, GL_FALSE, 0, &m_points[0]); in testRender()
555 ctx.drawArrays (GL_POINTS, 0, (glw::GLsizei)m_points.size()); in testRender()
|
| /third_party/vk-gl-cts/modules/gles3/functional/ |
| D | es3fClippingTests.cpp | 492 const std::vector<tcu::Vec4> m_points; member in deqp::gles3::Functional::__anon00101c6d0111::PointCase
499 , m_points (pointsBegin, pointsEnd) in PointCase()
531 for (size_t ndx = 0; ndx < m_points.size(); ++ndx) in testRender()
533 << "\tx=" << m_points[ndx].x() in testRender()
534 << "\ty=" << m_points[ndx].y() in testRender()
535 << "\tz=" << m_points[ndx].z() in testRender()
536 << "\tw=" << m_points[ndx].w() in testRender()
537 << "\t" << genClippingPointInfoString(m_points[ndx]) in testRender()
555 ctx.vertexAttribPointer (positionLoc, 4, GL_FLOAT, GL_FALSE, 0, &m_points[0]); in testRender()
558 ctx.drawArrays (GL_POINTS, 0, (glw::GLsizei)m_points.size()); in testRender()
|