/dports/math/cvc4/CVC4-1.7/test/regress/regress1/ |
H A D | test12.cvc | 34 P_2: BOOLEAN; 36 ASSERT (NOT P_1 OR P_2 OR P_2); 67 QUERY (NOT P_2 OR P_1); 70 QUERY (P_5 OR NOT P_2); 73 QUERY (P_1 OR NOT P_2); 82 QUERY (P_2 OR NOT P_1); 85 QUERY P_2; 94 QUERY P_2; 112 QUERY (P_1 OR P_2); 124 QUERY (P_2 OR P_1); [all …]
|
/dports/math/spot/spot-2.10.2/tests/ltsmin/ |
H A D | beem-peterson.4.gal | 13 int P_2.state=0; 14 int P_2.j=0; 15 int P_2.k=0; 77 { P_2.state = 2; 81 { P_2.state = 0; 84 transition t16 [ ( ( P_2.j < 4 ) && ( P_2.state == 2 ) ) ] 88 transition t17 [ ( ( P_2.j == 4 ) && ( P_2.state == 2 ) ) ] 96 …transition t19 [ ( ( P_2.state == 4 ) && ( P_2.k < 4 ) && ( ( pos[P_2.k] < P_2.j ) || ( P_2.k == … 98 P_2.k = ( 1 + P_2.k ); } 100 transition t20 [ ( ( P_2.state == 4 ) && ( ( step[( P_2.j - 1 )] != 2 ) || ( P_2.k == 4 ) ) ) ] [all …]
|
/dports/math/py-spot/spot-2.10.2/tests/ltsmin/ |
H A D | beem-peterson.4.gal | 13 int P_2.state=0; 14 int P_2.j=0; 15 int P_2.k=0; 77 { P_2.state = 2; 81 { P_2.state = 0; 84 transition t16 [ ( ( P_2.j < 4 ) && ( P_2.state == 2 ) ) ] 88 transition t17 [ ( ( P_2.j == 4 ) && ( P_2.state == 2 ) ) ] 96 …transition t19 [ ( ( P_2.state == 4 ) && ( P_2.k < 4 ) && ( ( pos[P_2.k] < P_2.j ) || ( P_2.k == … 98 P_2.k = ( 1 + P_2.k ); } 100 transition t20 [ ( ( P_2.state == 4 ) && ( ( step[( P_2.j - 1 )] != 2 ) || ( P_2.k == 4 ) ) ) ] [all …]
|
/dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/etc/gmsh/ |
H A D | xlifepp_macros.geo | 52 P_2=newp; 394 Ellipse(E_1)={P_2,P_1,P_2,P_3}; 430 Ellipse(E_4)={P_5,P_1,P_2,P_2}; 971 Ellipse(E_1)={P_2,P_1,P_2,P_3}; 1007 Ellipse(E_4)={P_5,P_1,P_2,P_2}; 1019 Ellipse(E_5)={P_2,P_1,P_2,P_7}; 1055 Ellipse(E_8)={P_6,P_1,P_2,P_2}; 1301 Ellipse(E_1)={P_2,P_1,P_2,P_3}; 1337 Ellipse(E_4)={P_5,P_1,P_2,P_2}; 1609 Ellipse(E_1)={P_2,P_1,P_2,P_3}; [all …]
|
/dports/math/gsl/gsl-2.7/integration/ |
H A D | glfixed.c | 384 double P0, P_1, P_2; /* Legendre polynomial values */ in gauss_legendre_tbl() local 420 P_2 = P_1; in gauss_legendre_tbl() 424 P0 = t2 + ltbl[k] * (t2 - P_2); in gauss_legendre_tbl() 435 P_2 = P_1; in gauss_legendre_tbl() 439 P0 = t2 + ltbl[k] * (t2 - P_2); in gauss_legendre_tbl() 444 P_2 = P_1; in gauss_legendre_tbl() 449 P0 = t2 + t3 * (t2 - P_2); in gauss_legendre_tbl()
|
/dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/tests/res/ |
H A D | unit_TermVector.res | 2 …' with unnknown 'v' : intg_Omega one * v, FEM computation, triangle->Misc P_2 Hammer Stroud (nbq … 5 using triangle->Misc P_2 Hammer Stroud (nbq = 3) 34 …' with unnknown 'v' : intg_Omega fun * v, FEM computation, triangle->Misc P_2 Hammer Stroud (nbq … 37 using triangle->Misc P_2 Hammer Stroud (nbq = 3) 84 …' with unnknown 'v' : intg_Omega one * v, FEM computation, triangle->Misc P_2 Hammer Stroud (nbq … 87 using triangle->Misc P_2 Hammer Stroud (nbq = 3) 116 using triangle->Misc P_2 Hammer Stroud (nbq = 3) 145 using triangle->Misc P_2 Hammer Stroud (nbq = 3) 174 using triangle->Misc P_2 Hammer Stroud (nbq = 3) 203 using triangle->Misc P_2 Hammer Stroud (nbq = 3) [all …]
|
H A D | unit_TermVector_vector.res | 50 …' with unnknown 'v' : intg_Omega fun | v, FEM computation, triangle->Misc P_2 Hammer Stroud (nbq … 53 using triangle->Misc P_2 Hammer Stroud (nbq = 3) 85 …' with unnknown 'v' : intg_Omega fun | v, FEM computation, triangle->Misc P_2 Hammer Stroud (nbq … 88 using triangle->Misc P_2 Hammer Stroud (nbq = 3) 117 … 'v' : intg_Omega real matrix * vfun | , FEM computation, triangle->Misc P_2 Hammer Stroud (nbq … 121 using triangle->Misc P_2 Hammer Stroud (nbq = 3) 138 …' : intg_Omega complex matrix * vfun | , FEM computation, triangle->Misc P_2 Hammer Stroud (nbq … 142 using triangle->Misc P_2 Hammer Stroud (nbq = 3)
|
/dports/security/libadacrypt/Ada-Crypto-Library-abc534f/src/ |
H A D | crypto-types-big_numbers.adb | 421 P_1, P_2 : Big_Unsigned; variable 431 P_2 := Left_2 * Right_2; 433 + Shift_Left(((Left_1 + Left_2)*(Right_1 + Right_2)) - P_1 - P_2, N) 434 + P_2; 452 P_1, P_2, P_3 : Big_Unsigned:= Big_Unsigned_Zero; variable 492 Task_2.Output(Result => P_2); 496 + Shift_Left((P_3 - P_1 - P_2), N) 497 + P_2;
|
/dports/math/openturns/openturns-1.18/python/test/ |
H A D | t_MonomialFunctionFactory_std.expout | 5 P_2=[x] --> x^2 16 P_2=class=MonomialFunction degree=2
|
/dports/math/openturns/openturns-1.18/lib/test/ |
H A D | t_MonomialFunctionFactory_std.expout | 5 P_2=[x] --> x^2 16 P_2=class=MonomialFunction degree=2
|
/dports/science/healpix/Healpix_3.50/src/cxx/libsharp/ |
H A D | sharp_legendre_roots.c | 44 double P_2 = P_1; in sharp_legendre_roots() local 47 P0 = x0*P_1 + (k-1.)/k * (x0*P_1-P_2); in sharp_legendre_roots()
|
/dports/math/libsharp2/libsharp-54856313a5fcfb6a33817b7dfa28c4b1965ffbd1/libsharp2/ |
H A D | sharp_legendre_roots.c | 44 double P_2 = P_1; in sharp_legendre_roots() local 47 P0 = x0*P_1 + (k-1.)/k * (x0*P_1-P_2); in sharp_legendre_roots()
|
/dports/math/pari/pari-2.13.3/src/functions/number_fields/ |
H A D | rnfidealfactor | 14 ? rnfidealfactor(rnf, y+1) \\ P_2^2 18 ? rnfidealfactor(rnf, x) \\ P_2
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/test/Transforms/NewGVN/ |
H A D | compare-condition-changes.ll | 39 ; CHECK-NEXT: [[P_1:%.*]] = phi i32 [ 1, [[ENTRY]] ], [ [[P_2:%.*]], [[LOOP_LATCH]] ] 49 ; CHECK-NEXT: [[P_2]] = phi i32 [ 0, [[LOOP_BB_2]] ], [ [[P_1]], [[LOOP_BB_1]] ] 50 ; CHECK-NEXT: [[C_2:%.*]] = icmp eq i32 [[P_2]], 123
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/test/Transforms/NewGVN/ |
H A D | compare-condition-changes.ll | 39 ; CHECK-NEXT: [[P_1:%.*]] = phi i32 [ 1, [[ENTRY]] ], [ [[P_2:%.*]], [[LOOP_LATCH]] ] 49 ; CHECK-NEXT: [[P_2]] = phi i32 [ 0, [[LOOP_BB_2]] ], [ [[P_1]], [[LOOP_BB_1]] ] 50 ; CHECK-NEXT: [[C_2:%.*]] = icmp eq i32 [[P_2]], 123
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/test/Transforms/NewGVN/ |
H A D | compare-condition-changes.ll | 39 ; CHECK-NEXT: [[P_1:%.*]] = phi i32 [ 1, [[ENTRY]] ], [ [[P_2:%.*]], [[LOOP_LATCH]] ] 49 ; CHECK-NEXT: [[P_2]] = phi i32 [ 0, [[LOOP_BB_2]] ], [ [[P_1]], [[LOOP_BB_1]] ] 50 ; CHECK-NEXT: [[C_2:%.*]] = icmp eq i32 [[P_2]], 123
|
/dports/graphics/llvm-mesa/llvm-13.0.1.src/test/Transforms/NewGVN/ |
H A D | compare-condition-changes.ll | 39 ; CHECK-NEXT: [[P_1:%.*]] = phi i32 [ 1, [[ENTRY]] ], [ [[P_2:%.*]], [[LOOP_LATCH]] ] 49 ; CHECK-NEXT: [[P_2]] = phi i32 [ 0, [[LOOP_BB_2]] ], [ [[P_1]], [[LOOP_BB_1]] ] 50 ; CHECK-NEXT: [[C_2:%.*]] = icmp eq i32 [[P_2]], 123
|
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/test/Transforms/NewGVN/ |
H A D | compare-condition-changes.ll | 39 ; CHECK-NEXT: [[P_1:%.*]] = phi i32 [ 1, [[ENTRY]] ], [ [[P_2:%.*]], [[LOOP_LATCH]] ] 49 ; CHECK-NEXT: [[P_2]] = phi i32 [ 0, [[LOOP_BB_2]] ], [ [[P_1]], [[LOOP_BB_1]] ] 50 ; CHECK-NEXT: [[C_2:%.*]] = icmp eq i32 [[P_2]], 123
|
/dports/mail/spamassassin-devel/spamassassin-1ea352210/t/ |
H A D | line_endings.t | 60 %patterns = ($message => P_2, 'X-Spam-Status: Yes' => 'XSS_Yes'); 102 %patterns = ($message => P_2, 'X-Spam-Status: Yes' => 'XSS_Yes');
|
/dports/mail/spamassassin/Mail-SpamAssassin-3.4.5/t/ |
H A D | line_endings.t | 60 %patterns = ($message => P_2, 'X-Spam-Status: Yes' => 'XSS_Yes'); 102 %patterns = ($message => P_2, 'X-Spam-Status: Yes' => 'XSS_Yes');
|
/dports/security/libdecaf/libdecaf-1.0.0/_aux/ristretto/ |
H A D | ristretto.tex | 87 … $P_1 = (x_1,y_1)$ be any point on it. Then there are exactly two points $P_2 = (x_2,y_2)$ satisf… 91 $$x_1 y_2 = x_2 y_1 \Longleftrightarrow P_1-P_2 = (0,y_3)$$ 92 …urve equation gives $y=\pm1$, the 2-torsion points. Adding back, we have $P_2 = P_1 + (0,\pm1) = … 123 Two elements $P_1 := (x_1,y_1)$ and $P_2 := (x_2,y_2)$ in $\text{Espresso}(E)$ are equal if they di… 125 If $h=4$, the points are equal if $P_1-P_2\in E_2$. By Lemma~\ref{lemma:line}, this is equivalent … 127 If $h=8$, the points are equal if $P_1-P_2\in E_4$. By Lemmas~\ref{lemma:tors} and~\ref{lemma:line…
|
/dports/science/chrono/chrono-7.0.1/src/chrono/fea/ |
H A D | ChElementShellBST.cpp | 450 ChVector<> P_2 = Ny(0) * np[0] + Ny(1) * np[1] + Ny(2) * np[2]; in ComputeInternalForces_impl() local 455 this->e[1] = 0.5 * (Vdot(P_2, P_2) - 1.0); in ComputeInternalForces_impl() 456 this->e[2] = (Vdot(P_1, P_2)); in ComputeInternalForces_impl() 531 + n[1] * Ny(iv) * P_2 in ComputeInternalForces_impl() 532 + n[2] * (Nx(iv) * P_2 + Ny(iv) * P_1) ).eigen(); in ComputeInternalForces_impl()
|
/dports/math/eclib/eclib-20210318/libsrc/ |
H A D | divpol.cc | 125 ZPoly P_2 = div_pol_2(a1,a2,a3,a4,a6); in mul_by_n_num() local 131 return (n%2==0? A * P_2 - B : A - P_2 * B); in mul_by_n_num()
|
/dports/math/boolector/boolector-3.2.2/test/log/ |
H A D | calprob14sat5ksimp.btor | 7 7 var 32 P_2
|
/dports/math/dune-functions/dune-functions-1882b3ec0a14b211dd077f0d5e6455495e28c35d/doc/manual/ |
H A D | dune-functions-bases.tex | 343 The lowest-order Taylor--Hood element is the product $P_2 \times P_2 \times P_2 \times P_1$ 344 of $P_2 \times P_2 \times P_2$ for the velocities with $P_1$ for the pressure. 349 $P_2 \times P_2 \times P_2$ forms a semantic unit---it contains the components of a velocity field. 351 as $(P_2 \times P_2 \times P_2) \times P_1$, which makes the semantic relationship clearer. 369 \node [treenode] {$(P_2\times P_2 \times P_2) \times P_1$} 370 child{ node [treenode] {$P_2 \times P_2 \times P_2$} 378 \caption{Function space tree of the Taylor--Hood space $(P_2 \times P_2 \times P_2)\times P_1$} 444 child{ node [treenode] {$\Lambda_{P_2} \sqcup \Lambda_{P_2} \sqcup \Lambda_{P_2}$} 1297 = (\Lambda_{P_2} \sqcup \Lambda_{P_2} \sqcup \Lambda_{P_2}) \sqcup \Lambda_{P_1}. 1303 \iota_{P_2}(\Lambda_{P_2}) &\to \mathbb{N}_0. [all …]
|