OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:xLen
(Results
1 - 7
of
7
) sorted by null
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/
BicubicSplineInterpolator.java
51
final int
xLen
= xval.length;
58
final double[][] fX = new double[yLen][
xLen
];
59
for (int i = 0; i <
xLen
; i++) {
78
// For each line x[i] (0 <= i <
xLen
), construct a 1D spline with
80
final PolynomialSplineFunction[] xSplineY = new PolynomialSplineFunction[
xLen
];
81
for (int i = 0; i <
xLen
; i++) {
86
final double[][] dFdX = new double[
xLen
][yLen];
89
for (int i = 0; i <
xLen
; i++) {
95
final double[][] dFdY = new double[
xLen
][yLen];
96
for (int i = 0; i <
xLen
; i++)
[
all
...]
SmoothingPolynomialBicubicSplineInterpolator.java
85
final int
xLen
= xval.length;
88
for (int i = 0; i <
xLen
; i++) {
102
for (int i = 0; i <
xLen
; i++) {
111
final double[][] fval_1 = new double[
xLen
][yLen];
114
for (int i = 0; i <
xLen
; i++) {
119
// For each line x[i] (0 <= i <
xLen
), construct a polynomial, with
121
final PolynomialFunction[] xPolyY = new PolynomialFunction[
xLen
];
122
for (int i = 0; i <
xLen
; i++) {
133
final double[][] fval_2 = new double[
xLen
][yLen];
134
for (int i = 0; i <
xLen
; i++)
[
all
...]
SmoothingBicubicSplineInterpolator.java
64
final int
xLen
= xval.length;
71
final double[][] zX = new double[yLen][
xLen
];
72
for (int i = 0; i <
xLen
; i++) {
93
final double[][] zY_1 = new double[
xLen
][yLen];
96
for (int i = 0; i <
xLen
; i++) {
101
// For each line x[i] (0 <= i <
xLen
), construct a 1D spline with
103
final PolynomialSplineFunction[] xSplineY = new PolynomialSplineFunction[
xLen
];
104
for (int i = 0; i <
xLen
; i++) {
110
final double[][] zY_2 = new double[
xLen
][yLen];
111
for (int i = 0; i <
xLen
; i++)
[
all
...]
TricubicSplineInterpolator.java
51
final int
xLen
= xval.length;
58
final double[][][] fvalXY = new double[zLen][
xLen
][yLen];
59
final double[][][] fvalZX = new double[yLen][zLen][
xLen
];
60
for (int i = 0; i <
xLen
; i++) {
80
// For each line x[i] (0 <= i <
xLen
), construct a 2D spline in y and z
82
= new BicubicSplineInterpolatingFunction[
xLen
];
83
for (int i = 0; i <
xLen
; i++) {
102
final double[][][] dFdX = new double[
xLen
][yLen][zLen];
103
final double[][][] dFdY = new double[
xLen
][yLen][zLen];
104
final double[][][] d2FdXdY = new double[
xLen
][yLen][zLen]
[
all
...]
BicubicSplineInterpolatingFunction.java
99
final int
xLen
= x.length;
102
if (
xLen
== 0 || yLen == 0 || f.length == 0 || f[0].length == 0) {
105
if (
xLen
!= f.length) {
106
throw new DimensionMismatchException(
xLen
, f.length);
108
if (
xLen
!= dFdX.length) {
109
throw new DimensionMismatchException(
xLen
, dFdX.length);
111
if (
xLen
!= dFdY.length) {
112
throw new DimensionMismatchException(
xLen
, dFdY.length);
114
if (
xLen
!= d2FdXdY.length) {
115
throw new DimensionMismatchException(
xLen
, d2FdXdY.length)
[
all
...]
TricubicSplineInterpolatingFunction.java
156
final int
xLen
= x.length;
160
if (
xLen
== 0 || yLen == 0 || z.length == 0 || f.length == 0 || f[0].length == 0) {
163
if (
xLen
!= f.length) {
164
throw new DimensionMismatchException(
xLen
, f.length);
166
if (
xLen
!= dFdX.length) {
167
throw new DimensionMismatchException(
xLen
, dFdX.length);
169
if (
xLen
!= dFdY.length) {
170
throw new DimensionMismatchException(
xLen
, dFdY.length);
172
if (
xLen
!= dFdZ.length) {
173
throw new DimensionMismatchException(
xLen
, dFdZ.length)
[
all
...]
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
HeuristicSolver.h
311
unsigned
xLen
= xCosts.getLength(),
320
for (unsigned k = 1; k <
xLen
; ++k) {
Completed in 1168 milliseconds