| /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
25 SkScalar px = pivot.fX; in RoundCapper()
26 SkScalar py = pivot.fY; in RoundCapper()
40 static void SquareCapper(SkPath* path, const SkPoint& pivot, in SquareCapper() argument
49 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
50 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
54 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); in SquareCapper()
55 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); in SquareCapper()
85 static void HandleInnerJoin(SkPath* inner, const SkPoint& pivot, const SkVector& after) in HandleInnerJoin() argument
[all …]
|
| D | SkStrokerPriv.h | 25 const SkPoint& pivot,
32 const SkPoint& pivot,
|
| D | SkTSearch.cpp | 143 char* pivot = left; in SkQSort_Partition() local
147 while (left < last && compare(left, pivot) < 0) in SkQSort_Partition()
149 while (first < rite && compare(rite, pivot) > 0) in SkQSort_Partition()
|
| /external/qemu/distrib/sdl-1.2.15/src/stdlib/ |
| D | SDL_qsort.c | 225 while (compare(first,pivot)<0) first+=sz; \
226 while (compare(pivot,last)<0) last-=sz; \
261 memcpy(pivot,first,size); \
263 memcpy(test,pivot,size); \
326 char *pivot=malloc(size); in qsort_nonaligned() local
328 assert(pivot!=0); in qsort_nonaligned()
338 memcpy(pivot,mid,size); in qsort_nonaligned()
348 free(pivot); in qsort_nonaligned()
357 char *pivot=malloc(size); in qsort_aligned() local
359 assert(pivot!=0); in qsort_aligned()
[all …]
|
| /external/jmonkeyengine/engine/src/core/com/jme3/collision/bih/ |
| D | BIHTree.java | 168 int pivot = l; in sortTriangles() local
177 while (pivot <= j) { in sortTriangles()
178 getTriangle(pivot, v1, v2, v3); in sortTriangles()
181 swapTriangles(pivot, j); in sortTriangles()
184 ++pivot; in sortTriangles()
189 pivot = (pivot == l && j < pivot) ? j : pivot; in sortTriangles()
190 return pivot; in sortTriangles()
322 int pivot = sortTriangles(l, r, split, axis); in createNode() local
323 if (pivot == l || pivot == r) { in createNode()
324 pivot = (r + l) / 2; in createNode()
[all …]
|
| /external/jmonkeyengine/engine/src/test/jme3test/helloworld/ |
| D | HelloNode.java | 73 Node pivot = new Node("pivot"); in simpleInitApp() local
74 rootNode.attachChild(pivot); // put this node in the scene in simpleInitApp()
77 pivot.attachChild(blue); in simpleInitApp()
78 pivot.attachChild(red); in simpleInitApp()
80 pivot.rotate(.4f,.4f,0f); in simpleInitApp()
|
| /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/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/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/libvpx/vp8/encoder/ |
| D | rdopt.c | 1449 int lidx,ridx,pivot; in quicksortmv() local
1456 pivot = (left + right)/2; in quicksortmv()
1458 while(lidx <=pivot && ridx >=pivot) in quicksortmv()
1460 while(arr[lidx] < arr[pivot] && lidx <= pivot) in quicksortmv()
1462 while(arr[ridx] > arr[pivot] && ridx >= pivot) in quicksortmv()
1467 if(lidx-1 == pivot) in quicksortmv()
1470 pivot = ridx; in quicksortmv()
1472 else if(ridx+1 == pivot) in quicksortmv()
1475 pivot = lidx; in quicksortmv()
1478 quicksortmv(arr, left, pivot - 1); in quicksortmv()
[all …]
|
| /external/icu4c/test/perf/utfperf/ |
| D | utfperf.cpp | 34 static UChar pivot[INTERMEDIATE_CAPACITY]; variable
298 pivotSource=pivotTarget=pivot; in call()
299 pivotLimit=pivot+testcase.pivotLength; in call()
308 pivot, &pivotSource, &pivotTarget, pivotLimit, in call()
|
| /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/jmonkeyengine/engine/src/bullet/com/jme3/bullet/objects/ |
| D | PhysicsRigidBody.java | 686 Vector3f pivot = null; in getDebugShape() local
688 pivot = physicsJoint.getPivotA(); in getDebugShape()
690 pivot = physicsJoint.getPivotB(); in getDebugShape()
692 Arrow arrow = new Arrow(pivot); in getDebugShape()
|
| /external/jmonkeyengine/engine/src/jbullet/com/jme3/bullet/objects/ |
| D | PhysicsRigidBody.java | 637 Vector3f pivot = null; in getDebugShape() local
639 pivot = physicsJoint.getPivotA(); in getDebugShape()
641 pivot = physicsJoint.getPivotB(); in getDebugShape()
643 Arrow arrow = new Arrow(pivot); in getDebugShape()
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| D | SkylineInplaceLU.h | 128 const double pivot = m_lu.coeffDiag(row); in compute() local
133 lIt.valueRef() /= pivot; in compute()
|
| /external/v8/src/ |
| D | array.js | 814 var pivot = v1;
818 a[low_end] = pivot;
824 var order = %_CallFunction(receiver, element, pivot, comparefn);
834 order = %_CallFunction(receiver, top_elem, pivot, comparefn);
|
| /external/opencv/cxcore/src/ |
| D | cxdatastructs.cpp | 2248 schar *m1, *m2, *m3, *pivot; in cvSeqSort() local
2290 pivot = icvMed3( m1, m2, m3, cmp_func, aux ); in cvSeqSort()
2292 if( pivot != left.ptr ) in cvSeqSort()
2294 CV_SWAP_ELEMS( pivot, left.ptr, elem_size ); in cvSeqSort()
2295 pivot = left.ptr; in cvSeqSort()
2302 while( left.ptr != right.ptr && (r = cmp_func(left.ptr, pivot, aux)) <= 0 ) in cvSeqSort()
2314 while( left.ptr != right.ptr && (r = cmp_func(right.ptr,pivot, aux)) >= 0 ) in cvSeqSort()
2328 r = cmp_func(left.ptr, pivot, aux); in cvSeqSort()
|
| /external/icu4c/common/ |
| D | ucnv.c | 2408 UChar *pivot, *pivot2; in ucnv_internalConvert() local
2427 pivot=pivot2=pivotBuffer; in ucnv_internalConvert()
2437 pivotBuffer, &pivot, &pivot2, pivotBuffer+CHUNK_SIZE, in ucnv_internalConvert()
2460 pivotBuffer, &pivot, &pivot2, pivotBuffer+CHUNK_SIZE, in ucnv_internalConvert()
|
| /external/jmonkeyengine/engine/src/tools/jme3tools/converters/model/strip/ |
| D | Stripifier.java | 823 int pivot = strip.m_faces.at(1).m_v1; in createStrips() local
824 if (tFirstFace.m_v1 == pivot) { in createStrips()
|
| /external/icu4c/test/testdata/ |
| D | format.txt | 293 …Description { "Test consistent pivot (parse/format) for multiple year lengths, y yy yyy yyyy yyyyy…
|
| /external/libxml2/patches/ |
| D | 0001-Add-ICU-support-for-libxml.patch | 223 + * 2. had we better use an explicit pivot buffer?
|
| /external/libvpx/examples/includes/PHP-Markdown-Extra-1.2.3/ |
| D | PHP Markdown Extra Readme.text | 160 | [Pivot][] | `(site home)/pivot/includes/markdown/`
|