Home
last modified time | relevance | path

Searched refs:m_v1 (Results 101 – 125 of 168) sorted by relevance

1234567

/dports/math/cgal/CGAL-5.3/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/
H A DEdge_profile.h89 const vertex_descriptor v1() const { return m_v1; } in v1()
148 const vertex_descriptor m_v1; variable
186 m_v1(target(h_v0v1, tmesh)), in Edge_profile()
188 m_p1(get(vpm, m_v1)), in Edge_profile()
195 CGAL_precondition(m_v0 != m_v1); in Edge_profile()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/angle/third_party/VK-GL-CTS/src/framework/referencerenderer/
H A DrrRasterizer.hpp153 tcu::Vec4 m_v1; member in rr::TriangleRasterizer
201 tcu::Vec4 m_v1; member in rr::SingleSampleLineRasterizer
287 tcu::Vec4 m_v1; member in rr::LineExitDiamondGenerator
/dports/graphics/appleseed/appleseed-2.1.0-beta/src/appleseed/foundation/meta/tests/
H A Dtest_objmeshfilewriter.cpp52 size_t m_v0, m_v1, m_v2; in TEST_SUITE() member
89 face.m_v1 = vertices[1]; in TEST_SUITE()
192 face.m_v1 = 1; in TEST_SUITE()
/dports/astro/py-pykep/pykep-2.6/include/keplerian_toolbox/
H A Dlambert_problem.hpp88 ar &m_v1; in serialize() local
104 std::vector<array3D> m_v1; member in kep_toolbox::lambert_problem
/dports/astro/pykep/pykep-2.6/include/keplerian_toolbox/
H A Dlambert_problem.hpp88 ar &m_v1; in serialize() local
104 std::vector<array3D> m_v1; member in kep_toolbox::lambert_problem
/dports/graphics/appleseed/appleseed-2.1.0-beta/src/tools/makefluffy/
H A Dmain.cpp116 GVector3 m_v0, m_v1, m_v2; member
134 const GVector3& v1 = object.get_vertex(triangle.m_v1); in extract_support_triangles()
150 support_triangle.m_v1 = v1; in extract_support_triangles()
215 points[0] = st.m_v0 * bary[0] + st.m_v1 * bary[1] + st.m_v2 * bary[2]; in create_curve_object()
/dports/games/pioneer/pioneer-20210723/src/
H A DGeoPatch.h66 …return (m_v0 + x * (1.0 - y) * (m_v1 - m_v0) + x * y * (m_v2 - m_v0) + (1.0 - x) * y * (m_v3 - m_v… in GetSpherePoint()
95 const vector3d m_v0, m_v1, m_v2, m_v3; variable
H A DGeoPatch.cpp36 m_v1(v1_), in GeoPatch()
49 m_clipCentroid = (m_v0 + m_v1 + m_v2 + m_v3) * 0.25; in GeoPatch()
53 m_clipRadius = std::max(m_clipRadius, (m_v1 - m_clipCentroid).Length()); in GeoPatch()
359 …SQuadSplitRequest *ssrd = new SQuadSplitRequest(m_v0, m_v1, m_v2, m_v3, m_centroid.Normalized(), m… in LODUpdate()
387 …SSingleSplitRequest *ssrd = new SSingleSplitRequest(m_v0, m_v1, m_v2, m_v3, m_centroid.Normalized(… in RequestSinglePatch()
/dports/math/py-z3-solver/z3-z3-4.8.10/src/sat/smt/
H A Dbv_solver.cpp269 ctx.add_antecedent(var2enode(c.m_v1), var2enode(c.m_v2)); in get_antecedents()
276 for (unsigned i = m_bits[c.m_v1].size(); i-- > 0; ) { in get_antecedents()
277 sat::literal a = m_bits[c.m_v1][i]; in get_antecedents()
301 SASSERT(m_bits[c.m_v1].size() == m_bits[c.m_v2].size()); in get_antecedents()
302 for (unsigned i = m_bits[c.m_v1].size(); i-- > 0; ) { in get_antecedents()
303 sat::literal a = m_bits[c.m_v1][i]; in get_antecedents()
346 expr* e1 = var2expr(c.m_v1); in log_drat()
361 …std::cout << "eq2bit " << mk_bounded_pp(var2expr(c.m_v1), m) << " == " << mk_bounded_pp(var2expr(c… in log_drat()
439 literal bit1 = m_bits[occ.m_v1][occ.m_idx]; in propagate_eq_occurs()
445 … eq_internalized(occ.m_bv2, occ.m_bv1, occ.m_idx, occ.m_v2, occ.m_v1, occ.m_literal, occ.m_node); in propagate_eq_occurs()
[all …]
H A Dbv_solver.h57 theory_var m_v1{ euf::null_theory_var };
62 … m_kind(bv_justification::kind_t::eq2bit), m_v1(v1), m_v2(v2), m_consequent(c), m_antecedent(a) {} in bv_justification()
64 m_kind(bv_justification::kind_t::bit2eq), m_v1(v1), m_v2(v2) {} in bv_justification()
68 …m_kind(bv_justification::kind_t::ne2bit), m_idx(idx), m_v1(v1), m_v2(v2), m_consequent(c), m_antec… in bv_justification()
113 theory_var m_v1; member
120 …m_bv1(b1), m_bv2(b2), m_idx(idx), m_v1(v1), m_v2(v2), m_literal(lit), m_node(n), m_next(next), m_p… in m_bv1()
/dports/graphics/appleseed/appleseed-2.1.0-beta/src/appleseed/renderer/modeling/object/
H A Dmeshobject.cpp117 const auto& v1 = impl->m_tess.m_vertices[prim.m_v1]; in rasterize()
131 triangle.m_v1[0] = v1[0]; in rasterize()
132 triangle.m_v1[1] = v1[1]; in rasterize()
133 triangle.m_v1[2] = v1[2]; in rasterize()
/dports/math/pdal/PDAL-2.3.0/filters/
H A DNormalFilter.cpp246 PointRef q = view.point(edge.m_v1); in refine()
255 else if (!inMST[edge.m_v1]) in refine()
257 newIdx = edge.m_v1; in refine()
/dports/math/z3/z3-z3-4.8.13/src/sat/smt/
H A Dbv_solver.cpp276 ctx.add_antecedent(var2enode(c.m_v1), var2enode(c.m_v2)); in get_antecedents()
283 for (unsigned i = m_bits[c.m_v1].size(); i-- > 0; ) { in get_antecedents()
284 sat::literal a = m_bits[c.m_v1][i]; in get_antecedents()
308 SASSERT(m_bits[c.m_v1].size() == m_bits[c.m_v2].size()); in get_antecedents()
309 for (unsigned i = m_bits[c.m_v1].size(); i-- > 0; ) { in get_antecedents()
310 sat::literal a = m_bits[c.m_v1][i]; in get_antecedents()
353 expr* e1 = var2expr(c.m_v1); in log_drat()
427 literal bit1 = m_bits[occ.m_v1][occ.m_idx]; in propagate_eq_occurs()
433 … eq_internalized(occ.m_bv2, occ.m_bv1, occ.m_idx, occ.m_v2, occ.m_v1, occ.m_literal, occ.m_node); in propagate_eq_occurs()
612 theory_var v1 = c.m_v1; in display_constraint()
[all …]
H A Dbv_solver.h57 theory_var m_v1{ euf::null_theory_var };
62 … m_kind(bv_justification::kind_t::eq2bit), m_v1(v1), m_v2(v2), m_consequent(c), m_antecedent(a) {} in bv_justification()
64 m_kind(bv_justification::kind_t::bit2eq), m_v1(v1), m_v2(v2) {} in bv_justification()
68 …m_kind(bv_justification::kind_t::ne2bit), m_idx(idx), m_v1(v1), m_v2(v2), m_consequent(c), m_antec… in bv_justification()
116 theory_var m_v1; member
123 …m_bv1(b1), m_bv2(b2), m_idx(idx), m_v1(v1), m_v2(v2), m_literal(lit), m_node(n), m_next(next), m_p… in m_bv1()
/dports/math/py-z3-solver/z3-z3-4.8.10/src/smt/
H A Dtheory_special_relations.h38 theory_var m_v1; variable
47 m_v1(v1), in atom()
62 theory_var v1() const { return m_v1; } in v1()
/dports/math/ogdf/OGDF/src/ogdf/planarlayout/
H A DTriconnectedShellingOrder.cpp172 node m_v1, m_v2; // the two nodes on the "bottom edge" member in ogdf::ComputeTricOrder
261 m_v1 = v1; in initOuterNodes()
301 if (!e->isIncident(m_v1) || !e->isIncident(m_v2)) { in initOuterEdges()
321 if (v == m_v1) in getOuterNodeDeg2()
413 bool isPossible = ((m_visited[v] >= 1) && (m_sepf[v] == 0) && (v != m_v1) && (v != m_v2)); in doUpdate()
/dports/math/py-z3-solver/z3-z3-4.8.10/src/ast/euf/
H A Deuf_egraph.h54 theory_var m_v1; variable
64 theory_var v1() const { return m_v1; } in v1()
70 m_id(id), m_v1(v1), m_v2(v2), m_child(c), m_root(r) {} in th_eq()
72 m_id(id), m_v1(v1), m_v2(v2), m_eq(eq), m_root(nullptr) {} in th_eq()
/dports/math/z3/z3-z3-4.8.13/src/smt/
H A Dtheory_special_relations.h38 theory_var m_v1; variable
47 m_v1(v1), in atom()
62 theory_var v1() const { return m_v1; } in v1()
/dports/graphics/appleseed/appleseed-2.1.0-beta/src/appleseed/renderer/kernel/rasterization/
H A Dobjectrasterizer.h51 double m_v1[3]; member
/dports/math/z3/z3-z3-4.8.13/src/ast/euf/
H A Deuf_egraph.h54 theory_var m_v1; variable
64 theory_var v1() const { return m_v1; } in v1()
70 m_id(id), m_v1(v1), m_v2(v2), m_child(c), m_root(r) {} in th_eq()
72 m_id(id), m_v1(v1), m_v2(v2), m_eq(eq), m_root(nullptr) {} in th_eq()
/dports/graphics/agg/agg-2.5/include/
H A Dagg_vcgen_dash.h87 const vertex_dist* m_v1; variable
/dports/math/py-matplotlib/matplotlib-3.4.3/extern/agg24-svn/include/
H A Dagg_vcgen_dash.h81 const vertex_dist* m_v1; variable
/dports/math/py-matplotlib2/matplotlib-2.2.4/extern/agg24-svn/include/
H A Dagg_vcgen_dash.h81 const vertex_dist* m_v1; variable
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/pdfium/third_party/agg23/
H A Dagg_vcgen_dash.h67 const vertex_dist* m_v1; variable
/dports/graphics/mapserver/mapserver-7.6.4/renderers/agg/include/
H A Dagg_vcgen_dash.h81 const vertex_dist* m_v1; variable

1234567