| /external/skia/src/core/ |
| D | SkStrokerPriv.cpp | 15 static void ButtCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal, in ButtCapper() argument
20 static void RoundCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal, in RoundCapper() argument
25 SkPoint projectedCenter = pivot + parallel; in RoundCapper()
31 static void SquareCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal, in SquareCapper() argument
37 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
38 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
40 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
41 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
70 static void HandleInnerJoin(SkPath* inner, const SkPoint& pivot, const SkVector& after) { in HandleInnerJoin() argument
78 inner->lineTo(pivot.fX, pivot.fY); in HandleInnerJoin()
[all …]
|
| D | SkTSort.h | 133 static T* SkTQSort_Partition(T* left, int count, T* pivot, const C& lessThan) { in SkTQSort_Partition() argument
136 T pivotValue = *pivot; in SkTQSort_Partition()
137 swap(*pivot, *right); in SkTQSort_Partition()
177 T* pivot = SkTQSort_Partition(left, count, middle, lessThan); in SkTIntroSort() local
178 int pivotCount = pivot - left; in SkTIntroSort()
|
| D | SkStrokerPriv.h | 27 const SkPoint& pivot,
34 const SkPoint& pivot,
|
| /external/skqp/src/core/ |
| D | SkStrokerPriv.cpp | 15 static void ButtCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal, in ButtCapper() argument
20 static void RoundCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal, in RoundCapper() argument
25 SkPoint projectedCenter = pivot + parallel; in RoundCapper()
31 static void SquareCapper(SkPath* path, const SkPoint& pivot, const SkVector& normal, in SquareCapper() argument
37 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
38 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
40 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
41 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
70 static void HandleInnerJoin(SkPath* inner, const SkPoint& pivot, const SkVector& after) { in HandleInnerJoin() argument
78 inner->lineTo(pivot.fX, pivot.fY); in HandleInnerJoin()
[all …]
|
| D | SkTSort.h | 141 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { in SkTQSort_Partition() argument
143 T pivotValue = *pivot; in SkTQSort_Partition()
144 swap(*pivot, *right); in SkTQSort_Partition()
182 T* pivot = left + ((right - left) >> 1); in SkTIntroSort() local
183 pivot = SkTQSort_Partition(left, right, pivot, lessThan); in SkTIntroSort()
185 SkTIntroSort(depth, left, pivot - 1, lessThan); in SkTIntroSort()
186 left = pivot + 1; in SkTIntroSort()
|
| D | SkStrokerPriv.h | 27 const SkPoint& pivot,
34 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/rust/crates/rayon/src/slice/ |
| D | quicksort.rs | 233 fn partition_in_blocks<T, F>(v: &mut [T], pivot: &T, is_less: &F) -> usize in partition_in_blocks()
309 end_l = end_l.offset(!is_less(&*elem, pivot) as isize); in partition_in_blocks()
326 end_r = end_r.offset(is_less(&*elem, pivot) as isize); in partition_in_blocks()
423 fn partition<T, F>(v: &mut [T], pivot: usize, is_less: &F) -> (usize, bool) in partition()
429 v.swap(0, pivot); in partition()
430 let (pivot, v) = v.split_at_mut(1); in partition()
431 let pivot = &mut pivot[0]; in partition() localVariable
436 value: unsafe { Some(ptr::read(pivot)) }, in partition()
437 dest: pivot, in partition()
439 let pivot = write_on_drop.value.as_ref().unwrap(); in partition() localVariable
[all …]
|
| /external/skqp/samplecode/ |
| D | SampleAndroidShadows.cpp | 293 SkPoint pivot = SkPoint::Make(fWideRectPath.getBounds().width()/2, in onDrawContent() local
302 persp.preTranslate(-pivot.fX, -pivot.fY); in onDrawContent()
303 persp.postTranslate(pivot.fX + translate.fX, pivot.fY + translate.fY); in onDrawContent()
308 SkTMax(1.0f, 16 + fZDelta) - SkScalarSin(radians)*pivot.fY); in onDrawContent()
312 pivot = SkPoint::Make(fWideOvalPath.getBounds().width() / 2, in onDrawContent()
319 persp.preTranslate(-pivot.fX, -pivot.fY); in onDrawContent()
320 persp.postTranslate(pivot.fX + translate.fX, pivot.fY + translate.fY); in onDrawContent()
324 SkTMax(1.0f, 32 + fZDelta) + SkScalarSin(radians)*pivot.fX); in onDrawContent()
328 pivot = SkPoint::Make(fStarPath.getBounds().width() / 2, in onDrawContent()
334 persp.preTranslate(-pivot.fX, -pivot.fY); in onDrawContent()
[all …]
|
| /external/skia/samplecode/ |
| D | SampleAndroidShadows.cpp | 269 SkPoint pivot = SkPoint::Make(fWideRectPath.getBounds().width()/2, in onDrawContent() local
278 persp.preTranslate(-pivot.fX, -pivot.fY); in onDrawContent()
279 persp.postTranslate(pivot.fX + translate.fX, pivot.fY + translate.fY); in onDrawContent()
284 std::max(1.0f, 16 + fZDelta) - SkScalarSin(radians)*pivot.fY); in onDrawContent()
288 pivot = SkPoint::Make(fWideOvalPath.getBounds().width() / 2, in onDrawContent()
295 persp.preTranslate(-pivot.fX, -pivot.fY); in onDrawContent()
296 persp.postTranslate(pivot.fX + translate.fX, pivot.fY + translate.fY); in onDrawContent()
300 std::max(1.0f, 32 + fZDelta) + SkScalarSin(radians)*pivot.fX); in onDrawContent()
304 pivot = SkPoint::Make(fStarPath.getBounds().width() / 2, in onDrawContent()
310 persp.preTranslate(-pivot.fX, -pivot.fY); in onDrawContent()
[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/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/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/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/rust/crates/rayon-core/tests/ |
| D | scope_join.rs | 24 let pivot = v.len() - 1; in partition() localVariable
26 for j in 0..pivot { in partition()
27 if v[j] <= v[pivot] { in partition()
32 v.swap(i, pivot); in partition()
|
| /external/marisa-trie/lib/marisa/grimoire/algorithm/ |
| D | sort.h | 90 const int pivot = median(*l, *(l + (r - l) / 2), *(r - 1), depth); in sort() local
94 if (label > pivot) { in sort()
96 } else if (label == pivot) { in sort()
104 if (label < pivot) { in sort()
106 } else if (label == pivot) { in sort()
129 if (pivot == -1) { in sort()
168 if (pivot == -1) { in sort()
|
| /external/tensorflow/tensorflow/python/tpu/ |
| D | tpu_test.py | 47 pivot = control_flow_ops.no_op()
48 context = tpu.TPUReplicateContext(b"context", 1, pivot=pivot)
63 pivot = control_flow_ops.no_op()
64 context = tpu.TPUReplicateContext(b"context", 1, pivot=pivot)
|
| /external/lottie/lottie/src/main/java/com/airbnb/lottie/parser/moshi/ |
| D | LinkedHashTreeMap.java | 403 Node<K, V> pivot = root.right; in rotateLeft() local
404 Node<K, V> pivotLeft = pivot.left; in rotateLeft()
405 Node<K, V> pivotRight = pivot.right; in rotateLeft()
413 replaceInParent(root, pivot); in rotateLeft()
416 pivot.left = root; in rotateLeft()
417 root.parent = pivot; in rotateLeft()
422 pivot.height = Math.max(root.height, in rotateLeft()
430 Node<K, V> pivot = root.left; in rotateRight() local
432 Node<K, V> pivotLeft = pivot.left; in rotateRight()
433 Node<K, V> pivotRight = pivot.right; in rotateRight()
[all …]
|
| /external/rust/crates/rayon-core/src/join/ |
| D | test.rs | 21 let pivot = v.len() - 1; in partition() localVariable
23 for j in 0..pivot { in partition()
24 if v[j] <= v[pivot] { in partition()
29 v.swap(i, pivot); in partition()
|
| /external/libvpx/libvpx/tools/3D-Reconstruction/sketch_3D_reconstruction/ |
| D | BVH.pde | 119 // find the median value of selected center component as pivot
121 float pivot;
123 pivot = axis_values[mesh_size / 2];
125 pivot =
134 if (t.bbx.getCenterAxisValue(axis) < pivot) {
136 } else if (t.bbx.getCenterAxisValue(axis) > pivot) {
|
| /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/llvm-project/lld/MachO/ |
| D | ExportTrie.cpp | 182 int pivot = charAt(pivotSymbol, pos); in sortAndBuild() local
187 if (c < pivot) in sortAndBuild()
189 else if (c > pivot) in sortAndBuild()
195 bool isTerminal = pivot == -1; in sortAndBuild()
|
| /external/python/cpython2/Demo/tkinter/guido/ |
| D | sortvisu.py | 46 self.pivot = Line(self.canvas, 0, 0, 0, 0)
152 def show_pivot(self, pivot): argument
153 x1, y1, x2, y2 = self.items[pivot].position()
154 self.pivot.coords(((0, y1-2), (9999, y1-2)))
157 self.pivot.coords(((0, 0), (0, 0)))
439 pivot = j
440 array.show_pivot(pivot)
449 while right > first and array.compare(right, pivot) >= 0:
455 while left < last and array.compare(left, pivot) <= 0:
464 array.swap(pivot, right)
|