| /external/eigen/doc/special_examples/ |
| Tutorial_sparse_example.cpp | 7 void buildProblem(std::vector<T>& coefficients, Eigen::VectorXd& b, int n);
16 std::vector<T> coefficients; // list of non-zeros coefficients local
18 buildProblem(coefficients, b, n);
21 A.setFromTriplets(coefficients.begin(), coefficients.end());
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/ |
| LinearInterpolator.java | 66 final double coefficients[] = new double[2]; local
68 coefficients[0] = y[i];
69 coefficients[1] = m[i];
70 polynomials[i] = new PolynomialFunction(coefficients);
|
| SplineInterpolator.java | 100 // cubic spline coefficients -- b is linear, c quadratic, d is cubic (original y's are constants)
115 double coefficients[] = new double[4]; local
117 coefficients[0] = y[i];
118 coefficients[1] = b[i];
119 coefficients[2] = c[i];
120 coefficients[3] = d[i];
121 polynomials[i] = new PolynomialFunction(coefficients);
|
| /external/skia/src/gpu/effects/ |
| GrBicubicEffect.h | 26 const float* coefficients() const { return fCoefficients; } function in class:GrBicubicEffect
33 * Create a simple filter effect with custom bicubic coefficients and optional domain.
35 static const GrFragmentProcessor* Create(GrTexture* tex, const SkScalar coefficients[16],
40 return Create(tex, coefficients, GrCoordTransform::MakeDivByTextureWHMatrix(tex),
43 return new GrBicubicEffect(tex, coefficients,
57 * Create a filter effect with custom bicubic coefficients, the texture matrix, and the x/y
60 static const GrFragmentProcessor* Create(GrTexture* tex, const SkScalar coefficients[16],
63 return new GrBicubicEffect(tex, coefficients, matrix, tileModes);
85 GrBicubicEffect(GrTexture*, const SkScalar coefficients[16], const SkMatrix &matrix,
87 GrBicubicEffect(GrTexture*, const SkScalar coefficients[16], const SkMatrix &matrix
[all...] |
| GrBicubicEffect.cpp | 53 "Coefficients");
64 GrGLSLShaderVar("coefficients", kMat44f_GrSLType),
78 "\tvec4 c = coefficients * ts;\n"
123 pdman.setMatrix4f(fCoefficientsUni, bicubicEffect.coefficients());
137 const SkScalar coefficients[16],
143 convert_row_major_scalar_coeffs_to_column_major_floats(fCoefficients, coefficients);
147 const SkScalar coefficients[16],
154 convert_row_major_scalar_coeffs_to_column_major_floats(fCoefficients, coefficients);
171 return !memcmp(fCoefficients, s.coefficients(), 16) &&
185 SkScalar coefficients[16] local
[all...] |
| /external/pdfium/xfa/src/fxbarcode/common/reedsolomon/ |
| BC_ReedSolomon.cpp | 85 CFX_Int32Array* coefficients = remainder->GetCoefficients();
local
86 int32_t numZeroCoefficients = ecBytes - coefficients->GetSize();
90 for (int32_t y = 0; y < coefficients->GetSize(); y++) {
92 coefficients->operator[](y);
|
| BC_ReedSolomonGF256.cpp | 91 CFX_Int32Array coefficients;
local
92 coefficients.SetSize(degree + 1);
93 coefficients[0] = coefficient;
95 temp->Init(this, &coefficients, e);
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/ |
| PolynomialFunctionNewtonForm.java | 40 * The coefficients of the polynomial, ordered by degree -- i.e.
41 * coefficients[0] is the constant term and coefficients[n] is the
44 private double coefficients[]; field in class:PolynomialFunctionNewtonForm
52 * When all c[i] = 0, a[] becomes normal polynomial coefficients,
53 * i.e. a[i] = coefficients[i].
58 * Whether the polynomial coefficients are available.
69 * @param a the coefficients in Newton form formula
106 * Returns a copy of coefficients in Newton form formula.
110 * @return a fresh copy of coefficients in Newton form formul
[all...] |
| PolynomialFunction.java | 29 * Immutable representation of a real polynomial function with real coefficients.
44 * The coefficients of the polynomial, ordered by degree -- i.e.,
45 * coefficients[0] is the constant term and coefficients[n] is the
48 private final double coefficients[]; field in class:PolynomialFunction
51 * Construct a polynomial with the given coefficients. The first element
52 * of the coefficients array is the constant term. Higher degree
53 * coefficients follow in sequence. The degree of the resulting polynomial
58 * the coefficients property.</p>
60 * @param c polynomial coefficients
[all...] |
| PolynomialFunctionLagrangeForm.java | 41 * The coefficients of the polynomial, ordered by degree -- i.e.
42 * coefficients[0] is the constant term and coefficients[n] is the
45 private double coefficients[]; field in class:PolynomialFunctionLagrangeForm
58 * Whether the polynomial coefficients are available.
128 * Returns a copy of the coefficients array.
132 * Note that coefficients computation can be ill-conditioned. Use with caution
135 * @return a fresh copy of the coefficients array
141 double[] out = new double[coefficients.length];
142 System.arraycopy(coefficients, 0, out, 0, coefficients.length)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/linear/ |
| LinearConstraint.java | 45 * The c<sub>i</sub>, l<sub>i</sub> or r<sub>i</sub> are the coefficients of the constraints, the x<sub>i</sub>
56 /** Coefficients of the constraint (left hand side). */
57 private final transient RealVector coefficients; field in class:LinearConstraint
75 * @param coefficients The coefficients of the constraint (left hand side)
79 public LinearConstraint(final double[] coefficients, final Relationship relationship,
81 this(new ArrayRealVector(coefficients), relationship, value);
94 * @param coefficients The coefficients of the constraint (left hand side)
98 public LinearConstraint(final RealVector coefficients, final Relationship relationship
[all...] |
| LinearObjectiveFunction.java | 36 * The c<sub>i</sub> and d are the coefficients of the equation,
47 /** Coefficients of the constraint (c<sub>i</sub>). */
48 private final transient RealVector coefficients; field in class:LinearObjectiveFunction
54 * @param coefficients The coefficients for the linear equation being optimized
57 public LinearObjectiveFunction(double[] coefficients, double constantTerm) {
58 this(new ArrayRealVector(coefficients), constantTerm);
62 * @param coefficients The coefficients for the linear equation being optimized
65 public LinearObjectiveFunction(RealVector coefficients, double constantTerm)
[all...] |
| SimplexTableau.java | 185 // decision variable coefficients
268 * Get the -1 times the sum of all coefficients in the given array.
269 * @param coefficients coefficients to sum
270 * @return the -1 times the sum of all coefficients in the given array.
272 protected static double getInvertedCoeffiecientSum(final RealVector coefficients) {
274 for (double coefficient : coefficients.getData()) {
374 double[] coefficients = new double[getOriginalNumDecisionVariables()]; local
375 for (int i = 0; i < coefficients.length; i++) {
378 coefficients[i] = 0
[all...] |
| /external/pdfium/xfa/src/fxbarcode/pdf417/ |
| BC_PDF417ECModulusGF.cpp | 81 CFX_Int32Array coefficients;
local
82 coefficients.SetSize(degree + 1);
83 coefficients[0] = coefficient;
84 modulusPoly = new CBC_PDF417ECModulusPoly(this, coefficients, e);
|
| /external/skia/src/gpu/gl/ |
| GrGLPathRendering.cpp | 195 float coefficients[3 * 3]; local
198 coefficients[0] = SkScalarToFloat(matrix[SkMatrix::kMScaleX]);
199 coefficients[1] = SkScalarToFloat(matrix[SkMatrix::kMSkewX]);
200 coefficients[2] = SkScalarToFloat(matrix[SkMatrix::kMTransX]);
203 coefficients[3] = SkScalarToFloat(matrix[SkMatrix::kMSkewY]);
204 coefficients[4] = SkScalarToFloat(matrix[SkMatrix::kMScaleY]);
205 coefficients[5] = SkScalarToFloat(matrix[SkMatrix::kMTransY]);
209 coefficients[6] = SkScalarToFloat(matrix[SkMatrix::kMPersp0]);
210 coefficients[7] = SkScalarToFloat(matrix[SkMatrix::kMPersp1]);
211 coefficients[8] = SkScalarToFloat(matrix[SkMatrix::kMPersp2])
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
| LaguerreSolver.java | 231 double coefficients[] = ((PolynomialFunction) f).getCoefficients(); local
232 Complex c[] = new Complex[coefficients.length];
233 for (int i = 0; i < coefficients.length; i++) {
234 c[i] = new Complex(coefficients[i], 0.0);
273 * Find all complex roots for the polynomial with the given coefficients,
276 * @param coefficients the polynomial coefficients array
286 public Complex[] solveAll(double coefficients[], double initial) throws
289 Complex c[] = new Complex[coefficients.length];
292 c[i] = new Complex(coefficients[i], 0.0)
[all...] |
| /developers/build/prebuilts/gradle/RenderScriptIntrinsic/Application/src/main/java/com/example/android/renderscriptintrinsic/ |
| MainActivity.java | 196 float coefficients[] = {-f1 * 2, 0, -f1, 0, 0, 0, -f2 * 2, -f2, 0, local
202 mScriptConvolve.setCoefficients(coefficients);
|
| /developers/samples/android/renderScript/RenderScriptIntrinsic/Application/src/main/java/com/example/android/renderscriptintrinsic/ |
| MainActivity.java | 196 float coefficients[] = {-f1 * 2, 0, -f1, 0, 0, 0, -f2 * 2, -f2, 0, local
202 mScriptConvolve.setCoefficients(coefficients);
|
| /development/samples/browseable/RenderScriptIntrinsic/src/com.example.android.renderscriptintrinsic/ |
| MainActivity.java | 196 float coefficients[] = {-f1 * 2, 0, -f1, 0, 0, 0, -f2 * 2, -f2, 0, local
202 mScriptConvolve.setCoefficients(coefficients);
|
| /external/skia/src/core/ |
| SkScalerContext.cpp | 268 // The strategy is to use one FIR (different coefficients) for each of r, g, and b.
270 // The FIRs are aligned, and the coefficients reach 5 samples to each side of their 'center'.
277 // Coefficients determined by a gausian where 5 samples = 3 std deviations (0x110 'contrast').
284 static const unsigned int coefficients[LCD_PER_PIXEL][SAMPLES_PER_PIXEL*3] = { local
306 fir[subpxl_index] += coefficients[subpxl_index][coeff_index] * sample_value;
|
| /external/zxing/core/ |
| core.jar | |
| /prebuilts/devtools/tools/lib/ |
| bcprov-jdk15on-1.48.jar | |
| /prebuilts/tools/common/m2/repository/org/bouncycastle/bcprov-jdk15on/1.48/ |
| bcprov-jdk15on-1.48.jar | |
| /prebuilts/tools/common/offline-m2/org/bouncycastle/bcprov-jdk15on/1.48/ |
| bcprov-jdk15on-1.48.jar | |
