| /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...] |
| db_rob_image_homography.cpp | 683 /*Pivot for hypothesis pruning*/
684 double pivot; local
[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...] |
| db_rob_image_homography.cpp | 683 /*Pivot for hypothesis pruning*/
684 double pivot; local
[all...] |
| /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,
|
| SkTSearch.cpp | 143 char* pivot = left; local
147 while (left < last && compare(left, pivot) < 0)
149 while (first < rite && compare(rite, pivot) > 0)
|
| /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);
|
| /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.12/src/stdlib/ |
| SDL_qsort.c | 115 * 3. We choose a pivot by looking at the first, last
118 * choosing the pivot, and it makes things a little
119 * easier in the partitioning step. Anyway, the pivot
130 * 4. We copy the pivot element to a separate place
133 * and don't have to wonder "did we move the pivot
180 #define Pivot(swapper,sz) \
207 while (compare(first,pivot)<0) first+=sz; \
208 while (compare(pivot,last)<0) last-=sz; \
243 memcpy(pivot,first,size); \
245 memcpy(test,pivot,size);
308 char *pivot=malloc(size); local
339 char *pivot=malloc(size); local
370 char *pivot=malloc(WORD_BYTES); local
[all...] |
| /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);
|
| /external/icu4c/test/perf/utfperf/ |
| utfperf.cpp | 34 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,
|
| /packages/apps/Launcher2/src/com/android/launcher2/ |
| HolographicOutlineHelper.java | 91 final float pivot = 0.95f; local
92 if (r < pivot) {
93 return (float) Math.pow(r / pivot, 1.5f);
|
| /external/opencv/cv/src/ |
| _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/libvpx/vp8/encoder/ |
| rdopt.c | 1449 int lidx,ridx,pivot; local
1485 int lidx,ridx,pivot; local
[all...] |
| /frameworks/base/core/java/android/widget/ |
| StackView.java | [all...] |
| /external/jmonkeyengine/engine/src/bullet/com/jme3/bullet/objects/ |
| PhysicsRigidBody.java | 686 Vector3f pivot = null; local
688 pivot = physicsJoint.getPivotA();
690 pivot = physicsJoint.getPivotB();
692 Arrow arrow = new Arrow(pivot);
|
| /libcore/luni/src/main/java/java/util/ |
| TreeMap.java | 524 Node<K, V> pivot = root.right; local
525 Node<K, V> pivotLeft = pivot.left;
526 Node<K, V> pivotRight = pivot.right;
528 // move the pivot's left child to the root's right
534 replaceInParent(root, pivot);
536 // move the root to the pivot's left
537 pivot.left = root;
538 root.parent = pivot;
543 pivot.height = Math.max(root.height,
551 Node<K, V> pivot = root.left local
[all...] |
| ComparableTimSort.java | 215 Comparable<Object> pivot = (Comparable) a[start]; local
217 // Set left (and right) to the index where a[start] (pivot) belongs
223 * pivot >= all in [lo, left).
224 * pivot < all in [right, start).
228 if (pivot.compareTo(a[mid]) < 0)
236 * The invariants still hold: pivot >= all in [lo, left) and
237 * pivot < all in [left, start), so pivot belongs at left. Note
238 * that if there are elements equal to pivot, left points to the
240 * Slide elements over to make room to make room for pivot
[all...] |
| TimSort.java | 248 T pivot = a[start]; local
250 // Set left (and right) to the index where a[start] (pivot) belongs
256 * pivot >= all in [lo, left).
257 * pivot < all in [right, start).
261 if (c.compare(pivot, a[mid]) < 0)
269 * The invariants still hold: pivot >= all in [lo, left) and
270 * pivot < all in [left, start), so pivot belongs at left. Note
271 * that if there are elements equal to pivot, left points to the
273 * Slide elements over to make room for pivot
[all...] |
| /external/jmonkeyengine/engine/src/jbullet/com/jme3/bullet/objects/ |
| PhysicsRigidBody.java | 637 Vector3f pivot = null; local
639 pivot = physicsJoint.getPivotA();
641 pivot = physicsJoint.getPivotB();
643 Arrow arrow = new Arrow(pivot);
|
| /external/v8/src/ |
| array.js | 782 // Find a pivot as the median of first, last and middle element.
814 var pivot = v1;
815 var low_end = from + 1; // Upper bound of elements lower than pivot.
816 var high_start = to - 1; // Lower bound of elements greater than pivot.
818 a[low_end] = pivot;
820 // From low_end to i are elements equal to pivot.
824 var order = %_CallFunction(receiver, element, pivot, comparefn);
834 order = %_CallFunction(receiver, top_elem, pivot, comparefn);
[all...] |
| /external/icu4c/common/ |
| ucnv.c | 2408 UChar *pivot, *pivot2; local
[all...] |
