| /external/skia/src/core/ |
| SkStrokerPriv.cpp | 13 static void ButtCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal,
18 static void RoundCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal,
23 SkPoint projectedCenter = pivot + parallel;
29 static void SquareCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal,
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.fY + normal.fY + parallel.fY)
[all...] |
| SkStrokerPriv.h | 27 const SkPoint& pivot,
34 const SkPoint& pivot,
|
| /external/skqp/src/core/ |
| SkStrokerPriv.cpp | 13 static void ButtCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal,
18 static void RoundCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal,
23 SkPoint projectedCenter = pivot + parallel;
29 static void SquareCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal,
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.fY + normal.fY + parallel.fY)
[all...] |
| SkStrokerPriv.h | 27 const SkPoint& pivot,
34 const SkPoint& pivot,
|
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_utilities_indexing.cpp | 35 a pivot element. Values equal to the pivot are ignored*/
36 void db_LeanPartitionOnPivot(double pivot,double *dest,const double *source,long first,long last,long *first_equal,long *last_equal)
52 if(temp<pivot) *(d_bottom++)=temp;
53 else if(temp>pivot) *(d_top--)=temp;
63 double pivot; local
78 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2]);
79 db_LeanPartitionOnPivot(pivot,dest,source,first,last,&first_equal,&last_equal);
85 return(pivot);
95 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2])
[all...] |
| /external/bart/bart/thermal/ |
| ThermalAssert.py | 65 for pivot, data_frame in data.groupby(axis=1, level=0):
67 series = data_frame[pivot]
77 result[pivot] = sum((index - shift_index)[mask.values])
80 result[pivot] = (
81 result[pivot] * 100.0) / self._ftrace.get_duration()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| LUDecompositionImpl.java | 44 /** Pivot permutation associated with LU decomposition */
45 private int[] pivot; field in class:LUDecompositionImpl
88 pivot = new int[m];
95 pivot[row] = row;
139 // Pivot if necessary
149 int temp = pivot[max];
150 pivot[max] = pivot[col];
151 pivot[col] = temp;
167 final int m = pivot.length
238 private final int[] pivot; field in class:LUDecompositionImpl.Solver
[all...] |
| FieldLUDecompositionImpl.java | 35 * a zero pivot element, no attempt is done to get the largest pivot element.</p>
49 /** Pivot permutation associated with LU decomposition */
50 private int[] pivot; field in class:FieldLUDecompositionImpl
82 pivot = new int[m];
89 pivot[row] = row;
131 // Pivot if necessary
139 int temp = pivot[nonZero];
140 pivot[nonZero] = pivot[col]
235 private final int[] pivot; field in class:FieldLUDecompositionImpl.Solver
[all...] |
| /external/trappy/trappy/plotter/ |
| BarPlot.py | 100 for i, (constraint, pivot) in enumerate(series_list):
102 bar_anchor = np.arange(len(result[pivot].values))
108 result[pivot].values,
116 end_of_previous = [x + y for (x, y) in zip(end_of_previous, result[pivot].values)]
118 axis.set_title(self.make_title(constraint, pivot, permute, concat))
120 self.add_to_legend(i, line_2d_list[0], constraint, pivot, concat, permute)
|
| LinePlot.py | 158 for i, (constraint, pivot) in enumerate(series_list):
161 result[pivot].index,
162 result[pivot].values,
170 axis.set_title(self.make_title(constraint, pivot, permute, concat))
172 self.add_to_legend(i, line_2d_list[0], constraint, pivot, concat, permute)
|
| ILinePlot.py | 161 self._attr["pivot"],
206 self._attr["pivot"] = AttrConf.PIVOT
226 trace_idx, pivot = p_val
231 pivot = p_val
235 if pivot in result:
236 data_dict[legend] = result[pivot]
240 elif pivot != AttrConf.PIVOT_VAL:
241 title = "{0}: {1}".format(self._attr["pivot"], self._attr["map_label"].get(pivot, pivot)
[all...] |
| /external/trappy/trappy/ |
| idle.py | 23 pivot = "cpu_id" variable in class:CpuIdle
|
| sched.py | 30 pivot = "cpus" variable in class:SchedLoadAvgSchedGroup
31 """The Pivot along which the data is orthogonal"""
49 pivot = "pid" variable in class:SchedLoadAvgTask
50 """The Pivot along which the data is orthogonal"""
66 pivot="cpu")
80 pivot = "cpu" variable in class:SchedCpuCapacity
81 """The Pivot along which the data is orthogonal"""
84 """This renaming is necessary because our cpu related pivot is 'cpu'
126 pivot = "cpu" variable in class:SchedCpuFrequency
127 """The Pivot along which the data is orthogonal""
[all...] |
| dynamic.py | 69 parse_raw=False, pivot=None):
88 :param pivot: The data column about which the data can be grouped
89 :type pivot: str
115 if pivot:
116 kwords["pivot"] = pivot
|
| utils.py | 132 def merge_dfs(pr_df, sec_df, pivot):
141 pivot_map[data[pivot]] = data
148 if key == pivot:
151 if value != value and pivot_map.has_key(data[pivot]):
152 data[key] = pivot_map[data[pivot]][key]
|
| /frameworks/base/tools/aapt2/ |
| NameMangler.h | 82 size_t pivot = out_name->find('$'); local
83 if (pivot == std::string::npos) {
87 out_package->assign(out_name->data(), pivot);
88 std::string new_name = out_name->substr(pivot + 1);
|
| /external/lisa/libs/utils/analysis/ |
| residency_analysis.py | 38 def __init__(self, pivot, time):
54 def process_pivot(pivot_list, pivot):
57 return pivot in pivot_list
61 pivot = args[0]['pivot']
68 debugg = False if pivot == 'schedtune' else False
71 prev_pivot = data['prev_' + pivot]
72 next_pivot = data['next_' + pivot]
75 pivot_res = res_analysis_obj.residency[pivot][int(cpu)]
81 # prev pivot processing (switch out
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/ |
| SplineMath.java | 41 int pivot = 0; local
44 pivot = j;
47 cur = points[pivot];
48 next = points[pivot + 1];
63 double tc = (a * a * a - a) * derivatives[pivot];
64 double td = (b * b * b - b) * derivatives[pivot + 1];
82 int pivot = 0; local
84 pivot = j;
89 cur = mPoints[pivot];
90 next = mPoints[pivot + 1]
[all...] |
| /external/trappy/tests/ |
| test_stats.py | 137 pivot = "identifier"
143 pivot)
159 pivot="identifier")
166 filters=my_filters, value=1, pivot="identifier")
187 pivot="result")
193 """Trigger works with a filter that depends on previous values of the same pivot"""
224 pivot="result")
245 pivot = "identifier"
251 pivot)
282 pivot = "identifier
[all...] |
| /external/eigen/bench/btl/actions/ |
| action_lu_solve.hh | 74 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/stat/descriptive/rank/ |
| Percentile.java | 301 * @param pivotsHeap set of pivot index corresponding to elements that
317 final int pivot; local
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) {
[all...] |
| /external/eigen/bench/btl/libs/blitz/ |
| blitz_LU_solve_interface.hh | 39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N)
42 pivot.resize(N);
46 inline static void free_Pivot_Vector(Pivot_Vector & pivot)
87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N)
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)
161 int ip = pivot( i ) ;
|
| /external/eigen/bench/btl/libs/gmm/ |
| gmm_LU_solve_interface.hh | 39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N)
42 pivot.resize(N);
46 inline static void free_Pivot_Vector(Pivot_Vector & pivot)
87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N)
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)
161 int ip = pivot( i ) ;
|
| /external/eigen/bench/btl/libs/mtl4/ |
| mtl4_LU_solve_interface.hh | 39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N)
42 pivot.resize(N);
46 inline static void free_Pivot_Vector(Pivot_Vector & pivot)
87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N)
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)
161 int ip = pivot( i ) ;
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/ |
| MatrixUtils.java | 44 * Find a pivot and swap the row of squareMatrix0 and squareMatrix1
49 float pivot = Math.abs(squareMatrix0[row][row]); local
51 if (pivot < Math.abs(squareMatrix0[i][row])) {
53 pivot = Math.abs(squareMatrix0[i][row]);
74 final float pivot = squareMatrix0[row][row]; local
75 if (pivot == 0) {
76 throw new MatrixOperationFailedException("Inverse failed. Invalid pivot");
79 squareMatrix0[row][j] /= pivot;
80 squareMatrix1[row][j] /= pivot;
|
