Home
last modified time | relevance | path

Searched refs:EdgeVec (Results 1 – 25 of 51) sorted by relevance

123

/dports/graphics/wings/wings-8d019ebe48/plugins_src/commands/
H A Dwpc_plane_cut.erl417 EdgeVec = e3d_vec:norm_sub(PosA, PosB),
434 EdgeVec = e3d_vec:norm_sub(PosA, PosB),
451 EdgeVec = e3d_vec:norm_sub(PosA, PosB),
469 EdgeVec = e3d_vec:norm_sub(PosA, PosB),
492 EdgeVec = e3d_vec:norm_sub(PosA, PosB),
511 EdgeVec = e3d_vec:norm_sub(PosA, PosB),
530 EdgeVec = e3d_vec:norm_sub(PosA, PosB),
549 EdgeVec = e3d_vec:norm_sub(PosA, PosB),
649 intersect_vec_plane(PosA, PosB, Plane, EdgeVec) ->
651 case e3d_vec:dot(EdgeVec,Plane) of
[all …]
/dports/biology/diamond/diamond-2.0.13/src/util/algo/
H A Dedge_vec.cpp22 EdgeVec::EdgeVec(const char *file): in EdgeVec() function in Util::Algo::UPGMA_MC::EdgeVec
97 CompactEdge EdgeVec::get() { in get()
114 std::string EdgeVec::print(int idx) const { in print()
H A Dedge_vec.h29 struct EdgeVec { struct
31 EdgeVec(const char *file); argument
H A Dupgma_mc.cpp167 double load_edges(EdgeVec& all_edges, EdgeList &edges, vector<Node> &nodes, Queue &queue, double la… in load_edges()
253 EdgeVec all_edges(config.single_query_file().c_str()); in upgma()
/dports/math/vtk8/VTK-8.2.0/ThirdParty/vtkm/vtk-m/vtkm/worklet/internal/
H A DClipTables.h19463 using EdgeVec = vtkm::Vec<vtkm::IdComponent, 2>;
19499 EdgeVec GetEdge(vtkm::Id shape, vtkm::Id edgeId) const in GetEdge()
19504 return EdgeVec(v1, v2); in GetEdge()
/dports/math/vtk9/VTK-9.1.0/ThirdParty/vtkm/vtkvtkm/vtk-m/vtkm/worklet/clip/
H A DClipTables.h2469 using EdgeVec = vtkm::IdComponent2;
2505 EdgeVec GetEdge(vtkm::Id shape, vtkm::Id edgeId) const in GetEdge()
2510 return EdgeVec(v1, v2); in GetEdge()
/dports/graphics/opensubdiv/OpenSubdiv-3_4_4/tutorials/far/tutorial_3_1/
H A Dhbr_to_vtr.h198 EdgeVec * edges = const_cast<EdgeVec *>(&_edgeids); in FinishEdgeMap()
229 typedef std::vector<OpenSubdiv::HbrHalfedge<T> const *> EdgeVec; typedef
240 EdgeVec _edgeids;
/dports/math/clasp/clasp-3.3.5/clasp/
H A Dlogic_program_types.h187 typedef bk_lib::pod_vector<PrgEdge> EdgeVec; typedef
303 void clearSupports(EdgeVec& to) { to.swap(supports_); clearSupports(); } in clearSupports()
324 EdgeVec supports_; // possible supports (body or disjunction)
535 EdgeVec* largeHead() const { return headData_.ext; } in largeHead()
550 EdgeVec* ext;
/dports/math/clingo/clingo-5.5.1/clasp/clasp/
H A Dlogic_program_types.h187 typedef bk_lib::pod_vector<PrgEdge> EdgeVec; typedef
303 void clearSupports(EdgeVec& to) { to.swap(supports_); clearSupports(); } in clearSupports()
324 EdgeVec supports_; // possible supports (body or disjunction)
535 EdgeVec* largeHead() const { return headData_.ext; } in largeHead()
550 EdgeVec* ext;
/dports/math/clingo/clingo-5.5.1/clasp/clasp-da10954/clasp/
H A Dlogic_program_types.h187 typedef bk_lib::pod_vector<PrgEdge> EdgeVec; typedef
303 void clearSupports(EdgeVec& to) { to.swap(supports_); clearSupports(); } in clearSupports()
324 EdgeVec supports_; // possible supports (body or disjunction)
535 EdgeVec* largeHead() const { return headData_.ext; } in largeHead()
550 EdgeVec* ext;
/dports/math/clasp/clasp-3.3.5/src/
H A Dlogic_program_types.cpp412 struct X { uint64 x; EdgeVec y; uint32 z; }; in PrgHead()
445 EdgeVec::iterator it,n,j= supports_.begin(); in simplifySupports()
511 EdgeVec temp; temp.swap(supports_); in backpropagate()
618 EdgeVec temp; temp.swap(supports_); in propagateValue()
619 EdgeVec::iterator j = temp.begin(); in propagateValue()
638 EdgeVec::iterator j = supports_.begin(); in addConstraints()
641 for (EdgeVec::iterator it = supports_.begin(); it != supports_.end(); ++it) { in addConstraints()
798 EdgeVec* t = new EdgeVec(heads_begin(), heads_end()); in addHead()
1369 EdgeVec temp; temp.swap(supports_); in detach()
1388 EdgeVec temp; in propagateAssigned()
[all …]
/dports/math/clingo/clingo-5.5.1/clasp/clasp-da10954/src/
H A Dlogic_program_types.cpp412 struct X { uint64 x; EdgeVec y; uint32 z; }; in PrgHead()
445 EdgeVec::iterator it,n,j= supports_.begin(); in simplifySupports()
511 EdgeVec temp; temp.swap(supports_); in backpropagate()
618 EdgeVec temp; temp.swap(supports_); in propagateValue()
619 EdgeVec::iterator j = temp.begin(); in propagateValue()
638 EdgeVec::iterator j = supports_.begin(); in addConstraints()
641 for (EdgeVec::iterator it = supports_.begin(); it != supports_.end(); ++it) { in addConstraints()
798 EdgeVec* t = new EdgeVec(heads_begin(), heads_end()); in addHead()
1369 EdgeVec temp; temp.swap(supports_); in detach()
1388 EdgeVec temp; in propagateAssigned()
[all …]
/dports/math/clingo/clingo-5.5.1/clasp/src/
H A Dlogic_program_types.cpp412 struct X { uint64 x; EdgeVec y; uint32 z; }; in PrgHead()
445 EdgeVec::iterator it,n,j= supports_.begin(); in simplifySupports()
511 EdgeVec temp; temp.swap(supports_); in backpropagate()
618 EdgeVec temp; temp.swap(supports_); in propagateValue()
619 EdgeVec::iterator j = temp.begin(); in propagateValue()
638 EdgeVec::iterator j = supports_.begin(); in addConstraints()
641 for (EdgeVec::iterator it = supports_.begin(); it != supports_.end(); ++it) { in addConstraints()
798 EdgeVec* t = new EdgeVec(heads_begin(), heads_end()); in addHead()
1369 EdgeVec temp; temp.swap(supports_); in detach()
1388 EdgeVec temp; in propagateAssigned()
[all …]
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/plugins_unsupported/editrgbtri/
H A DmodButterfly.h62 typedef std::vector<EdgeType> EdgeVec; typedef
H A DcontrolPoint.h62 typedef std::vector<EdgeType> EdgeVec; typedef
H A DinteractiveEdit.h145 typedef std::vector<EdgeType> EdgeVec; typedef
H A DrgbPrimitives.h67 typedef std::vector<EdgeType> EdgeVec; typedef
/dports/science/elmerfem/elmerfem-release-9.0/fem/src/modules/
H A DVectorHelmholtz.F90367 REAL(KIND=dp) :: Source(3),Coord(3),Coord0(3),EdgeVec(3),MinCoord(3) local
428 EdgeVec(1) = Nodes % x(1) - Nodes % x(2)
429 EdgeVec(2) = Nodes % y(1) - Nodes % y(2)
430 EdgeVec(3) = Nodes % z(1) - Nodes % z(2)
432 EdgeLen = SQRT( SUM( EdgeVec**2 ) )
435 DotProd = SUM(EdgeVec*Source) / EdgeLen
/dports/graphics/wdune/wdune-1.926/vcglib/vcg/complex/algorithms/
H A Dvoronoi_processing.h513 std::vector< typename tri::UpdateTopology<MeshType>::PEdge> EdgeVec; in ConvertVoronoiDiagramToMesh() local
543 tri::UpdateTopology<MeshType>::FillUniqueEdgeVector(outMesh,EdgeVec,false); in ConvertVoronoiDiagramToMesh()
547 for(size_t i=0;i<EdgeVec.size();++i) in ConvertVoronoiDiagramToMesh()
549 size_t e0 = tri::Index(outMesh,EdgeVec[i].v[0]); in ConvertVoronoiDiagramToMesh()
550 size_t e1 = tri::Index(outMesh,EdgeVec[i].v[1]); in ConvertVoronoiDiagramToMesh()
809 std::vector< typename tri::UpdateTopology<MeshType>::PEdge> EdgeVec; in ConvertVoronoiDiagramToMeshOld() local
810 tri::UpdateTopology<MeshType>::FillUniqueEdgeVector(outMesh,EdgeVec,false); in ConvertVoronoiDiagramToMeshOld()
813 for(size_t i=0;i<EdgeVec.size();++i) in ConvertVoronoiDiagramToMeshOld()
815 size_t e0 = tri::Index(outMesh,EdgeVec[i].v[0]); in ConvertVoronoiDiagramToMeshOld()
816 size_t e1 = tri::Index(outMesh,EdgeVec[i].v[1]); in ConvertVoronoiDiagramToMeshOld()
/dports/devel/vcglib/vcglib-2020.09/vcg/complex/algorithms/
H A Dvoronoi_processing.h499 std::vector< typename tri::UpdateTopology<MeshType>::PEdge> EdgeVec; in ConvertVoronoiDiagramToMesh() local
529 tri::UpdateTopology<MeshType>::FillUniqueEdgeVector(outMesh,EdgeVec,false); in ConvertVoronoiDiagramToMesh()
533 for(size_t i=0;i<EdgeVec.size();++i) in ConvertVoronoiDiagramToMesh()
535 size_t e0 = tri::Index(outMesh,EdgeVec[i].v[0]); in ConvertVoronoiDiagramToMesh()
536 size_t e1 = tri::Index(outMesh,EdgeVec[i].v[1]); in ConvertVoronoiDiagramToMesh()
795 std::vector< typename tri::UpdateTopology<MeshType>::PEdge> EdgeVec; in ConvertVoronoiDiagramToMeshOld() local
796 tri::UpdateTopology<MeshType>::FillUniqueEdgeVector(outMesh,EdgeVec,false); in ConvertVoronoiDiagramToMeshOld()
799 for(size_t i=0;i<EdgeVec.size();++i) in ConvertVoronoiDiagramToMeshOld()
801 size_t e0 = tri::Index(outMesh,EdgeVec[i].v[0]); in ConvertVoronoiDiagramToMeshOld()
802 size_t e1 = tri::Index(outMesh,EdgeVec[i].v[1]); in ConvertVoronoiDiagramToMeshOld()
/dports/biology/lamarc/lamarc-2.1.8/boost/graph/detail/
H A Dadjacency_list.hpp305 template <class Vertex, class EdgeVec, class Property>
309 typedef typename EdgeVec::iterator Iter;
314 EdgeVec* edge_vec = 0) in stored_ra_edge_iter()
323 EdgeVec* m_vec;
344 template <class Tag, class Vertex, class EdgeVec, class Property>
347 const detail::stored_ra_edge_iter<Vertex, EdgeVec, Property>& e) in get() argument
/dports/devel/boost-docs/boost_1_72_0/boost/graph/detail/
H A Dadjacency_list.hpp356 template <class Vertex, class EdgeVec, class Property>
360 typedef typename EdgeVec::iterator Iter;
366 inline stored_ra_edge_iter(Vertex v, Iter i, EdgeVec* edge_vec) in stored_ra_edge_iter()
376 EdgeVec* m_vec;
397 template <class Tag, class Vertex, class EdgeVec, class Property>
400 const detail::stored_ra_edge_iter<Vertex, EdgeVec, Property>& e) in get() argument
/dports/devel/hyperscan/boost_1_75_0/boost/graph/detail/
H A Dadjacency_list.hpp368 template < class Vertex, class EdgeVec, class Property >
371 typedef typename EdgeVec::iterator Iter;
381 inline stored_ra_edge_iter(Vertex v, Iter i, EdgeVec* edge_vec) in stored_ra_edge_iter()
403 EdgeVec* m_vec;
422 template < class Tag, class Vertex, class EdgeVec, class Property >
424 const detail::stored_ra_edge_iter< Vertex, EdgeVec, Property >& e) in get() argument
/dports/devel/boost-python-libs/boost_1_72_0/boost/graph/detail/
H A Dadjacency_list.hpp356 template <class Vertex, class EdgeVec, class Property>
360 typedef typename EdgeVec::iterator Iter;
366 inline stored_ra_edge_iter(Vertex v, Iter i, EdgeVec* edge_vec) in stored_ra_edge_iter()
376 EdgeVec* m_vec;
397 template <class Tag, class Vertex, class EdgeVec, class Property>
400 const detail::stored_ra_edge_iter<Vertex, EdgeVec, Property>& e) in get() argument
/dports/devel/R-cran-BH/BH/inst/include/boost/graph/detail/
H A Dadjacency_list.hpp369 template < class Vertex, class EdgeVec, class Property >
372 typedef typename EdgeVec::iterator Iter;
382 inline stored_ra_edge_iter(Vertex v, Iter i, EdgeVec* edge_vec) in stored_ra_edge_iter()
404 EdgeVec* m_vec;
423 template < class Tag, class Vertex, class EdgeVec, class Property >
425 const detail::stored_ra_edge_iter< Vertex, EdgeVec, Property >& e) in get() argument

123