| /external/chromium_org/webkit/data/test_shell/sort/ |
| sort-quick.js | 9 var pivot = left + Math.floor(Math.random()*(right-left));
10 //var pivot = Math.floor(left + (right-left)/2);
11 partition(sort, left, right, pivot);
15 function partition(sort, left, right, pivot) {
16 sort.swap(pivot, right);
17 sort.add_work(function(){partition_step(sort, left, right, pivot, left, left);});
20 function partition_step(sort, left, right, pivot, i, j) {
27 sort.add_work(function(){partition_step(sort, left, right, pivot, i, j)});
|
| /packages/apps/Camera/jni/feature_stab/db_vlvm/ |
| db_utilities_indexing.cpp | 35 a pivot element. Values equal to the pivot are ignored*/
36 void db_LeanPartitionOnPivot(double pivot,double *dest,const double *source,long first,long last,long *first_equal,long *last_equal)
52 if(temp<pivot) *(d_bottom++)=temp;
53 else if(temp>pivot) *(d_top--)=temp;
63 double pivot; local
78 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2]);
79 db_LeanPartitionOnPivot(pivot,dest,source,first,last,&first_equal,&last_equal);
85 return(pivot);
95 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2])
[all...] |
| /packages/apps/Camera2/jni/feature_stab/db_vlvm/ |
| db_utilities_indexing.cpp | 35 a pivot element. Values equal to the pivot are ignored*/
36 void db_LeanPartitionOnPivot(double pivot,double *dest,const double *source,long first,long last,long *first_equal,long *last_equal)
52 if(temp<pivot) *(d_bottom++)=temp;
53 else if(temp>pivot) *(d_top--)=temp;
63 double pivot; local
78 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2]);
79 db_LeanPartitionOnPivot(pivot,dest,source,first,last,&first_equal,&last_equal);
85 return(pivot);
95 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2])
[all...] |
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_utilities_indexing.cpp | 35 a pivot element. Values equal to the pivot are ignored*/
36 void db_LeanPartitionOnPivot(double pivot,double *dest,const double *source,long first,long last,long *first_equal,long *last_equal)
52 if(temp<pivot) *(d_bottom++)=temp;
53 else if(temp>pivot) *(d_top--)=temp;
63 double pivot; local
78 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2]);
79 db_LeanPartitionOnPivot(pivot,dest,source,first,last,&first_equal,&last_equal);
85 return(pivot);
95 pivot=db_TripleMedian(source[first],source[last],source[(first+last)/2])
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkStrokerPriv.cpp | 14 static void ButtCapper(SkPath* path, const SkPoint& pivot,
21 static void RoundCapper(SkPath* path, const SkPoint& pivot,
25 SkScalar px = pivot.fX;
26 SkScalar py = pivot.fY;
40 static void SquareCapper(SkPath* path, const SkPoint& pivot,
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.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY)
[all...] |
| SkStrokerPriv.h | 25 const SkPoint& pivot,
32 const SkPoint& pivot,
|
| SkTSort.h | 136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) {
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/ |
| SkStrokerPriv.cpp | 14 static void ButtCapper(SkPath* path, const SkPoint& pivot,
21 static void RoundCapper(SkPath* path, const SkPoint& pivot,
25 SkScalar px = pivot.fX;
26 SkScalar py = pivot.fY;
40 static void SquareCapper(SkPath* path, const SkPoint& pivot,
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.fX + normal.fX + parallel.fX, pivot.fY + normal.fY + parallel.fY)
[all...] |
| SkStrokerPriv.h | 25 const SkPoint& pivot,
32 const SkPoint& pivot,
|
| SkTSort.h | 136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) {
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/jmonkeyengine/engine/src/test/jme3test/helloworld/ |
| HelloNode.java | 72 /** Create a pivot node at (0,0,0) and attach it to the root node */
73 Node pivot = new Node("pivot"); local
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);
|
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/ |
| SplineMath.java | 41 int pivot = 0; local
44 pivot = j;
47 cur = points[pivot];
48 next = points[pivot + 1];
63 double tc = (a * a * a - a) * derivatives[pivot];
64 double td = (b * b * b - b) * derivatives[pivot + 1];
82 int pivot = 0; local
84 pivot = j;
89 cur = mPoints[pivot];
90 next = mPoints[pivot + 1]
[all...] |
| /external/eigen/bench/btl/actions/ |
| 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/jmonkeyengine/engine/src/core/com/jme3/collision/bih/ |
| BIHTree.java | 168 int pivot = l; local
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;
322 int pivot = sortTriangles(l, r, split, axis); local
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/stdlib/ |
| SDL_qsort.c | 133 * 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
198 #define Pivot(swapper,sz) \
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); local
357 char *pivot=malloc(size); local
388 char *pivot=malloc(WORD_BYTES); local
[all...] |
| /external/eigen/bench/btl/libs/blitz/ |
| blitz_LU_solve_interface.hh | 39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N)
42 pivot.resize(N);
46 inline static void free_Pivot_Vector(Pivot_Vector & pivot)
87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N)
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)
161 int ip = pivot( i ) ;
|
| /external/eigen/bench/btl/libs/gmm/ |
| gmm_LU_solve_interface.hh | 39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N)
42 pivot.resize(N);
46 inline static void free_Pivot_Vector(Pivot_Vector & pivot)
87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N)
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)
161 int ip = pivot( i ) ;
|
| /external/eigen/bench/btl/libs/mtl4/ |
| mtl4_LU_solve_interface.hh | 39 inline static void new_Pivot_Vector(Pivot_Vector & pivot,int N)
42 pivot.resize(N);
46 inline static void free_Pivot_Vector(Pivot_Vector & pivot)
87 inline static void LU_factor(gene_matrix & LU, Pivot_Vector & pivot, int N)
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)
161 int ip = pivot( i ) ;
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/ |
| MatrixUtils.java | 43 * Find a pivot and swap the row of squareMatrix0 and squareMatrix1
48 float pivot = Math.abs(squareMatrix0[row][row]); local
50 if (pivot < Math.abs(squareMatrix0[i][row])) {
52 pivot = Math.abs(squareMatrix0[i][row]);
73 final float pivot = squareMatrix0[row][row]; local
74 if (pivot == 0) {
75 throw new MatrixOperationFailedException("Inverse failed. Invalid pivot");
78 squareMatrix0[row][j] /= pivot;
79 squareMatrix1[row][j] /= pivot;
|
| /external/chromium_org/ui/gfx/ |
| interpolated_transform_unittest.cc | 83 gfx::Point pivot(100, 100);
87 pivot,
92 gfx::Point expected_result = pivot;
93 result.TransformPoint(pivot);
94 EXPECT_EQ(expected_result, pivot);
101 gfx::Point pivot(100, 100);
104 pivot,
109 gfx::Point expected_result = pivot;
110 result.TransformPoint(pivot);
111 EXPECT_EQ(expected_result, pivot);
[all...] |
| interpolated_transform.cc | 294 const gfx::Point& pivot,
297 Init(pivot, transform);
301 const gfx::Point& pivot,
306 Init(pivot, transform);
319 void InterpolatedTransformAboutPivot::Init(const gfx::Point& pivot,
323 to_pivot.Translate(-pivot.x(), -pivot.y());
324 from_pivot.Translate(pivot.x(), pivot.y());
|
| interpolated_transform.h | 218 InterpolatedTransformAboutPivot(const gfx::Point& pivot,
222 InterpolatedTransformAboutPivot(const gfx::Point& pivot,
232 void Init(const gfx::Point& pivot, InterpolatedTransform* transform);
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| NodeVector.java | 669 * Pick a pivot and move it out of the way
671 int pivot = a[(lo + hi) / 2]; local
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/ |
| 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 );
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| quicksort.h | 44 * @param pivot_rank Desired rank of the pivot.
45 * @param num_samples Choose pivot from that many samples.
80 value_type& pivot = samples[pivot_rank * num_samples / n]; local
83 pred(comp, pivot);
|
