/external/skia/src/core/ |
H A D | SkStrokerPriv.cpp | 14 static void ButtCapper(SkPath* path, const SkPoint& pivot, argument 21 static void RoundCapper(SkPath* path, const SkPoint& pivot, argument 28 SkPoint projectedCenter = pivot + parallel; 34 static void SquareCapper(SkPath* path, const SkPoint& pivot, argument 43 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY); 44 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY); 48 path->lineTo(pivot.fX + normal.fX + parallel.fX, pivot 79 HandleInnerJoin(SkPath* inner, const SkPoint& pivot, const SkVector& after) argument 94 BluntJoiner(SkPath* outer, SkPath* inner, const SkVector& beforeUnitNormal, const SkPoint& pivot, const SkVector& afterUnitNormal, SkScalar radius, SkScalar invMiterLimit, bool, bool) argument 111 RoundJoiner(SkPath* outer, SkPath* inner, const SkVector& beforeUnitNormal, const SkPoint& pivot, const SkVector& afterUnitNormal, SkScalar radius, SkScalar invMiterLimit, bool, bool) argument 149 MiterJoiner(SkPath* outer, SkPath* inner, const SkVector& beforeUnitNormal, const SkPoint& pivot, const SkVector& afterUnitNormal, SkScalar radius, SkScalar invMiterLimit, bool prevIsLine, bool currIsLine) argument [all...] |
H A D | SkStrokerPriv.h | 25 const SkPoint& pivot, 32 const SkPoint& pivot,
|
H A D | SkTSort.h | 136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { argument 137 T pivotValue = *pivot; 138 SkTSwap(*pivot, *right); 176 T* pivot = left + ((right - left) >> 1); local 177 pivot = SkTQSort_Partition(left, right, pivot, lessThan); 179 SkTIntroSort(depth, left, pivot - 1, lessThan); 180 left = pivot + 1;
|
H A D | SkScan_Hairline.cpp | 277 static bool lt_90(SkPoint p0, SkPoint pivot, SkPoint p2) { 278 return SkVector::DotProduct(p0 - pivot, p2 - pivot) >= 0;
|
/external/jmonkeyengine/engine/src/test/jme3test/helloworld/ |
H A D | HelloNode.java | 72 /** Create a pivot node at (0,0,0) and attach it to the root node */ 73 Node pivot = new Node("pivot"); 74 rootNode.attachChild(pivot); // put this node in the scene 76 /** Attach the two boxes to the *pivot* node. (And transitively to the root node.) */ 77 pivot.attachChild(blue); 78 pivot.attachChild(red); 79 /** Rotate the pivot node: Note that both boxes have rotated! */ 80 pivot.rotate(.4f,.4f,0f);
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
H A D | LUDecompositionImpl.java | 45 private int[] pivot; field in class:LUDecompositionImpl 88 pivot = new int[m]; 95 pivot[row] = row; 149 int temp = pivot[max]; 150 pivot[max] = pivot[col]; 151 pivot[col] = temp; 167 final int m = pivot.length; 183 final int m = pivot.length; 198 final int m = pivot 238 private final int[] pivot; field in class:LUDecompositionImpl.Solver 249 Solver(final double[][] lu, final int[] pivot, final boolean singular) argument [all...] |
H A D | FieldLUDecompositionImpl.java | 35 * a zero pivot element, no attempt is done to get the largest pivot element.</p> 50 private int[] pivot; field in class:FieldLUDecompositionImpl 82 pivot = new int[m]; 89 pivot[row] = row; 139 int temp = pivot[nonZero]; 140 pivot[nonZero] = pivot[col]; 141 pivot[col] = temp; 158 final int m = pivot 235 private final int[] pivot; field in class:FieldLUDecompositionImpl.Solver 247 Solver(final Field<T> field, final T[][] lu, final int[] pivot, final boolean singular) argument [all...] |
/external/linux-tools-perf/src/tools/perf/scripts/python/ |
H A D | net_dropmonitor.py | 37 pivot = (start + end) // 2 38 if loc < kallsyms[pivot][0]: 39 end = pivot 41 start = pivot
|
/external/eigen/bench/btl/actions/ |
H A D | 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/mockito/cglib-and-asm/src/org/mockito/cglib/util/ |
H A D | SorterTemplate.java | 99 private void merge(int lo, int pivot, int hi, int len1, int len2) { argument 104 if (compare(pivot, lo) < 0) { 105 swap(pivot, lo); 114 second_cut = lower(pivot, hi, first_cut); 115 len22 = second_cut - pivot; 118 second_cut = pivot + len22; 119 first_cut = upper(lo, pivot, second_cut); 122 rotate(first_cut, pivot, second_cut);
|
/external/jmonkeyengine/engine/src/core/com/jme3/collision/bih/ |
H A D | BIHTree.java | 168 int pivot = l; 177 while (pivot <= j) { 178 getTriangle(pivot, v1, v2, v3); 181 swapTriangles(pivot, j); 184 ++pivot; 189 pivot = (pivot == l && j < pivot) ? j : pivot; 190 return pivot; [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/rank/ |
H A D | Percentile.java | 301 * @param pivotsHeap set of pivot index corresponding to elements that 317 final int pivot; 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) { 396 partition(final double[] work, final int begin, final int end, final int pivot) argument [all...] |
/external/eigen/bench/btl/libs/blitz/ |
H A D | blitz_LU_solve_interface.hh | 39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N) argument 42 pivot.resize(N); 46 inline static void free_Pivot_Vector(Pivot_Vector & pivot) argument 87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) argument 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) argument 161 int ip = pivot( i ) ;
|
/external/eigen/bench/btl/libs/gmm/ |
H A D | gmm_LU_solve_interface.hh | 39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N) argument 42 pivot.resize(N); 46 inline static void free_Pivot_Vector(Pivot_Vector & pivot) argument 87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) argument 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) argument 161 int ip = pivot( i ) ;
|
/external/eigen/bench/btl/libs/mtl4/ |
H A D | mtl4_LU_solve_interface.hh | 39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N) argument 42 pivot.resize(N); 46 inline static void free_Pivot_Vector(Pivot_Vector & pivot) argument 87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N) argument 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) argument 161 int ip = pivot( i ) ;
|
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
H A D | NodeVector.java | 669 * Pick a pivot and move it out of the way 671 int pivot = a[(lo + hi) / 2]; 674 a[hi] = pivot; 681 * is greater than the pivot or lo >= hi 683 while (a[lo] <= pivot && lo < hi) 690 * is less than the pivot, or lo >= hi 692 while (pivot <= a[hi] && lo < hi) 719 a[hi] = pivot; 723 * equal to pivot, elements a[hi+1] to a[hi0] are greater than 724 * pivot [all...] |
/external/opencv/cxcore/include/ |
H A 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, *left [all...] |
/external/icu/icu4c/source/test/perf/utfperf/ |
H A D | utfperf.cpp | 33 static UChar pivot[INTERMEDIATE_CAPACITY]; variable 55 UOPTION_DEF("pivot", '\x01', UOPT_REQUIRES_ARG) 62 "\t--pivot Length (in UChars) of the UTF-16 pivot buffer, if applicable.\n" 81 fprintf(stderr, "error: pivot length must be 1..%ld\n", (long)PIVOT_CAPACITY); 297 pivotSource=pivotTarget=pivot; 298 pivotLimit=pivot+testcase.pivotLength; 307 pivot, &pivotSource, &pivotTarget, pivotLimit,
|
/external/skia/gm/ |
H A D | aaclip.cpp | 210 SkMatrix pivot; local 211 pivot.setRotate(90, W/2, H/2); 212 fVPath.transform(pivot, &fHPath);
|
/external/opencv/cv/src/ |
H A D | _cvkdtree.hpp | 127 const __instype & pivot; member in struct:CvKDTree::median_pr 132 : pivot(_pivot), dim(_dim), deref(_deref), ctor(_ctor) { 135 return deref(ctor(lhs), dim) <= deref(ctor(pivot), dim); 142 int pivot = (last - first) / 2; local 144 std::swap(first[pivot], last[-1]);
|
/external/jmonkeyengine/engine/src/bullet/com/jme3/bullet/objects/ |
H A D | PhysicsRigidBody.java | 686 Vector3f pivot = null; 688 pivot = physicsJoint.getPivotA(); 690 pivot = physicsJoint.getPivotB(); 692 Arrow arrow = new Arrow(pivot);
|
/external/mesa3d/src/egl/main/ |
H A D | eglconfig.c | 673 const EGLint pivot = 0; local 679 _eglSwapConfigs(&configs[pivot], &configs[count / 2]); 683 while (i < count && compare(configs[i], configs[pivot], priv_data) < 0) 685 while (compare(configs[j], configs[pivot], priv_data) > 0) 698 _eglSwapConfigs(&configs[pivot], &configs[j]);
|
/external/pdfium/core/src/fxge/agg/agg23/ |
H A D | fx_agg_rasterizer_scanline_aa.cpp | 353 cell_aa** pivot; local 355 pivot = base + len / 2; 356 swap_cells(base, pivot);
|
/external/jmonkeyengine/engine/src/jbullet/com/jme3/bullet/objects/ |
H A D | PhysicsRigidBody.java | 637 Vector3f pivot = null; 639 pivot = physicsJoint.getPivotA(); 641 pivot = physicsJoint.getPivotB(); 643 Arrow arrow = new Arrow(pivot);
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/random/ |
H A D | RandomDataImpl.java | 364 final double pivot = 40.0d; 365 if (mean < pivot) {
|