| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/s2/ |
| H A D | s2polyline_test.cc | 103 int next_vertex; in TEST() local
105 EXPECT_EQ(1, next_vertex); in TEST()
108 EXPECT_EQ(3, next_vertex); in TEST()
110 EXPECT_EQ(4, next_vertex); in TEST()
120 EXPECT_EQ(3, next_vertex); in TEST()
135 int next_vertex; in TEST() local
159 int next_vertex; in TEST() local
164 EXPECT_EQ(1, next_vertex); in TEST()
169 EXPECT_EQ(1, next_vertex); in TEST()
174 EXPECT_EQ(2, next_vertex); in TEST()
[all …]
|
| H A D | s2polyline.cc | 143 *next_vertex = 1; in GetSuffix()
164 *next_vertex = num_vertices(); in GetSuffix()
169 int next_vertex; in Interpolate() local
196 *next_vertex = 1; in Project()
226 int next_vertex; in IsOnRight() local
229 DCHECK_GE(next_vertex, 1); in IsOnRight()
235 if (closest_point == vertex(next_vertex-1) && next_vertex > 1 && in IsOnRight()
239 return S2::OrderedCCW(vertex(next_vertex-2), point, vertex(next_vertex), in IsOnRight()
245 if (next_vertex == num_vertices()) in IsOnRight()
246 --next_vertex; in IsOnRight()
[all …]
|
| /dports/emulators/mess/mame-mame0226/3rdparty/bgfx/3rdparty/meshoptimizer/src/ |
| H A D | vfetchoptimizer.cpp | 13 unsigned int next_vertex = 0; in meshopt_optimizeVertexFetchRemap() local
22 destination[index] = next_vertex++; in meshopt_optimizeVertexFetchRemap()
26 assert(next_vertex <= vertex_count); in meshopt_optimizeVertexFetchRemap()
28 return next_vertex; in meshopt_optimizeVertexFetchRemap()
50 unsigned int next_vertex = 0; in meshopt_optimizeVertexFetch() local
62 …memcpy(static_cast<unsigned char*>(destination) + next_vertex * vertex_size, static_cast<const uns… in meshopt_optimizeVertexFetch()
64 remap = next_vertex++; in meshopt_optimizeVertexFetch()
71 assert(next_vertex <= vertex_count); in meshopt_optimizeVertexFetch()
73 return next_vertex; in meshopt_optimizeVertexFetch()
|
| H A D | indexgenerator.cpp | 142 unsigned int next_vertex = 0; in meshopt_generateVertexRemap() local
157 destination[index] = next_vertex++; in meshopt_generateVertexRemap()
168 assert(next_vertex <= vertex_count); in meshopt_generateVertexRemap()
170 return next_vertex; in meshopt_generateVertexRemap()
197 unsigned int next_vertex = 0; in meshopt_generateVertexRemapMulti() local
212 destination[index] = next_vertex++; in meshopt_generateVertexRemapMulti()
223 assert(next_vertex <= vertex_count); in meshopt_generateVertexRemapMulti()
225 return next_vertex; in meshopt_generateVertexRemapMulti()
|
| /dports/emulators/mame/mame-mame0226/3rdparty/bgfx/3rdparty/meshoptimizer/src/ |
| H A D | vfetchoptimizer.cpp | 13 unsigned int next_vertex = 0; in meshopt_optimizeVertexFetchRemap() local
22 destination[index] = next_vertex++; in meshopt_optimizeVertexFetchRemap()
26 assert(next_vertex <= vertex_count); in meshopt_optimizeVertexFetchRemap()
28 return next_vertex; in meshopt_optimizeVertexFetchRemap()
50 unsigned int next_vertex = 0; in meshopt_optimizeVertexFetch() local
62 …memcpy(static_cast<unsigned char*>(destination) + next_vertex * vertex_size, static_cast<const uns… in meshopt_optimizeVertexFetch()
64 remap = next_vertex++; in meshopt_optimizeVertexFetch()
71 assert(next_vertex <= vertex_count); in meshopt_optimizeVertexFetch()
73 return next_vertex; in meshopt_optimizeVertexFetch()
|
| H A D | indexgenerator.cpp | 142 unsigned int next_vertex = 0; in meshopt_generateVertexRemap() local
157 destination[index] = next_vertex++; in meshopt_generateVertexRemap()
168 assert(next_vertex <= vertex_count); in meshopt_generateVertexRemap()
170 return next_vertex; in meshopt_generateVertexRemap()
197 unsigned int next_vertex = 0; in meshopt_generateVertexRemapMulti() local
212 destination[index] = next_vertex++; in meshopt_generateVertexRemapMulti()
223 assert(next_vertex <= vertex_count); in meshopt_generateVertexRemapMulti()
225 return next_vertex; in meshopt_generateVertexRemapMulti()
|
| /dports/graphics/s2/s2geometry-0.9.0/src/s2/ |
| H A D | s2polyline_test.cc | 144 int next_vertex; in TEST() local
146 EXPECT_EQ(1, next_vertex); in TEST()
149 EXPECT_EQ(3, next_vertex); in TEST()
151 EXPECT_EQ(4, next_vertex); in TEST()
160 EXPECT_EQ(3, next_vertex); in TEST()
174 int next_vertex; in TEST() local
196 int next_vertex; in TEST() local
201 EXPECT_EQ(1, next_vertex); in TEST()
206 EXPECT_EQ(1, next_vertex); in TEST()
211 EXPECT_EQ(2, next_vertex); in TEST()
[all …]
|
| H A D | s2polyline.cc | 174 *next_vertex = 1; in GetSuffix()
195 *next_vertex = num_vertices(); in GetSuffix()
200 int next_vertex; in Interpolate() local
227 *next_vertex = 1; in Project()
257 int next_vertex; in IsOnRight() local
260 S2_DCHECK_GE(next_vertex, 1); in IsOnRight()
266 if (closest_point == vertex(next_vertex-1) && next_vertex > 1 && in IsOnRight()
270 return s2pred::OrderedCCW(vertex(next_vertex-2), point, vertex(next_vertex), in IsOnRight()
276 if (next_vertex == num_vertices()) in IsOnRight()
277 --next_vertex; in IsOnRight()
[all …]
|
| /dports/graphics/py-s2/s2geometry-0.9.0/src/s2/ |
| H A D | s2polyline_test.cc | 144 int next_vertex; in TEST() local
146 EXPECT_EQ(1, next_vertex); in TEST()
149 EXPECT_EQ(3, next_vertex); in TEST()
151 EXPECT_EQ(4, next_vertex); in TEST()
160 EXPECT_EQ(3, next_vertex); in TEST()
174 int next_vertex; in TEST() local
196 int next_vertex; in TEST() local
201 EXPECT_EQ(1, next_vertex); in TEST()
206 EXPECT_EQ(1, next_vertex); in TEST()
211 EXPECT_EQ(2, next_vertex); in TEST()
[all …]
|
| H A D | s2polyline.cc | 174 *next_vertex = 1; in GetSuffix()
195 *next_vertex = num_vertices(); in GetSuffix()
200 int next_vertex; in Interpolate() local
227 *next_vertex = 1; in Project()
257 int next_vertex; in IsOnRight() local
260 S2_DCHECK_GE(next_vertex, 1); in IsOnRight()
266 if (closest_point == vertex(next_vertex-1) && next_vertex > 1 && in IsOnRight()
270 return s2pred::OrderedCCW(vertex(next_vertex-2), point, vertex(next_vertex), in IsOnRight()
276 if (next_vertex == num_vertices()) in IsOnRight()
277 --next_vertex; in IsOnRight()
[all …]
|
| /dports/graphics/R-cran-s2/s2/src/s2/ |
| H A D | s2polyline.cc | 174 *next_vertex = 1; in GetSuffix()
195 *next_vertex = num_vertices(); in GetSuffix()
200 int next_vertex; in Interpolate() local
227 *next_vertex = 1; in Project()
257 int next_vertex; in IsOnRight() local
260 S2_DCHECK_GE(next_vertex, 1); in IsOnRight()
266 if (closest_point == vertex(next_vertex-1) && next_vertex > 1 && in IsOnRight()
270 return s2pred::OrderedCCW(vertex(next_vertex-2), point, vertex(next_vertex), in IsOnRight()
276 if (next_vertex == num_vertices()) in IsOnRight()
277 --next_vertex; in IsOnRight()
[all …]
|
| /dports/science/frontistr/FrontISTR-c66bdc397de319ca59a0565b3f3b1a3b33f0c50c/hecmw1/src/operations/dynamic_load_balancing/ |
| H A D | hecmw_dlb_mesh2graph.c | 103 p1 = p1->next_vertex; in add8_adj_link()
111 p2 = adj_link[id_node].next_vertex; in add8_adj_link()
113 adj_link[id_node].next_vertex = p1; in add8_adj_link()
114 p1->next_vertex = p2; in add8_adj_link()
152 p1 = p1->next_vertex; in add6_adj_link()
160 p2 = adj_link[id_node].next_vertex; in add6_adj_link()
162 adj_link[id_node].next_vertex = p1; in add6_adj_link()
201 p1 = p1->next_vertex; in add4_adj_link()
222 p1 = adj_link[i].next_vertex; in adj_link_free()
225 p1 = p1->next_vertex; in adj_link_free()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 107 vertex_t next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering() local
126 while (next_vertex == v || next_vertex == u) in planar_canonical_ordering()
130 next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering()
147 if ((next_vertex == x && in planar_canonical_ordering()
173 if (status[next_vertex] == detail::PCO_PROCESSED) in planar_canonical_ordering()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 109 vertex_t next_vertex = source(*next_edge_itr, g) == u in planar_canonical_ordering() local
129 while (next_vertex == v || next_vertex == u) in planar_canonical_ordering()
134 next_vertex = source(*next_edge_itr, g) == u in planar_canonical_ordering()
151 if ((next_vertex == x in planar_canonical_ordering()
173 if (status[next_vertex] == detail::PCO_PROCESSED) in planar_canonical_ordering()
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 109 vertex_t next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering() local
128 while (next_vertex == v || next_vertex == u) in planar_canonical_ordering()
132 next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering()
149 if ((next_vertex == x && in planar_canonical_ordering()
175 if (status[next_vertex] == detail::PCO_PROCESSED) in planar_canonical_ordering()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 107 vertex_t next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering() local
126 while (next_vertex == v || next_vertex == u) in planar_canonical_ordering()
130 next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering()
147 if ((next_vertex == x && in planar_canonical_ordering()
173 if (status[next_vertex] == detail::PCO_PROCESSED) in planar_canonical_ordering()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 109 vertex_t next_vertex = source(*next_edge_itr, g) == u in planar_canonical_ordering() local
129 while (next_vertex == v || next_vertex == u) in planar_canonical_ordering()
134 next_vertex = source(*next_edge_itr, g) == u in planar_canonical_ordering()
151 if ((next_vertex == x in planar_canonical_ordering()
173 if (status[next_vertex] == detail::PCO_PROCESSED) in planar_canonical_ordering()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 109 vertex_t next_vertex = source(*next_edge_itr, g) == u in planar_canonical_ordering() local
129 while (next_vertex == v || next_vertex == u) in planar_canonical_ordering()
134 next_vertex = source(*next_edge_itr, g) == u in planar_canonical_ordering()
151 if ((next_vertex == x in planar_canonical_ordering()
173 if (status[next_vertex] == detail::PCO_PROCESSED) in planar_canonical_ordering()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 107 vertex_t next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering() local
126 while (next_vertex == v || next_vertex == u) in planar_canonical_ordering()
130 next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering()
147 if ((next_vertex == x && in planar_canonical_ordering()
173 if (status[next_vertex] == detail::PCO_PROCESSED) in planar_canonical_ordering()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 107 vertex_t next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering() local
126 while (next_vertex == v || next_vertex == u) in planar_canonical_ordering()
130 next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering()
147 if ((next_vertex == x && in planar_canonical_ordering()
173 if (status[next_vertex] == detail::PCO_PROCESSED) in planar_canonical_ordering()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 107 vertex_t next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering() local
126 while (next_vertex == v || next_vertex == u) in planar_canonical_ordering()
130 next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering()
147 if ((next_vertex == x && in planar_canonical_ordering()
173 if (status[next_vertex] == detail::PCO_PROCESSED) in planar_canonical_ordering()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 107 vertex_t next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering() local
126 while (next_vertex == v || next_vertex == u) in planar_canonical_ordering()
130 next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering()
147 if ((next_vertex == x && in planar_canonical_ordering()
173 if (status[next_vertex] == detail::PCO_PROCESSED) in planar_canonical_ordering()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 107 vertex_t next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering() local
126 while (next_vertex == v || next_vertex == u) in planar_canonical_ordering()
130 next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering()
147 if ((next_vertex == x && in planar_canonical_ordering()
173 if (status[next_vertex] == detail::PCO_PROCESSED) in planar_canonical_ordering()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 107 vertex_t next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering() local
126 while (next_vertex == v || next_vertex == u) in planar_canonical_ordering()
130 next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering()
147 if ((next_vertex == x && in planar_canonical_ordering()
173 if (status[next_vertex] == detail::PCO_PROCESSED) in planar_canonical_ordering()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | planar_canonical_ordering.hpp | 107 vertex_t next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering() local
126 while (next_vertex == v || next_vertex == u) in planar_canonical_ordering()
130 next_vertex = source(*next_edge_itr, g) == u ? in planar_canonical_ordering()
147 if ((next_vertex == x && in planar_canonical_ordering()
173 if (status[next_vertex] == detail::PCO_PROCESSED) in planar_canonical_ordering()
|