| /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/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 | 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/deqp-deps/SPIRV-Tools/source/comp/ |
| D | move_to_front.cpp | 392 const uint32_t pivot = RightOf(node); in RotateLeft() local
393 assert(pivot); in RotateLeft()
396 MutableRightOf(node) = LeftOf(pivot); in RotateLeft()
400 MutableParentOf(pivot) = ParentOf(node); in RotateLeft()
402 root_ = pivot; in RotateLeft()
404 MutableLeftOf(ParentOf(node)) = pivot; in RotateLeft()
406 MutableRightOf(ParentOf(node)) = pivot; in RotateLeft()
409 MutableLeftOf(pivot) = node; in RotateLeft()
410 MutableParentOf(node) = pivot; in RotateLeft()
415 UpdateNode(pivot); in RotateLeft()
[all …]
|
| /external/swiftshader/third_party/SPIRV-Tools/source/comp/ |
| D | move_to_front.cpp | 392 const uint32_t pivot = RightOf(node); in RotateLeft() local
393 assert(pivot); in RotateLeft()
396 MutableRightOf(node) = LeftOf(pivot); in RotateLeft()
400 MutableParentOf(pivot) = ParentOf(node); in RotateLeft()
402 root_ = pivot; in RotateLeft()
404 MutableLeftOf(ParentOf(node)) = pivot; in RotateLeft()
406 MutableRightOf(ParentOf(node)) = pivot; in RotateLeft()
409 MutableLeftOf(pivot) = node; in RotateLeft()
410 MutableParentOf(node) = pivot; in RotateLeft()
415 UpdateNode(pivot); in RotateLeft()
[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 | 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/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/archive-patcher/generator/src/main/java/com/google/archivepatcher/generator/bsdiff/ |
| D | BsDiff.java | 122 final int pivot = oldDataRangeStartA + (rangeLength / 2); in searchForMatch() local
123 groupArray.seekToIntAligned(pivot); in searchForMatch()
133 return searchForMatch(groupArray, oldData, newData, newStart, pivot, oldDataRangeStartB); in searchForMatch()
135 return searchForMatch(groupArray, oldData, newData, newStart, oldDataRangeStartA, pivot); in searchForMatch()
|
| /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/v8/src/builtins/ |
| D | typed-array.tq | 138 // Find a pivot as the median of first, last and middle element.
176 const pivot: Object = v1;
177 let low_end: Smi = from + 1; // Upper bound of elems lower than pivot.
178 let high_start: Smi = to - 1; // Lower bound of elems greater than pivot.
182 Store(context, array, low_end, pivot);
184 // From low_end to idx are elements equal to pivot.
189 context, array, comparefn, element, pivot) otherwise Detached;
208 context, array, comparefn, top_elem, pivot) otherwise Detached;
|
| /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)
|
| /external/tensorflow/tensorflow/python/tpu/ |
| D | tpu_test.py | 46 pivot = control_flow_ops.no_op()
47 context = tpu.TPUReplicateContext(b"context", 1, pivot=pivot)
|
| /external/icu/icu4c/source/test/perf/utfperf/ |
| D | utfperf.cpp | 37 static UChar pivot[INTERMEDIATE_CAPACITY]; variable
301 pivotSource=pivotTarget=pivot; in call()
302 pivotLimit=pivot+testcase.pivotLength; in call()
311 pivot, &pivotSource, &pivotTarget, pivotLimit, in call()
|
| /external/python/cpython3/Tools/demo/ |
| D | sortvisu.py | 46 self.pivot = self.canvas.create_line(0, 0, 0, 0)
150 def show_pivot(self, pivot): argument
151 x1, y1, x2, y2 = self.items[pivot].position()
152 self.canvas.coords(self.pivot, (0, y1 - 2, 9999, y1 - 2))
155 self.canvas.coords(self.pivot, (0, 0, 0, 0))
441 pivot = j
442 array.show_pivot(pivot)
451 while right > first and array.compare(right, pivot) >= 0:
457 while left < last and array.compare(left, pivot) <= 0:
466 array.swap(pivot, right)
|
| /external/cldr/tools/java/org/unicode/cldr/util/ |
| D | StringRange.java | 173 public boolean merge(int pivot, Ranges other) { in merge() argument
179 if (i == pivot) { in merge()
190 ranges[pivot].max = other.ranges[pivot].max; in merge()
|