Searched defs:pivot (Results 1 - 25 of 53) sorted by relevance

123

/external/trappy/tests/trappy/
H A Didle.py23 pivot = "cpu_id" variable in class:CpuIdle
H A Dpid_controller.py29 pivot = "thermal_zone_id" variable in class:PIDController
H A Dcpu_power.py106 pivot = "cpus" variable in class:CpuOutPower
136 pivot = "cpus" variable in class:CpuInPower
H A Dsched.py30 pivot = "cpus" variable in class:SchedLoadAvgSchedGroup
49 pivot = "pid" variable in class:SchedLoadAvgTask
66 pivot="cpu")
80 pivot = "cpu" variable in class:SchedCpuCapacity
84 """This renaming is necessary because our cpu related pivot is 'cpu'
126 pivot = "cpu" variable in class:SchedCpuFrequency
130 """This renaming is necessary because our cpu related pivot is 'cpu'
H A Dthermal.py36 pivot = "id" variable in class:Thermal
130 pivot = "thermal_zone_id" variable in class:ThermalGovernor
/external/trappy/trappy/
H A Didle.py23 pivot = "cpu_id" variable in class:CpuIdle
H A Dpid_controller.py29 pivot = "thermal_zone_id" variable in class:PIDController
H A Dcpu_power.py106 pivot = "cpus" variable in class:CpuOutPower
136 pivot = "cpus" variable in class:CpuInPower
H A Dsched.py30 pivot = "cpus" variable in class:SchedLoadAvgSchedGroup
49 pivot = "pid" variable in class:SchedLoadAvgTask
66 pivot="cpu")
80 pivot = "cpu" variable in class:SchedCpuCapacity
84 """This renaming is necessary because our cpu related pivot is 'cpu'
126 pivot = "cpu" variable in class:SchedCpuFrequency
130 """This renaming is necessary because our cpu related pivot is 'cpu'
H A Dthermal.py36 pivot = "id" variable in class:Thermal
130 pivot = "thermal_zone_id" variable in class:ThermalGovernor
/external/eigen/bench/btl/actions/
H A Daction_lu_solve.hh74 typename Interface::Pivot_Vector pivot; // pivot vector local
75 Interface::new_Pivot_Vector(pivot,size);
89 Interface::LU_factor(LU,pivot,size);
93 Interface::LU_solve(LU,pivot,B,X,size);
125 Interface::free_Pivot_Vector(pivot);
/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
H A DFieldLUDecompositionImpl.java35 * a zero pivot element, no attempt is done to get the largest pivot element.</p>
50 private int[] pivot; field in class:FieldLUDecompositionImpl
82 pivot = new int[m];
89 pivot[row] = row;
139 int temp = pivot[nonZero];
140 pivot[nonZero] = pivot[col];
141 pivot[col] = temp;
158 final int m = pivot
235 private final int[] pivot; field in class:FieldLUDecompositionImpl.Solver
247 Solver(final Field<T> field, final T[][] lu, final int[] pivot, final boolean singular) argument
[all...]
H A DLUDecompositionImpl.java45 private int[] pivot; field in class:LUDecompositionImpl
88 pivot = new int[m];
95 pivot[row] = row;
149 int temp = pivot[max];
150 pivot[max] = pivot[col];
151 pivot[col] = temp;
167 final int m = pivot.length;
183 final int m = pivot.length;
198 final int m = pivot
238 private final int[] pivot; field in class:LUDecompositionImpl.Solver
249 Solver(final double[][] lu, final int[] pivot, final boolean singular) argument
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/rank/
H A DPercentile.java301 * @param pivotsHeap set of pivot index corresponding to elements that
317 final int pivot;
319 // the pivot has already been found in a previous call
321 pivot = pivotsHeap[node];
323 // select a pivot and partition work array around it
324 pivot = partition(work, begin, end, medianOf3(work, begin, end));
326 pivotsHeap[node] = pivot;
330 if (k == pivot) {
331 // the pivot was exactly the element we wanted
333 } else if (k < pivot) {
396 partition(final double[] work, final int begin, final int end, final int pivot) argument
[all...]
/external/eigen/bench/btl/libs/blitz/
H A Dblitz_LU_solve_interface.hh39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N) argument
42 pivot.resize(N);
46 inline static void free_Pivot_Vector(Pivot_Vector & pivot) argument
87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) argument
117 // Search for the largest pivot element :
139 pivot( j ) = index_max ;
141 // Divide by the pivot element :
150 inline static void LU_solve(const gene_matrix & LU, const Pivot_Vector pivot, gene_vector &B, gene_vector X, int N) argument
161 int ip = pivot( i ) ;
/external/eigen/bench/btl/libs/gmm/
H A Dgmm_LU_solve_interface.hh39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N) argument
42 pivot.resize(N);
46 inline static void free_Pivot_Vector(Pivot_Vector & pivot) argument
87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) argument
117 // Search for the largest pivot element :
139 pivot( j ) = index_max ;
141 // Divide by the pivot element :
150 inline static void LU_solve(const gene_matrix & LU, const Pivot_Vector pivot, gene_vector &B, gene_vector X, int N) argument
161 int ip = pivot( i ) ;
/external/eigen/bench/btl/libs/mtl4/
H A Dmtl4_LU_solve_interface.hh39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N) argument
42 pivot.resize(N);
46 inline static void free_Pivot_Vector(Pivot_Vector & pivot) argument
87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) argument
117 // Search for the largest pivot element :
139 pivot( j ) = index_max ;
141 // Divide by the pivot element :
150 inline static void LU_solve(const gene_matrix & LU, const Pivot_Vector pivot, gene_vector &B, gene_vector X, int N) argument
161 int ip = pivot( i ) ;
/external/skia/src/core/
H A DSkTSort.h138 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { argument
139 T pivotValue = *pivot;
140 SkTSwap(*pivot, *right);
178 T* pivot = left + ((right - left) >> 1); local
179 pivot = SkTQSort_Partition(left, right, pivot, lessThan);
181 SkTIntroSort(depth, left, pivot - 1, lessThan);
182 left = pivot + 1;
H A DSkStrokerPriv.cpp13 static void ButtCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal, argument
18 static void RoundCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal, argument
23 SkPoint projectedCenter = pivot + parallel;
29 static void SquareCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal, argument
35 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY);
36 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY);
38 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot
68 HandleInnerJoin(SkPath* inner, const SkPoint& pivot, const SkVector& after) argument
82 BluntJoiner(SkPath* outer, SkPath* inner, const SkVector& beforeUnitNormal, const SkPoint& pivot, const SkVector& afterUnitNormal, SkScalar radius, SkScalar invMiterLimit, bool, bool) argument
97 RoundJoiner(SkPath* outer, SkPath* inner, const SkVector& beforeUnitNormal, const SkPoint& pivot, const SkVector& afterUnitNormal, SkScalar radius, SkScalar invMiterLimit, bool, bool) argument
133 MiterJoiner(SkPath* outer, SkPath* inner, const SkVector& beforeUnitNormal, const SkPoint& pivot, const SkVector& afterUnitNormal, SkScalar radius, SkScalar invMiterLimit, bool prevIsLine, bool currIsLine) argument
[all...]
/external/skqp/src/core/
H A DSkTSort.h138 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { argument
139 T pivotValue = *pivot;
140 SkTSwap(*pivot, *right);
178 T* pivot = left + ((right - left) >> 1); local
179 pivot = SkTQSort_Partition(left, right, pivot, lessThan);
181 SkTIntroSort(depth, left, pivot - 1, lessThan);
182 left = pivot + 1;
/external/eigen/unsupported/Eigen/src/Skyline/
H A DSkylineInplaceLU.h128 const double pivot = m_lu.coeffDiag(row); local
133 lIt.valueRef() /= pivot;
/external/icu/android_icu4j/src/main/java/android/icu/impl/
H A DStringRange.java176 public boolean merge(int pivot, Ranges other) { argument
177 // We merge items if the pivot is adjacent, and all later ranges are equal.
179 if (i == pivot) {
190 ranges[pivot].max = other.ranges[pivot].max;
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DStringRange.java172 public boolean merge(int pivot, Ranges other) { argument
173 // We merge items if the pivot is adjacent, and all later ranges are equal.
175 if (i == pivot) {
186 ranges[pivot].max = other.ranges[pivot].max;
/external/skia/gm/
H A Daaclip.cpp316 SkMatrix pivot; local
317 pivot.setRotate(90, W/2, H/2);
318 fVPath.transform(pivot, &fHPath);
/external/skia/samplecode/
H A DSampleAndroidShadows.cpp236 SkPoint pivot = SkPoint::Make(fWideRectPath.getBounds().width()/2, variable
245 persp.preTranslate(-pivot.fX, -pivot.fY);
246 persp.postTranslate(pivot.fX + translate.fX, pivot.fY + translate.fY);
251 SkTMax(1.0f, 16 + fZDelta) - SkScalarSin(-radians)*pivot.fY);
255 pivot = SkPoint::Make(fWideOvalPath.getBounds().width() / 2,
261 persp.preTranslate(-pivot.fX, -pivot.fY);
262 persp.postTranslate(pivot
[all...]

Completed in 1094 milliseconds

123