/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/clang/test/Preprocessor/ |
H A D | macro_disable.c | 28 #define M_2(x) x + M_1(1) macro 29 #define M_3(x) x + M_2(2)
|
/dports/lang/clang-mesa/clang-13.0.1.src/test/Preprocessor/ |
H A D | macro_disable.c | 28 #define M_2(x) x + M_1(1) macro 29 #define M_3(x) x + M_2(2)
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/clang/test/Preprocessor/ |
H A D | macro_disable.c | 28 #define M_2(x) x + M_1(1) macro 29 #define M_3(x) x + M_2(2)
|
/dports/devel/llvm13/llvm-project-13.0.1.src/clang/test/Preprocessor/ |
H A D | macro_disable.c | 28 #define M_2(x) x + M_1(1) 29 #define M_3(x) x + M_2(2)
|
/dports/devel/llvm80/llvm-8.0.1.src/tools/clang/test/Preprocessor/ |
H A D | macro_disable.c | 28 #define M_2(x) x + M_1(1) macro 29 #define M_3(x) x + M_2(2)
|
/dports/devel/llvm70/llvm-7.0.1.src/tools/clang/test/Preprocessor/ |
H A D | macro_disable.c | 28 #define M_2(x) x + M_1(1) macro 29 #define M_3(x) x + M_2(2)
|
/dports/lang/racket/racket-8.3/share/pkgs/redex-benchmark/redex/benchmark/models/stlc+lists/ |
H A D | stlc-with-binding-1.rkt | 11 (typeof Γ M_2 σ) 13 (typeof Γ M_2 σ_2)
|
/dports/lang/racket/racket-8.3/share/pkgs/redex-benchmark/redex/benchmark/models/poly-stlc/ |
H A D | poly-stlc-1.rkt | 11 (typeof Γ M_2 σ) 13 (typeof Γ M_2 σ_2)
|
/dports/math/pari/pari-2.13.3/src/functions/modular_symbols/ |
H A D | msatkinlehner | 14 ? M = msinit(36,2); \\ M_2(Gamma_0(36)) 19 ? M = msinit(36,2, -1); \\ M_2(Gamma_0(36))^-
|
H A D | mshecke | 14 ? M = msinit(11,2); \\ M_2(Gamma_0(11)) 22 ? M = msinit(11,2, 1); \\ M_2(Gamma_0(11))^+
|
/dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/floats/core/ |
H A D | FloatDomain.java | 1373 boolean M_2 = (c < 0 && d > 0); in mulBounds() 1391 } else if (M_2) { // P1 /\ M in mulBounds() 1416 } else if (M_2) { // P0 /\ M in mulBounds() 1433 } else if (M_2) { // M /\ M in mulBounds() 1450 } else if (M_2) { // N1 /\ M in mulBounds() 1475 } else if (M_2) {// N0 /\ M in mulBounds() 1507 boolean M_2 = (c < 0 && d > 0); in divBounds() 1526 } else if (M_2) { // P1 /\ M in divBounds() 1573 } else if (M_2) { in divBounds()
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/mlir/test/Dialect/Linalg/ |
H A D | fusion-pattern.mlir | 44 // CHECK: %[[M_2:.+]] = dim %[[ARG2]], %[[C0]] 45 // CHECK: %[[TILE_M_2:.+]] = affine.min #[[MAP0]](%[[IV0]])[%[[M_2]]] 117 // CHECK-DAG: %[[M_2:.+]] = dim %[[ARG0]], %[[C0]] 120 // CHECK-SAME: (%[[C0]]) to (%[[M_2]]) step (%[[C32]]) { 122 // CHECK: %[[TILE_M:.+]] = affine.min #[[MAP2]](%[[IV1]])[%[[M_2]]] 184 // CHECK: %[[M_2:.+]] = dim %[[ARG3]], %[[C0]] 185 // CHECK: %[[TILE_M_2:.+]] = affine.min #[[MAP0]](%[[IV0]])[%[[M_2]]] 259 // CHECK: %[[M_2:.+]] = dim %[[ARG4]], %[[C0]] 260 // CHECK: %[[TILE_M_2:.+]] = affine.min #[[MAP0]](%[[IV0]])[%[[M_2]]]
|
/dports/math/faiss/faiss-1.7.1/faiss/ |
H A D | Index2Layer.cpp | 298 int M_2, mi_nbits; member 307 M_2 = storage.pq.M / 2; in Distance2xXPQ4() 327 const __m128* pq_l1 = pq_l1_t + M_2 * l1_idx; in operator ()() 329 for (int m = 0; m < M_2; m++) { in operator ()() 337 pq_l1_t += M_2 << mi_nbits; in operator ()()
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/mlir/test/Dialect/Linalg/ |
H A D | fusion-pattern.mlir | 46 // CHECK: %[[M_2:.+]] = memref.dim %[[ARG2]], %[[C0]] 47 // CHECK: %[[TILE_M_2:.+]] = affine.min #[[MAP0]](%[[IV0]])[%[[M_2]]] 52 // CHECK: %[[TILE_M_3:.+]] = affine.min #[[MAP4]](%[[IV0]])[%[[M_2]], %[[M]]] 130 // CHECK-DAG: %[[M_2:.+]] = memref.dim %[[ARG0]], %[[C0]] 133 // CHECK-SAME: (%[[C0]]) to (%[[M_2]]) step (%[[C32]]) { 135 // CHECK: %[[TILE_M:.+]] = affine.min #[[MAP2]](%[[IV1]])[%[[M_2]]] 198 // CHECK: %[[M_2:.+]] = memref.dim %[[ARG3]], %[[C0]] 199 // CHECK: %[[TILE_M_2:.+]] = affine.min #[[MAP0]](%[[IV0]])[%[[M_2]]] 203 // CHECK: %[[TILE_M_3:.+]] = affine.min #[[MAP4]](%[[IV0]])[%[[M_2]], %[[M]]] 283 // CHECK: %[[M_2:.+]] = memref.dim %[[ARG4]], %[[C0]] [all …]
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/mlir/test/Dialect/Linalg/ |
H A D | fusion-pattern.mlir | 46 // CHECK: %[[M_2:.+]] = memref.dim %[[ARG2]], %[[C0]] 47 // CHECK: %[[TILE_M_2:.+]] = affine.min #[[MAP0]](%[[IV0]])[%[[M_2]]] 52 // CHECK: %[[TILE_M_3:.+]] = affine.min #[[MAP4]](%[[IV0]])[%[[M_2]], %[[M]]] 130 // CHECK-DAG: %[[M_2:.+]] = memref.dim %[[ARG0]], %[[C0]] 133 // CHECK-SAME: (%[[C0]]) to (%[[M_2]]) step (%[[C32]]) { 135 // CHECK: %[[TILE_M:.+]] = affine.min #[[MAP2]](%[[IV1]])[%[[M_2]]] 198 // CHECK: %[[M_2:.+]] = memref.dim %[[ARG3]], %[[C0]] 199 // CHECK: %[[TILE_M_2:.+]] = affine.min #[[MAP0]](%[[IV0]])[%[[M_2]]] 203 // CHECK: %[[TILE_M_3:.+]] = affine.min #[[MAP4]](%[[IV0]])[%[[M_2]], %[[M]]] 283 // CHECK: %[[M_2:.+]] = memref.dim %[[ARG4]], %[[C0]] [all …]
|
/dports/devel/llvm13/llvm-project-13.0.1.src/mlir/test/Dialect/Linalg/ |
H A D | fusion-pattern.mlir | 46 // CHECK: %[[M_2:.+]] = memref.dim %[[ARG2]], %[[C0]] 47 // CHECK: %[[TILE_M_2:.+]] = affine.min #[[MAP0]](%[[IV0]])[%[[M_2]]] 52 // CHECK: %[[TILE_M_3:.+]] = affine.min #[[MAP4]](%[[IV0]])[%[[M_2]], %[[M]]] 130 // CHECK-DAG: %[[M_2:.+]] = memref.dim %[[ARG0]], %[[C0]] 133 // CHECK-SAME: (%[[C0]]) to (%[[M_2]]) step (%[[C32]]) { 135 // CHECK: %[[TILE_M:.+]] = affine.min #[[MAP2]](%[[IV1]])[%[[M_2]]] 198 // CHECK: %[[M_2:.+]] = memref.dim %[[ARG3]], %[[C0]] 199 // CHECK: %[[TILE_M_2:.+]] = affine.min #[[MAP0]](%[[IV0]])[%[[M_2]]] 203 // CHECK: %[[TILE_M_3:.+]] = affine.min #[[MAP4]](%[[IV0]])[%[[M_2]], %[[M]]] 283 // CHECK: %[[M_2:.+]] = memref.dim %[[ARG4]], %[[C0]] [all …]
|
/dports/math/R-cran-LearnBayes/LearnBayes/inst/doc/ |
H A D | BayesFactors.Rnw | 29 …the sampling model -- it could be (model $M_1$) Poisson($\theta$), (model $M_2$) normal with mean … 57 …redictive density. The Bayes factor in support of model $M_1$ over model $M_2$ is given by the ra… 80 We similarly find the predictive densities of the models $M_2$ and $M_3$ by defining functions for … 94 …dictive densities, we see that model $M_1$ is preferred to $M_3$ which is preferred to model $M_2$.
|
/dports/math/R-cran-LearnBayes/LearnBayes/vignettes/ |
H A D | BayesFactors.Rnw | 29 …the sampling model -- it could be (model $M_1$) Poisson($\theta$), (model $M_2$) normal with mean … 57 …redictive density. The Bayes factor in support of model $M_1$ over model $M_2$ is given by the ra… 80 We similarly find the predictive densities of the models $M_2$ and $M_3$ by defining functions for … 94 …dictive densities, we see that model $M_1$ is preferred to $M_3$ which is preferred to model $M_2$.
|
/dports/misc/usd/USD-21.11/pxr/usd/pcp/testenv/testPcpPathTranslation_HardToReach.testenv/TestReverseTranslation_1/ |
H A D | 2.sdf | 3 def __AnyType__ "M_2" (
|
H A D | 1.sdf | 4 add references = @./2.sdf@</M_2>
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/mlir/test/Dialect/Linalg/ |
H A D | fusion-pattern.mlir | 44 // CHECK: %[[M_2:.+]] = dim %[[ARG2]], %[[C0]] 45 // CHECK: %[[TILE_M_2:.+]] = affine.min #[[MAP0]](%[[IV0]])[%[[M_2]]] 122 // CHECK-DAG: %[[M_2:.+]] = dim %[[ARG0]], %[[C0]] 125 // CHECK-SAME: (%[[C0]]) to (%[[M_2]]) step (%[[C32]]) { 127 // CHECK: %[[TILE_M:.+]] = affine.min #[[MAP2]](%[[IV1]])[%[[M_2]]] 189 // CHECK: %[[M_2:.+]] = dim %[[ARG3]], %[[C0]] 190 // CHECK: %[[TILE_M_2:.+]] = affine.min #[[MAP0]](%[[IV0]])[%[[M_2]]] 269 // CHECK: %[[M_2:.+]] = dim %[[ARG4]], %[[C0]] 270 // CHECK: %[[TILE_M_2:.+]] = affine.min #[[MAP0]](%[[IV0]])[%[[M_2]]]
|
/dports/devel/llvm12/llvm-project-12.0.1.src/mlir/test/Dialect/Linalg/ |
H A D | fusion-pattern.mlir | 44 // CHECK: %[[M_2:.+]] = dim %[[ARG2]], %[[C0]] 45 // CHECK: %[[TILE_M_2:.+]] = affine.min #[[MAP0]](%[[IV0]])[%[[M_2]]] 122 // CHECK-DAG: %[[M_2:.+]] = dim %[[ARG0]], %[[C0]] 125 // CHECK-SAME: (%[[C0]]) to (%[[M_2]]) step (%[[C32]]) { 127 // CHECK: %[[TILE_M:.+]] = affine.min #[[MAP2]](%[[IV1]])[%[[M_2]]] 189 // CHECK: %[[M_2:.+]] = dim %[[ARG3]], %[[C0]] 190 // CHECK: %[[TILE_M_2:.+]] = affine.min #[[MAP0]](%[[IV0]])[%[[M_2]]] 269 // CHECK: %[[M_2:.+]] = dim %[[ARG4]], %[[C0]] 270 // CHECK: %[[TILE_M_2:.+]] = affine.min #[[MAP0]](%[[IV0]])[%[[M_2]]]
|
/dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/doc/Eqs/ |
H A D | improper_class2.tex | 9 & & M_2 (\theta_{ijk} - \theta_1) (\theta_{ijl} - \theta_2) + \\
|
/dports/math/gap/gap-4.11.0/pkg/congruence-1.2.3/lib/ |
H A D | units.g | 30 # Returns a list of lists of generators of a subgroup of f.i. in M_2(Q), 76 # Will be applied with n = order of the normal subgroup N determining M_2(Q). 94 # Will be applied with n = order of the normal subgroup N determining M_2(Q).
|
/dports/math/scilab/scilab-6.1.1/scilab/modules/spreadsheet/tests/unit_tests/ |
H A D | csvWrite.tst | 15 filename = fullfile(TMPDIR,"M_2.csv"); 17 assert_checkfilesequal ( filename , fullfile(path,"M_2.csv") );
|