Searched refs:pivot (Results 1 - 25 of 39) sorted by relevance

12

/external/chromium_org/third_party/skia/experimental/Intersection/
H A DTSearch.h13 static T* QSort_Partition(T* left, T* right, T* pivot) argument
15 T pivotValue = *pivot;
16 SkTSwap(*pivot, *right);
35 T* pivot = left + (right - left >> 1); local
36 pivot = QSort_Partition(left, right, pivot);
37 QSort(left, pivot - 1);
38 QSort(pivot + 1, right);
42 static T** QSort_Partition(T** left, T** right, T** pivot) argument
44 T* pivotValue = *pivot;
64 T** pivot = left + (right - left >> 1); local
71 QSort_Partition(S& context, T* left, T* right, T* pivot, bool (*lessThan)(S&, const T, const T)) argument
95 T* pivot = left + (right - left >> 1); local
[all...]
/external/skia/experimental/Intersection/
H A DTSearch.h13 static T* QSort_Partition(T* left, T* right, T* pivot) argument
15 T pivotValue = *pivot;
16 SkTSwap(*pivot, *right);
35 T* pivot = left + (right - left >> 1); local
36 pivot = QSort_Partition(left, right, pivot);
37 QSort(left, pivot - 1);
38 QSort(pivot + 1, right);
42 static T** QSort_Partition(T** left, T** right, T** pivot) argument
44 T* pivotValue = *pivot;
64 T** pivot = left + (right - left >> 1); local
71 QSort_Partition(S& context, T* left, T* right, T* pivot, bool (*lessThan)(S&, const T, const T)) argument
95 T* pivot = left + (right - left >> 1); local
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkStrokerPriv.cpp14 static void ButtCapper(SkPath* path, const SkPoint& pivot, argument
21 static void RoundCapper(SkPath* path, const SkPoint& pivot, argument
25 SkScalar px = pivot.fX;
26 SkScalar py = pivot.fY;
40 static void SquareCapper(SkPath* path, const SkPoint& pivot, argument
49 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY);
50 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY);
54 path->lineTo(pivot
85 HandleInnerJoin(SkPath* inner, const SkPoint& pivot, const SkVector& after) argument
100 BluntJoiner(SkPath* outer, SkPath* inner, const SkVector& beforeUnitNormal, const SkPoint& pivot, const SkVector& afterUnitNormal, SkScalar radius, SkScalar invMiterLimit, bool, bool) argument
117 RoundJoiner(SkPath* outer, SkPath* inner, const SkVector& beforeUnitNormal, const SkPoint& pivot, const SkVector& afterUnitNormal, SkScalar radius, SkScalar invMiterLimit, bool, bool) argument
158 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 DSkStrokerPriv.h25 const SkPoint& pivot,
32 const SkPoint& pivot,
H A DSkTSort.h136 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;
/external/skia/src/core/
H A DSkStrokerPriv.cpp14 static void ButtCapper(SkPath* path, const SkPoint& pivot, argument
21 static void RoundCapper(SkPath* path, const SkPoint& pivot, argument
25 SkScalar px = pivot.fX;
26 SkScalar py = pivot.fY;
40 static void SquareCapper(SkPath* path, const SkPoint& pivot, argument
49 path->setLastPt(pivot.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY);
50 path->lineTo(pivot.fX - normal.fX + parallel.fX, pivot.fY - normal.fY + parallel.fY);
54 path->lineTo(pivot
85 HandleInnerJoin(SkPath* inner, const SkPoint& pivot, const SkVector& after) argument
100 BluntJoiner(SkPath* outer, SkPath* inner, const SkVector& beforeUnitNormal, const SkPoint& pivot, const SkVector& afterUnitNormal, SkScalar radius, SkScalar invMiterLimit, bool, bool) argument
117 RoundJoiner(SkPath* outer, SkPath* inner, const SkVector& beforeUnitNormal, const SkPoint& pivot, const SkVector& afterUnitNormal, SkScalar radius, SkScalar invMiterLimit, bool, bool) argument
158 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 DSkStrokerPriv.h25 const SkPoint& pivot,
32 const SkPoint& pivot,
H A DSkTSort.h136 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;
/external/linux-tools-perf/perf-3.12.0/tools/perf/scripts/python/
H A Dnet_dropmonitor.py37 pivot = (start + end) // 2
38 if loc < kallsyms[pivot][0]:
39 end = pivot
41 start = pivot
/external/eigen/bench/btl/actions/
H A Daction_lu_solve.hh74 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 DSorterTemplate.java99 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/qemu/distrib/sdl-1.2.15/src/stdlib/
H A DSDL_qsort.c133 * 3. We choose a pivot by looking at the first, last
136 * choosing the pivot, and it makes things a little
137 * easier in the partitioning step. Anyway, the pivot
148 * 4. We copy the pivot element to a separate place
151 * and don't have to wonder "did we move the pivot
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 local
357 char *pivot=malloc(size); local
388 char *pivot=malloc(WORD_BYTES); local
[all...]
/external/eigen/bench/btl/libs/blitz/
H A Dblitz_LU_solve_interface.hh39 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 Dgmm_LU_solve_interface.hh39 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 Dmtl4_LU_solve_interface.hh39 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/chromium_org/ui/gfx/
H A Dinterpolated_transform_unittest.cc73 gfx::Point pivot(100, 100);
77 pivot,
82 gfx::Point expected_result = pivot;
83 result.TransformPoint(&pivot);
84 EXPECT_EQ(expected_result, pivot);
91 gfx::Point pivot(100, 100);
94 pivot,
99 gfx::Point expected_result = pivot;
100 result.TransformPoint(&pivot);
101 EXPECT_EQ(expected_result, pivot);
[all...]
H A Dinterpolated_transform.cc291 const gfx::Point& pivot,
294 Init(pivot, transform);
298 const gfx::Point& pivot,
303 Init(pivot, transform);
316 void InterpolatedTransformAboutPivot::Init(const gfx::Point& pivot, argument
320 to_pivot.Translate(-pivot.x(), -pivot.y());
321 from_pivot.Translate(pivot.x(), pivot.y());
290 InterpolatedTransformAboutPivot( const gfx::Point& pivot, InterpolatedTransform* transform) argument
297 InterpolatedTransformAboutPivot( const gfx::Point& pivot, InterpolatedTransform* transform, float start_time, float end_time) argument
H A Dinterpolated_transform.h219 InterpolatedTransformAboutPivot(const gfx::Point& pivot,
223 InterpolatedTransformAboutPivot(const gfx::Point& pivot,
233 void Init(const gfx::Point& pivot, InterpolatedTransform* transform);
/external/apache-xml/src/main/java/org/apache/xml/utils/
H A DNodeVector.java669 * 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/chromium_org/tools/
H A Dbisect-builds.py744 # Figure out our bookends and first pivot point; fetch the pivot revision.
747 pivot = maxrev / 2
748 rev = revlist[pivot]
768 down_pivot = int((pivot - minrev) / 2) + minrev
770 if down_pivot != pivot and down_pivot != minrev:
776 up_pivot = int((maxrev - pivot) / 2) + pivot
778 if up_pivot != pivot and up_pivot != maxrev:
784 # Run test on the pivot revisio
[all...]
/external/opencv/cxcore/include/
H A Dcxmisc.h470 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/chromium_org/third_party/icu/source/test/perf/utfperf/
H A Dutfperf.cpp34 static UChar pivot[INTERMEDIATE_CAPACITY]; variable
56 UOPTION_DEF("pivot", '\x01', UOPT_REQUIRES_ARG)
63 "\t--pivot Length (in UChars) of the UTF-16 pivot buffer, if applicable.\n"
82 fprintf(stderr, "error: pivot length must be 1..%ld\n", (long)PIVOT_CAPACITY);
298 pivotSource=pivotTarget=pivot;
299 pivotLimit=pivot+testcase.pivotLength;
308 pivot, &pivotSource, &pivotTarget, pivotLimit,
/external/icu/icu4c/source/test/perf/utfperf/
H A Dutfperf.cpp34 static UChar pivot[INTERMEDIATE_CAPACITY]; variable
56 UOPTION_DEF("pivot", '\x01', UOPT_REQUIRES_ARG)
63 "\t--pivot Length (in UChars) of the UTF-16 pivot buffer, if applicable.\n"
82 fprintf(stderr, "error: pivot length must be 1..%ld\n", (long)PIVOT_CAPACITY);
298 pivotSource=pivotTarget=pivot;
299 pivotLimit=pivot+testcase.pivotLength;
308 pivot, &pivotSource, &pivotTarget, pivotLimit,
/external/chromium_org/third_party/tlslite/tlslite/utils/
H A Drijndael.py115 pivot = AA[i][i] variable
116 if pivot == 0:
123 pivot = AA[i][i] variable
126 AA[i][j] = alog[(255 + log[AA[i][j] & 0xFF] - log[pivot & 0xFF]) % 255]
189 del pivot
/external/opencv/cv/src/
H A D_cvkdtree.hpp127 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]);

Completed in 497 milliseconds

12