Home
last modified time | relevance | path

Searched refs:m_u (Results 176 – 200 of 694) sorted by relevance

12345678910>>...28

/dports/emulators/mame/mame-mame0226/3rdparty/bgfx/examples/03-raymarch/
H A Draymarch.cpp19 float m_u; member
62 vertex[0].m_u = minu; in renderScreenSpaceQuad()
69 vertex[1].m_u = maxu; in renderScreenSpaceQuad()
76 vertex[2].m_u = maxu; in renderScreenSpaceQuad()
83 vertex[3].m_u = minu; in renderScreenSpaceQuad()
/dports/biology/abyss/abyss-2.3.1/BloomDBG/
H A DRollingBloomDBG.h257 : m_g(&g), m_u(u), m_v(u.clone()), m_i(0)
296 vertex_descriptor m_u;
321 : m_g(&g), m_u(u), m_v(u.clone()), m_i(0)
330 return edge_descriptor(m_u, m_v.clone());
360 vertex_descriptor m_u;
385 : m_g(&g), m_u(u), m_v(u.clone()), m_i(0)
394 return edge_descriptor(m_v.clone(), m_u);
424 vertex_descriptor m_u;
/dports/games/dustrac/DustRacing2D-ae380b8/src/game/MiniCore/src/Text/
H A Dmctextureglyph.cc27 m_uv[1] = UV(uv1.m_u, uv0.m_v); in MCTextureGlyph()
29 m_uv[3] = UV(uv0.m_u, uv1.m_v); in MCTextureGlyph()
/dports/devel/boost-docs/boost_1_72_0/libs/graph/example/
H A Dimplicit_graph.cpp198 ring_incident_edge_iterator::iterator_adaptor_(0),m_n(0),m_u(0) {}; in ring_incident_edge_iterator()
203 m_n(g.n()),m_u(u) {}; in ring_incident_edge_iterator()
211 m_n(g.n()),m_u(u) {}; in ring_incident_edge_iterator()
221 if (m_u == 0 && p == 1) in dereference()
224 v = (m_u+ring_offset[p]) % m_n; in dereference()
225 return edge_descriptor(m_u, v); in dereference()
229 vertex_descriptor m_u; // Vertex whose out edges are iterated member in ring_incident_edge_iterator
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/example/
H A Dimplicit_graph.cpp198 ring_incident_edge_iterator::iterator_adaptor_(0),m_n(0),m_u(0) {}; in ring_incident_edge_iterator()
203 m_n(g.n()),m_u(u) {}; in ring_incident_edge_iterator()
211 m_n(g.n()),m_u(u) {}; in ring_incident_edge_iterator()
221 if (m_u == 0 && p == 1) in dereference()
224 v = (m_u+ring_offset[p]) % m_n; in dereference()
225 return edge_descriptor(m_u, v); in dereference()
229 vertex_descriptor m_u; // Vertex whose out edges are iterated member in ring_incident_edge_iterator
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/example/
H A Dimplicit_graph.cpp198 ring_incident_edge_iterator::iterator_adaptor_(0),m_n(0),m_u(0) {}; in ring_incident_edge_iterator()
203 m_n(g.n()),m_u(u) {}; in ring_incident_edge_iterator()
211 m_n(g.n()),m_u(u) {}; in ring_incident_edge_iterator()
221 if (m_u == 0 && p == 1) in dereference()
224 v = (m_u+ring_offset[p]) % m_n; in dereference()
225 return edge_descriptor(m_u, v); in dereference()
229 vertex_descriptor m_u; // Vertex whose out edges are iterated member in ring_incident_edge_iterator
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/example/
H A Dimplicit_graph.cpp198 ring_incident_edge_iterator::iterator_adaptor_(0),m_n(0),m_u(0) {}; in ring_incident_edge_iterator()
203 m_n(g.n()),m_u(u) {}; in ring_incident_edge_iterator()
211 m_n(g.n()),m_u(u) {}; in ring_incident_edge_iterator()
221 if (m_u == 0 && p == 1) in dereference()
224 v = (m_u+ring_offset[p]) % m_n; in dereference()
225 return edge_descriptor(m_u, v); in dereference()
229 vertex_descriptor m_u; // Vertex whose out edges are iterated member in ring_incident_edge_iterator
/dports/databases/percona57-server/boost_1_59_0/libs/graph/example/
H A Dimplicit_graph.cpp198 ring_incident_edge_iterator::iterator_adaptor_(0),m_n(0),m_u(0) {}; in ring_incident_edge_iterator()
203 m_n(g.n()),m_u(u) {}; in ring_incident_edge_iterator()
211 m_n(g.n()),m_u(u) {}; in ring_incident_edge_iterator()
221 if (m_u == 0 && p == 1) in dereference()
224 v = (m_u+ring_offset[p]) % m_n; in dereference()
225 return edge_descriptor(m_u, v); in dereference()
229 vertex_descriptor m_u; // Vertex whose out edges are iterated member in ring_incident_edge_iterator
/dports/databases/xtrabackup/boost_1_59_0/libs/graph/example/
H A Dimplicit_graph.cpp198 ring_incident_edge_iterator::iterator_adaptor_(0),m_n(0),m_u(0) {}; in ring_incident_edge_iterator()
203 m_n(g.n()),m_u(u) {}; in ring_incident_edge_iterator()
211 m_n(g.n()),m_u(u) {}; in ring_incident_edge_iterator()
221 if (m_u == 0 && p == 1) in dereference()
224 v = (m_u+ring_offset[p]) % m_n; in dereference()
225 return edge_descriptor(m_u, v); in dereference()
229 vertex_descriptor m_u; // Vertex whose out edges are iterated member in ring_incident_edge_iterator
/dports/databases/percona57-client/boost_1_59_0/libs/graph/example/
H A Dimplicit_graph.cpp198 ring_incident_edge_iterator::iterator_adaptor_(0),m_n(0),m_u(0) {}; in ring_incident_edge_iterator()
203 m_n(g.n()),m_u(u) {}; in ring_incident_edge_iterator()
211 m_n(g.n()),m_u(u) {}; in ring_incident_edge_iterator()
221 if (m_u == 0 && p == 1) in dereference()
224 v = (m_u+ring_offset[p]) % m_n; in dereference()
225 return edge_descriptor(m_u, v); in dereference()
229 vertex_descriptor m_u; // Vertex whose out edges are iterated member in ring_incident_edge_iterator
/dports/devel/boost-libs/boost_1_72_0/libs/graph/example/
H A Dimplicit_graph.cpp198 ring_incident_edge_iterator::iterator_adaptor_(0),m_n(0),m_u(0) {}; in ring_incident_edge_iterator()
203 m_n(g.n()),m_u(u) {}; in ring_incident_edge_iterator()
211 m_n(g.n()),m_u(u) {}; in ring_incident_edge_iterator()
221 if (m_u == 0 && p == 1) in dereference()
224 v = (m_u+ring_offset[p]) % m_n; in dereference()
225 return edge_descriptor(m_u, v); in dereference()
229 vertex_descriptor m_u; // Vertex whose out edges are iterated member in ring_incident_edge_iterator
/dports/science/smoldyn/smoldyn-2.67/source/NextSubVolume/Eigen/src/UmfPackSupport/
H A DUmfPackSupport.h176 return m_u; in matrixU()
319 mutable LUMatrixType m_u; variable
354 m_u.resize((std::min)(rows,cols),cols); in extractData()
355 m_u.resizeNonZeros(unz); in extractData()
362 m_u.outerIndexPtr(), m_u.innerIndexPtr(), m_u.valuePtr(), in extractData()
/dports/devel/hyperscan/boost_1_75_0/libs/graph/example/
H A Dimplicit_graph.cpp205 : ring_incident_edge_iterator::iterator_adaptor_(0), m_n(0), m_u(0) {}; in ring_incident_edge_iterator()
208 : ring_incident_edge_iterator::iterator_adaptor_(0), m_n(g.n()), m_u(u) {}; in ring_incident_edge_iterator()
216 , m_u(u) {}; in ring_incident_edge_iterator()
227 if (m_u == 0 && p == 1) in dereference()
230 v = (m_u + ring_offset[p]) % m_n; in dereference()
231 return edge_descriptor(m_u, v); in dereference()
235 vertex_descriptor m_u; // Vertex whose out edges are iterated member in ring_incident_edge_iterator
/dports/graphics/embree/embree-3.13.2/kernels/subdiv/
H A Dtessellation.h128 const vbool8 m_u = u_i < grid_u_segments; in gridUVTessellator() local
129 const vfloat8 u = select(m_u, vfloat8(x0+u_i) * inv_grid_u_segments, 1.0f); in gridUVTessellator()
152 const vbool4 m_u = u_i < grid_u_segments; in gridUVTessellator() local
153 const vfloat4 u = select(m_u, vfloat4(x0+u_i) * inv_grid_u_segments, 1.0f); in gridUVTessellator()
/dports/science/apbs/apbs-pdb2pqr-apbs-1.5-102-g500c1473/apbs/include/Eigen/src/UmfPackSupport/
H A DUmfPackSupport.h176 return m_u; in matrixU()
319 mutable LUMatrixType m_u; variable
354 m_u.resize((std::min)(rows,cols),cols); in extractData()
355 m_u.resizeNonZeros(unz); in extractData()
362 m_u.outerIndexPtr(), m_u.innerIndexPtr(), m_u.valuePtr(), in extractData()
/dports/science/pcmsolver/pcmsolver-1.3.0/external/eigen3/include/eigen3/Eigen/src/UmfPackSupport/
H A DUmfPackSupport.h203 return m_u; in matrixU()
366 mutable LUMatrixType m_u; variable
399 m_u.resize((std::min)(rows,cols),cols); in extractData()
400 m_u.resizeNonZeros(unz); in extractData()
407 m_u.outerIndexPtr(), m_u.innerIndexPtr(), m_u.valuePtr(), in extractData()
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/eigen_3.3.3/Eigen/src/UmfPackSupport/
H A DUmfPackSupport.h203 return m_u; in matrixU()
366 mutable LUMatrixType m_u; variable
399 m_u.resize((std::min)(rows,cols),cols); in extractData()
400 m_u.resizeNonZeros(unz); in extractData()
407 m_u.outerIndexPtr(), m_u.innerIndexPtr(), m_u.valuePtr(), in extractData()
/dports/graphics/open3d/Open3D-0.2/src/External/Eigen/Eigen/src/UmfPackSupport/
H A DUmfPackSupport.h203 return m_u; in matrixU()
366 mutable LUMatrixType m_u; variable
399 m_u.resize((std::min)(rows,cols),cols); in extractData()
400 m_u.resizeNonZeros(unz); in extractData()
407 m_u.outerIndexPtr(), m_u.innerIndexPtr(), m_u.valuePtr(), in extractData()
/dports/devel/vcglib/vcglib-2020.09/eigenlib/Eigen/src/UmfPackSupport/
H A DUmfPackSupport.h203 return m_u; in matrixU()
366 mutable LUMatrixType m_u; variable
399 m_u.resize((std::min)(rows,cols),cols); in extractData()
400 m_u.resizeNonZeros(unz); in extractData()
407 m_u.outerIndexPtr(), m_u.innerIndexPtr(), m_u.valuePtr(), in extractData()
/dports/graphics/py-open3d-python/Open3D-0.2/src/External/Eigen/Eigen/src/UmfPackSupport/
H A DUmfPackSupport.h203 return m_u; in matrixU()
366 mutable LUMatrixType m_u; variable
399 m_u.resize((std::min)(rows,cols),cols); in extractData()
400 m_u.resizeNonZeros(unz); in extractData()
407 m_u.outerIndexPtr(), m_u.innerIndexPtr(), m_u.valuePtr(), in extractData()
/dports/biology/abyss/abyss-2.3.1/Konnector/
H A DDBGBloom.h179 : m_g(&g), m_u(u), m_v(u), m_i(0)
188 return edge_descriptor(m_u, m_v);
218 vertex_descriptor m_u;
243 : m_g(&g), m_u(u), m_v(u), m_i(0)
252 return edge_descriptor(m_v, m_u);
282 vertex_descriptor m_u;
/dports/security/cryptopp/cryptopp-8.6.0/
H A Drw.h103 const Integer& GetMultiplicativeInverseOfPrime2ModPrime1() const {return m_u;} in GetMultiplicativeInverseOfPrime2ModPrime1()
107 void SetMultiplicativeInverseOfPrime2ModPrime1(const Integer &u) {m_u = u;} in SetMultiplicativeInverseOfPrime2ModPrime1()
120 Integer m_p, m_q, m_u;
/dports/net-p2p/qtum/qtum-mainnet-fastlane-v0.20.3/src/cryptopp/
H A Drw.h104 const Integer& GetMultiplicativeInverseOfPrime2ModPrime1() const {return m_u;} in GetMultiplicativeInverseOfPrime2ModPrime1()
108 void SetMultiplicativeInverseOfPrime2ModPrime1(const Integer &u) {m_u = u;} in SetMultiplicativeInverseOfPrime2ModPrime1()
121 Integer m_p, m_q, m_u;
/dports/emulators/citra-qt5/citra-ac98458e0/externals/cryptopp/cryptopp/
H A Drw.h103 const Integer& GetMultiplicativeInverseOfPrime2ModPrime1() const {return m_u;} in GetMultiplicativeInverseOfPrime2ModPrime1()
107 void SetMultiplicativeInverseOfPrime2ModPrime1(const Integer &u) {m_u = u;} in SetMultiplicativeInverseOfPrime2ModPrime1()
120 Integer m_p, m_q, m_u;
/dports/emulators/citra/citra-ac98458e0/externals/cryptopp/cryptopp/
H A Drw.h103 const Integer& GetMultiplicativeInverseOfPrime2ModPrime1() const {return m_u;} in GetMultiplicativeInverseOfPrime2ModPrime1()
107 void SetMultiplicativeInverseOfPrime2ModPrime1(const Integer &u) {m_u = u;} in SetMultiplicativeInverseOfPrime2ModPrime1()
120 Integer m_p, m_q, m_u;

12345678910>>...28