Home
last modified time | relevance | path

Searched refs:sV (Results 1 – 25 of 651) sorted by relevance

12345678910>>...27

/dports/math/py-grandalf/grandalf-0.7/grandalf/
H A Dgraphs.py291 self.sV = Poset(V)
297 v = self.sV[0]
348 if not ((x in self.sV) or (y in self.sV)):
400 V = self.sV
555 for v in self.sV:
563 for v in self.sV:
567 for v in self.sV:
616 return o.sV.issubset(self.sV) and o.sE.issubset(self.sE)
622 for v in G.sV:
624 self.sV.update(G.sV)
[all …]
/dports/editors/abiword/abiword-3.0.5/src/wp/impexp/xp/
H A Die_imp_RTFObjectsAndPicts.cpp1164 std::string sV; in addFrame() local
1169 sV = "image"; in addFrame()
1172 sV = "none"; in addFrame()
1183 sV = "textbox"; in addFrame()
1191 sV = "column-above-text"; in addFrame()
1195 sV = "page-above-text"; in addFrame()
1199 sV = "block-above-text"; in addFrame()
1206 sV = "above-text"; in addFrame()
1210 sV = "wrapped-both"; in addFrame()
1218 sV = "solid"; in addFrame()
[all …]
/dports/biology/seqan/seqan-library-2.4.0/include/seqan/graph_algorithms/
H A Dweighted_bipartite_matching.h189 … if (property(vertMap, sV) == true) { TVertexDescriptor tmp = sV; sV = tV; tV = tmp; } in _weightedBipartiteMatching()
190 if ((setS.find(sV) != setS.end()) && in _weightedBipartiteMatching()
274 TVertexDescriptor sV = sourceVertex(itE); in weightedBipartiteMatching() local
276 TEdgeDescriptor e = addEdge(fullGraph, sV, tV); in weightedBipartiteMatching()
277 if (sV < tV) edgeSet.insert(std::make_pair(sV, tV)); in weightedBipartiteMatching()
278 else edgeSet.insert(std::make_pair(tV, sV)); in weightedBipartiteMatching()
296 TVertexDescriptor sV = value(set1It); in weightedBipartiteMatching() local
298 if (sV > tV) { TVertexDescriptor tmp = sV; sV = tV; tV = tmp; } in weightedBipartiteMatching()
299 if (edgeSet.find(std::make_pair(sV, tV)) == edgeSet.end()) addEdge(fullGraph, sV, tV); in weightedBipartiteMatching()
313 TVertexDescriptor sV = (value(eIt)).i1; in weightedBipartiteMatching() local
[all …]
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/include/seqan/graph_algorithms/
H A Dweighted_bipartite_matching.h189 … if (property(vertMap, sV) == true) { TVertexDescriptor tmp = sV; sV = tV; tV = tmp; } in _weightedBipartiteMatching()
190 if ((setS.find(sV) != setS.end()) && in _weightedBipartiteMatching()
274 TVertexDescriptor sV = sourceVertex(itE); in weightedBipartiteMatching() local
276 TEdgeDescriptor e = addEdge(fullGraph, sV, tV); in weightedBipartiteMatching()
277 if (sV < tV) edgeSet.insert(std::make_pair(sV, tV)); in weightedBipartiteMatching()
278 else edgeSet.insert(std::make_pair(tV, sV)); in weightedBipartiteMatching()
296 TVertexDescriptor sV = value(set1It); in weightedBipartiteMatching() local
298 if (sV > tV) { TVertexDescriptor tmp = sV; sV = tV; tV = tmp; } in weightedBipartiteMatching()
299 if (edgeSet.find(std::make_pair(sV, tV)) == edgeSet.end()) addEdge(fullGraph, sV, tV); in weightedBipartiteMatching()
313 TVertexDescriptor sV = (value(eIt)).i1; in weightedBipartiteMatching() local
[all …]
/dports/biology/pbseqan/seqan-21d95d737d8decb5cc3693b9065d81e831e7f57d/include/seqan/graph_algorithms/
H A Dweighted_bipartite_matching.h189 … if (property(vertMap, sV) == true) { TVertexDescriptor tmp = sV; sV = tV; tV = tmp; } in _weightedBipartiteMatching()
190 if ((setS.find(sV) != setS.end()) && in _weightedBipartiteMatching()
274 TVertexDescriptor sV = sourceVertex(itE); in weightedBipartiteMatching() local
276 TEdgeDescriptor e = addEdge(fullGraph, sV, tV); in weightedBipartiteMatching()
277 if (sV < tV) edgeSet.insert(std::make_pair(sV, tV)); in weightedBipartiteMatching()
278 else edgeSet.insert(std::make_pair(tV, sV)); in weightedBipartiteMatching()
296 TVertexDescriptor sV = value(set1It); in weightedBipartiteMatching() local
298 if (sV > tV) { TVertexDescriptor tmp = sV; sV = tV; tV = tmp; } in weightedBipartiteMatching()
299 if (edgeSet.find(std::make_pair(sV, tV)) == edgeSet.end()) addEdge(fullGraph, sV, tV); in weightedBipartiteMatching()
313 TVertexDescriptor sV = (value(eIt)).i1; in weightedBipartiteMatching() local
[all …]
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bmsh3d/
H A Dbmsh3d_edge.h92 bmsh3d_vertex* sV() const { return vertices_[0]; } in sV() function
169 V = E0->sV(); in incident_V_of_Es()
178 if (E1->is_V_incident(E2->sV())) in Es_sharing_V()
179 return E2->sV(); in Es_sharing_V()
193 if (E1->is_V_incident(E2->sV())) in Es_sharing_V_check()
194 V1 = E2->sV(); in Es_sharing_V_check()
210 if (E1->sV() == E2->sV() && E1->eV() == E2->eV()) in same_incident_Vs()
212 if (E1->sV() == E2->eV() && E1->eV() == E2->sV()) in same_incident_Vs()
H A Dbmsh3d_graph.h109 bmsh3d_vertex* sV = E->sV(); in add_edge_incidence() local
110 sV->add_incident_E (E); in add_edge_incidence()
117 bmsh3d_vertex* sV = E->sV(); in add_edge_incidence_check() local
118 sV->check_add_incident_E (E); in add_edge_incidence_check()
141 if (V == E->sV()) in _disconnect_vertex_edge()
205 bmsh3d_vertex* sV = E->sV(); in remove_edge_complete() local
209 try_remove_vertex (sV); in remove_edge_complete()
H A Dbmsh3d_mesh_mc.cxx49 bmsh3d_vertex* sV = this->vertexmap(E->sV()->id()); in bmsh3d_mesh_mc() local
51 auto* new_edge = new bmsh3d_edge(sV,eV,E->id()); in bmsh3d_mesh_mc()
120 << " v1=" << ((bmsh3d_vertex*)new_edge->sV())->get_pt() in clone()
201 bmsh3d_vertex* v1 = ne->sV(); in mesh_break_face()
207 if (e->sV() == v1 || e->sV() == v2) in mesh_break_face()
213 if (e->sV() == v1 || e->sV() == v2) in mesh_break_face()
225 bmsh3d_vertex* V1s = E1->sV(); in mesh_break_face()
233 bmsh3d_vertex* V2s = E2->sV(); in mesh_break_face()
302 if (ne->is_V_incident(E12->sV())) in mesh_break_face()
361 auto* e = new bmsh3d_edge(M1->vertexmap(edge->sV()->id() + v_num), in merge_mesh()
[all …]
/dports/science/lammps/lammps-stable_29Sep2021/lib/poems/
H A Donfunctions.cpp25 void OnPopulateSVect(Vect3& angular, Vect3& linear, Vect6& sV){ in OnPopulateSVect() argument
26 sV.elements[0] = angular.elements[0]; in OnPopulateSVect()
27 sV.elements[1] = angular.elements[1]; in OnPopulateSVect()
28 sV.elements[2] = angular.elements[2]; in OnPopulateSVect()
29 sV.elements[3] = linear.elements[0]; in OnPopulateSVect()
30 sV.elements[4] = linear.elements[1]; in OnPopulateSVect()
31 sV.elements[5] = linear.elements[2]; in OnPopulateSVect()
/dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/lib/poems/
H A Donfunctions.cpp25 void OnPopulateSVect(Vect3& angular, Vect3& linear, Vect6& sV){ in OnPopulateSVect() argument
26 sV.elements[0] = angular.elements[0]; in OnPopulateSVect()
27 sV.elements[1] = angular.elements[1]; in OnPopulateSVect()
28 sV.elements[2] = angular.elements[2]; in OnPopulateSVect()
29 sV.elements[3] = linear.elements[0]; in OnPopulateSVect()
30 sV.elements[4] = linear.elements[1]; in OnPopulateSVect()
31 sV.elements[5] = linear.elements[2]; in OnPopulateSVect()
/dports/cad/calculix/CalculiX/cgx_2.18/src/
H A Dfuss.c150 sV.DN_1 = 0.0; in fuss()
151 sV.DN_2 = 0.0; in fuss()
162 sV.BN = 0.0; in fuss()
163 sV.RM = 0.0; in fuss()
164 sV.a = 0.0; in fuss()
165 sV.b = 0.0; in fuss()
782 sV.RN_2 = sV.RM + sV.Dum + sV.PN_2; in fuss()
790 sV.DN_2 = sV.DDN_1; in fuss()
799sV.PN_1 = calcRadius(point[p2].py, point[pBN].py, point[p2].pz, point[pBN].pz) - sV.Dum - sV.PN_2 … in fuss()
800 sV.RN_1 = sV.RN_2 + sV.HN_2 + sV.PN_1; in fuss()
[all …]
/dports/science/lammps/lammps-stable_29Sep2021/lib/atc/
H A DVector.cpp12 int sV[2] = {v.size(), 1}; // sizes of v in MultMv() local
14 GCK(A, v, sA[!At]!=sV[0], "MultAB<double>: matrix-vector multiply"); in MultMv()
22 int *N = sV+1; // # of cols in op[B] in MultMv()
28 dgemm_(ta, t, M, N, K, &a, pa, sA, pv, sV, &b, pc, M); in MultMv()
30 dgemm_(t, ta, N, M, K, &a, pv, sV+1, pa, sA+1, &b, pc, N); in MultMv()
/dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/lib/atc/
H A DVector.cpp12 int sV[2] = {v.size(), 1}; // sizes of v in MultMv() local
14 GCK(A, v, sA[!At]!=sV[0], "MultAB<double>: matrix-vector multiply"); in MultMv()
22 int *N = sV+1; // # of cols in op[B] in MultMv()
28 dgemm_(ta, t, M, N, K, &a, pa, sA, pv, sV, &b, pc, M); in MultMv()
30 dgemm_(t, ta, N, M, K, &a, pv, sV+1, pa, sA+1, &b, pc, N); in MultMv()
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bmsh3d/vis/
H A Dbmsh3d_vis_edge.cxx27 const bmsh3d_vertex* sV = E->sV(); in draw_edge_geom() local
31 coords->point.set1Value(0, float(sV->pt().x()), float(sV->pt().y()), float(sV->pt().z())); in draw_edge_geom()
/dports/www/domoticz/domoticz-2020.2/dzVents/runtime/device-adapters/
H A DAdapters.lua90 local sV = splitted[1]
95 if (sV ~= nil) then
96 sV = string.gsub(sV, '%' .. radixSeparator, '.')
99 local value = sV ~= nil and tonumber(sV) or 0
/dports/cad/openroad/OpenROAD-2.0/src/OpenDB/src/db/
H A Dtmg_conn_g.cpp1001 = (sV[k]->xMax() - sV[k]->xMin() > sV[k]->yMax() - sV[k]->yMin()); in adjustShapes()
1003 = (sV[k]->xMax() - sV[k]->xMin() < sV[k]->yMax() - sV[k]->yMin()); in adjustShapes()
1045 if (ty + ty != sV[k]->yMin() + sV[k]->yMax()) in adjustShapes()
1048 if (tx + tx != sV[k]->xMin() + sV[k]->xMax()) in adjustShapes()
1055 if (sV[k]->xMin() < tx - w / 2 && tx + w / 2 < sV[k]->xMax()) in adjustShapes()
1175 ty = (sV[k]->yMin() + sV[k]->yMax()) / 2; in adjustShapes()
1182 tx = (sV[k]->xMin() + sV[k]->xMax()) / 2; in adjustShapes()
1192 if (is_h[k] && ty + ty != sV[k]->yMin() + sV[k]->yMax()) in adjustShapes()
1194 if (is_v[k] && tx + tx != sV[k]->xMin() + sV[k]->xMax()) in adjustShapes()
1199 if (sV[k]->xMin() < tx - w / 2 && tx + w / 2 < sV[k]->xMax()) in adjustShapes()
[all …]
/dports/math/R-cran-robustbase/robustbase/R/
H A DglmrobMqle.R157 sV <- NULL # FIXME workaround for codetools functionVar
168 sV <- sVF * sqrt(phi)
177 H <- floor(mu*ni - tcc* sni*sV)
178 K <- floor(mu*ni + tcc* sni*sV)
211 EEq <- colMeans(cpsi * w.x * sni/sV * dmu.deta * X)
214 DiagB <- eval(EpsiS) /(sni*sV) * w.x * (ni*dmu.deta)^2
269 DiagB <- eval(EpsiS) / (sni*sV)* w.x * (ni*dmu.deta)^2
385 tcc*(1 - pK - pH) + mu*(dpH - dpK)/sV
398 tcc*(dpH + dpK) + E2f / sV
424 ifelse(ni == 1, (- (H < 0) + (K >= 1) ) * sV,
[all …]
H A DglmrobMqle-DQD.R99 sV <- s.ph * u ## = sqrt(dispersion * Gamma()$variance) functionVar
100 residP <- (y-u)/sV
114 ( nui/sV - Enui/u*s.ph )
119 sV <- sqrt(phi) * u ## = sqrt(dispersion * Gamma()$variance) functionVar
120 residP <- (y-u)/sV
122 (nui / sV)
128 sV <- s.ph * u ## = sqrt(dispersion * Gamma()$variance) functionVar
/dports/math/py-grandalf/grandalf-0.7/tests/
H A Dtest_routing.py11 sug.init_all(roots=[gr.sV[0]],inverted_edges=[])
30 for v in gr.sV: print (v,v.view.xy)
36 sug.init_all(roots=[gr.sV[0]],inverted_edges=[])
54 for v in gr.sV: print (v,v.view.xy)
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/test/jdk/sun/security/pkcs11/Secmod/
H A DTestNssDbSqlite.java105 Signature sV = Signature.getInstance("SHA256withRSA", sunRsaSignProvider); in testRetrieveKeysFromKeystore() local
106 sV.initVerify(certificate); in testRetrieveKeysFromKeystore()
107 sV.update(plainText.getBytes()); in testRetrieveKeysFromKeystore()
108 if(!sV.verify(generatedSignature)){ in testRetrieveKeysFromKeystore()
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/test/jdk/sun/security/pkcs11/Secmod/
H A DTestNssDbSqlite.java105 Signature sV = Signature.getInstance("SHA256withRSA", sunRsaSignProvider); in testRetrieveKeysFromKeystore() local
106 sV.initVerify(certificate); in testRetrieveKeysFromKeystore()
107 sV.update(plainText.getBytes()); in testRetrieveKeysFromKeystore()
108 if(!sV.verify(generatedSignature)){ in testRetrieveKeysFromKeystore()
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/test/jdk/sun/security/pkcs11/Secmod/
H A DTestNssDbSqlite.java105 Signature sV = Signature.getInstance("SHA256withRSA", sunRsaSignProvider); in testRetrieveKeysFromKeystore() local
106 sV.initVerify(certificate); in testRetrieveKeysFromKeystore()
107 sV.update(plainText.getBytes()); in testRetrieveKeysFromKeystore()
108 if(!sV.verify(generatedSignature)){ in testRetrieveKeysFromKeystore()
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/test/jdk/sun/security/pkcs11/Secmod/
H A DTestNssDbSqlite.java105 Signature sV = Signature.getInstance("SHA256withRSA", sunRsaSignProvider); in testRetrieveKeysFromKeystore() local
106 sV.initVerify(certificate); in testRetrieveKeysFromKeystore()
107 sV.update(plainText.getBytes()); in testRetrieveKeysFromKeystore()
108 if(!sV.verify(generatedSignature)){ in testRetrieveKeysFromKeystore()
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/test/jdk/sun/security/pkcs11/Secmod/
H A DTestNssDbSqlite.java105 Signature sV = Signature.getInstance("SHA256withRSA", sunRsaSignProvider); in testRetrieveKeysFromKeystore() local
106 sV.initVerify(certificate); in testRetrieveKeysFromKeystore()
107 sV.update(plainText.getBytes()); in testRetrieveKeysFromKeystore()
108 if(!sV.verify(generatedSignature)){ in testRetrieveKeysFromKeystore()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/test/jdk/sun/security/pkcs11/Secmod/
H A DTestNssDbSqlite.java105 Signature sV = Signature.getInstance("SHA256withRSA", sunRsaSignProvider); in testRetrieveKeysFromKeystore() local
106 sV.initVerify(certificate); in testRetrieveKeysFromKeystore()
107 sV.update(plainText.getBytes()); in testRetrieveKeysFromKeystore()
108 if(!sV.verify(generatedSignature)){ in testRetrieveKeysFromKeystore()

12345678910>>...27