| /external/eigen/Eigen/src/UmfPackSupport/ |
| D | UmfPackSupport.h | 57 const int Ap[], const int Ai[], const double Ax[], void **Symbolic, in umfpack_symbolic() argument
60 return umfpack_di_symbolic(n_row,n_col,Ap,Ai,Ax,Symbolic,Control,Info); in umfpack_symbolic()
64 … const int Ap[], const int Ai[], const std::complex<double> Ax[], void **Symbolic, in umfpack_symbolic() argument
67 return umfpack_zi_symbolic(n_row,n_col,Ap,Ai,&numext::real_ref(Ax[0]),0,Symbolic,Control,Info); in umfpack_symbolic()
70 inline int umfpack_numeric( const int Ap[], const int Ai[], const double Ax[], in umfpack_numeric() argument
74 return umfpack_di_numeric(Ap,Ai,Ax,Symbolic,Numeric,Control,Info); in umfpack_numeric()
77 inline int umfpack_numeric( const int Ap[], const int Ai[], const std::complex<double> Ax[], in umfpack_numeric() argument
81 return umfpack_zi_numeric(Ap,Ai,&numext::real_ref(Ax[0]),0,Symbolic,Numeric,Control,Info); in umfpack_numeric()
84 inline int umfpack_solve( int sys, const int Ap[], const int Ai[], const double Ax[], in umfpack_solve() argument
88 return umfpack_di_solve(sys,Ap,Ai,Ax,X,B,Numeric,Control,Info); in umfpack_solve()
[all …]
|
| /external/eigen/bench/ |
| D | sparse_setter.cpp | 304 const Values Ax, in coo_tocsr() argument
330 Bx[dest] = Ax[n]; in coo_tocsr()
354 T Ax[]) in csr_sort_indices() argument
365 temp.push_back(std::make_pair(Aj[jj],Ax[jj])); in csr_sort_indices()
372 Ax[jj] = temp[n].second; in csr_sort_indices()
382 T Ax[]) in csr_sum_duplicates() argument
391 T x = Ax[jj]; in csr_sum_duplicates()
394 x += Ax[jj]; in csr_sum_duplicates()
398 Ax[nnz] = x; in csr_sum_duplicates()
|
| /external/llvm-project/llvm/test/tools/llvm-objcopy/ELF/ |
| D | strip-sections-only-section.test | 3 # RUN: od -Ax -t x1 %t2 | FileCheck %s
4 # RUN: od -Ax -t c %t2 | FileCheck %s --check-prefix=TEXT
|
| D | strip-sections-keep.test | 3 # RUN: od -Ax -t c %t2 | FileCheck %s
|
| D | binary-first-seg-offset-zero.test | 3 # RUN: od -Ax -t x1 %t2 | FileCheck %s
|
| D | binary-remove-middle.test | 3 # RUN: od -Ax -v -t x1 %t2 | FileCheck %s
|
| D | binary-remove-all-but-one.test | 3 # RUN: od -Ax -t x1 %t2 | FileCheck %s
|
| D | binary-remove-end.test | 3 # RUN: od -Ax -v -t x1 %t2 | FileCheck %s
|
| D | two-seg-remove-end.test | 3 # RUN: od -Ax -v -t x1 %t2 | FileCheck %s
|
| D | two-seg-remove-first.test | 3 # RUN: od -Ax -v -t x1 %t2 | FileCheck %s
|
| D | two-seg-remove-third-sec.test | 3 # RUN: od -Ax -v -t x1 %t2 | FileCheck %s
|
| D | parent-loop-check.test | 13 # RUN: od -Ax -t x1 %t2 | FileCheck %s
|
| /external/eigen/doc/ |
| D | LeastSquares.dox | 6 of equations, say \a Ax = \a b, has no solutions. In this case, it makes sense to search for the
7 vector \a x which is closest to being a solution, in the sense that the difference \a Ax - \a b is
53 Finding the least squares solution of \a Ax = \a b is equivalent to solving the normal equation
54 <i>A</i><sup>T</sup><i>Ax</i> = <i>A</i><sup>T</sup><i>b</i>. This leads to the following code
|
| /external/llvm-project/lld/test/ELF/ |
| D | fill-trap-ppc.s | 6 # RUN: od -Ax -t x1 -N16 -j0x10ff0 %t.ppc64le | FileCheck %s -check-prefix=LE
11 # RUN: od -Ax -t x1 -N16 -j0x10ff0 %t.ppc64 | FileCheck %s -check-prefix=BE
|
| D | fill-trap.s | 13 # RUN: od -Ax -x -N16 -j0x1ff0 %t | FileCheck %s --check-prefix=FILL
18 # RUN: od -Ax -x -N16 -j0x1ff0 %t | FileCheck %s --check-prefix=FILL
|
| D | oformat-binary.s | 22 # RUN: od -Ax -t x1 %talign | FileCheck %s --check-prefix=ALIGN --ignore-case
41 # RUN: od -Ax -t x1 %tlma | FileCheck %s --check-prefix=ALIGN --ignore-case
|
| /external/llvm/test/Transforms/InstSimplify/ |
| D | compare.ll | 1209 define void @icmp_slt_sge_or(i32 %Ax, i32 %Bx) {
1215 %Aneg = or i32 %Ax, 2147483648
1216 %Apos = and i32 %Ax, 2147483647
1236 %Cxp = or i32 %Ax, %Bpos
1237 %Dxp = icmp slt i32 %Cxp, %Ax
1238 %Exp = icmp sge i32 %Cxp, %Ax
1239 %Fxp = icmp sgt i32 %Ax, %Cxp
1240 %Gxp = icmp sle i32 %Ax, %Cxp
1241 %Cxx = or i32 %Ax, %Bx
1242 %Dxx = icmp slt i32 %Cxx, %Ax
[all …]
|
| /external/python/httplib2/tests/tls/ |
| D | client.key | 16 YZRL9idgwgU4LMOqaPkU99de4wzYF44joZrp3Eme3dC9sdHrDtDy6OpiQu4zP+Ax
|
| D | client.pem | 36 YZRL9idgwgU4LMOqaPkU99de4wzYF44joZrp3Eme3dC9sdHrDtDy6OpiQu4zP+Ax
|
| D | client_chain.pem | 56 YZRL9idgwgU4LMOqaPkU99de4wzYF44joZrp3Eme3dC9sdHrDtDy6OpiQu4zP+Ax
|
| /external/llvm-project/llvm/test/Transforms/InstSimplify/ |
| D | compare.ll | 1742 define void @icmp_slt_sge_or(i32 %Ax, i32 %Bx) {
1804 %Aneg = or i32 %Ax, 2147483648
1805 %Apos = and i32 %Ax, 2147483647
1825 %Cxp = or i32 %Ax, %Bpos
1826 %Dxp = icmp slt i32 %Cxp, %Ax
1827 %Exp = icmp sge i32 %Cxp, %Ax
1828 %Fxp = icmp sgt i32 %Ax, %Cxp
1829 %Gxp = icmp sle i32 %Ax, %Cxp
1830 %Cxx = or i32 %Ax, %Bx
1831 %Dxx = icmp slt i32 %Cxx, %Ax
[all …]
|
| /external/skqp/src/core/ |
| D | SkGeometry.cpp | 259 SkScalar Ax = src[1].fX - src[0].fX; in SkFindQuadMaxCurvature() local
264 SkScalar numer = -(Ax * Bx + Ay * By); in SkFindQuadMaxCurvature()
529 SkScalar Ax = src[1].fX - src[0].fX; in SkFindCubicInflections() local
537 Ax*Cy - Ay*Cx, in SkFindCubicInflections()
538 Ax*By - Ay*Bx, in SkFindCubicInflections()
|
| /external/skia/src/pathops/ |
| D | SkPathOpsCubic.cpp | 518 double Ax = fPts[1].fX - fPts[0].fX; in findInflections() local
524 return SkDQuad::RootsValidT(Bx * Cy - By * Cx, Ax * Cy - Ay * Cx, Ax * By - Ay * Bx, tValues); in findInflections()
|
| /external/skqp/src/pathops/ |
| D | SkPathOpsCubic.cpp | 516 double Ax = fPts[1].fX - fPts[0].fX; in findInflections() local
522 return SkDQuad::RootsValidT(Bx * Cy - By * Cx, Ax * Cy - Ay * Cx, Ax * By - Ay * Bx, tValues); in findInflections()
|
| /external/skia/src/core/ |
| D | SkGeometry.cpp | 325 SkScalar Ax = src[1].fX - src[0].fX; in SkFindQuadMaxCurvature() local
330 SkScalar numer = -(Ax * Bx + Ay * By); in SkFindQuadMaxCurvature()
732 SkScalar Ax = src[1].fX - src[0].fX; in SkFindCubicInflections() local
740 Ax*Cy - Ay*Cx, in SkFindCubicInflections()
741 Ax*By - Ay*Bx, in SkFindCubicInflections()
|