| /external/skia/src/core/ |
| D | SkStrokerPriv.cpp | 14 static void ButtCapper(SkPath* path, const SkPoint& pivot, in ButtCapper() argument
21 static void RoundCapper(SkPath* path, const SkPoint& pivot, in RoundCapper() argument
28 SkPoint projectedCenter = pivot + parallel; in RoundCapper()
34 static void SquareCapper(SkPath* path, const SkPoint& pivot, in SquareCapper() argument
43 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
44 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
48 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
49 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
79 static void HandleInnerJoin(SkPath* inner, const SkPoint& pivot, const SkVector& after) in HandleInnerJoin() argument
88 inner->lineTo(pivot.fX, pivot.fY); in HandleInnerJoin()
[all …]
|
| D | SkTSort.h | 136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { in SkTQSort_Partition() argument
137 T pivotValue = *pivot; in SkTQSort_Partition()
138 SkTSwap(*pivot, *right); in SkTQSort_Partition()
176 T* pivot = left + ((right - left) >> 1); in SkTIntroSort() local
177 pivot = SkTQSort_Partition(left, right, pivot, lessThan); in SkTIntroSort()
179 SkTIntroSort(depth, left, pivot - 1, lessThan); in SkTIntroSort()
180 left = pivot + 1; in SkTIntroSort()
|
| D | SkStrokerPriv.h | 25 const SkPoint& pivot,
32 const SkPoint& pivot,
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| D | LUDecompositionImpl.java | 45 private int[] pivot; field in LUDecompositionImpl
88 pivot = new int[m]; in LUDecompositionImpl()
95 pivot[row] = row; in LUDecompositionImpl()
149 int temp = pivot[max]; in LUDecompositionImpl()
150 pivot[max] = pivot[col]; in LUDecompositionImpl()
151 pivot[col] = temp; in LUDecompositionImpl()
167 final int m = pivot.length; in getL()
183 final int m = pivot.length; in getU()
198 final int m = pivot.length; in getP()
201 cachedP.setEntry(i, pivot[i], 1.0); in getP()
[all …]
|
| D | FieldLUDecompositionImpl.java | 50 private int[] pivot; field in FieldLUDecompositionImpl
82 pivot = new int[m]; in FieldLUDecompositionImpl()
89 pivot[row] = row; in FieldLUDecompositionImpl()
139 int temp = pivot[nonZero]; in FieldLUDecompositionImpl()
140 pivot[nonZero] = pivot[col]; in FieldLUDecompositionImpl()
141 pivot[col] = temp; in FieldLUDecompositionImpl()
158 final int m = pivot.length; in getL()
174 final int m = pivot.length; in getU()
189 final int m = pivot.length; in getP()
192 cachedP.setEntry(i, pivot[i], field.getOne()); in getP()
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/rank/ |
| D | Percentile.java | 317 final int pivot; in select() local
321 pivot = pivotsHeap[node]; in select()
324 pivot = partition(work, begin, end, medianOf3(work, begin, end)); in select()
326 pivotsHeap[node] = pivot; in select()
330 if (k == pivot) { in select()
333 } else if (k < pivot) { in select()
335 end = pivot; in select()
339 begin = pivot + 1; in select()
396 private int partition(final double[] work, final int begin, final int end, final int pivot) { in partition() argument
398 final double value = work[pivot]; in partition()
[all …]
|
| /external/mockito/cglib-and-asm/src/org/mockito/cglib/util/ |
| D | SorterTemplate.java | 99 private void merge(int lo, int pivot, int hi, int len1, int len2) { in merge() argument
104 if (compare(pivot, lo) < 0) { in merge()
105 swap(pivot, lo); in merge()
114 second_cut = lower(pivot, hi, first_cut); in merge()
115 len22 = second_cut - pivot; in merge()
118 second_cut = pivot + len22; in merge()
119 first_cut = upper(lo, pivot, second_cut); in merge()
122 rotate(first_cut, pivot, second_cut); in merge()
|
| /external/eigen/bench/btl/libs/mtl4/ |
| D | mtl4_LU_solve_interface.hh | 39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N) in new_Pivot_Vector() argument
42 pivot.resize(N); in new_Pivot_Vector()
46 inline static void free_Pivot_Vector(Pivot_Vector & pivot) in free_Pivot_Vector() argument
87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) in LU_factor() argument
139 pivot( j ) = index_max ; in LU_factor()
150 …inline static void LU_solve(const gene_matrix & LU, const Pivot_Vector pivot, gene_vector &B, gene… in LU_solve() argument
161 int ip = pivot( i ) ; in LU_solve()
|
| /external/eigen/bench/btl/libs/gmm/ |
| D | gmm_LU_solve_interface.hh | 39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N) in new_Pivot_Vector() argument
42 pivot.resize(N); in new_Pivot_Vector()
46 inline static void free_Pivot_Vector(Pivot_Vector & pivot) in free_Pivot_Vector() argument
87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) in LU_factor() argument
139 pivot( j ) = index_max ; in LU_factor()
150 …inline static void LU_solve(const gene_matrix & LU, const Pivot_Vector pivot, gene_vector &B, gene… in LU_solve() argument
161 int ip = pivot( i ) ; in LU_solve()
|
| /external/eigen/bench/btl/libs/blitz/ |
| D | blitz_LU_solve_interface.hh | 39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N) in new_Pivot_Vector() argument
42 pivot.resize(N); in new_Pivot_Vector()
46 inline static void free_Pivot_Vector(Pivot_Vector & pivot) in free_Pivot_Vector() argument
87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) in LU_factor() argument
139 pivot( j ) = index_max ; in LU_factor()
150 …inline static void LU_solve(const gene_matrix & LU, const Pivot_Vector pivot, gene_vector &B, gene… in LU_solve() argument
161 int ip = pivot( i ) ; in LU_solve()
|
| /external/eigen/bench/btl/actions/ |
| D | action_lu_solve.hh | 74 typename Interface::Pivot_Vector pivot; // pivot vector in calculate() local
75 Interface::new_Pivot_Vector(pivot,size); in calculate()
89 Interface::LU_factor(LU,pivot,size); in calculate()
93 Interface::LU_solve(LU,pivot,B,X,size); in calculate()
125 Interface::free_Pivot_Vector(pivot); in calculate()
|
| /external/opencv/cxcore/include/ |
| D | cxmisc.h | 470 T* pivot; \
478 pivot = left + (n/2); \
487 a = pivot - d, b = pivot, c = pivot + d; \
488 pivot = LT(*a, *b) ? (LT(*b, *c) ? b : (LT(*a, *c) ? c : a)) \
496 a = left, b = pivot, c = right; \
497 pivot = LT(*a, *b) ? (LT(*b, *c) ? b : (LT(*a, *c) ? c : a)) \
499 if( pivot != left0 ) \
501 CV_SWAP( *pivot, *left0, t ); \
502 pivot = left0; \
509 while( left <= right && !LT(*pivot, *left) ) \
[all …]
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| D | NodeVector.java | 671 int pivot = a[(lo + hi) / 2]; in sort() local
674 a[hi] = pivot; in sort()
683 while (a[lo] <= pivot && lo < hi) in sort()
692 while (pivot <= a[hi] && lo < hi) in sort()
719 a[hi] = pivot; in sort()
|
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| D | kmeans_index.h | 545 DistanceType* center = clusters[i]->pivot; in getClusterCenters()
570 DistanceType* pivot; member
613 save_value(stream, *(node->pivot), (int)veclen_); in save_tree()
630 node->pivot = new DistanceType[veclen_]; in load_tree()
631 load_value(stream, *(node->pivot), (int)veclen_); in load_tree()
651 delete[] node->pivot; in free_centers()
699 node->pivot = mean; in computeNodeStatistics()
868 node->childs[c]->pivot = centers[c]; in computeClustering()
897 DistanceType bsq = distance_(vec, node->pivot, veclen_); in findNN()
941 domain_distances[best_index] = distance_(q, node->childs[best_index]->pivot, veclen_); in exploreNodeBranches()
[all …]
|
| D | hierarchical_clustering_index.h | 588 int pivot; member
724 node->childs[i]->pivot = centers[i]; in computeClustering()
766 … domain_distances[best_index] = distance(vec, dataset[node->childs[best_index]->pivot], veclen_); in findNN()
768 domain_distances[i] = distance(vec, dataset[node->childs[i]->pivot], veclen_); in findNN()
|
| /external/opencv3/modules/photo/src/ |
| D | align.cpp | 75 size_t pivot = src.size() / 2; in process() local
76 dst[pivot] = src[pivot]; in process()
78 cvtColor(src[pivot], gray_base, COLOR_RGB2GRAY); in process()
82 if(i == pivot) { in process()
|
| /external/opencv3/modules/ml/src/ |
| D | kdtree.cpp | 105 float pivot = vals[ofs[ip]]; in medianPartition() local
109 if( vals[ofs[i1]] <= pivot ) in medianPartition()
122 float pivot = vals[ofs[middle]]; in medianPartition() local
126 CV_Assert(vals[ofs[k]] <= pivot); in medianPartition()
127 less += vals[ofs[k]] < pivot; in medianPartition()
131 CV_Assert(vals[ofs[k]] >= pivot); in medianPartition()
132 more += vals[ofs[k]] > pivot; in medianPartition()
|
| /external/icu/icu4c/source/test/perf/utfperf/ |
| D | utfperf.cpp | 33 static UChar pivot[INTERMEDIATE_CAPACITY]; variable
297 pivotSource=pivotTarget=pivot; in call()
298 pivotLimit=pivot+testcase.pivotLength; in call()
307 pivot, &pivotSource, &pivotTarget, pivotLimit, in call()
|
| /external/opencv3/modules/core/src/ |
| D | lpsolver.cpp | 85 static inline void pivot(Mat_<double>& c,Mat_<double>& b,double& v,vector<int>& N,vector<int>& B,in…
190 pivot(c,b,v,N,B,k,0,indexToRow); in initialize_simplex()
205 pivot(c,b,v,N,B,iterator_offset,0,indexToRow); in initialize_simplex()
302 pivot(c,b,v,N,B,l,e,indexToRow); in inner_simplex()
315 static inline void pivot(Mat_<double>& c,Mat_<double>& b,double& v,vector<int>& N,vector<int>& B, in pivot() function
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| D | StringRange.java | 172 public boolean merge(int pivot, Ranges other) { in merge() argument
175 if (i == pivot) { in merge()
186 ranges[pivot].max = other.ranges[pivot].max; in merge()
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | StringRange.java | 168 public boolean merge(int pivot, Ranges other) { in merge() argument
171 if (i == pivot) { in merge()
182 ranges[pivot].max = other.ranges[pivot].max; in merge()
|
| /external/opencv/cv/src/ |
| D | _cvkdtree.hpp | 127 const __instype & pivot; member
132 : pivot(_pivot), dim(_dim), deref(_deref), ctor(_ctor) { in median_pr()
135 return deref(ctor(lhs), dim) <= deref(ctor(pivot), dim); in operator ()()
142 int pivot = (last - first) / 2; in median_partition() local
144 std::swap(first[pivot], last[-1]); in median_partition()
|
| /external/skia/gm/ |
| D | aaclip.cpp | 210 SkMatrix pivot; in ClipCubicGM() local
211 pivot.setRotate(90, W/2, H/2); in ClipCubicGM()
212 fVPath.transform(pivot, &fHPath); in ClipCubicGM()
|
| /external/mesa3d/src/egl/main/ |
| D | eglconfig.c | 673 const EGLint pivot = 0; in _eglSortConfigs() local
679 _eglSwapConfigs(&configs[pivot], &configs[count / 2]); in _eglSortConfigs()
683 while (i < count && compare(configs[i], configs[pivot], priv_data) < 0) in _eglSortConfigs()
685 while (compare(configs[j], configs[pivot], priv_data) > 0) in _eglSortConfigs()
698 _eglSwapConfigs(&configs[pivot], &configs[j]); in _eglSortConfigs()
|
| /external/pdfium/third_party/agg23/ |
| D | agg_rasterizer_scanline_aa.cpp | 352 cell_aa** pivot; in qsort_cells() local
354 pivot = base + len / 2; in qsort_cells()
355 swap_cells(base, pivot); in qsort_cells()
|