| /dports/misc/vxl/vxl-3.3.2/contrib/prip/vdtop/ |
| H A D | vdtop_neighborhood.h | 33 neighbors_[0]=tmp ; in set_center()
35 neighbors_[1]=tmp ; in set_center()
37 neighbors_[2]=tmp ; in set_center()
39 neighbors_[3]=tmp ; in set_center()
41 neighbors_[4]=tmp ; in set_center()
43 neighbors_[5]=tmp ; in set_center()
45 neighbors_[6]=tmp ; in set_center()
47 neighbors_[7]=tmp ; in set_center()
52 return neighbors_ ; in begin()
82 neighbors_[0]=tmp ; in set_center()
[all …]
|
| /dports/cad/repsnapper/repsnapper-2.5a4/libraries/poly2tri/poly2tri/poly2tri/common/ |
| H A D | shapes.cc | 39 neighbors_[0] = NULL; neighbors_[1] = NULL; neighbors_[2] = NULL; in Triangle()
49 neighbors_[0] = t; in MarkNeighbor()
51 neighbors_[1] = t; in MarkNeighbor()
53 neighbors_[2] = t; in MarkNeighbor()
62 neighbors_[0] = &t; in MarkNeighbor()
65 neighbors_[1] = &t; in MarkNeighbor()
68 neighbors_[2] = &t; in MarkNeighbor()
109 neighbors_[0] = NULL; in ClearNeighbors()
110 neighbors_[1] = NULL; in ClearNeighbors()
111 neighbors_[2] = NULL; in ClearNeighbors()
[all …]
|
| /dports/games/spring/spring_98.0/rts/lib/assimp/contrib/poly2tri/poly2tri/common/ |
| H A D | shapes.cc | 39 neighbors_[0] = NULL; neighbors_[1] = NULL; neighbors_[2] = NULL; in Triangle()
49 neighbors_[0] = t; in MarkNeighbor()
51 neighbors_[1] = t; in MarkNeighbor()
53 neighbors_[2] = t; in MarkNeighbor()
62 neighbors_[0] = &t; in MarkNeighbor()
65 neighbors_[1] = &t; in MarkNeighbor()
68 neighbors_[2] = &t; in MarkNeighbor()
109 neighbors_[0] = NULL; in ClearNeighbors()
110 neighbors_[1] = NULL; in ClearNeighbors()
111 neighbors_[2] = NULL; in ClearNeighbors()
[all …]
|
| /dports/devel/upp/upp/bazaar/plugin/assimp/contrib/poly2tri/poly2tri/common/ |
| H A D | shapes.cc | 39 neighbors_[0] = NULL; neighbors_[1] = NULL; neighbors_[2] = NULL; in Triangle()
49 neighbors_[0] = t; in MarkNeighbor()
51 neighbors_[1] = t; in MarkNeighbor()
53 neighbors_[2] = t; in MarkNeighbor()
62 neighbors_[0] = &t; in MarkNeighbor()
65 neighbors_[1] = &t; in MarkNeighbor()
68 neighbors_[2] = &t; in MarkNeighbor()
109 neighbors_[0] = NULL; in ClearNeighbors()
110 neighbors_[1] = NULL; in ClearNeighbors()
111 neighbors_[2] = NULL; in ClearNeighbors()
[all …]
|
| /dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Assimp/contrib/poly2tri/poly2tri/common/ |
| H A D | shapes.cc | 39 neighbors_[0] = NULL; neighbors_[1] = NULL; neighbors_[2] = NULL; in Triangle()
49 neighbors_[0] = t; in MarkNeighbor()
51 neighbors_[1] = t; in MarkNeighbor()
53 neighbors_[2] = t; in MarkNeighbor()
62 neighbors_[0] = &t; in MarkNeighbor()
65 neighbors_[1] = &t; in MarkNeighbor()
68 neighbors_[2] = &t; in MarkNeighbor()
109 neighbors_[0] = NULL; in ClearNeighbors()
110 neighbors_[1] = NULL; in ClearNeighbors()
111 neighbors_[2] = NULL; in ClearNeighbors()
[all …]
|
| /dports/graphics/wdune/wdune-1.926/src/ |
| H A D | shapes.cpp | 39 neighbors_[0] = NULL; neighbors_[1] = NULL; neighbors_[2] = NULL; in Triangle()
49 neighbors_[0] = t; in MarkNeighbor()
51 neighbors_[1] = t; in MarkNeighbor()
53 neighbors_[2] = t; in MarkNeighbor()
62 neighbors_[0] = &t; in MarkNeighbor()
65 neighbors_[1] = &t; in MarkNeighbor()
68 neighbors_[2] = &t; in MarkNeighbor()
109 neighbors_[0] = NULL; in ClearNeighbors()
110 neighbors_[1] = NULL; in ClearNeighbors()
111 neighbors_[2] = NULL; in ClearNeighbors()
[all …]
|
| /dports/multimedia/assimp/assimp-5.1.3/contrib/poly2tri/poly2tri/common/ |
| H A D | shapes.cc | 39 neighbors_[0] = NULL; neighbors_[1] = NULL; neighbors_[2] = NULL; in Triangle()
49 neighbors_[0] = t; in MarkNeighbor()
51 neighbors_[1] = t; in MarkNeighbor()
53 neighbors_[2] = t; in MarkNeighbor()
62 neighbors_[0] = &t; in MarkNeighbor()
65 neighbors_[1] = &t; in MarkNeighbor()
68 neighbors_[2] = &t; in MarkNeighbor()
109 neighbors_[0] = NULL; in ClearNeighbors()
110 neighbors_[1] = NULL; in ClearNeighbors()
111 neighbors_[2] = NULL; in ClearNeighbors()
[all …]
|
| /dports/games/doomsday/doomsday-2.3.1/doomsday/external/assimp/contrib/poly2tri/poly2tri/common/ |
| H A D | shapes.cc | 39 neighbors_[0] = NULL; neighbors_[1] = NULL; neighbors_[2] = NULL; in Triangle()
49 neighbors_[0] = t; in MarkNeighbor()
51 neighbors_[1] = t; in MarkNeighbor()
53 neighbors_[2] = t; in MarkNeighbor()
62 neighbors_[0] = &t; in MarkNeighbor()
65 neighbors_[1] = &t; in MarkNeighbor()
68 neighbors_[2] = &t; in MarkNeighbor()
109 neighbors_[0] = NULL; in ClearNeighbors()
110 neighbors_[1] = NULL; in ClearNeighbors()
111 neighbors_[2] = NULL; in ClearNeighbors()
[all …]
|
| /dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/poly2tri/common/ |
| H A D | shapes.cc | 45 neighbors_[0] = NULL; neighbors_[1] = NULL; neighbors_[2] = NULL; in Triangle()
55 neighbors_[0] = t; in MarkNeighbor()
57 neighbors_[1] = t; in MarkNeighbor()
59 neighbors_[2] = t; in MarkNeighbor()
68 neighbors_[0] = &t; in MarkNeighbor()
71 neighbors_[1] = &t; in MarkNeighbor()
74 neighbors_[2] = &t; in MarkNeighbor()
115 neighbors_[0] = NULL; in ClearNeighbors()
116 neighbors_[1] = NULL; in ClearNeighbors()
117 neighbors_[2] = NULL; in ClearNeighbors()
[all …]
|
| /dports/devel/qt5-location/kde-qtlocation-5.15.2p6/src/3rdparty/poly2tri/common/ |
| H A D | shapes.cpp | 39 neighbors_[0] = NULL; neighbors_[1] = NULL; neighbors_[2] = NULL; in Triangle()
49 neighbors_[0] = t; in MarkNeighbor()
51 neighbors_[1] = t; in MarkNeighbor()
53 neighbors_[2] = t; in MarkNeighbor()
62 neighbors_[0] = &t; in MarkNeighbor()
65 neighbors_[1] = &t; in MarkNeighbor()
68 neighbors_[2] = &t; in MarkNeighbor()
109 neighbors_[0] = NULL; in ClearNeighbors()
110 neighbors_[1] = NULL; in ClearNeighbors()
111 neighbors_[2] = NULL; in ClearNeighbors()
[all …]
|
| /dports/graphics/qt5-3d/kde-qt3d-5.15.2p39/src/3rdparty/assimp/contrib/poly2tri/poly2tri/common/ |
| H A D | shapes.cc | 39 neighbors_[0] = NULL; neighbors_[1] = NULL; neighbors_[2] = NULL; in Triangle()
49 neighbors_[0] = t; in MarkNeighbor()
51 neighbors_[1] = t; in MarkNeighbor()
53 neighbors_[2] = t; in MarkNeighbor()
62 neighbors_[0] = &t; in MarkNeighbor()
65 neighbors_[1] = &t; in MarkNeighbor()
68 neighbors_[2] = &t; in MarkNeighbor()
109 neighbors_[0] = NULL; in ClearNeighbors()
110 neighbors_[1] = NULL; in ClearNeighbors()
111 neighbors_[2] = NULL; in ClearNeighbors()
[all …]
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/octree/include/pcl/octree/ |
| H A D | octree_pointcloud_adjacency_container.h | 67 return (neighbors_.begin()); in cbegin()
72 return (neighbors_.end()); in cend()
78 return neighbors_.size(); in size()
93 return neighbors_.size(); in getNumNeighbors()
134 return (neighbors_.begin()); in begin()
139 return (neighbors_.end()); in end()
182 neighbors_.clear(); in reset()
193 neighbors_.push_back(neighbor); in addNeighbor()
202 for (iterator neighb_it = neighbors_.begin(); neighb_it != neighbors_.end(); in removeNeighbor()
217 neighbors_ = neighbor_arg; in setNeighbors()
[all …]
|
| /dports/math/poly2tri/poly2tri-e6e63dd29ef0805b3e40fe1832c2f1fe2307943a/poly2tri/common/ |
| H A D | shapes.cc | 45 neighbors_[0] = NULL; neighbors_[1] = NULL; neighbors_[2] = NULL; in Triangle()
55 neighbors_[0] = t; in MarkNeighbor()
57 neighbors_[1] = t; in MarkNeighbor()
59 neighbors_[2] = t; in MarkNeighbor()
68 neighbors_[0] = &t; in MarkNeighbor()
71 neighbors_[1] = &t; in MarkNeighbor()
74 neighbors_[2] = &t; in MarkNeighbor()
115 neighbors_[0] = NULL; in ClearNeighbors()
116 neighbors_[1] = NULL; in ClearNeighbors()
117 neighbors_[2] = NULL; in ClearNeighbors()
[all …]
|
| /dports/cad/horizon-eda/horizon-2.1.0/3rd_party/poly2tri/common/ |
| H A D | shapes.cpp | 45 neighbors_[0] = nullptr; neighbors_[1] = nullptr; neighbors_[2] = nullptr; in Triangle()
55 neighbors_[0] = t; in MarkNeighbor()
57 neighbors_[1] = t; in MarkNeighbor()
59 neighbors_[2] = t; in MarkNeighbor()
68 neighbors_[0] = &t; in MarkNeighbor()
71 neighbors_[1] = &t; in MarkNeighbor()
74 neighbors_[2] = &t; in MarkNeighbor()
87 t = neighbors_[i]; in Clear()
254 return neighbors_[2]; in NeighborAcross()
265 return neighbors_[0]; in NeighborCW()
[all …]
|
| /dports/graphics/qgis/qgis-3.22.3/external/poly2tri/common/ |
| H A D | shapes.cc | 49 neighbors_[0] = nullptr; neighbors_[1] = nullptr; neighbors_[2] = nullptr; in Triangle()
59 neighbors_[0] = t; in MarkNeighbor()
61 neighbors_[1] = t; in MarkNeighbor()
63 neighbors_[2] = t; in MarkNeighbor()
72 neighbors_[0] = &t; in MarkNeighbor()
75 neighbors_[1] = &t; in MarkNeighbor()
78 neighbors_[2] = &t; in MarkNeighbor()
91 t = neighbors_[i]; in Clear()
258 return neighbors_[2]; in NeighborAcross()
269 return neighbors_[0]; in NeighborCW()
[all …]
|
| /dports/graphics/qgis-ltr/qgis-3.16.16/external/poly2tri/common/ |
| H A D | shapes.cc | 45 neighbors_[0] = NULL; neighbors_[1] = NULL; neighbors_[2] = NULL; in Triangle()
55 neighbors_[0] = t; in MarkNeighbor()
57 neighbors_[1] = t; in MarkNeighbor()
59 neighbors_[2] = t; in MarkNeighbor()
68 neighbors_[0] = &t; in MarkNeighbor()
71 neighbors_[1] = &t; in MarkNeighbor()
74 neighbors_[2] = &t; in MarkNeighbor()
115 neighbors_[0] = NULL; in ClearNeighbors()
116 neighbors_[1] = NULL; in ClearNeighbors()
117 neighbors_[2] = NULL; in ClearNeighbors()
[all …]
|
| /dports/cad/meshlab/meshlab-Meshlab-2020.05/src/plugins_experimental/filter_segmentation/ |
| H A D | HC_Segmenter.cpp | 57 if (it == to->neighbors_.end()){ in clusterAddNeighbor()
100 for (I = c->neighbors_.begin(); I != c->neighbors_.end(); ++I){ in clusterMerge()
109 iter = cl->neighbors_.find(cl); in clusterMerge()
111 cl->neighbors_.erase(iter); in clusterMerge()
115 iter = cl->neighbors_.find(c); in clusterMerge()
117 cl->neighbors_.erase(iter); in clusterMerge()
129 if (itB != to->neighbors_.end() && itA != to->neighbors_.end()){ in clusterExchange()
132 to->neighbors_.erase(itB); in clusterExchange()
134 else if (itB != to->neighbors_.end() && itA == to->neighbors_.end()){ in clusterExchange()
138 to->neighbors_.erase(itB); in clusterExchange()
[all …]
|
| /dports/science/plumed/plumed2-2.7.2/src/tools/ |
| H A D | NeighborList.cpp | 73 neighbors_.clear(); in initialize()
75 neighbors_.push_back(getIndexPair(i)); in initialize()
99 neighbors_.clear(); in update()
158 neighbors_.resize(tot_size/2); in update()
180 AtomNumber index0=fullatomlist_[neighbors_[i].first]; in getReducedAtomList()
181 AtomNumber index1=fullatomlist_[neighbors_[i].second]; in getReducedAtomList()
204 return neighbors_.size(); in size()
208 return neighbors_[i]; in getClosePair()
213 …Aneigh=pair<AtomNumber,AtomNumber>(fullatomlist_[neighbors_[i].first],fullatomlist_[neighbors_[i].… in getClosePairAtomNumber()
220 if(neighbors_[i].first==index) neighbors.push_back(neighbors_[i].second); in getNeighbors()
[all …]
|
| /dports/math/vtk8/VTK-8.2.0/ThirdParty/diy2/vtkdiy2/include/vtkdiy2/ |
| H A D | link.hpp | 22 int size() const { return static_cast<int>(neighbors_.size()); } in size()
25 BlockID target(int i) const { return neighbors_[static_cast<size_t>(i)]; } in target()
30 void add_neighbor(const BlockID& block) { neighbors_.push_back(block); } in add_neighbor()
32 …signer) { for (unsigned i = 0; i < neighbors_.size(); ++i) { neighbors_[i].proc = assigner.r… in fix()
34 void swap(Link& other) { neighbors_.swap(other.neighbors_); } in swap()
37 neighbors() const { return neighbors_; } in neighbors()
39 neighbors() { return neighbors_; } in neighbors()
41 virtual void save(BinaryBuffer& bb) const { diy::save(bb, neighbors_); } in save()
42 virtual void load(BinaryBuffer& bb) { diy::load(bb, neighbors_); } in load()
47 Neighbors neighbors_; member in diy::Link
[all …]
|
| /dports/graphics/gegl/gegl-0.4.34/subprojects/poly2tri-c/poly2tri-c/p2t/common/ |
| H A D | shapes.c | 150 THIS->neighbors_[0] = NULL; in p2t_triangle_init()
151 THIS->neighbors_[1] = NULL; in p2t_triangle_init()
152 THIS->neighbors_[2] = NULL; in p2t_triangle_init()
164 THIS->neighbors_[0] = t; in p2t_triangle_mark_neighbor_pt_pt_tr()
166 THIS->neighbors_[1] = t; in p2t_triangle_mark_neighbor_pt_pt_tr()
168 THIS->neighbors_[2] = t; in p2t_triangle_mark_neighbor_pt_pt_tr()
180 THIS->neighbors_[0] = t; in p2t_triangle_mark_neighbor_tr()
185 THIS->neighbors_[1] = t; in p2t_triangle_mark_neighbor_tr()
235 THIS->neighbors_[0] = NULL; in p2t_triangle_clear_neighbors()
236 THIS->neighbors_[1] = NULL; in p2t_triangle_clear_neighbors()
[all …]
|
| /dports/math/vtk8/VTK-8.2.0/ThirdParty/vtkm/vtk-m/vtkm/thirdparty/diy/vtkmdiy/include/vtkmdiy/ |
| H A D | link.hpp | 20 int size() const { return static_cast<int>(neighbors_.size()); } in size()
23 BlockID target(int i) const { return neighbors_[static_cast<size_t>(i)]; } in target()
24 BlockID& target(int i) { return neighbors_[static_cast<size_t>(i)]; } in target()
28 void add_neighbor(const BlockID& block) { neighbors_.push_back(block); } in add_neighbor()
30 …signer) { for (unsigned i = 0; i < neighbors_.size(); ++i) { neighbors_[i].proc = assigner.r… in fix()
32 void swap(Link& other) { neighbors_.swap(other.neighbors_); } in swap()
34 virtual void save(BinaryBuffer& bb) const { diy::save(bb, neighbors_); } in save()
35 virtual void load(BinaryBuffer& bb) { diy::load(bb, neighbors_); } in load()
40 std::vector<BlockID> neighbors_; member in diy::Link
202 std::vector<BlockID> tmp(neighbors_.begin(), neighbors_.end()); in size_unique()
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/recognition/include/pcl/recognition/ransac_based/ |
| H A D | orr_graph.h | 77 return (neighbors_); in getNeighbors()
119 std::set<Node*> neighbors_;
182 …( typename std::set<Node*>::iterator neigh = (*it)->neighbors_.begin () ; neigh != (*it)->neighbor… in computeMaximalOnOffPartition()
196 nodes_[id1]->neighbors_.insert (nodes_[id2]); in insertUndirectedEdge()
197 nodes_[id2]->neighbors_.insert (nodes_[id1]); in insertUndirectedEdge()
203 nodes_[id1]->neighbors_.insert (nodes_[id2]); in insertDirectedEdge()
209 nodes_[id1]->neighbors_.erase (nodes_[id2]); in deleteUndirectedEdge()
210 nodes_[id2]->neighbors_.erase (nodes_[id1]); in deleteUndirectedEdge()
216 nodes_[id1]->neighbors_.erase (nodes_[id2]); in deleteDirectedEdge()
|
| /dports/math/geogram/geogram-1.7.7/src/lib/geogram/delaunay/ |
| H A D | delaunay_nn.cpp | 66 neighbors_.lock_array(v); in enlarge_neighborhood()
67 if(nb > neighbors_.array_size(v)) { in enlarge_neighborhood()
74 neighbors_.set_array(v, nb, neighbors, false); in enlarge_neighborhood()
76 neighbors_.unlock_array(v); in enlarge_neighborhood()
82 index_t nb = neighbors_.array_size(v); in store_neighbors_CB()
90 neighbors_.set_array(v, nb, neighbors, false); in store_neighbors_CB()
91 geo_debug_assert(neighbors_.array_size(v) == nb); in store_neighbors_CB()
|
| /dports/math/disco/DisCO-releases-1.0.0-33-g68720be/examples/VRP/ |
| H A D | VrpHeurTSP.h | 81 int *neighbors_; variable
100 if (neighbors_) { in freeGuts()
101 delete [] neighbors_; in freeGuts()
102 neighbors_ = NULL; in freeGuts()
115 neighbors_(0), nodeCalls_(0), edgeColMatch_(0) {} in VrpHeurTSP()
125 neighbors_ = NULL; in VrpHeurTSP()
|
| /dports/math/vtk9/VTK-9.1.0/ThirdParty/vtkm/vtkvtkm/vtk-m/vtkm/thirdparty/diy/vtkmdiy/include/vtkmdiy/ |
| H A D | link.hpp | 33 BlockID target(int i) const { return neighbors_[static_cast<size_t>(i)]; } in target()
34 BlockID& target(int i) { return neighbors_[static_cast<size_t>(i)]; } in target()
38 void add_neighbor(const BlockID& block) { neighbors_.push_back(block); } in add_neighbor()
40 …signer) { for (unsigned i = 0; i < neighbors_.size(); ++i) { neighbors_[i].proc = assigner.r… in fix()
42 void swap(Link& other) { neighbors_.swap(other.neighbors_); } in swap()
45 neighbors() const { return neighbors_; } in neighbors()
47 neighbors() { return neighbors_; } in neighbors()
51 virtual void save(BinaryBuffer& bb) const { diy::save(bb, neighbors_); } in save()
52 virtual void load(BinaryBuffer& bb) { diy::load(bb, neighbors_); } in load()
55 Neighbors neighbors_; member in diy::Link
[all …]
|