| /dports/graphics/urho3d/Urho3D-1.7.1/Source/Urho3D/Math/ |
| H A D | Frustum.cpp | 74 vertices_[i] = rhs.vertices_[i]; in operator =()
180 vertices_[i] = transform * vertices_[i]; in Transform()
188 vertices_[i] = transform * vertices_[i]; in Transform()
197 transformed.vertices_[i] = transform * vertices_[i]; in Transformed()
207 transformed.vertices_[i] = transform * vertices_[i]; in Transformed()
231 planes_[PLANE_NEAR].Define(vertices_[2], vertices_[1], vertices_[0]); in UpdatePlanes()
232 planes_[PLANE_LEFT].Define(vertices_[3], vertices_[7], vertices_[6]); in UpdatePlanes()
233 planes_[PLANE_RIGHT].Define(vertices_[1], vertices_[5], vertices_[4]); in UpdatePlanes()
234 planes_[PLANE_UP].Define(vertices_[0], vertices_[4], vertices_[7]); in UpdatePlanes()
235 planes_[PLANE_DOWN].Define(vertices_[6], vertices_[5], vertices_[1]); in UpdatePlanes()
[all …]
|
| /dports/multimedia/zoneminder/zoneminder-1.36.5/src/ |
| H A D | zm_poly.cpp | 32 if (vertices_.empty()) in UpdateExtent()
51 for (size_t i = 0, j = vertices_.size() - 1; i < vertices_.size(); j = i++) { in UpdateArea()
52 …double trap_area = ((vertices_[i].x_ - vertices_[j].x_) * ((vertices_[i].y_ + vertices_[j].y_))) /… in UpdateArea()
65 for (size_t i = 0, j = vertices_.size() - 1; i < vertices_.size(); j = i++) { in UpdateCentre()
66 float_x += ((vertices_[i].y_ - vertices_[j].y_) in UpdateCentre()
67 * ((vertices_[i].x_ * 2) + (vertices_[i].x_ * vertices_[j].x_) + (vertices_[j].x_ * 2))); in UpdateCentre()
68 float_y += ((vertices_[j].x_ - vertices_[i].x_) in UpdateCentre()
69 * ((vertices_[i].y_ * 2) + (vertices_[i].y_ * vertices_[j].y_) + (vertices_[j].y_ * 2))); in UpdateCentre()
79 for (size_t i = 0, j = vertices_.size() - 1; i < vertices_.size(); j = i++) { in Contains()
80 …if ((((vertices_[i].y_ <= coord.y_) && (coord.y_ < vertices_[j].y_)) || ((vertices_[j].y_ <= coord… in Contains()
[all …]
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/apps/in_hand_scanner/src/ |
| H A D | visibility_confidence.cpp | 46 vertices_.col ( 0) = Eigen::Vector4f (-0.000000119f, 0.000000000f, 1.000000000f, 0.f); in Dome()
47 vertices_.col ( 1) = Eigen::Vector4f ( 0.894427180f, 0.000000000f, 0.447213739f, 0.f); in Dome()
48 vertices_.col ( 2) = Eigen::Vector4f ( 0.276393145f, 0.850650907f, 0.447213650f, 0.f); in Dome()
49 vertices_.col ( 3) = Eigen::Vector4f (-0.723606884f, 0.525731146f, 0.447213531f, 0.f); in Dome()
50 vertices_.col ( 4) = Eigen::Vector4f (-0.723606884f, -0.525731146f, 0.447213531f, 0.f); in Dome()
51 vertices_.col ( 5) = Eigen::Vector4f ( 0.276393145f, -0.850650907f, 0.447213650f, 0.f); in Dome()
52 vertices_.col ( 6) = Eigen::Vector4f ( 0.343278527f, 0.000000000f, 0.939233720f, 0.f); in Dome()
53 vertices_.col ( 7) = Eigen::Vector4f ( 0.686557174f, 0.000000000f, 0.727075875f, 0.f); in Dome()
78 for (Eigen::Index i=0; i < vertices_.cols (); ++i) in Dome()
80 vertices_.col (i).head <3> ().normalize (); in Dome()
[all …]
|
| /dports/science/votca/votca-2021.2-18560-gfbe18d971/tools/src/libtools/ |
| H A D | edge.cc | 39 return vertices_.back(); in getOtherEndPoint()
41 return vertices_.front(); in getOtherEndPoint()
46 return (vertices_.front() == ID || vertices_.back() == ID); in contains()
50 if (this->vertices_.front() == ed.vertices_.front() && in operator ==()
51 this->vertices_.back() == ed.vertices_.back()) { in operator ==()
54 if (this->vertices_.back() == ed.vertices_.front() && in operator ==()
55 this->vertices_.front() == ed.vertices_.back()) { in operator ==()
64 if (this->vertices_.front() < ed.vertices_.front()) { in operator <()
67 if (this->vertices_.front() > ed.vertices_.front()) { in operator <()
70 if (this->vertices_.back() < ed.vertices_.back()) { in operator <()
[all …]
|
| H A D | reducededge.cc | 113 vertices_ = vertices; in ReducedEdge()
119 Edge ed(vertices_.at(index), vertices_.at(index + 1)); in expand()
127 find(vertices_.begin(), vertices_.end(), vertex); in vertexExistInChain()
132 if (edge.vertices_.size() != vertices_.size()) { in operator ==()
136 if (vertices_.at(index) != edge.vertices_.at(index)) { in operator ==()
148 if (this->vertices_.front() < edge.vertices_.front()) { in operator <()
151 if (this->vertices_.front() > edge.vertices_.front()) { in operator <()
154 if (this->vertices_.back() < edge.vertices_.back()) { in operator <()
157 if (vertices_.size() < edge.vertices_.size()) { in operator <()
161 if (vertices_.at(index) > edge.vertices_.at(index)) { in operator <()
[all …]
|
| /dports/science/votca/votca-2021.2-18560-gfbe18d971/tools/tools-9c102e0/src/libtools/ |
| H A D | edge.cc | 39 return vertices_.back(); in getOtherEndPoint()
41 return vertices_.front(); in getOtherEndPoint()
46 return (vertices_.front() == ID || vertices_.back() == ID); in contains()
50 if (this->vertices_.front() == ed.vertices_.front() && in operator ==()
51 this->vertices_.back() == ed.vertices_.back()) { in operator ==()
54 if (this->vertices_.back() == ed.vertices_.front() && in operator ==()
55 this->vertices_.front() == ed.vertices_.back()) { in operator ==()
64 if (this->vertices_.front() < ed.vertices_.front()) { in operator <()
67 if (this->vertices_.front() > ed.vertices_.front()) { in operator <()
70 if (this->vertices_.back() < ed.vertices_.back()) { in operator <()
[all …]
|
| H A D | reducededge.cc | 113 vertices_ = vertices; in ReducedEdge()
119 Edge ed(vertices_.at(index), vertices_.at(index + 1)); in expand()
127 find(vertices_.begin(), vertices_.end(), vertex); in vertexExistInChain()
132 if (edge.vertices_.size() != vertices_.size()) { in operator ==()
136 if (vertices_.at(index) != edge.vertices_.at(index)) { in operator ==()
148 if (this->vertices_.front() < edge.vertices_.front()) { in operator <()
151 if (this->vertices_.front() > edge.vertices_.front()) { in operator <()
154 if (this->vertices_.back() < edge.vertices_.back()) { in operator <()
157 if (vertices_.size() < edge.vertices_.size()) { in operator <()
161 if (vertices_.at(index) > edge.vertices_.at(index)) { in operator <()
[all …]
|
| /dports/www/firefox-esr/firefox-91.8.0/gfx/harfbuzz/src/ |
| H A D | hb-repacker.hh | 162 vertices_.fini_deep (); in ~graph_t()
186 return vertices_[i].obj; in object()
198 size_t size = vertices_[i].obj.tail - vertices_[i].obj.head; in serialize()
264 vertices_.fini_deep (); in sort_kahn()
265 vertices_ = sorted_graph; in sort_kahn()
326 vertices_.fini_deep (); in sort_shortest_distance()
327 vertices_ = sorted_graph; in sort_shortest_distance()
346 if (vertices_.in_error () in duplicate()
377 vertex_t root = vertices_[vertices_.length - 2]; in duplicate()
378 vertices_[vertices_.length - 2] = *clone; in duplicate()
[all …]
|
| /dports/www/lagrange/lagrange-1.7.3/lib/harfbuzz/src/ |
| H A D | hb-repacker.hh | 162 vertices_.fini_deep (); in ~graph_t()
186 return vertices_[i].obj; in object()
198 size_t size = vertices_[i].obj.tail - vertices_[i].obj.head; in serialize()
264 vertices_.fini_deep (); in sort_kahn()
265 vertices_ = sorted_graph; in sort_kahn()
326 vertices_.fini_deep (); in sort_shortest_distance()
327 vertices_ = sorted_graph; in sort_shortest_distance()
346 if (vertices_.in_error () in duplicate()
377 vertex_t root = vertices_[vertices_.length - 2]; in duplicate()
378 vertices_[vertices_.length - 2] = *clone; in duplicate()
[all …]
|
| /dports/mail/thunderbird/thunderbird-91.8.0/gfx/harfbuzz/src/ |
| H A D | hb-repacker.hh | 162 vertices_.fini_deep (); in ~graph_t()
186 return vertices_[i].obj; in object()
198 size_t size = vertices_[i].obj.tail - vertices_[i].obj.head; in serialize()
264 vertices_.fini_deep (); in sort_kahn()
265 vertices_ = sorted_graph; in sort_kahn()
326 vertices_.fini_deep (); in sort_shortest_distance()
327 vertices_ = sorted_graph; in sort_shortest_distance()
346 if (vertices_.in_error () in duplicate()
377 vertex_t root = vertices_[vertices_.length - 2]; in duplicate()
378 vertices_[vertices_.length - 2] = *clone; in duplicate()
[all …]
|
| /dports/www/firefox/firefox-99.0/gfx/harfbuzz/src/ |
| H A D | hb-repacker.hh | 176 vertices_.fini (); in ~graph_t()
182 vertices_.in_error () || in in_error()
196 return vertices_.length - 1; in root_idx()
201 return vertices_[i].obj; in object()
221 size_t size = vertices_[i].obj.tail - vertices_[i].obj.head; in serialize()
257 if (vertices_.length <= 1) { in sort_kahn()
310 if (vertices_.length <= 1) { in sort_shortest_distance()
571 vertex_t root = vertices_[vertices_.length - 2]; in duplicate()
573 vertices_[vertices_.length - 1] = root; in duplicate()
770 size_t size = vertices_[i].obj.tail - vertices_[i].obj.head; in serialized_length()
[all …]
|
| /dports/print/harfbuzz/harfbuzz-3.4.0/src/ |
| H A D | hb-repacker.hh | 176 vertices_.fini (); in ~graph_t()
182 vertices_.in_error () || in in_error()
196 return vertices_.length - 1; in root_idx()
201 return vertices_[i].obj; in object()
221 size_t size = vertices_[i].obj.tail - vertices_[i].obj.head; in serialize()
257 if (vertices_.length <= 1) { in sort_kahn()
310 if (vertices_.length <= 1) { in sort_shortest_distance()
571 vertex_t root = vertices_[vertices_.length - 2]; in duplicate()
573 vertices_[vertices_.length - 1] = root; in duplicate()
770 size_t size = vertices_[i].obj.tail - vertices_[i].obj.head; in serialized_length()
[all …]
|
| /dports/print/harfbuzz-icu/harfbuzz-3.4.0/src/ |
| H A D | hb-repacker.hh | 176 vertices_.fini (); in ~graph_t()
182 vertices_.in_error () || in in_error()
196 return vertices_.length - 1; in root_idx()
201 return vertices_[i].obj; in object()
221 size_t size = vertices_[i].obj.tail - vertices_[i].obj.head; in serialize()
257 if (vertices_.length <= 1) { in sort_kahn()
310 if (vertices_.length <= 1) { in sort_shortest_distance()
571 vertex_t root = vertices_[vertices_.length - 2]; in duplicate()
573 vertices_[vertices_.length - 1] = root; in duplicate()
770 size_t size = vertices_[i].obj.tail - vertices_[i].obj.head; in serialized_length()
[all …]
|
| /dports/print/harfbuzz-hb-view/harfbuzz-3.4.0/src/ |
| H A D | hb-repacker.hh | 176 vertices_.fini (); in ~graph_t()
182 vertices_.in_error () || in in_error()
196 return vertices_.length - 1; in root_idx()
201 return vertices_[i].obj; in object()
221 size_t size = vertices_[i].obj.tail - vertices_[i].obj.head; in serialize()
257 if (vertices_.length <= 1) { in sort_kahn()
310 if (vertices_.length <= 1) { in sort_shortest_distance()
571 vertex_t root = vertices_[vertices_.length - 2]; in duplicate()
573 vertices_[vertices_.length - 1] = root; in duplicate()
770 size_t size = vertices_[i].obj.tail - vertices_[i].obj.head; in serialized_length()
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bmsh3d/ |
| H A D | bmsh3d_edge.h | 68 vertices_[0] = sv; in bmsh3d_edge()
69 vertices_[1] = ev; in bmsh3d_edge()
97 if (vertices_[0] == V) in other_V()
98 return vertices_[1]; in other_V()
100 if (vertices_[1] == V) in other_V()
106 return vertices_[0] == V || vertices_[1] == V; in is_V_incident()
109 return (vertices_[0] == V0 && vertices_[1] == V1) in both_Vs_incident()
110 || (vertices_[0] == V1 && vertices_[1] == V0); in both_Vs_incident()
112 bool is_self_loop() const { return vertices_[0] == vertices_[1]; } in is_self_loop()
143 vertices_[0] = vertices_[1]; in switch_s_e_vertex()
[all …]
|
| /dports/graphics/urho3d/Urho3D-1.7.1/Source/Urho3D/Graphics/ |
| H A D | CustomGeometry.cpp | 215 vertices_.Clear(); in Clear()
223 vertices_.Resize(num); in SetNumGeometries()
251 vertices_[index].Clear(); in BeginGeometry()
263 vertices_[geometryIndex_].Resize(vertices_[geometryIndex_].Size() + 1); in DefineVertex()
269 if (vertices_.Size() < geometryIndex_ || vertices_[geometryIndex_].Empty()) in DefineNormal()
278 if (vertices_.Size() < geometryIndex_ || vertices_[geometryIndex_].Empty()) in DefineColor()
287 if (vertices_.Size() < geometryIndex_ || vertices_[geometryIndex_].Empty()) in DefineTexCoord()
296 if (vertices_.Size() < geometryIndex_ || vertices_[geometryIndex_].Empty()) in DefineTangent()
314 vertices_[index].Resize(numVertices); in DefineGeometry()
437 return index < vertices_.Size() ? vertices_[index].Size() : 0; in GetNumVertices()
[all …]
|
| /dports/graphics/blender/blender-2.91.0/extern/ceres/internal/ceres/ |
| H A D | graph.h | 61 if (vertices_.find(vertex) == vertices_.end()) { in RemoveVertex()
65 vertices_.erase(vertex); in RemoveVertex()
82 DCHECK(vertices_.find(vertex1) != vertices_.end()); in AddEdge()
83 DCHECK(vertices_.find(vertex2) != vertices_.end()); in AddEdge()
97 return vertices_; in vertices()
115 if (vertices_.find(vertex) == vertices_.end()) { in AddVertex()
129 if (vertices_.find(vertex) == vertices_.end()) { in RemoveVertex()
133 vertices_.erase(vertex); in RemoveVertex()
156 DCHECK(vertices_.find(vertex1) != vertices_.end()); in AddEdge()
157 DCHECK(vertices_.find(vertex2) != vertices_.end()); in AddEdge()
[all …]
|
| /dports/misc/openmvg/openMVG-2.0/src/third_party/ceres-solver/internal/ceres/ |
| H A D | graph.h | 61 if (vertices_.find(vertex) == vertices_.end()) { in RemoveVertex()
65 vertices_.erase(vertex); in RemoveVertex()
83 DCHECK(vertices_.find(vertex1) != vertices_.end()); in AddEdge()
84 DCHECK(vertices_.find(vertex2) != vertices_.end()); in AddEdge()
98 return vertices_; in vertices()
102 HashSet<Vertex> vertices_;
118 if (vertices_.find(vertex) == vertices_.end()) { in AddVertex()
132 if (vertices_.find(vertex) == vertices_.end()) { in RemoveVertex()
160 DCHECK(vertices_.find(vertex1) != vertices_.end()); in AddEdge()
161 DCHECK(vertices_.find(vertex2) != vertices_.end()); in AddEdge()
[all …]
|
| /dports/math/ceres-solver/ceres-solver-2.0.0/internal/ceres/ |
| H A D | graph.h | 62 if (vertices_.find(vertex) == vertices_.end()) { in RemoveVertex()
66 vertices_.erase(vertex); in RemoveVertex()
83 DCHECK(vertices_.find(vertex1) != vertices_.end()); in AddEdge()
84 DCHECK(vertices_.find(vertex2) != vertices_.end()); in AddEdge()
100 std::unordered_set<Vertex> vertices_;
114 if (vertices_.find(vertex) == vertices_.end()) { in AddVertex()
115 vertices_.insert(vertex); in AddVertex()
126 if (vertices_.find(vertex) == vertices_.end()) { in RemoveVertex()
130 vertices_.erase(vertex); in RemoveVertex()
153 DCHECK(vertices_.find(vertex1) != vertices_.end()); in AddEdge()
[all …]
|
| /dports/graphics/open3d/Open3D-0.2/src/Core/Geometry/ |
| H A D | TriangleMesh.cpp | 40 vertices_.clear(); in Clear()
54 auto itr_x = std::min_element(vertices_.begin(), vertices_.end(), in GetMinBound()
56 auto itr_y = std::min_element(vertices_.begin(), vertices_.end(), in GetMinBound()
58 auto itr_z = std::min_element(vertices_.begin(), vertices_.end(), in GetMinBound()
68 auto itr_x = std::max_element(vertices_.begin(), vertices_.end(), in GetMaxBound()
70 auto itr_y = std::max_element(vertices_.begin(), vertices_.end(), in GetMaxBound()
72 auto itr_z = std::max_element(vertices_.begin(), vertices_.end(), in GetMaxBound()
122 vertices_[old_vert_num + i] = mesh.vertices_[i]; in operator +=()
196 Coordinate3 coord = std::make_tuple(vertices_[i](0), vertices_[i](1), in RemoveDuplicatedVertices()
200 vertices_[k] = vertices_[i]; in RemoveDuplicatedVertices()
[all …]
|
| /dports/graphics/py-open3d-python/Open3D-0.2/src/Core/Geometry/ |
| H A D | TriangleMesh.cpp | 40 vertices_.clear(); in Clear()
54 auto itr_x = std::min_element(vertices_.begin(), vertices_.end(), in GetMinBound()
56 auto itr_y = std::min_element(vertices_.begin(), vertices_.end(), in GetMinBound()
58 auto itr_z = std::min_element(vertices_.begin(), vertices_.end(), in GetMinBound()
68 auto itr_x = std::max_element(vertices_.begin(), vertices_.end(), in GetMaxBound()
70 auto itr_y = std::max_element(vertices_.begin(), vertices_.end(), in GetMaxBound()
72 auto itr_z = std::max_element(vertices_.begin(), vertices_.end(), in GetMaxBound()
122 vertices_[old_vert_num + i] = mesh.vertices_[i]; in operator +=()
196 Coordinate3 coord = std::make_tuple(vertices_[i](0), vertices_[i](1), in RemoveDuplicatedVertices()
200 vertices_[k] = vertices_[i]; in RemoveDuplicatedVertices()
[all …]
|
| /dports/print/lyx/lyx-2.3.4.2/src/ |
| H A D | Graph.cpp | 41 if (!vertices_[s].visited) { in bfs_init()
43 vertices_[s].visited = true; in bfs_init()
73 if (!vertices_[cv].visited) { in getReachableTo()
74 vertices_[cv].visited = true; in getReachableTo()
112 if (!vertices_[cv].visited) { in getReachable()
113 vertices_[cv].visited = true; in getReachable()
145 if (!vertices_[cv].visited) { in isReachable()
146 vertices_[cv].visited = true; in isReachable()
166 pathes.resize(vertices_.size()); in getPath()
177 if (!vertices_[cv].visited) { in getPath()
[all …]
|
| /dports/math/openturns/openturns-1.18/lib/src/Base/Geom/ |
| H A D | Mesh.cxx | 110 return vertices_; in getVertices()
115 vertices_ = vertices; in setVertices()
116 …if (vertices_.getDescription().isBlank()) vertices_.setDescription(Description::BuildDefault(verti… in setVertices()
124 return vertices_[index]; in getVertex()
130 vertices_[index] = vertex; in setVertex()
269 return vertices_.getSize(); in getVerticesNumber()
395 const Scalar step = vertices_(simplices_(0, 1), 0) - vertices_(simplices_(0, 0), 0); in isRegular()
408 return vertices_.getMin(); in getLowerBound()
414 return vertices_.getMax(); in getUpperBound()
432 if (vertices_(*(cit + 1), 0) < vertices_(*cit, 0)) std::swap(*cit, *(cit + 1)); in fixOrientation()
[all …]
|
| /dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/src/geometry/subdivision/subUtil/ |
| H A D | Tetrahedron.cpp | 58 vertices_[0] = rV1; in Tetrahedron()
59 vertices_[1] = rV2; in Tetrahedron()
60 vertices_[2] = rV3; in Tetrahedron()
61 vertices_[3] = rV4; in Tetrahedron()
85 Vect V1(listV[vertices_[3]].geomPt(),listV[vertices_[0]].geomPt()); in volume()
86 Vect V2(listV[vertices_[3]].geomPt(),listV[vertices_[1]].geomPt()); in volume()
87 Vect V3(listV[vertices_[3]].geomPt(),listV[vertices_[2]].geomPt()); in volume()
98 Vect V2(listV[vertices_[3]].geomPt(),listV[vertices_[2]].geomPt()); in inRadius()
104 V1=Vect(listV[vertices_[2]].geomPt(),listV[vertices_[0]].geomPt()); in inRadius()
105 V2=Vect(listV[vertices_[2]].geomPt(),listV[vertices_[1]].geomPt()); in inRadius()
[all …]
|
| /dports/graphics/R-cran-s2/s2/src/s2/ |
| H A D | s2lax_polygon_shape.cc | 76 vertices_ = nullptr; in Init()
124 return vertices_[j]; in loop_vertex()
156 vertices_ = nullptr; in Init()
193 return Edge(vertices_[e0], vertices_[e1]); in edge()
216 return Edge(vertices_[j], vertices_[k]); in chain_edge()
219 return Edge(vertices_[base + j], vertices_[base + k]); in chain_edge()
259 return vertices_.size(); in num_vertices()
278 return vertices_[j]; in loop_vertex()
303 return Edge(vertices_[e], vertices_[e1]); in edge()
326 return Edge(vertices_[j], vertices_[k]); in chain_edge()
[all …]
|